Skip navigation links

com.tangosol.util
Class BinaryRadixTree.KeyIterator

java.lang.Object
com.oracle.common.collections.AbstractStableIterator
com.tangosol.util.BinaryRadixTree.KeyIterator

All Implemented Interfaces:

java.util.Enumeration, java.util.Iterator

Direct Known Subclasses:

BinaryRadixTree.AllKeyIterator, BinaryRadixTree.FilteredIterator

Enclosing class:

BinaryRadixTree

protected abstract class BinaryRadixTree.KeyIterator

extends com.oracle.common.collections.AbstractStableIterator

An Iterator that iterates Binary keys from Nodes.

Field Summary

protected java.util.Iterator	f_iter An Iterator of Nodes from which this Iterator will iterate Binary keys.
protected com.oracle.common.base.Predicate	f_predicate The predicate to use to evaluate Nodes for inclusion in this iterator.

Constructor Summary

BinaryRadixTree.KeyIterator(com.oracle.common.base.Predicate predicate)
Default constructor.

Method Summary

protected void	advance()
protected void	append(java.util.List list, com.tangosol.util.BinaryRadixTree.Node node) Recursively append all the nodes to the list that meet the criteria of this Iterator.
protected int	getEstimatedSize() Guess how many items might theoretically be in the iterator.
protected void	remove(Binary oPrev)

Methods inherited from class com.oracle.common.collections.AbstractStableIterator

getPrevious, hasMoreElements, hasNext, next, nextElement, remove, remove, setNext

Field Detail

f_iter

protected final java.util.Iterator f_iter

An Iterator of Nodes from which this Iterator will iterate Binary keys.

f_predicate

protected final com.oracle.common.base.Predicate f_predicate

The predicate to use to evaluate Nodes for inclusion in this iterator.

Constructor Detail

BinaryRadixTree.KeyIterator

public BinaryRadixTree.KeyIterator(com.oracle.common.base.Predicate predicate)

Default constructor.

Method Detail

advance

protected void advance()

Specified by:

advance in class com.oracle.common.collections.AbstractStableIterator

remove

protected void remove(Binary oPrev)

append

protected void append(java.util.List list,
                      com.tangosol.util.BinaryRadixTree.Node node)

Recursively append all the nodes to the list that meet the criteria of this Iterator.

Parameters:

list - the list to append to

node - the Node to evaluate for inclusion in this Iterator

getEstimatedSize

protected int getEstimatedSize()

Guess how many items might theoretically be in the iterator.

Returns:

an estimate (WAG) of the number of items in the iterator

Skip navigation links