HomeSort by relevance Sort by last modified time
    Searched refs:newCapacity (Results 26 - 50 of 78) sorted by null

12 3 4

  /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...]
normalizer2impl.cpp 183 int32_t newCapacity=length+appendLength;
185 if(newCapacity<doubleCapacity) {
186 newCapacity=doubleCapacity;
188 if(newCapacity<256) {
189 newCapacity=256;
191 start=str.getBuffer(newCapacity);
    [all...]
uniset.cpp     [all...]
  /external/icu4c/i18n/unicode/
sortkey.h 244 * Replaces the current bytes buffer with a new one of newCapacity
248 uint8_t *reallocate(int32_t newCapacity, int32_t length);
  /frameworks/native/libs/utils/
BasicHashtable.cpp 202 size_t newBucketCount, newCapacity;
203 determineCapacity(minimumCapacity, loadFactor, &newBucketCount, &newCapacity);
205 if (newBucketCount != mBucketCount || newCapacity != mCapacity) {
236 mCapacity = newCapacity;
  /frameworks/native/include/utils/
LruCache.h 87 void rehash(size_t newCapacity);
216 void LruCache<TKey, TValue>::rehash(size_t newCapacity) {
222 mTable.reset(new BasicHashtable<TKey, Entry>(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...]
ArrayDeque.java 122 int newCapacity = n << 1;
123 if (newCapacity < 0)
125 Object[] a = 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...]
Scanner.java     [all...]
  /libcore/luni/src/main/java/java/lang/
ThreadLocal.java 314 int newCapacity = capacity;
319 newCapacity = capacity * 2;
325 initializeTable(newCapacity);
  /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...]
ConcurrentHashMap.java 401 int newCapacity = oldCapacity << 1;
402 threshold = (int)(newCapacity * loadFactor);
404 (HashEntry<K,V>[]) new HashEntry<?,?>[newCapacity];
405 int sizeMask = newCapacity - 1;
    [all...]
  /frameworks/ex/common/java/com/android/common/widget/
CompositeCursorAdapter.java 89 int newCapacity = mSize + 2;
90 Partition[] newAdapters = new Partition[newCapacity];
  /external/icu4c/i18n/
tznames_impl.cpp 208 int32_t newCapacity = fNodesCapacity + 1000;
209 if (newCapacity > 0xffff) {
210 newCapacity = 0xffff;
212 CharacterNode *newNodes = (CharacterNode *)uprv_malloc(newCapacity * sizeof(CharacterNode));
219 fNodesCapacity = newCapacity;
    [all...]
ucol.cpp 275 reallocCEs(collIterate *data, int32_t newCapacity) {
281 uint32_t *newCEs = (uint32_t *)uprv_malloc(newCapacity * 4);
288 data->extendCEsSize = newCapacity;
326 int32_t newCapacity = 2 * offsetBufferSize + UCOL_EXPAND_CE_BUFFER_SIZE;
327 int32_t *newBuffer = static_cast<int32_t *>(uprv_malloc(newCapacity * 4));
338 offsetBufferSize = newCapacity;
    [all...]
  /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/webkit/Source/JavaScriptCore/wtf/
Deque.h 423 size_t newCapacity = max(static_cast<size_t>(16), oldCapacity + oldCapacity / 4 + 1);
425 m_buffer.allocateBuffer(newCapacity);
430 size_t newStart = newCapacity - (oldCapacity - m_start);
  /libcore/luni/src/main/native/
org_apache_harmony_xml_ExpatParser.cpp 72 int newCapacity = capacity * 2;
73 jstring* newArray = new jstring[newCapacity];
82 capacity = newCapacity;
    [all...]
  /frameworks/av/media/libstagefright/
AVIExtractor.cpp 252 size_t newCapacity =
255 sp<ABuffer> newBuffer = new ABuffer(newCapacity);
    [all...]
  /frameworks/base/core/java/com/android/internal/widget/
PointerLocationView.java     [all...]

Completed in 1164 milliseconds

12 3 4