Skip navigation links
com.tangosol.util
Class BinaryRadixTree.FilteredIterator
java.lang.Object
com.tangosol.util.Base
com.tangosol.util.AbstractStableIterator
com.tangosol.util.BinaryRadixTree.KeyIterator
com.tangosol.util.BinaryRadixTree.FilteredIterator
- All Implemented Interfaces:
- java.util.Iterator
- Enclosing class:
- BinaryRadixTree
-
protected class BinaryRadixTree.FilteredIterator
- extends BinaryRadixTree.KeyIterator
An Iterator that iterates only the Binary keys in the radix tree whose associated value matches (via some bit-mask) a specified value.
Constructor Summary |
BinaryRadixTree.FilteredIterator(long lMask, long lValue)
Construct an iterator of all of the keys that have values that match the specified value as seen through the passed bit-mask. |
Method Summary |
protected int |
getEstimatedSize()
{inheritDoc} |
protected boolean |
includeNode(com.tangosol.util.BinaryRadixTree.Node node)
{inheritDoc} |
BinaryRadixTree.FilteredIterator
public BinaryRadixTree.FilteredIterator(long lMask,
long lValue)
- Construct an iterator of all of the keys that have values that match the specified value as seen through the passed bit-mask. For each key in the tree associated with a value v, the key is included in the Iterator iff (v & lMask) == (lValue & lMask).
- Parameters:
lMask
- a long bit-mask value
lValue
- a long value to compare to
getEstimatedSize
protected int getEstimatedSize()
- {inheritDoc}
-
- Overrides:
getEstimatedSize
in class BinaryRadixTree.KeyIterator
-
- Returns:
- an estimate (WAG) of the number of items in the iterator
includeNode
protected boolean includeNode(com.tangosol.util.BinaryRadixTree.Node node)
- {inheritDoc}
-
- Specified by:
includeNode
in class BinaryRadixTree.KeyIterator
-
- Parameters:
node
- a Node in the radix tree
- Returns:
- true iff the Node should be included in the Iterator
Skip navigation links
Copyright © 2000, 2011, Oracle and/or its affiliates. All rights reserved.