/ndk/sources/cxx-stl/llvm-libc++/test/strings/basic.string/string.cons/ |
move_alloc.pass.cpp | 30 assert(s2.capacity() >= s2.size());
|
move_assignment.pass.cpp | 31 assert(s1.capacity() >= s1.size());
|
pointer_assignment.pass.cpp | 27 assert(s1.capacity() >= s1.size());
|
size_char_alloc.pass.cpp | 34 assert(s2.capacity() >= s2.size()); 50 assert(s2.capacity() >= s2.size()); 67 assert(s2.capacity() >= s2.size()); 84 assert(s2.capacity() >= s2.size());
|
pointer_alloc.pass.cpp | 34 assert(s2.capacity() >= s2.size()); 50 assert(s2.capacity() >= s2.size());
|
/system/core/toolbox/ |
dynarray.h | 9 int capacity; member in struct:__anon44023
|
/system/extras/tests/sdcard/ |
stopwatch.h | 84 // Create a stop watch. Default capacity == 2 * interval_nb 87 // @param capacity Hint about the number of sampless that will be 89 // to size the internal storage, when the capacity 91 StopWatch(const char *name, size_t capacity = kUseDefaultCapacity);
|
/external/marisa-trie/tests/ |
vector-test.cc | 27 ASSERT(vec.capacity() == 0); 39 ASSERT(vec.capacity() >= vec.size()); 54 ASSERT(vec.capacity() == vec.size()); 64 ASSERT(vec.capacity() == 0); 71 ASSERT(vec.capacity() == 0); 85 ASSERT(vec.capacity() == vec.size()); 99 ASSERT(vec.capacity() == 1); 101 ASSERT(vec.capacity() == 2); 103 ASSERT(vec.capacity() == 4); 105 ASSERT(vec.capacity() == 8) [all...] |
/external/marisa-trie/v0_1_5/tests/ |
vector-test.cc | 27 ASSERT(vec.capacity() == 0); 40 ASSERT(vec.capacity() >= vec.size()); 55 ASSERT(vec.capacity() == vec.size()); 66 ASSERT(vec.capacity() == 0); 73 ASSERT(vec.capacity() == 0); 88 ASSERT(vec.capacity() == vec.size()); 103 ASSERT(vec.capacity() == 1); 105 ASSERT(vec.capacity() == 2); 107 ASSERT(vec.capacity() == 4); 109 ASSERT(vec.capacity() == 8) [all...] |
/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);
|
ByteBufferTest.java | 57 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 59 loadTestData1(array, buf.arrayOffset(), buf.capacity()); 60 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 62 loadTestData2(array, buf.arrayOffset(), buf.capacity()); 63 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 66 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 69 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 95 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 97 loadTestData1(array, buf.arrayOffset(), buf.capacity()); 98 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); [all...] |
/external/icu4c/i18n/ |
fpositer.cpp | 62 int32_t FieldPositionIterator::getData(int32_t *dest, int32_t capacity) const { 65 if (capacity < len) { 66 len = -len; // error, insufficient capacity
|
/external/icu4c/layoutex/ |
plruns.cpp | 305 virtual void init(le_int32 capacity); 306 virtual void grow(le_int32 capacity); 371 void ULocRuns::init(le_int32 capacity) 373 LocaleRuns::init(capacity); 374 fLocaleNames = LE_NEW_ARRAY(const char *, capacity); 377 void ULocRuns::grow(le_int32 capacity) 379 LocaleRuns::grow(capacity); 380 fLocaleNames = (const char **) LE_GROW_ARRAY(fLocaleNames, capacity);
|
/external/v8/src/ |
zone.h | 190 // Construct a new ZoneList with the given capacity; the length is 191 // always zero. The capacity must be non-negative. 192 explicit ZoneList(int capacity) 193 : List<T, ZoneListAllocationPolicy>(capacity) { }
|
hashmap.h | 74 // The capacity of the table. The implementation 76 // the table capacity. 77 uint32_t capacity() const { return capacity_; } function in class:v8::internal::TemplateHashMapImpl 98 void Initialize(uint32_t capacity); 262 void TemplateHashMapImpl<P>::Initialize(uint32_t capacity) { 263 ASSERT(IsPowerOf2(capacity)); 264 map_ = reinterpret_cast<Entry*>(P::New(capacity * sizeof(Entry))); 269 capacity_ = capacity;
|
/external/webkit/Source/WebCore/platform/graphics/win/ |
WKCAImageQueue.cpp | 55 WKCAImageQueue::WKCAImageQueue(uint32_t width, uint32_t height, uint32_t capacity) 58 m_private->m_imageQueue.adoptCF(wkCAImageQueueCreate(width, height, capacity));
|
/packages/apps/Gallery/src/com/android/camera/gallery/ |
LruCache.java | 33 public LruCache(final int capacity) { 37 return size() > capacity;
|
/libcore/luni/src/main/java/java/nio/ |
CharBuffer.java | 44 * @param capacity 45 * the capacity of the new buffer. 48 * if {@code capacity} is less than zero. 50 public static CharBuffer allocate(int capacity) { 51 if (capacity < 0) { 52 throw new IllegalArgumentException("capacity < 0: " + capacity); 54 return new CharArrayBuffer(new char[capacity]); 75 * {@code start + charCount}, capacity will be the length of the array. 115 * {@code end}, capacity will be the length of the char sequence. The ne [all...] |
/libcore/luni/src/main/java/java/util/ |
PriorityQueue.java | 52 * Constructs a priority queue with an initial capacity of 11 and natural 60 * Constructs a priority queue with the specified capacity and natural 64 * the specified capacity. 73 * Constructs a priority queue with the specified capacity and comparator. 76 * the specified capacity. 93 * The constructed priority queue has the initial capacity of 110% of the 118 * priority queue. The constructed priority queue has the initial capacity 132 * The constructed priority queue has the initial capacity of 110% of the 304 int capacity = in.readInt(); local 305 elements = newElementArray(capacity); 395 int capacity = (int) Math.ceil(c.size() local [all...] |
/external/icu4c/common/ |
unistr.cpp | 155 UnicodeString::UnicodeString(int32_t capacity, UChar32 c, int32_t count) 161 allocate(capacity); 165 if(capacity < length) { 166 capacity = length; 168 if(allocate(capacity)) { 372 UnicodeString::allocate(int32_t capacity) { 373 if(capacity <= US_STACKBUF_SIZE) { 376 // count bytes for the refCounter and the string capacity, and 380 int32_t words = (int32_t)(((sizeof(int32_t) + (capacity + 1) * U_SIZEOF_UCHAR + 15) & ~15) >> 2); 421 int32_t capacity; local 889 int32_t capacity = (int32_t)sizeof(stackBuffer); local 1211 int32_t capacity; local 1586 int32_t capacity=getCapacity(); local [all...] |