Spliterator<Entry<V>> () { Node<V>[] t; ConcurrentIntObjectHashMap<V> m = map; long n = m.sumCount(); int f = (t = m.table) == null ? 0 : t.length; return new EntrySpliterator<V>(t, f, 0, f, n < 0L ? 0L : n, m); }