org.ccnx.ccn.impl.repo.ContentTree.LeftSearch Class Reference

Search for data matching an interest that specifies either the leftmost (canonically smallest) match or doesn't specify a specific way to match data within several pieces of matching data. More...

List of all members.

Protected Member Functions

 LeftSearch (Interest interest, InterestPreScreener ips)
Iterator< TreeNodeinitIterator (boolean leftSearch, byte[] interestComp)
 Return an iterator through children at this level.
boolean continueSearch (boolean leftSearch, TreeNode child, byte[] component)

Detailed Description

Search for data matching an interest that specifies either the leftmost (canonically smallest) match or doesn't specify a specific way to match data within several pieces of matching data.


Member Function Documentation

Iterator<TreeNode> org.ccnx.ccn.impl.repo.ContentTree.LeftSearch.initIterator ( boolean  leftSearch,
byte[]  interestComp 
) [protected, virtual]

Return an iterator through children at this level.

Parameters:
anyOK leftSearch only - if false must go "left by one" at this level
interestComp component to start search with
Returns:
the iterator

Implements org.ccnx.ccn.impl.repo.ContentTree.Search.


The documentation for this class was generated from the following file:
Generated on Fri May 13 16:27:39 2011 for Content-Centric Networking in Java by  doxygen 1.6.3