/system/core/toolbox/ |
H A D | dynarray.h | 9 int capacity; member in struct:__anon246
|
/system/core/include/utils/ |
H A D | KeyedVector.h | 58 inline size_t capacity() const { return mVector.capacity(); } function in class:android::KeyedVector 59 //! sets the capacity. capacity can never be reduced less than size()
|
H A D | BasicHashtable.h | 115 // number of entries and returns its effective capacity. 173 /* Creates a hashtable with the specified minimum initial capacity. 176 * minimumInitialCapacity: The minimum initial capacity for the hashtable. 208 /* Returns the capacity of the hashtable, which is the number of elements that can 211 inline size_t capacity() const { function in class:android::BasicHashtable 287 * If the entry will not fit, then the hashtable's capacity is increased and 312 * Grows the hashtable to at least the specified minimum capacity or the 320 * Rehashing is the only way to change the capacity or load factor of the 322 * hashtable by choosing a minimum capacity that is smaller than the current 323 * capacity (suc [all...] |
H A D | SortedVector.h | 69 inline size_t capacity() const { return VectorImpl::capacity(); } function in class:android::SortedVector 70 //! sets the capacity. capacity can never be reduced less than size()
|
H A D | Vector.h | 79 inline size_t capacity() const { return VectorImpl::capacity(); } function in class:android::Vector 80 //! sets the capacity. capacity can never be reduced less than size()
|
/system/core/libpixelflinger/codeflinger/tinyutils/ |
H A D | SortedVector.h | 66 inline size_t capacity() const { return VectorImpl::capacity(); } function in class:android::tinyutils::SortedVector 67 //! setst the capacity. capacity can never be reduced less than size()
|
H A D | KeyedVector.h | 57 inline size_t capacity() const { return mVector.capacity(); } function in class:android::tinyutils::KeyedVector 58 //! setst the capacity. capacity can never be reduced less than size()
|
H A D | Vector.h | 74 inline size_t capacity() const { return VectorImpl::capacity(); } function in class:android::tinyutils::Vector 75 //! setst the capacity. capacity can never be reduced less than size()
|
H A D | VectorImpl.cpp | 93 sb = SharedBuffer::alloc(capacity() * mItemSize); 104 size_t VectorImpl::capacity() const function in class:android::tinyutils::VectorImpl 222 ALOG_ASSERT(index<capacity(), 223 "[%p] itemLocation: index=%d, capacity=%d, count=%d", 224 this, (int)index, (int)capacity(), (int)mCount); 234 ALOG_ASSERT(index<capacity(), 235 "[%p] editItemLocation: index=%d, capacity=%d, count=%d", 236 this, (int)index, (int)capacity(), (int)mCount); 246 size_t current_capacity = capacity(); 249 // we can't reduce the capacity [all...] |
/system/extras/tests/sdcard/ |
H A D | stopwatch.cpp | 54 StopWatch::StopWatch(const char *name, size_t capacity) argument 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",
|
/system/core/libutils/ |
H A D | VectorImpl.cpp | 90 sb = SharedBuffer::alloc(capacity() * mItemSize); 101 size_t VectorImpl::capacity() const function in class:android::VectorImpl 298 ALOG_ASSERT(index<capacity(), 299 "[%p] editItemLocation: index=%d, capacity=%d, count=%d", 300 this, (int)index, (int)capacity(), (int)mCount); 302 if (index < capacity()) { 313 ALOG_ASSERT(index<capacity(), 314 "[%p] itemLocation: index=%d, capacity=%d, count=%d", 315 this, (int)index, (int)capacity(), (int)mCount); 317 if (index < capacity()) { [all...] |
/system/core/charger/ |
H A D | charger.c | 110 /* current capacity being animated */ 111 int capacity; member in struct:animation 342 "/sys/%s/capacity", path); 673 if (batt_anim->capacity < 0 || batt_anim->num_frames == 0) 724 /* find first frame given current capacity */ 735 batt_anim->capacity = batt_cap; 748 if (batt_anim->num_frames == 0 || batt_anim->capacity < 0) {
|