/** * @return an iterator over the entries of the backing map */ public Iterator<Map.Entry<K, V>> iterator() { final ConcurrentHashMapV8<K, V> m = map; final Node<K, V>[] t; final int f = (t = m.table) == null ? 0 : t.length; return new EntryIterator<K, V>(t, f, 0, f, m); }
/** * @return an iterator over the entries of the backing map */ public Iterator<Map.Entry<K, V>> iterator() { final ConcurrentHashMapV8<K, V> m = map; final Node<K, V>[] t; final int f = (t = m.table) == null ? 0 : t.length; return new EntryIterator<K, V>(t, f, 0, f, m); }
/** * @return an iterator over the entries of the backing map */ public Iterator<Map.Entry<K, V>> iterator() { final ConcurrentHashMapV8<K, V> m = map; final Node<K, V>[] t; final int f = (t = m.table) == null ? 0 : t.length; return new EntryIterator<K, V>(t, f, 0, f, m); }
/** * @return an iterator over the entries of the backing map */ public Iterator<Map.Entry<K, V>> iterator() { final ConcurrentHashMapV8<K, V> m = map; final Node<K, V>[] t; final int f = (t = m.table) == null ? 0 : t.length; return new EntryIterator<K, V>(t, f, 0, f, m); }
/** * @return an iterator over the entries of the backing map */ public Iterator<Map.Entry<K, V>> iterator() { final ConcurrentHashMapV8<K, V> m = map; final Node<K, V>[] t; final int f = (t = m.table) == null ? 0 : t.length; return new EntryIterator<K, V>(t, f, 0, f, m); }
/** * @return an iterator over the entries of the backing map */ public Iterator<Map.Entry<K, V>> iterator() { final ConcurrentHashMapV8<K, V> m = map; final Node<K, V>[] t; final int f = (t = m.table) == null ? 0 : t.length; return new EntryIterator<K, V>(t, f, 0, f, m); }
/** * @return an iterator over the entries of the backing map */ public Iterator<Map.Entry<K, V>> iterator() { final ConcurrentHashMapV8<K, V> m = map; final Node<K, V>[] t; final int f = (t = m.table) == null ? 0 : t.length; return new EntryIterator<K, V>(t, f, 0, f, m); }