Skip navigation links

com.tangosol.util
Class BinaryRadixTree.KeyIterator

java.lang.Object
com.tangosol.util.Base
com.tangosol.util.AbstractStableIterator
com.tangosol.util.BinaryRadixTree.KeyIterator

All Implemented Interfaces:

java.util.Iterator

Direct Known Subclasses:

BinaryRadixTree.AllKeyIterator, BinaryRadixTree.FilteredIterator

Enclosing class:

BinaryRadixTree

protected abstract class BinaryRadixTree.KeyIterator

extends AbstractStableIterator

An Iterator that iterates Binary keys from Nodes.

Field Summary

protected java.util.Iterator

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

Constructor Summary

BinaryRadixTree.KeyIterator()
Default constructor.

Method Summary

protected void	advance() Advance to the next object.
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 abstract boolean	includeNode(com.tangosol.util.BinaryRadixTree.Node node) Determine if the specified Node should be included in the Iterator.
protected void	remove(Binary oPrev)

Methods inherited from class com.tangosol.util.AbstractStableIterator

getPrevious, hasNext, next, remove, remove, setNext

Field Detail

m_iter

protected final java.util.Iterator m_iter

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

Constructor Detail

BinaryRadixTree.KeyIterator

public BinaryRadixTree.KeyIterator()

Default constructor.

Method Detail

advance

protected void advance()

Advance to the next object.

This method must be implemented by the concrete sub-class by calling AbstractStableIterator.setNext(java.lang.Object) if there is a next object.

Specified by:

advance in class 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

includeNode

protected abstract boolean includeNode(com.tangosol.util.BinaryRadixTree.Node node)

Determine if the specified Node should be included in the Iterator.

Parameters:

node - a Node in the radix tree

Returns:

true iff the Node should be included in the Iterator

Skip navigation links