Protected Member Functions | |
Search (Interest interest, InterestPreScreener ips) | |
ContentObject | search (TreeNode node, ContentName nodeName, ContentGetter getter, int depth, boolean leftSearch) |
Do the actual search. | |
abstract Iterator< TreeNode > | initIterator (boolean leftSearch, byte[] interestComp) |
Return an iterator through children at this level. | |
abstract boolean | continueSearch (boolean leftSearch, TreeNode child, byte[] component) |
Protected Attributes | |
Interest | _interest |
InterestPreScreener | _ips |
SortedMap< TreeNode, TreeNode > | _children = null |
ContentObject org.ccnx.ccn.impl.repo.ContentTree.Search.search | ( | TreeNode | node, | |
ContentName | nodeName, | |||
ContentGetter | getter, | |||
int | depth, | |||
boolean | leftSearch | |||
) | [protected] |
Do the actual search.
Use abstract method to decide how to traverse the tree
node | the node rooting a subtree to search | |
nodeName | the full name of this node from the root up to and its component | |
getter | a handler to pull actual ContentObjects for final match testing | |
depth | the length of name of node including its component (number of components) | |
leftSearch | true if we should search down the left side of the tree at this level |
abstract Iterator<TreeNode> org.ccnx.ccn.impl.repo.ContentTree.Search.initIterator | ( | boolean | leftSearch, | |
byte[] | interestComp | |||
) | [protected, pure virtual] |
Return an iterator through children at this level.
anyOK | leftSearch only - if false must go "left by one" at this level | |
interestComp | component to start search with |
Implemented in org.ccnx.ccn.impl.repo.ContentTree.LeftSearch, and org.ccnx.ccn.impl.repo.ContentTree.RightSearch.