| /external/icu4c/common/ |
| uvectr64.h | 62 int32_t capacity; member in class:UVector64
64 int32_t maxCapacity; // Limit beyond which capacity is not permitted to grow.
156 * Set the maximum allowed buffer capacity for this vector/stack.
158 * A Limit of zero means unlimited capacity.
203 if ((minimumCapacity >= 0) && (capacity >= minimumCapacity)) {
|
| uvector.cpp | 31 capacity(0),
41 capacity(0),
51 capacity(0),
61 capacity(0),
81 capacity = initialCapacity;
333 if (capacity < minimumCapacity) {
334 if (capacity > (INT32_MAX - 1) / 2) { // integer overflow check
338 int32_t newCap = capacity * 2;
354 capacity = newCap;
|
| /system/extras/tests/sdcard/ |
| stopwatch.cpp | 54 StopWatch::StopWatch(const char *name, size_t capacity)
55 : mName(strdup(name)), mNum(0), mData(NULL), mDataLen(0), mCapacity(capacity * 2),
145 // Normally we should have enough capacity but if we have to
148 // a capacity when building the StopWatch.
154 fprintf(stderr, "# Increased capacity to %d for %s. Measurement affected.\n",
|
| /libcore/luni/src/main/java/java/util/ |
| ArrayList.java | 46 * The minimum amount by which the capacity of an ArrayList will increase.
49 * RI's specified default initial capacity of 10: instead of 10, we start
66 * initial capacity.
68 * @param capacity
69 * the initial capacity of this {@code ArrayList}.
71 public ArrayList(int capacity) {
72 if (capacity < 0) {
75 array = (capacity == 0 ? EmptyArray.OBJECT : new Object[capacity]);
79 * Constructs a new {@code ArrayList} instance with zero initial capacity
[all...] |
| LinkedHashMap.java | 73 * capacity.
76 * the initial capacity of this map.
78 * when the capacity is less than zero.
86 * capacity and load factor.
89 * the initial capacity of this map.
93 * when the capacity is less than zero or the load factor is
102 * capacity, load factor and a flag specifying the ordering behavior.
105 * the initial capacity of this hash map.
114 * when the capacity is less than zero or the load factor is
|
| /external/apache-harmony/nio/src/test/java/common/org/apache/harmony/nio/tests/java/nio/channels/ |
| FileChannelTest.java | 51 private static final int CAPACITY = 100;
[all...] |
| /libcore/luni/src/main/java/java/lang/ |
| ThreadLocal.java | 241 * Creates a new, empty table with the given capacity.
243 private void initializeTable(int capacity) {
244 this.table = new Object[capacity * 2];
247 this.maximumLoad = capacity * 2 / 3; // 2/3
306 int capacity = table.length >> 1; local
308 // Default to the same capacity. This will create a table of the
314 int newCapacity = capacity;
316 if (size > (capacity >> 1)) {
319 newCapacity = capacity * 2;
|
| AbstractStringBuilder.java | 78 AbstractStringBuilder(int capacity) {
79 if (capacity < 0) {
82 value = new char[capacity];
186 * @return the capacity
190 public int capacity() { method in class:AbstractStringBuilder
267 * Ensures that this object has a minimum capacity available before
270 * {@link #capacity()}, then the capacity will be increased to the largest
271 * value of either the {@code minimumCapacity} or the current capacity
273 * no guarantee that the capacity will change
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| BlockingQueue.java | 69 * <p>A <tt>BlockingQueue</tt> may be capacity bounded. At any given
72 * A <tt>BlockingQueue</tt> without any intrinsic capacity constraints always
73 * reports a remaining capacity of <tt>Integer.MAX_VALUE</tt>.
155 * so immediately without violating capacity restrictions, returning
158 * When using a capacity-restricted queue, it is generally preferable to
164 * time due to capacity restrictions
175 * so immediately without violating capacity restrictions, returning
177 * available. When using a capacity-restricted queue, this method is
262 * @return the remaining capacity
|
| BlockingDeque.java | 92 * capacity-constrained.
181 * possible to do so immediately without violating capacity restrictions,
183 * available. When using a capacity-restricted deque, it is generally
196 * possible to do so immediately without violating capacity restrictions,
198 * available. When using a capacity-restricted deque, it is generally
211 * possible to do so immediately without violating capacity restrictions,
214 * When using a capacity-restricted deque, this method is generally
227 * possible to do so immediately without violating capacity restrictions,
230 * When using a capacity-restricted deque, this method is generally
400 * immediately without violating capacity restrictions, returnin
[all...] |
| /external/llvm/include/llvm/ADT/ |
| SmallVector.h | 86 /// capacity_in_bytes - This returns capacity()*sizeof(T).
140 /// capacity - Return the total number of elements in the currently allocated
142 size_t capacity() const { return capacity_ptr() - begin(); } function in class:llvm::SmallVectorTemplateCommon
202 size_t CurCapacity = this->capacity();
298 if (this->capacity() < N)
310 if (this->capacity() < N)
318 if (this->capacity() < N)
376 if (this->capacity() < NumElts)
545 /// enough capacity for.
549 /// Clients can use this in conjunction with capacity() to write past the en
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/xnet/provider/jsse/ |
| SSLEngineImpl.java | 443 // check the destination buffers and count their capacity
444 int capacity = 0; local
453 capacity += dsts[i].remaining();
455 if (capacity < recordProtocol.getDataSize(src.remaining())) {
603 int capacity = dst.remaining(); local
608 if (capacity < recordProtocol.getRecordSize(2)) {
643 if (capacity < recordProtocol.getMinRecordSize()) {
645 logger.println("Capacity of the destination("
646 +capacity+") < MIN_PACKET_SIZE("
658 if ((capacity < SSLRecordProtocol.MAX_SSL_PACKET_SIZE) &
[all...] |
| /libcore/luni/src/test/java/libcore/java/nio/channels/ |
| OldFileChannelTest.java | 41 private static final int CAPACITY = 100;
260 ByteBuffer readBuffer = ByteBuffer.allocate(CAPACITY);
545 readBuffers[0] = ByteBuffer.allocate(CAPACITY);
546 readBuffers[1] = ByteBuffer.allocate(CAPACITY);
610 readBuffers[0] = ByteBuffer.allocate(CAPACITY);
611 readBuffers[1] = ByteBuffer.allocate(CAPACITY);
620 readBuffers[0] = ByteBuffer.allocate(CAPACITY);
629 readBuffers[0] = ByteBuffer.allocate(CAPACITY);
653 ByteBuffer writeBuffer = ByteBuffer.allocate(CAPACITY);
713 ByteBuffer writeBuffer = ByteBuffer.allocate(CAPACITY);
[all...] |
| /libcore/luni/src/test/java/tests/api/java/util/ |
| VectorTest.java | 58 assertEquals("Wrong capacity", 10, v.capacity());
69 assertEquals("Wrong capacity", 100, v.capacity());
90 assertEquals("Failed to inc capacity by proper amount",
91 12, v.capacity());
99 assertEquals("Wrong capacity", 6, grow.capacity());
309 * java.util.Vector#capacity()
312 // Test for method int java.util.Vector.capacity()
[all...] |
| /external/webkit/Source/WebKit/gtk/webkit/ |
| webkitwebbackforwardlist.cpp | 399 return backForwardList->capacity();
408 * exceeds its capacity, items will be removed everytime a new item has been
461 // Clear the current list by setting capacity to 0
462 int capacity = backForwardList->capacity(); local
464 backForwardList->setCapacity(capacity);
|
| /sdk/ddms/libs/ddmlib/src/com/android/ddmlib/ |
| Debugger.java | 200 * have a full packet in the buffer. If the buffer is at capacity,
206 if (mReadBuffer.position() == mReadBuffer.capacity()) {
207 if (mReadBuffer.capacity() * 2 > MAX_BUF_SIZE) {
211 + mReadBuffer.capacity() * 2);
214 ByteBuffer.allocate(mReadBuffer.capacity() * 2);
239 * "limit" is set to the buffer capacity.
|
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| OutputCollector.java | 45 * @param initialCapacity {@code >= 0;} initial capacity of the output list
46 * @param suffixInitialCapacity {@code >= 0;} initial capacity of the output
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| OutputCollector.java | 48 * @param initialCapacity {@code >= 0;} initial capacity of the output list
49 * @param suffixInitialCapacity {@code >= 0;} initial capacity of the output
|
| /external/apache-harmony/nio/src/test/java/common/org/apache/harmony/nio/tests/java/nio/ |
| ReadOnlyDoubleBufferTest.java | 111 buf.put(new double[buf.capacity() + 1], 0, buf.capacity() + 1);
|
| ReadOnlyFloatBufferTest.java | 112 buf.put(new float[buf.capacity() + 1], 0, buf.capacity() + 1);
|
| ReadOnlyIntBufferTest.java | 112 buf.put(new int[buf.capacity() + 1], 0, buf.capacity() + 1);
|
| ReadOnlyLongBufferTest.java | 112 buf.put(new long[buf.capacity() + 1], 0, buf.capacity() + 1);
|
| ReadOnlyShortBufferTest.java | 112 buf.put(new short[buf.capacity() + 1], 0, buf.capacity() + 1);
|
| WrappedCharBufferTest2.java | 95 buf.put(new char[buf.capacity() + 1], 0, buf.capacity() + 1);
|
| /external/emma/core/java12/com/vladium/jcd/cls/attribute/ |
| AttributeElementFactory.java | 20 public static IExceptionHandlerTable newExceptionHandlerTable (final int capacity)
22 return new ExceptionHandlerTable (capacity);
|
