| /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...] |
| /art/compiler/utils/ |
| assembler.cc | 30 static byte* NewContents(size_t capacity) {
31 return new byte[capacity];
48 CHECK_EQ(Capacity(), kInitialBufferCapacity);
81 size_t old_capacity = Capacity();
99 CHECK_EQ(Capacity(), new_capacity);
|
| /external/chromium_org/chrome/installer/mini_installer/ |
| mini_string_test.cc | 30 EXPECT_EQ(MAX_PATH, str.capacity());
37 size_t max_chars = str.capacity() - 1;
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| Vector.h | 294 size_t capacity() const { return m_capacity; } function in class:WTF::VectorBufferBase
311 VectorBufferBase(T* buffer, size_t capacity)
313 , m_capacity(capacity)
339 VectorBuffer(size_t capacity)
343 if (capacity)
344 allocateBuffer(capacity);
366 using Base::capacity;
389 VectorBuffer(size_t capacity)
392 if (capacity > inlineCapacity)
393 Base::allocateBuffer(capacity);
532 size_t capacity() const { return Base::capacity(); } function in class:WTF::Vector
672 else if (other.size() > capacity()) { function
[all...] |
| Deque.h | 64 size_t size() const { return m_start <= m_end ? m_end - m_start : m_end + m_buffer.capacity() - m_start; }
224 // In this implementation a capacity of 1 would confuse append() and
225 // other places that assume the index after capacity - 1 is 0.
226 ASSERT(m_buffer.capacity() != 1);
228 if (!m_buffer.capacity()) {
232 ASSERT(m_start < m_buffer.capacity());
233 ASSERT(m_end < m_buffer.capacity());
240 ASSERT_UNUSED(index, index <= m_buffer.capacity());
278 , m_buffer(other.m_buffer.capacity())
288 TypeOperations::uninitializedCopy(otherBuffer + m_start, otherBuffer + m_buffer.capacity(), m_buffer.buffer() + m_start)
[all...] |
| /external/chromium_org/third_party/libjingle/source/talk/app/webrtc/java/src/org/webrtc/ |
| VideoRenderer.java | 93 src.position(0).limit(src.capacity());
95 dst.position(0).limit(dst.capacity());
|
| /external/icu4c/i18n/ |
| fpositer.cpp | 60 int32_t FieldPositionIterator::getData(int32_t *dest, int32_t capacity) const {
63 if (capacity < len) {
64 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;
|
| /frameworks/support/v4/java/android/support/v4/util/ |
| ArrayMap.java | 46 * you have no control over this shrinking -- if you set a capacity and then remove an
47 * item, it may reduce the capacity to better match the current size. In the future an
48 * explicit call to set the capacity should turn off this aggressive shrinking behavior.</p>
58 * Create a new ArrayMap with a given initial capacity.
60 public ArrayMap(int capacity) {
61 super(capacity);
|
| /libcore/harmony-tests/src/test/java/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);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.cons/ |
| pointer_alloc.pass.cpp | 35 assert(s2.capacity() >= s2.size());
50 assert(s2.capacity() >= s2.size());
|
| pointer_size_alloc.pass.cpp | 34 assert(s2.capacity() >= s2.size());
48 assert(s2.capacity() >= s2.size());
|
| /packages/apps/Gallery/src/com/android/camera/gallery/ |
| LruCache.java | 33 public LruCache(final int capacity) {
37 return size() > capacity;
|
| /external/chromium_org/third_party/icu/source/common/ |
| uloc_tag.c | 923 _appendLanguageToLanguageTag(const char* localeID, char* appendAt, int32_t capacity, UBool strict, UErrorCode* status) {
945 if (reslen < capacity) {
946 uprv_memcpy(appendAt + reslen, LANG_UND, uprv_min(LANG_UND_LEN, capacity - reslen));
955 if (reslen < capacity) {
956 uprv_memcpy(appendAt + reslen, LANG_UND, uprv_min(LANG_UND_LEN, capacity - reslen));
968 if (reslen < capacity) {
969 uprv_memcpy(appendAt + reslen, buf, uprv_min(len, capacity - reslen));
973 u_terminateChars(appendAt, capacity, reslen, status);
978 _appendScriptToLanguageTag(const char* localeID, char* appendAt, int32_t capacity, UBool strict, UErrorCode* status) {
1004 if (reslen < capacity) {
[all...] |
| ustrenum.cpp | 76 StringEnumeration::ensureCharsCapacity(int32_t capacity, UErrorCode &status) {
77 if(U_SUCCESS(status) && capacity>charsCapacity) {
78 if(capacity<(charsCapacity+charsCapacity/2)) {
80 capacity=charsCapacity+charsCapacity/2;
85 chars=(char *)uprv_malloc(capacity);
91 charsCapacity=capacity;
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkTDynamicHash.h | 22 static const int kMinCapacity = 4; // Smallest capacity we allow.
73 int capacity() const { return fCapacity; } function in class:SkTDynamicHash
94 static T** AllocArray(int capacity) {
95 T** array = (T**)sk_malloc_throw(sizeof(T*) * capacity);
96 sk_bzero(array, sizeof(T*) * capacity); // All cells == Empty().
100 void reset(int capacity) {
103 fCapacity = capacity;
110 // Is capacity sane?
|
| /external/skia/src/core/ |
| SkTDynamicHash.h | 22 static const int kMinCapacity = 4; // Smallest capacity we allow.
73 int capacity() const { return fCapacity; } function in class:SkTDynamicHash
94 static T** AllocArray(int capacity) {
95 T** array = (T**)sk_malloc_throw(sizeof(T*) * capacity);
96 sk_bzero(array, sizeof(T*) * capacity); // All cells == Empty().
100 void reset(int capacity) {
103 fCapacity = capacity;
110 // Is capacity sane?
|
