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

  /dalvik/vm/
ReferenceTable.c 71 Object** newTable;
79 newTable = (Object**) realloc(pRef->table, newSize * sizeof(Object*));
80 if (newTable == NULL) {
88 pRef->nextEntry = newTable + (pRef->nextEntry - pRef->table);
89 pRef->table = newTable;
IndirectRefTable.c 161 Object** newTable;
169 newTable = (Object**) realloc(pRef->table, newSize * sizeof(Object*));
170 if (newTable == NULL) {
179 pRef->table = newTable;
  /libcore/luni/src/main/java/java/util/
HashMap.java 538 HashMapEntry<K, V>[] newTable = makeTable(newCapacity);
545 HashMapEntry<K, V> newNext = newTable[newIndex];
546 newTable[newIndex] = e;
559 @SuppressWarnings("unchecked") HashMapEntry<K, V>[] newTable
561 table = newTable;
563 return newTable;
579 HashMapEntry<K, V>[] newTable = makeTable(newCapacity);
581 return newTable;
595 newTable[j | highBit] = e;
600 newTable[j | nextHighBit] = n
    [all...]
Hashtable.java 460 HashtableEntry<K, V>[] newTable = makeTable(newCapacity);
467 HashtableEntry<K, V> newNext = newTable[newIndex];
468 newTable[newIndex] = e;
492 @SuppressWarnings("unchecked") HashtableEntry<K, V>[] newTable
494 table = newTable;
496 return newTable;
512 HashtableEntry<K, V>[] newTable = makeTable(newCapacity);
514 return newTable;
528 newTable[j | highBit] = e;
533 newTable[j | nextHighBit] = n
    [all...]
  /libcore/luni/src/main/java/java/util/concurrent/
ConcurrentHashMap.java 312 void setTable(HashEntry<K,V>[] newTable) {
313 threshold = (int)(newTable.length * loadFactor);
314 table = newTable;
476 HashEntry<K,V>[] newTable = HashEntry.newArray(oldCapacity<<1);
477 threshold = (int)(newTable.length * loadFactor);
478 int sizeMask = newTable.length - 1;
490 newTable[idx] = e;
505 newTable[lastIdx] = lastRun;
510 HashEntry<K,V> n = newTable[k];
511 newTable[k] = new HashEntry<K,V>(p.key, p.hash
    [all...]
  /external/guava/src/com/google/common/collect/
CustomConcurrentHashMap.java 776 void setTable(AtomicReferenceArray<E> newTable) {
777 this.threshold = newTable.length() * 3 / 4;
778 this.table = newTable;
    [all...]
  /external/webkit/JavaScriptCore/runtime/
Structure.cpp 632 PropertyMapHashTable* newTable = static_cast<PropertyMapHashTable*>(fastMalloc(tableSize));
633 memcpy(newTable, m_propertyTable, tableSize);
637 if (UString::Rep* key = newTable->entries()[i].key)
643 newTable->deletedOffsets = new Vector<unsigned>(*m_propertyTable->deletedOffsets);
645 return newTable;
    [all...]
  /external/chromium/third_party/icu/source/i18n/
zonemeta.cpp 74 UChar ** newTable = (UChar**)uprv_realloc(gUStringTable, (gUStringAlloc+USTRING_ALLOC_INCR)*sizeof(UChar*));
75 if (newTable != NULL) {
76 gUStringTable = newTable;
    [all...]
ucol.cpp     [all...]
  /external/icu4c/i18n/
ucol.cpp     [all...]
  /external/expat/lib/
xmlparse.c     [all...]

Completed in 344 milliseconds