BottomUpTreeWalk Class Reference

#include <TreeWalk.h>

Inheritance diagram for BottomUpTreeWalk:

Public Member Functions
	BottomUpTreeWalk (Compute *_comp, TreePiece *tp)
void	walk (GenericTreeNode *node, State *state, int chunk, int reqID, int awi)
Public Member Functions inherited from TreeWalk
TreePiece *	getOwnerTP ()
Compute *	getCompute ()
virtual void	init (Compute *c, TreePiece *owner)
	Associate a compute object and a treepiece with this walk.
void	reassoc (Compute *c)
virtual void	reset ()
virtual void	resumeWalk (GenericTreeNode *node, State *state, int chunk, int reqID, int activeWalkIndex)
WalkType	getSelfType ()

Additional Inherited Members
Protected Member Functions inherited from TreeWalk
	TreeWalk (Compute *_comp, TreePiece *tp, WalkType _type)
	TreeWalk (WalkType t)
Protected Attributes inherited from TreeWalk
Compute *	comp
TreePiece *	ownerTP
WalkType	type

Detailed Description

Walk a tree starting with a leaf node and working up the tree. This class is used for the k-th nearest neighbor search (Smooth).

Member Function Documentation

void BottomUpTreeWalk::walk ( GenericTreeNode *  node, State *  state, int  chunk, int  reqID, int  awi  )

virtual

Bottom up treewalk for efficient smooth: If startNode is the root, and not a periodic, then go down to the bucket being walked, pushing siblings onto a stack in the local frame. Once the stack is processed, then all walks are done in the standard "top down" way.

Implements TreeWalk.

---

The documentation for this class was generated from the following files:

• TreeWalk.h
• TreeWalk.cpp