Home
last modified time | relevance | path

Searched defs:tab (Results 1 – 8 of 8) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
DHashtable.java300 HashtableEntry tab[] = table; in contains() local
338 HashtableEntry tab[] = table; in containsKey() local
365 HashtableEntry tab[] = table; in get() local
446 HashtableEntry tab[] = table; in put() local
484 HashtableEntry tab[] = table; in remove() local
522 HashtableEntry tab[] = table; in clear() local
691 HashtableEntry[] tab = table; in contains() local
706 HashtableEntry[] tab = table; in remove() local
840 HashtableEntry[] tab = table; in hashCode() local
858 HashtableEntry<?, ?>[] tab = table; in forEach() local
[all …]
DIdentityHashMap.java338 Object[] tab = table; in get() local
362 Object[] tab = table; in containsKey() local
385 Object[] tab = table; in containsValue() local
403 Object[] tab = table; in containsMapping() local
433 Object[] tab = table; in put() local
525 Object[] tab = table; in remove() local
558 Object[] tab = table; in removeMapping() local
589 Object[] tab = table; in closeDeletion() local
622 Object[] tab = table; in clear() local
689 Object[] tab = table; in hashCode() local
[all …]
DHashMap.java691 HashMapEntry[] tab = table; in containsNullValue() local
922 HashMapEntry<K,V>[] tab = m.table; in getFence() local
954 HashMapEntry<K,V>[] tab = m.table; in forEachRemaining() local
982 HashMapEntry<K,V>[] tab = map.table; in tryAdvance() local
1027 HashMapEntry<K,V>[] tab = m.table; in forEachRemaining() local
1055 HashMapEntry<K,V>[] tab = map.table; in tryAdvance() local
1099 HashMapEntry<K,V>[] tab = m.table; in forEachRemaining() local
1127 HashMapEntry<K,V>[] tab = map.table; in tryAdvance() local
1206 HashMapEntry<K,V>[] tab; in forEach() local
1261 HashMapEntry<K,V>[] tab; in forEach() local
[all …]
DWeakHashMap.java379 Entry<K,V>[] tab = getTable(); in get() local
409 Entry<K,V>[] tab = getTable(); in getEntry() local
432 Entry<K,V>[] tab = getTable(); in put() local
574 Entry<K,V>[] tab = getTable(); in remove() local
672 Entry<K,V>[] tab = getTable(); in containsNullValue() local
995 Entry<K, V>[] tab = getTable(); in forEach() local
1017 Entry<K, V>[] tab = getTable(); in replaceAll() local
1093 WeakHashMap.Entry<K,V>[] tab = m.table; in forEachRemaining() local
1126 WeakHashMap.Entry<K,V>[] tab = map.table; in tryAdvance() local
1173 WeakHashMap.Entry<K,V>[] tab = m.table; in forEachRemaining() local
[all …]
/libcore/ojluni/src/main/java/java/lang/
DThreadLocal.java394 Entry[] tab = table; in getEntryAfterMiss() local
423 Entry[] tab = table; in set() local
453 Entry[] tab = table; in remove() local
484 Entry[] tab = table; in replaceStaleEntry() local
552 Entry[] tab = table; in expungeStaleEntry() local
613 Entry[] tab = table; in cleanSomeSlots() local
675 Entry[] tab = table; in expungeStaleEntries() local
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/
DGroupByOpTest.java134 Collector<Integer, ?, Map<Object, List<Integer>>> tab = Collectors.groupingBy(md.m); in testOps() local
/libcore/ojluni/src/main/java/sun/net/www/
DHeaderParser.java53 String[][] tab; field in HeaderParser
/libcore/luni/src/main/java/java/util/concurrent/
DConcurrentHashMap.java733 static final <K,V> Node<K,V> tabAt(Node<K,V>[] tab, int i) { in tabAt()
737 static final <K,V> boolean casTabAt(Node<K,V>[] tab, int i, in casTabAt()
742 static final <K,V> void setTabAt(Node<K,V>[] tab, int i, Node<K,V> v) { in setTabAt()
914 Node<K,V>[] tab; Node<K,V> e, p; int n, eh; K ek; in get() local
1165 Node<K,V>[] tab = table; in clear() local
1451 Node<K,V>[] tab = (Node<K,V>[])new Node<?,?>[n]; in readObject() local
2204 ForwardingNode(Node<K,V>[] tab) { in ForwardingNode()
2263 Node<K,V>[] tab; int sc; in initTable() local
2313 Node<K,V>[] tab, nt; int n, sc; in addCount() local
2336 final Node<K,V>[] helpTransfer(Node<K,V>[] tab, Node<K,V> f) { in helpTransfer()
[all …]