org.infinispan.commons.util.concurrent.jdk8backported

Class EquivalentConcurrentHashMapV8.KeySpliterator<K,V>

java.lang.Object

org.infinispan.commons.util.concurrent.jdk8backported.EquivalentConcurrentHashMapV8.Traverser<K,V>

org.infinispan.commons.util.concurrent.jdk8backported.EquivalentConcurrentHashMapV8.KeySpliterator<K,V>

All Implemented Interfaces:

EquivalentConcurrentHashMapV8.ConcurrentHashMapSpliterator<K>

Enclosing class:

EquivalentConcurrentHashMapV8<K,V>

static final class EquivalentConcurrentHashMapV8.KeySpliterator<K,V>
extends EquivalentConcurrentHashMapV8.Traverser<K,V>
implements EquivalentConcurrentHashMapV8.ConcurrentHashMapSpliterator<K>

Field Summary

Fields

Modifier and Type	Field and Description
(package private) long	est

Fields inherited from class org.infinispan.commons.util.concurrent.jdk8backported.EquivalentConcurrentHashMapV8.Traverser

baseIndex, baseLimit, baseSize, index, next, spare, stack, tab

Constructor Summary

Constructors

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

Method Summary

Methods

Modifier and Type	Method and Description
long	estimateSize() Returns an estimate of the number of elements covered by this Spliterator.
void	forEachRemaining(EquivalentConcurrentHashMapV8.Action<? super K> action) Applies the action to each untraversed element
boolean	tryAdvance(EquivalentConcurrentHashMapV8.Action<? super K> action) If an element remains, applies the action and returns true.
EquivalentConcurrentHashMapV8.ConcurrentHashMapSpliterator<K>	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 org.infinispan.commons.util.concurrent.jdk8backported.EquivalentConcurrentHashMapV8.Traverser

advance

Methods inherited from class java.lang.Object

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

Field Detail

est

long est

Constructor Detail

EquivalentConcurrentHashMapV8.KeySpliterator

EquivalentConcurrentHashMapV8.KeySpliterator(EquivalentConcurrentHashMapV8.Node<K,V>[] tab,
                                            int size,
                                            int index,
                                            int limit,
                                            long est)

Method Detail

trySplit

public EquivalentConcurrentHashMapV8.ConcurrentHashMapSpliterator<K> trySplit()

Description copied from interface: EquivalentConcurrentHashMapV8.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 EquivalentConcurrentHashMapV8.ConcurrentHashMapSpliterator<K>

forEachRemaining

public void forEachRemaining(EquivalentConcurrentHashMapV8.Action<? super K> action)

Description copied from interface: EquivalentConcurrentHashMapV8.ConcurrentHashMapSpliterator

Applies the action to each untraversed element

Specified by:

forEachRemaining in interface EquivalentConcurrentHashMapV8.ConcurrentHashMapSpliterator<K>

tryAdvance

public boolean tryAdvance(EquivalentConcurrentHashMapV8.Action<? super K> action)

Description copied from interface: EquivalentConcurrentHashMapV8.ConcurrentHashMapSpliterator

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

Specified by:

tryAdvance in interface EquivalentConcurrentHashMapV8.ConcurrentHashMapSpliterator<K>

estimateSize

public long estimateSize()

Description copied from interface: EquivalentConcurrentHashMapV8.ConcurrentHashMapSpliterator

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

Specified by:

estimateSize in interface EquivalentConcurrentHashMapV8.ConcurrentHashMapSpliterator<K>