HomeSort by relevance Sort by last modified time
    Searched refs:newBucketCount (Results 1 - 8 of 8) sorted by null

  /external/emma/core/java12/com/vladium/util/
IntObjectMap.java 244 // TODO: it is possible to run this method twice, first time using the 2*k+1 prime sequencer for newBucketCount
250 final int newBucketCount = (m_buckets.length << 1) + 1;
251 final Entry [] newBuckets = new Entry [newBucketCount];
262 final int newBucketIndex = (entryKey & 0x7FFFFFFF) % newBucketCount;
273 m_sizeThreshold = (int) (newBucketCount * m_loadFactor);
IntSet.java 216 // TODO: it is possible to run this method twice, first time using the 2*k+1 prime sequencer for newBucketCount
222 final int newBucketCount = (m_buckets.length << 1) + 1;
223 final Entry [] newBuckets = new Entry [newBucketCount];
234 final int newBucketIndex = (entryKey & 0x7FFFFFFF) % newBucketCount;
245 m_sizeThreshold = (int) (newBucketCount * m_loadFactor);
IntIntMap.java 286 // TODO: it is possible to run this method twice, first time using the 2*k+1 prime sequencer for newBucketCount
292 final int newBucketCount = (m_buckets.length << 1) + 1;
293 final Entry [] newBuckets = new Entry [newBucketCount];
304 final int newBucketIndex = entryKeyHash % newBucketCount;
315 m_sizeThreshold = (int) (newBucketCount * m_loadFactor);
ObjectIntMap.java 282 // TODO: it is possible to run this method twice, first time using the 2*k+1 prime sequencer for newBucketCount
288 final int newBucketCount = (m_buckets.length << 1) + 1;
289 final Entry [] newBuckets = new Entry [newBucketCount];
300 final int newBucketIndex = entryKeyHash % newBucketCount;
311 m_sizeThreshold = (int) (newBucketCount * m_loadFactor);
SoftValueMap.java 472 // TODO: it is possible to run this method twice, first time using the 2*k+1 prime sequencer for newBucketCount
478 final int newBucketCount = (m_buckets.length << 1) + 1;
479 final SoftEntry [] newBuckets = new SoftEntry [newBucketCount];
501 final int newBucketIndex = (entryKeyHashCode & 0x7FFFFFFF) % newBucketCount;
533 m_sizeThreshold = (int) (newBucketCount * m_loadFactor);
  /frameworks/native/libs/utils/
BasicHashtable.cpp 202 size_t newBucketCount, newCapacity;
203 determineCapacity(minimumCapacity, loadFactor, &newBucketCount, &newCapacity);
205 if (newBucketCount != mBucketCount || newCapacity != mCapacity) {
209 newBuckets = allocateBuckets(newBucketCount);
214 size_t index = chainStart(hash, newBucketCount);
217 size_t inc = chainIncrement(hash, newBucketCount);
220 index = chainSeek(index, inc, newBucketCount);
235 mBucketCount = newBucketCount;
  /system/core/libcutils/
hashmap.c 105 size_t newBucketCount = map->bucketCount << 1;
106 Entry** newBuckets = calloc(newBucketCount, sizeof(Entry*));
118 size_t index = calculateIndex(newBucketCount, entry->hash);
128 map->bucketCount = newBucketCount;
  /external/emma/lib/
emma.jar 

Completed in 242 milliseconds