Class AbstractTrieSetMultimap.TrieSetMultimap_BleedingEdgeNodeIterator<K, V, C, R extends MultimapNode<K,V,C,R>>

java.lang.Object

io.usethesource.capsule.core.AbstractTrieSetMultimap.TrieSetMultimap_BleedingEdgeNodeIterator<K,V,C,R>

All Implemented Interfaces:

Iterator<R>

Enclosing class:

AbstractTrieSetMultimap<K, V, C extends Iterable<V>, R extends MultimapNode<K,V,C,R>>

private static class AbstractTrieSetMultimap.TrieSetMultimap_BleedingEdgeNodeIterator<K, V, C, R extends MultimapNode<K,V,C,R>>
extends Object
implements Iterator<R>

Iterator that first iterates over inlined-values and then continues depth first recursively.

Field Summary

Fields

Modifier and Type	Field	Description
(package private) final Deque<Iterator<? extends R>>	nodeIteratorStack

Constructor Summary

Constructors

Constructor	Description
TrieSetMultimap_BleedingEdgeNodeIterator(R rootNode)

Method Summary

Modifier and Type	Method	Description
boolean	hasNext()
R	next()
void	remove()

Methods inherited from class Object

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

Methods inherited from interface Iterator

forEachRemaining

Field Details

nodeIteratorStack

final Deque<Iterator<? extends R extends MultimapNode<K,V,C,R>>> nodeIteratorStack

Constructor Details

TrieSetMultimap_BleedingEdgeNodeIterator

TrieSetMultimap_BleedingEdgeNodeIterator(R rootNode)

Method Details

hasNext

public boolean hasNext()

Specified by:

hasNext in interface Iterator<K>

next

public R next()

Specified by:

next in interface Iterator<K>

remove

public void remove()

Specified by:

remove in interface Iterator<K>