Cross Reference: /libcore/ojluni/src/main/java/java/util/WeakHashMap.java

Lines Matching refs:Entry
159     Entry<K,V>[] table;
193     private Entry<K,V>[] newTable(int n) {
194         return (Entry<K,V>[]) new Entry[n];
303                     Entry<K,V> e = (Entry<K,V>) x;
306                 Entry<K,V> prev = table[i];
307                 Entry<K,V> p = prev;
309                     Entry<K,V> next = p.next;
331     private Entry<K,V>[] getTable() {
379         Entry<K,V>[] tab = getTable();
381         Entry<K,V> e = tab[index];
406     Entry<K,V> getEntry(Object key) {
409         Entry<K,V>[] tab = getTable();
411         Entry<K,V> e = tab[index];
432         Entry<K,V>[] tab = getTable();
435         for (Entry<K,V> e = tab[i]; e != null; e = e.next) {
445         Entry<K,V> e = tab[i];
446         tab[i] = new Entry<>(k, value, queue, h, e);
467         Entry<K,V>[] oldTable = getTable();
474         Entry<K,V>[] newTable = newTable(newCapacity);
493     private void transfer(Entry<K,V>[] src, Entry<K,V>[] dest) {
495             Entry<K,V> e = src[j];
498                 Entry<K,V> next = e.next;
547         for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
574         Entry<K,V>[] tab = getTable();
576         Entry<K,V> prev = tab[i];
577         Entry<K,V> e = prev;
580             Entry<K,V> next = e.next;
597     /** Special version of remove needed by Entry set */
599         if (!(o instanceof Map.Entry))
601         Entry<K,V>[] tab = getTable();
602         Map.Entry<?,?> entry = (Map.Entry<?,?>)o;
606         Entry<K,V> prev = tab[i];
607         Entry<K,V> e = prev;
610             Entry<K,V> next = e.next;
660         Entry<K,V>[] tab = getTable();
662             for (Entry<K,V> e = tab[i]; e != null; e = e.next)
672         Entry<K,V>[] tab = getTable();
674             for (Entry<K,V> e = tab[i]; e != null; e = e.next)
684     private static class Entry<K,V> extends WeakReference<Object> implements Map.Entry<K,V> {
687         Entry<K,V> next;
692         Entry(Object key, V value,
694               int hash, Entry<K,V> next) {
717             if (!(o instanceof Map.Entry))
719             Map.Entry<?,?> e = (Map.Entry<?,?>)o;
745         private Entry<K,V> entry = null;
746         private Entry<K,V> lastReturned = null;
766             Entry<K,V>[] t = table;
769                 Entry<K,V> e = entry;
787         protected Entry<K,V> nextEntry() {
826     private class EntryIterator extends HashIterator<Map.Entry<K,V>> {
827         public Map.Entry<K,V> next() {
834     private transient Set<Map.Entry<K,V>> entrySet = null;
939     public Set<Map.Entry<K,V>> entrySet() {
940         Set<Map.Entry<K,V>> es = entrySet;
944     private class EntrySet extends AbstractSet<Map.Entry<K,V>> {
945         public Iterator<Map.Entry<K,V>> iterator() {
950             if (!(o instanceof Map.Entry))
952             Map.Entry<?,?> e = (Map.Entry<?,?>)o;
953             Entry<K,V> candidate = getEntry(e.getKey());
969         private List<Map.Entry<K,V>> deepCopy() {
970             List<Map.Entry<K,V>> list = new ArrayList<>(size());
971             for (Map.Entry<K,V> e : this)
984         public Spliterator<Map.Entry<K,V>> spliterator() {
995         Entry<K, V>[] tab = getTable();
996         for (Entry<K, V> entry : tab) {
1017         Entry<K, V>[] tab = getTable();
1018         for (Entry<K, V> entry : tab) {
1040         WeakHashMap.Entry<K,V> current; // current node
1093             WeakHashMap.Entry<K,V>[] tab = m.table;
1102                 WeakHashMap.Entry<K,V> p = current;
1126             WeakHashMap.Entry<K,V>[] tab = map.table;
1173             WeakHashMap.Entry<K,V>[] tab = m.table;
1182                 WeakHashMap.Entry<K,V> p = current;
1204             WeakHashMap.Entry<K,V>[] tab = map.table;
1232         implements Spliterator<Map.Entry<K,V>> {
1246         public void forEachRemaining(Consumer<? super Map.Entry<K, V>> action) {
1251             WeakHashMap.Entry<K,V>[] tab = m.table;
1260                 WeakHashMap.Entry<K,V> p = current;
1282         public boolean tryAdvance(Consumer<? super Map.Entry<K,V>> action) {
1286             WeakHashMap.Entry<K,V>[] tab = map.table;