|
Algorithm Development Kit 1.0 |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface IVisitTwoDNode
Provides interface to enable traversals over TwoD trees to be defined.
There are two methods provided, to differentiate between the two times that nodes are visited within the kd-tree. First, during normal searching when a point is found to be contained within the range query. Second when an entire subtree is found to be contained. The difference leads to great performance benefits, and the drain method designates that the node is being added "in bulk".
Method Summary | |
---|---|
void |
drain(TwoDNode node)
Specialized behavior during search traversals when an entire sub-tree is visited. |
void |
visit(TwoDNode node)
Specialized behavior during traversals for each node being visited. |
Method Detail |
---|
void visit(TwoDNode node)
node
- void drain(TwoDNode node)
node
- whose sub-tree rooted at the node is to be visited "in bulk."
|
Algorithm Development Kit 1.0 | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |