Searched defs:elementData (Results 1 - 5 of 5) sorted by relevance
/dalvik/libcore/luni/src/main/java/java/util/ |
H A D | Vector.java | 60 protected Object[] elementData; field in class:Vector 110 elementData = newElementArray(capacity); 130 elementData[elementCount++] = it.next(); 197 int required = size - (elementData.length - elementCount); 203 System.arraycopy(elementData, location, elementData, location 208 elementData[location++] = it.next(); 238 if (elementCount == elementData.length) { 241 elementData[elementCount++] = object; 254 return elementData [all...] |
H A D | WeakHashMap.java | 42 Entry<K, V>[] elementData; field in class:WeakHashMap 135 while (position < elementData.length) { 136 if ((nextEntry = elementData[position++]) != null) { 206 elementData = newEntryArray(capacity == 0 ? 1 : capacity); 231 elementData = newEntryArray(capacity == 0 ? 1 : capacity); 264 Arrays.fill(elementData, null); 273 threshold = (int) ((long) elementData.length * loadFactor / 10000); 468 int index = (key.hashCode() & 0x7FFFFFFF) % elementData.length; 469 Entry<K, V> entry = elementData[index]; 478 Entry<K, V> entry = elementData[ [all...] |
H A D | HashMap.java | 37 transient Entry<K, V>[] elementData; field in class:HashMap 99 Entry<KT, VT>[] elementData = associatedMap.elementData; 100 int length = elementData.length; 105 if (elementData[newPosition] == null) { 137 result = lastEntry = associatedMap.elementData[position++]; 160 while (associatedMap.elementData[--position] == null) { 163 associatedMap.elementData[position] = associatedMap.elementData[position].next; 212 int index = (hash & 0x7FFFFFFF) % associatedMap.elementData [all...] |
H A D | Hashtable.java | 49 transient Entry<K, V>[] elementData; field in class:Hashtable 146 if (elementData[position] == null) { 162 && (lastEntry = elementData[position]) == null) { 187 Entry<K, V> entry = elementData[lastPosition]; 189 elementData[lastPosition] = entry.next; 238 if (elementData[start] != null) { 239 entry = elementData[start]; 278 elementData = newElementArray(capacity == 0 ? 1 : capacity); 279 firstSlot = elementData.length; 301 elementData [all...] |
H A D | IdentityHashMap.java | 53 transient Object[] elementData; field in class:IdentityHashMap 142 while (position < associatedMap.elementData.length) { 144 if (associatedMap.elementData[position] == null) { 181 associatedMap.remove(associatedMap.elementData[lastPosition]); 261 elementData = newElementArray(computeElementArraySize()); 308 for (int i = 0; i < elementData.length; i++) { 309 elementData[i] = null; 329 int index = findIndex(key, elementData); 330 return elementData[index] == key; 348 for (int i = 1; i < elementData [all...] |
Completed in 99 milliseconds