| /libcore/ojluni/src/main/java/sun/net/www/ |
| D | HeaderParser.java | 53 String[][] tab; field in HeaderParser
59 tab = new String[asize][2]; in HeaderParser()
77 n.tab = new String [asize][2]; in subsequence()
79 System.arraycopy (tab, start, n.tab, 0, (end-start)); in subsequence()
96 tab[i][0] = new String(ca, beg, end-beg).toLowerCase(); in parse()
102 tab[i++][1]= new String(ca, beg, end-beg); in parse()
119 tab[i++][0] = (new String(ca, beg, end-beg)).toLowerCase(); in parse()
121 tab[i++][1] = (new String(ca, beg, end-beg)); in parse()
134 System.arraycopy (tab, 0, ntab, 0, tab.length); in parse()
135 tab = ntab; in parse()
[all …]
|
| /libcore/ojluni/src/main/java/java/lang/ |
| D | ThreadLocal.java | 394 Entry[] tab = table; in getEntryAfterMiss() local
395 int len = tab.length; in getEntryAfterMiss()
405 e = tab[i]; in getEntryAfterMiss()
423 Entry[] tab = table; in set() local
424 int len = tab.length; in set()
427 for (Entry e = tab[i]; in set()
429 e = tab[i = nextIndex(i, len)]) { in set()
443 tab[i] = new Entry(key, value); in set()
453 Entry[] tab = table; in remove() local
454 int len = tab.length; in remove()
[all …]
|
| /libcore/ojluni/src/main/java/java/util/ |
| D | IdentityHashMap.java | 338 Object[] tab = table; in get() local
339 int len = tab.length; in get()
342 Object item = tab[i]; in get()
344 return (V) tab[i + 1]; in get()
362 Object[] tab = table; in containsKey() local
363 int len = tab.length; in containsKey()
366 Object item = tab[i]; in containsKey()
385 Object[] tab = table; in containsValue() local
386 for (int i = 1; i < tab.length; i += 2) in containsValue()
387 if (tab[i] == value && tab[i - 1] != null) in containsValue()
[all …]
|
| D | Hashtable.java | 300 HashtableEntry tab[] = table; in contains() local
301 for (int i = tab.length ; i-- > 0 ;) { in contains()
302 for (HashtableEntry<K,V> e = tab[i] ; e != null ; e = e.next) { in contains()
338 HashtableEntry tab[] = table; in containsKey() local
340 int index = (hash & 0x7FFFFFFF) % tab.length; in containsKey()
341 for (HashtableEntry<K,V> e = tab[index] ; e != null ; e = e.next) { in containsKey()
365 HashtableEntry tab[] = table; in get() local
367 int index = (hash & 0x7FFFFFFF) % tab.length; in get()
368 for (HashtableEntry<K,V> e = tab[index] ; e != null ; e = e.next) { in get()
446 HashtableEntry tab[] = table; in put() local
[all …]
|
| D | HashMap.java | 679 HashMapEntry[] tab = table; in containsValue()
680 for (int i = 0; i < tab.length ; i++) in containsValue()
681 for (HashMapEntry e = tab[i] ; e != null ; e = e.next) in containsValue()
691 HashMapEntry[] tab = table; in containsNullValue() local
692 for (int i = 0; i < tab.length ; i++) in containsNullValue()
693 for (HashMapEntry e = tab[i] ; e != null ; e = e.next) in containsNullValue()
922 HashMapEntry<K,V>[] tab = m.table; in getFence() local
923 hi = fence = (tab == null) ? 0 : tab.length; in getFence()
954 HashMapEntry<K,V>[] tab = m.table; in forEachRemaining() local
957 hi = fence = (tab == null) ? 0 : tab.length; in forEachRemaining()
[all …]
|
| D | WeakHashMap.java | 379 Entry<K,V>[] tab = getTable(); in get() local
380 int index = indexFor(h, tab.length); in get()
381 Entry<K,V> e = tab[index]; in get()
409 Entry<K,V>[] tab = getTable(); in getEntry() local
410 int index = indexFor(h, tab.length); in getEntry()
411 Entry<K,V> e = tab[index]; in getEntry()
432 Entry<K,V>[] tab = getTable(); in put() local
433 int i = indexFor(h, tab.length); in put()
435 for (Entry<K,V> e = tab[i]; e != null; e = e.next) { in put()
445 Entry<K,V> e = tab[i]; in put()
[all …]
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| D | ConcurrentHashMap.java | 733 static final <K,V> Node<K,V> tabAt(Node<K,V>[] tab, int i) { in tabAt() argument
734 return (Node<K,V>)U.getObjectVolatile(tab, ((long)i << ASHIFT) + ABASE); in tabAt()
737 static final <K,V> boolean casTabAt(Node<K,V>[] tab, int i, in casTabAt() argument
739 return U.compareAndSwapObject(tab, ((long)i << ASHIFT) + ABASE, c, v); in casTabAt()
742 static final <K,V> void setTabAt(Node<K,V>[] tab, int i, Node<K,V> v) { in setTabAt() argument
743 U.putObjectVolatile(tab, ((long)i << ASHIFT) + ABASE, v); in setTabAt()
914 Node<K,V>[] tab; Node<K,V> e, p; int n, eh; K ek; in get() local
916 if ((tab = table) != null && (n = tab.length) > 0 && in get()
917 (e = tabAt(tab, (n - 1) & h)) != null) { in get()
993 for (Node<K,V>[] tab = table;;) { in putVal()
[all …]
|
| /libcore/luni/src/test/resources/out_hb/ |
| D | staff.out | 13 This is an adjacent CDATASection with a reference to a tab &tab;
|
| /libcore/luni/src/test/resources/out_dh/ |
| D | staff.out | 13 This is an adjacent CDATASection with a reference to a tab &tab;
|
| /libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/ |
| D | GroupByOpTest.java | 134 Collector<Integer, ?, Map<Object, List<Integer>>> tab = Collectors.groupingBy(md.m); in testOps() local
137 .terminal(s -> s, s -> s.collect(tab)) in testOps()
|
| /libcore/ojluni/ |
| D | NOTICE | 48 * tab size: 8 (not used)
|