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

Search for data matching an interest in which the rightmost (canonically largest) data among several matching pieces should be returned. More...

Inheritance diagram for org.ccnx.ccn.impl.repo.ContentTree.RightSearch:

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

List of all members.

Protected Member Functions

 RightSearch (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 in which the rightmost (canonically largest) data among several matching pieces should be returned.

Member Function Documentation

Iterator<TreeNode> org.ccnx.ccn.impl.repo.ContentTree.RightSearch.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 Thu Feb 16 00:44:53 2012 for Content-Centric Networking in Java by  doxygen 1.5.6