com.toolsverse.util.concurrentlinkedhashmap

Class ConcurrentHashMapV8.EntrySpliterator<K,V>

Object

com.toolsverse.util.concurrentlinkedhashmap.ConcurrentHashMapV8.Traverser<K,V>

com.toolsverse.util.concurrentlinkedhashmap.ConcurrentHashMapV8.EntrySpliterator<K,V>

All Implemented Interfaces:

ConcurrentHashMapV8.ConcurrentHashMapSpliterator<Map.Entry<K,V>>

Enclosing class:

ConcurrentHashMapV8<K,V>

static final class ConcurrentHashMapV8.EntrySpliterator<K,V>
extends ConcurrentHashMapV8.Traverser<K,V>
implements ConcurrentHashMapV8.ConcurrentHashMapSpliterator<Map.Entry<K,V>>

Field Summary

Fields

Modifier and Type	Field and Description
(package private) long	est
(package private) ConcurrentHashMapV8<K,V>	map

Fields inherited from class com.toolsverse.util.concurrentlinkedhashmap.ConcurrentHashMapV8.Traverser

baseIndex, baseLimit, baseSize, index, next, tab

Constructor Summary

Constructors

Constructor and Description
EntrySpliterator(ConcurrentHashMapV8.Node<K,V>[] tab, int size, int index, int limit, long est, ConcurrentHashMapV8<K,V> map)

Method Summary

Modifier and Type	Method and Description
long	estimateSize() Returns an estimate of the number of elements covered by this Spliterator.
void	forEachRemaining(ConcurrentHashMapV8.Action<? super Map.Entry<K,V>> action) Applies the action to each untraversed element
boolean	tryAdvance(ConcurrentHashMapV8.Action<? super Map.Entry<K,V>> action) If an element remains, applies the action and returns true.
ConcurrentHashMapV8.ConcurrentHashMapSpliterator<Map.Entry<K,V>>	trySplit() If possible, returns a new spliterator covering approximately one half of the elements, which will not be covered by this spliterator.

Methods inherited from class com.toolsverse.util.concurrentlinkedhashmap.ConcurrentHashMapV8.Traverser

advance

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

map

final ConcurrentHashMapV8<K,V> map

est

long est

Constructor Detail

EntrySpliterator

EntrySpliterator(ConcurrentHashMapV8.Node<K,V>[] tab,
                 int size,
                 int index,
                 int limit,
                 long est,
                 ConcurrentHashMapV8<K,V> map)

Method Detail

trySplit

public ConcurrentHashMapV8.ConcurrentHashMapSpliterator<Map.Entry<K,V>> trySplit()

Description copied from interface: ConcurrentHashMapV8.ConcurrentHashMapSpliterator

If possible, returns a new spliterator covering approximately one half of the elements, which will not be covered by this spliterator. Returns null if cannot be split.

Specified by:

trySplit in interface ConcurrentHashMapV8.ConcurrentHashMapSpliterator<Map.Entry<K,V>>

forEachRemaining

public void forEachRemaining(ConcurrentHashMapV8.Action<? super Map.Entry<K,V>> action)

Description copied from interface: ConcurrentHashMapV8.ConcurrentHashMapSpliterator

Applies the action to each untraversed element

Specified by:

forEachRemaining in interface ConcurrentHashMapV8.ConcurrentHashMapSpliterator<Map.Entry<K,V>>

tryAdvance

public boolean tryAdvance(ConcurrentHashMapV8.Action<? super Map.Entry<K,V>> action)

Description copied from interface: ConcurrentHashMapV8.ConcurrentHashMapSpliterator

If an element remains, applies the action and returns true.

Specified by:

tryAdvance in interface ConcurrentHashMapV8.ConcurrentHashMapSpliterator<Map.Entry<K,V>>

estimateSize

public long estimateSize()

Description copied from interface: ConcurrentHashMapV8.ConcurrentHashMapSpliterator

Returns an estimate of the number of elements covered by this Spliterator.

Specified by:

estimateSize in interface ConcurrentHashMapV8.ConcurrentHashMapSpliterator<Map.Entry<K,V>>