Home
last modified time | relevance | path

Searched refs:tab (Results 1 – 6 of 6) sorted by relevance

/libcore/luni/src/main/java/java/util/
DHashtable.java124 HashtableEntry<K, V>[] tab = (HashtableEntry<K, V>[]) EMPTY_TABLE; in Hashtable() local
125 table = tab; in Hashtable()
266 HashtableEntry<K, V>[] tab = table; in get() local
267 for (HashtableEntry<K, V> e = tab[hash & (tab.length - 1)]; in get()
290 HashtableEntry<K, V>[] tab = table; in containsKey() local
291 for (HashtableEntry<K, V> e = tab[hash & (tab.length - 1)]; in containsKey()
314 HashtableEntry[] tab = table; in containsValue() local
315 int len = tab.length; in containsValue()
318 for (HashtableEntry e = tab[i]; e != null; e = e.next) { in containsValue()
365 HashtableEntry<K, V>[] tab = table; in put() local
[all …]
DHashMap.java145 HashMapEntry<K, V>[] tab = (HashMapEntry<K, V>[]) EMPTY_TABLE; in HashMap() local
146 table = tab; in HashMap()
306 HashMapEntry<K, V>[] tab = table; in get() local
307 for (HashMapEntry<K, V> e = tab[hash & (tab.length - 1)]; in get()
336 HashMapEntry<K, V>[] tab = table; in containsKey() local
337 for (HashMapEntry<K, V> e = tab[hash & (tab.length - 1)]; in containsKey()
365 HashMapEntry[] tab = table; in containsValue() local
366 int len = tab.length; in containsValue()
369 for (HashMapEntry e = tab[i]; e != null; e = e.next) { in containsValue()
380 for (HashMapEntry e = tab[i]; e != null; e = e.next) { in containsValue()
[all …]
DLinkedHashMap.java252 HashMapEntry<K, V>[] tab = table; in get() local
253 for (HashMapEntry<K, V> e = tab[hash & (tab.length - 1)]; in get()
/libcore/luni/src/main/java/java/util/concurrent/
DConcurrentHashMap.java214 static final <K,V> HashEntry<K,V> entryAt(HashEntry<K,V>[] tab, int i) { in entryAt() argument
215 return (tab == null) ? null : in entryAt()
217 (tab, ((long)i << TSHIFT) + TBASE); in entryAt()
224 static final <K,V> void setEntryAt(HashEntry<K,V>[] tab, int i, in setEntryAt() argument
226 UNSAFE.putOrderedObject(tab, ((long)i << TSHIFT) + TBASE, e); in setEntryAt()
327 Segment(float lf, int threshold, HashEntry<K,V>[] tab) { in Segment() argument
330 this.table = tab; in Segment()
338 HashEntry<K,V>[] tab = table; in put() local
339 int index = (tab.length - 1) & hash; in put()
340 HashEntry<K,V> first = entryAt(tab, index); in put()
[all …]
/libcore/luni/src/test/resources/out_hb/
Dstaff.out13 This is an adjacent CDATASection with a reference to a tab &tab;
/libcore/luni/src/test/resources/out_dh/
Dstaff.out13 This is an adjacent CDATASection with a reference to a tab &tab;