| /external/emma/core/java12/com/vladium/jcd/cls/ |
| ElementFactory.java | 21 public static IAttributeCollection newAttributeCollection (final int capacity)
23 return new AttributeCollection (capacity);
26 public static IConstantCollection newConstantCollection (final int capacity)
28 return new ConstantCollection (capacity);
31 public static IFieldCollection newFieldCollection (final int capacity)
33 return new FieldCollection (capacity);
36 public static IInterfaceCollection newInterfaceCollection (final int capacity)
38 return new InterfaceCollection (capacity);
41 public static IMethodCollection newMethodCollection (final int capacity)
43 return new MethodCollection (capacity);
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.capacity/ |
| capacity.pass.cpp | 12 // size_type capacity() const;
23 assert(v.capacity() == 0);
27 assert(v.capacity() == 100);
29 assert(v.capacity() > 101);
34 assert(v.capacity() == 0);
38 assert(v.capacity() == 100);
40 assert(v.capacity() > 101);
|
| reserve.pass.cpp | 24 assert(v.capacity() >= 10);
28 assert(v.capacity() == 100);
31 assert(v.capacity() == 100);
34 assert(v.capacity() == 150);
38 assert(v.capacity() == 100);
41 assert(v.capacity() == 100);
44 assert(v.capacity() == 150);
50 assert(v.capacity() >= 10);
54 assert(v.capacity() == 100);
57 assert(v.capacity() == 100)
[all...] |
| resize_size.pass.cpp | 27 assert(v.capacity() == 100);
30 assert(v.capacity() >= 200);
36 assert(v.capacity() == 100);
39 assert(v.capacity() >= 200);
46 assert(v.capacity() == 100);
49 assert(v.capacity() >= 200);
55 assert(v.capacity() == 100);
58 assert(v.capacity() >= 200);
66 assert(v.capacity() == 100);
69 assert(v.capacity() >= 200)
[all...] |
| swap.pass.cpp | 26 assert(v1.capacity() == 200);
28 assert(v2.capacity() == 100);
36 assert(v1.capacity() == 200);
38 assert(v2.capacity() == 100);
|
| resize_size_value.pass.cpp | 25 assert(v.capacity() == 100);
29 assert(v.capacity() >= 200);
39 assert(v.capacity() == 100);
42 assert(v.capacity() >= 200);
49 assert(v.capacity() == 100);
53 assert(v.capacity() >= 200);
63 assert(v.capacity() == 100);
66 assert(v.capacity() >= 200);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/ |
| capacity.pass.cpp | 13 // size_type capacity() const;
24 assert(v.capacity() == 0);
28 assert(v.capacity() >= 100);
30 assert(v.capacity() >= 101);
35 assert(v.capacity() == 0);
39 assert(v.capacity() >= 100);
41 assert(v.capacity() >= 101);
|
| reserve.pass.cpp | 25 assert(v.capacity() >= 10);
29 assert(v.capacity() >= 100);
32 assert(v.capacity() >= 100);
35 assert(v.capacity() >= 150);
41 assert(v.capacity() >= 10);
45 assert(v.capacity() >= 100);
48 assert(v.capacity() >= 100);
51 assert(v.capacity() >= 150);
|
| resize_size.pass.cpp | 26 assert(v.capacity() >= 100);
29 assert(v.capacity() >= 200);
36 assert(v.capacity() >= 100);
39 assert(v.capacity() >= 200);
|
| shrink_to_fit.pass.cpp | 26 assert(v.capacity() >= 101);
34 assert(v.capacity() >= 101);
|
| /external/emma/core/java12/com/vladium/jcd/cls/attribute/ |
| AttributeElementFactory.java | 20 public static IExceptionHandlerTable newExceptionHandlerTable (final int capacity)
22 return new ExceptionHandlerTable (capacity);
|
| /frameworks/base/tests/AccessoryDisplay/common/src/com/android/accessorydisplay/common/ |
| BufferPool.java | 68 int capacity = buffer.capacity(); local
69 if (capacity < needed) {
71 capacity = chooseCapacity(capacity, needed);
72 buffer = ByteBuffer.allocate(capacity);
79 private int chooseCapacity(int capacity, int needed) {
80 while (capacity < needed) {
81 capacity *= 2;
83 if (capacity > mMaxBufferSize)
[all...] |
| /frameworks/av/media/libstagefright/foundation/ |
| ABuffer.cpp | 25 ABuffer::ABuffer(size_t capacity)
26 : mData(malloc(capacity)),
27 mCapacity(capacity),
29 mRangeLength(capacity),
34 ABuffer::ABuffer(void *data, size_t capacity)
36 mCapacity(capacity),
38 mRangeLength(capacity),
|
| /libcore/luni/src/main/java/java/util/ |
| LinkedHashSet.java | 49 * capacity.
51 * @param capacity
52 * the initial capacity of this {@code LinkedHashSet}.
54 public LinkedHashSet(int capacity) {
55 super(new LinkedHashMap<E, HashSet<E>>(capacity));
60 * capacity and load factor.
62 * @param capacity
63 * the initial capacity.
67 public LinkedHashSet(int capacity, float loadFactor) {
68 super(new LinkedHashMap<E, HashSet<E>>(capacity, loadFactor))
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| utrace.c | 88 static void outputChar(char c, char *outBuf, int32_t *outIx, int32_t capacity, int32_t indent) {
93 * 3. When preflighting buffer len (buffer capacity is exceeded), when
100 (c!='\n' && c!=0 && *outIx < capacity && outBuf[(*outIx)-1]=='\n') || /* case 2. */
101 (c=='\n' && *outIx>=capacity)) /* case 3 */
105 if (*outIx < capacity) {
112 if (*outIx < capacity) {
124 char *outBuf, int32_t *outIx, int32_t capacity) {
129 outputChar(c, outBuf, outIx, capacity, 0);
134 static void outputPtrBytes(void *val, char *outBuf, int32_t *outIx, int32_t capacity) {
148 outputHexBytes(*p, 2, outBuf, outIx, capacity);
[all...] |
| /external/icu4c/common/ |
| utrace.c | 88 static void outputChar(char c, char *outBuf, int32_t *outIx, int32_t capacity, int32_t indent) {
93 * 3. When preflighting buffer len (buffer capacity is exceeded), when
100 (c!='\n' && c!=0 && *outIx < capacity && outBuf[(*outIx)-1]=='\n') || /* case 2. */
101 (c=='\n' && *outIx>=capacity)) /* case 3 */
105 if (*outIx < capacity) {
112 if (*outIx < capacity) {
124 char *outBuf, int32_t *outIx, int32_t capacity) {
129 outputChar(c, outBuf, outIx, capacity, 0);
134 static void outputPtrBytes(void *val, char *outBuf, int32_t *outIx, int32_t capacity) {
148 outputHexBytes(*p, 2, outBuf, outIx, capacity);
[all...] |
| /external/icu4c/layoutex/ |
| RunArrays.cpp | 50 void RunArray::init(le_int32 capacity)
52 fLimits = LE_NEW_ARRAY(le_int32, capacity);
92 void FontRuns::init(le_int32 capacity)
94 RunArray::init(capacity);
95 fFonts = LE_NEW_ARRAY(const LEFontInstance *, capacity);
98 void FontRuns::grow(le_int32 capacity)
100 RunArray::grow(capacity);
101 fFonts = (const LEFontInstance **) LE_GROW_ARRAY(fFonts, capacity);
144 void LocaleRuns::init(le_int32 capacity)
146 RunArray::init(capacity);
[all...] |
| /external/srec/shared/include/ |
| CircularBuffer.h | 50 * Total buffer capacity.
52 size_t capacity; member in struct:CircularBuffer_t
73 * Creates a circular buffer of the specified capacity.
75 * @param capacity the capacity in number of bytes of the data buffer.
79 ESR_SHARED_API ESR_ReturnCode CircularBufferCreate(size_t capacity, const LCHAR* mtag, CircularBuffer** buffer);
82 * Returns the capacity of the buffer.
84 #define CircularBufferGetCapacity(buffer) ((buffer)->capacity + 0)
99 #define CircularBufferIsFull(buffer) ((buffer)->size == (buffer)->capacity)
109 * Determines the residual capacity of the circular buffer
[all...] |
| /external/chromium_org/native_client_sdk/src/libraries/xray/ |
| hashtable.c | 23 int capacity; member in struct:XRayHashTable
32 int32_t capacity);
55 return table->capacity;
67 uint32_t m = table->capacity - 1;
96 uint32_t m = table->capacity - 1;
109 ratio = (float)table->count / (float)table->capacity;
110 /* Double the capacity of the symtable if we've hit the ratio. */
127 if ((i < 0) || (i >= table->capacity))
133 /* Grows the hash table by doubling its capacity, */
137 int old_capacity = table->capacity;
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_dynarray.h | 36 * Also, size <= capacity and data != 0 if and only if capacity != 0
37 * capacity will always be the allocation size of data
43 unsigned capacity; member in struct:util_dynarray
67 if(newsize > buf->capacity)
69 unsigned newcap = buf->capacity << 1;
72 buf->data = REALLOC(buf->data, buf->capacity, newcap);
73 buf->capacity = newcap;
90 if (buf->size != buf->capacity) {
92 buf->data = REALLOC(buf->data, buf->capacity, buf->size)
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_dynarray.h | 36 * Also, size <= capacity and data != 0 if and only if capacity != 0
37 * capacity will always be the allocation size of data
43 unsigned capacity; member in struct:util_dynarray
67 if(newsize > buf->capacity)
69 unsigned newcap = buf->capacity << 1;
72 buf->data = REALLOC(buf->data, buf->capacity, newcap);
73 buf->capacity = newcap;
90 if (buf->size != buf->capacity) {
92 buf->data = REALLOC(buf->data, buf->capacity, buf->size)
[all...] |
| /libcore/luni/src/main/java/java/nio/ |
| Buffer.java | 24 * <li>Capacity: the number of elements a buffer can hold. Capacity may not be
32 * and not greater than capacity.</li>
54 * The capacity of this buffer, which never changes.
56 final int capacity; field in class:Buffer
60 * Limit must be no less than zero and no greater than <code>capacity</code>.
97 Buffer(int elementSizeShift, int capacity, MemoryBlock block) {
99 if (capacity < 0) {
100 throw new IllegalArgumentException("capacity < 0: " + capacity);
147 public final int capacity() { method in class:Buffer
[all...] |
| /external/chromium_org/chrome/browser/extensions/api/system_storage/ |
| storage_api_test_util.h | 20 double capacity; member in struct:extensions::test::TestStorageUnitInfo
|
| /external/chromium_org/third_party/WebKit/Source/wtf/tests/ |
| HashSet.cpp | 44 // Initial capacity is null.
45 ASSERT_EQ(0, testSet.capacity());
47 // Adding items up to size should never change the capacity.
50 ASSERT_EQ(initialCapacity, static_cast<unsigned>(testSet.capacity()));
53 // Adding items up to less than half the capacity should not change the capacity.
57 ASSERT_EQ(initialCapacity, static_cast<unsigned>(testSet.capacity()));
60 // Adding one more item increase the capacity.
62 EXPECT_GT(static_cast<unsigned>(testSet.capacity()), initialCapacity);
|
| VectorBasic.cpp | 38 EXPECT_EQ(0ul, intVector.capacity());
|
