| /external/srec/portable/src/ |
| phashtable.c | 278 unsigned int newCapacity = ((oldCapacity << 1) | 0x01);
284 sizeof(PHashTableEntry *) * newCapacity);
290 table->args.capacity = newCapacity;
291 table->threshold = (unsigned int)(newCapacity * table->args.maxLoadFactor);
293 for (i = oldCapacity; i < newCapacity; ++i)
302 idx = entry->hashCode % newCapacity;
|
| /external/icu4c/i18n/ |
| sortkey.cpp | 99 uint8_t *CollationKey::reallocate(int32_t newCapacity, int32_t length) {
100 uint8_t *newBytes = static_cast<uint8_t *>(uprv_malloc(newCapacity));
107 fUnion.fFields.fCapacity = newCapacity;
|
| /libcore/luni/src/main/java/java/util/ |
| HashMap.java | 536 int newCapacity = Collections.roundUpToPowerOfTwo(capacityForInitSize(numMappings));
539 if (newCapacity <= oldCapacity) {
542 if (newCapacity == oldCapacity * 2) {
548 HashMapEntry<K, V>[] newTable = makeTable(newCapacity);
550 int newMask = newCapacity - 1;
566 * @param newCapacity must be a power of two
568 private HashMapEntry<K, V>[] makeTable(int newCapacity) {
570 = (HashMapEntry<K, V>[]) new HashMapEntry[newCapacity];
572 threshold = (newCapacity >> 1) + (newCapacity >> 2); // 3/4 capacit
[all...] |
| Hashtable.java | 440 int newCapacity = Collections.roundUpToPowerOfTwo(capacityForInitSize(numMappings));
443 if (newCapacity <= oldCapacity) {
449 if (newCapacity == oldCapacity * 2) {
455 HashtableEntry<K, V>[] newTable = makeTable(newCapacity);
457 int newMask = newCapacity - 1;
484 * @param newCapacity must be a power of two
486 private HashtableEntry<K, V>[] makeTable(int newCapacity) {
488 = (HashtableEntry<K, V>[]) new HashtableEntry[newCapacity];
490 threshold = (newCapacity >> 1) + (newCapacity >> 2); // 3/4 capacit
[all...] |
| ArrayList.java | 154 Object[] newArray = new Object[newCapacity(s)];
173 private static int newCapacity(int currentCapacity) {
197 int newCapacity = newCapacity(newSize - 1); // ~33% growth room
198 Object[] newArray = new Object[newCapacity];
238 int newCapacity = newCapacity(newSize - 1); // ~33% growth room
239 Object[] newArray = new Object[newCapacity];
|
| Vector.java | 445 private void grow(int newCapacity) {
446 E[] newData = newElementArray(newCapacity);
447 // Assumes elementCount is <= newCapacity
448 // assert elementCount <= newCapacity;
[all...] |
| /libcore/luni/src/main/java/libcore/io/ |
| IoUtils.java | 240 final int newCapacity = capacity * 2;
241 byte[] newBytes = new byte[newCapacity];
244 capacity = newCapacity;
|
| /external/icu4c/common/ |
| ustr_wcs.cpp | 108 int32_t newCapacity = 2 * srcLength;
109 if(newCapacity <= tempBufCapacity) {
110 newCapacity = _BUFFER_CAPACITY_MULTIPLIER * tempBufCapacity;
113 newCapacity, count, 1)) {
|
| unistr.cpp | [all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkTDynamicHash.h | 202 void resize(int newCapacity) {
207 reset(newCapacity);
|
| /external/skia/src/core/ |
| SkTDynamicHash.h | 202 void resize(int newCapacity) {
207 reset(newCapacity);
|
| /external/clang/include/clang/AST/ |
| ASTVector.h | 376 size_t NewCapacity = 2*CurCapacity;
377 if (NewCapacity < MinSize)
378 NewCapacity = MinSize;
381 T *NewElts = new (C, llvm::alignOf<T>()) T[NewCapacity];
397 Capacity = Begin+NewCapacity;
|
| /external/chromium_org/third_party/icu/source/common/ |
| unistr.cpp | [all...] |
| uset.cpp | 610 // int32_t newCapacity=set->capacity+set->capacity/2+USET_GROW_DELTA;
611 // UChar32* newArray=(UChar32* )uprv_malloc(newCapacity*4);
615 // set->capacity=newCapacity;
|
| /external/lzma/CPP/Common/ |
| MyString.h | 162 void SetCapacity(int newCapacity)
164 int realCapacity = newCapacity + 1;
169 if (newCapacity > kMaxStringSize || newCapacity < _length)
|
| MyVector.h | 27 void Reserve(int newCapacity);
|
| /external/clang/lib/AST/ |
| NestedNameSpecifier.cpp | 403 unsigned NewCapacity
407 char *NewBuffer = static_cast<char *>(malloc(NewCapacity));
413 BufferCapacity = NewCapacity;
|
| /libcore/luni/src/main/java/java/lang/ |
| ThreadLocal.java | 314 int newCapacity = capacity;
319 newCapacity = capacity * 2;
325 initializeTable(newCapacity);
|
| /external/icu4c/i18n/unicode/ |
| sortkey.h | 245 * Replaces the current bytes buffer with a new one of newCapacity
249 uint8_t *reallocate(int32_t newCapacity, int32_t length);
|
| /external/clang/lib/Sema/ |
| TypeLocBuilder.h | 133 void grow(size_t NewCapacity);
|
| /external/llvm/include/llvm/ADT/ |
| SmallVector.h | 272 size_t NewCapacity = size_t(NextPowerOf2(CurCapacity+2));
273 if (NewCapacity < MinSize)
274 NewCapacity = MinSize;
275 T *NewElts = static_cast<T*>(malloc(NewCapacity*sizeof(T)));
289 this->CapacityX = this->begin()+NewCapacity;
|
| /frameworks/av/media/libstagefright/mpeg2ts/ |
| MPEG2PSExtractor.cpp | 166 size_t newCapacity = mBuffer->capacity() + kChunkSize;
167 sp<ABuffer> newBuffer = new ABuffer(newCapacity);
|
| ATSParser.cpp | [all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| MinMaxPriorityQueue.java | 920 int newCapacity = calculateNewCapacity();
921 Object[] newQueue = new Object[newCapacity];
930 int newCapacity = (oldCapacity < 64)
933 return capAtMaximumSize(newCapacity, maximumSize);
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ScheduledThreadPoolExecutor.java | [all...] |
