/ndk/sources/cxx-stl/llvm-libc++/test/strings/basic.string/string.cons/ |
copy.pass.cpp | 26 assert(s2.capacity() >= s2.size());
|
copy_alloc.pass.cpp | 26 assert(s2.capacity() >= s2.size());
|
copy_assignment.pass.cpp | 25 assert(s1.capacity() >= s1.size());
|
move.pass.cpp | 30 assert(s2.capacity() >= s2.size());
|
pointer_size_alloc.pass.cpp | 33 assert(s2.capacity() >= s2.size()); 48 assert(s2.capacity() >= s2.size());
|
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
ResizableIntArray.java | 26 public ResizableIntArray(final int capacity) { 27 reset(capacity); 54 * Calculate the new capacity of {@code mArray}. 55 * @param minimumCapacity the minimum capacity that the {@code mArray} should have. 56 * @return the new capacity that the {@code mArray} should have. Returns zero when there is no 86 public void reset(final int capacity) { 88 mArray = new int[capacity];
|
/sdk/eclipse/plugins/com.android.ide.eclipse.gldebugger/src/com/android/ide/eclipse/gltrace/ |
GLUtils.java | 49 StringBuilder sb = new StringBuilder(bb.capacity() * 3); 63 StringBuilder sb = new StringBuilder(bb.capacity() * 3); 77 StringBuilder sb = new StringBuilder(bb.capacity() * 3); 95 StringBuilder sb = new StringBuilder(bb.capacity() * 3);
|
/external/stlport/test/unit/ |
vector_test.cpp | 30 CPPUNIT_TEST(capacity); 53 void capacity(); 90 CPPUNIT_ASSERT( (*it).capacity() == 0 ); 110 size_t v1Cap = v1.capacity(); 111 size_t v2Cap = v2.capacity(); 116 CPPUNIT_ASSERT( v1.capacity() == v2Cap ); 120 CPPUNIT_ASSERT( v2.capacity() == v1Cap ); 293 void VectorTest::capacity() function in class:VectorTest 298 CPPUNIT_ASSERT( v.capacity() == 0 ); 300 CPPUNIT_ASSERT( v.capacity() >= 1 ) [all...] |
/ndk/tests/device/test-gnustl-full/unit/ |
vector_test.cpp | 30 CPPUNIT_TEST(capacity); 53 void capacity(); 90 CPPUNIT_ASSERT( (*it).capacity() == 0 ); 110 size_t v1Cap = v1.capacity(); 111 size_t v2Cap = v2.capacity(); 116 CPPUNIT_ASSERT( v1.capacity() == v2Cap ); 120 CPPUNIT_ASSERT( v2.capacity() == v1Cap ); 293 void VectorTest::capacity() function in class:VectorTest 298 CPPUNIT_ASSERT( v.capacity() == 0 ); 300 CPPUNIT_ASSERT( v.capacity() >= 1 ) [all...] |
/ndk/tests/device/test-stlport/unit/ |
vector_test.cpp | 30 CPPUNIT_TEST(capacity); 53 void capacity(); 90 CPPUNIT_ASSERT( (*it).capacity() == 0 ); 110 size_t v1Cap = v1.capacity(); 111 size_t v2Cap = v2.capacity(); 116 CPPUNIT_ASSERT( v1.capacity() == v2Cap ); 120 CPPUNIT_ASSERT( v2.capacity() == v1Cap ); 293 void VectorTest::capacity() function in class:VectorTest 298 CPPUNIT_ASSERT( v.capacity() == 0 ); 300 CPPUNIT_ASSERT( v.capacity() >= 1 ) [all...] |
/external/chromium/net/base/ |
io_buffer.h | 104 // realloc memory to the specified capacity. 105 void SetCapacity(int capacity); 106 int capacity() { return capacity_; } function in class:net::GrowableIOBuffer
|
/external/guava/guava/src/com/google/common/collect/ |
LinkedHashMultiset.java | 45 * capacity. 84 super(new LinkedHashMap<E, Count>(Maps.capacity(distinctElements))); 103 Maps.capacity(distinctElements)));
|
/external/icu4c/common/unicode/ |
utrace.h | 307 * @param capacity Length of the output buffer. 313 * If buffer capacity is insufficient, the required capacity is returned. 317 utrace_vformat(char *outBuf, int32_t capacity, 328 * @param capacity Length of the output buffer. 334 * If buffer capacity is insufficient, the required capacity is returned. 338 utrace_format(char *outBuf, int32_t capacity,
|
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/ |
ByteBufferHelper.java | 39 nuSamples.get(lastIndex).limit() == nuSamples.get(lastIndex).capacity() - buffer.capacity()) {
|
/external/srec/portable/src/ |
ArrayListImpl.c | 60 impl->capacity = minCapacity; 78 if (impl->size >= impl->capacity) 81 size_t newCapacity = impl->capacity * 2; 86 impl->capacity = newCapacity; 122 if (impl->capacity > impl->minCapacity && 123 impl->size <= impl->capacity / 4) 126 size_t newCapacity = impl->capacity / 2; 132 impl->capacity = newCapacity;
|
phashtable.c | 91 tmp->args.capacity = PHASH_TABLE_DEFAULT_CAPACITY; 106 tmp->entries = NEW_ARRAY(PHashTableEntry *, tmp->args.capacity, memTag); 114 for (i = tmp->args.capacity; i > 0;) 121 tmp->threshold = (unsigned int)(tmp->args.capacity * tmp->args.maxLoadFactor); 218 idx = hashCode % table->args.capacity; 265 idx = hashCode % table->args.capacity; 277 unsigned int oldCapacity = table->args.capacity; 290 table->args.capacity = newCapacity; 349 idx = hashCode % table->args.capacity; 365 idx = hashCode % table->args.capacity; [all...] |
/external/webkit/Source/JavaScriptCore/runtime/ |
ArgList.cpp | 54 // capacity, all our values are allocated on the stack, and 56 // our Vector's inline capacity, though, our values move to the 68 if (m_vector.size() < m_vector.capacity()) { 75 m_vector.reserveCapacity(m_vector.capacity() * 4);
|
/external/webkit/Source/WebCore/history/ |
BackForwardListImpl.h | 64 int capacity(); 85 virtual bool isActive() { return enabled() && capacity(); }
|
/libcore/luni/src/main/java/java/nio/ |
MappedByteBuffer.java | 42 MappedByteBuffer(MemoryBlock block, int capacity, MapMode mapMode) { 43 super(capacity, block);
|
/libcore/luni/src/main/java/org/apache/harmony/luni/lang/reflect/ |
ListOfTypes.java | 29 ListOfTypes(int capacity) { 30 types = new ArrayList<Type>(capacity);
|
/tools/external/fat32lib/src/main/java/de/waldheinz/fs/fat/ |
Sector.java | 58 buffer.limit(buffer.capacity()); 84 buffer.limit(buffer.capacity());
|
/external/icu4c/common/ |
charstr.cpp | 110 UBool CharString::ensureCapacity(int32_t capacity, 116 if(capacity>buffer.getCapacity()) { 118 desiredCapacityHint=capacity+buffer.getCapacity(); 120 if( (desiredCapacityHint<=capacity || buffer.resize(desiredCapacityHint, len+1)==NULL) && 121 buffer.resize(capacity, len+1)==NULL
|
/external/icu4c/i18n/ |
bocsu.cpp | 101 int32_t capacity; local 106 char *buffer=sink.GetAppendBuffer(1, length*2, scratch, (int32_t)sizeof(scratch), &capacity); 108 // We must have capacity>=SLOPE_MAX_BYTES in case u_writeDiff() writes that much, 111 if(capacity<16) { 113 capacity=(int32_t)sizeof(scratch); 116 uint8_t *lastSafe=p+capacity-SLOPE_MAX_BYTES;
|
udatpg.cpp | 59 UChar *bestPattern, int32_t capacity, 63 bestPattern, capacity, pErrorCode); 70 UChar *bestPattern, int32_t capacity, 81 return result.extract(bestPattern, capacity, *pErrorCode); 87 UChar *skeleton, int32_t capacity, 98 return result.extract(skeleton, capacity, *pErrorCode); 104 UChar *skeleton, int32_t capacity, 115 return result.extract(skeleton, capacity, *pErrorCode); 122 UChar *conflictingPattern, int32_t capacity, int32_t *pLength, 135 int32_t length=conflictingPatternString.extract(conflictingPattern, capacity, *pErrorCode) [all...] |
/external/icu4c/i18n/unicode/ |
udatpg.h | 203 * @param capacity the capacity of bestPattern. 212 UChar *bestPattern, int32_t capacity, 237 * @param capacity 238 * the capacity of bestPattern. 249 UChar *bestPattern, int32_t capacity, 266 * @param capacity the capacity of skeleton. 275 UChar *skeleton, int32_t capacity, 295 * @param capacity the capacity of base skeleton [all...] |