class TreeSearch::TreeWalk


TreeSearch::TreeWalk

Function Members (Methods)

public:

virtual	~TreeWalk()
static TClass*	Class()
virtual TClass*	IsA() const
TreeSearch::NodeVisitor::ETreeOp	operator()(TreeSearch::Link* link, TreeSearch::NodeVisitor& op, TreeSearch::Pattern* parent = 0, UInt_t depth = 0, UInt_t shift = 0, Bool_t mirrored = false) const
TreeSearch::TreeWalk&	operator=(const TreeSearch::TreeWalk&)
void	SetNlevels(UInt_t n)
virtual void	ShowMembers(TMemberInspector& insp, char* parent)
virtual void	Streamer(TBuffer& b)
void	StreamerNVirtual(TBuffer& b)
TreeSearch::TreeWalk	TreeWalk(UInt_t nlevels = 0)
TreeSearch::TreeWalk	TreeWalk(const TreeSearch::TreeWalk&)

Data Members

private:

UInt_t	fNlevels	Number of levels in tree

Class Charts

Inheritance Inherited Members Includes Libraries

Function documentation

operator()(TreeSearch::Link* link, TreeSearch::NodeVisitor& op, TreeSearch::Pattern* parent = 0, UInt_t depth = 0, UInt_t shift = 0, Bool_t mirrored = false) const

 Traverse the tree and call function object "action" for each link.
 The return value from action determines the behavior:
  kRecurse: process child nodes until reaching maxdepth
  kRecurseUncond: process child nodes (regardless of depth)
  fSkipChildNodes: ignore child nodes
  kError: error, return immediately

TreeWalk( UInt_t nlevels = 0 )

{}

virtual ~TreeWalk()

{}

void SetNlevels(UInt_t n)

{ fNlevels = n; }

WritePattern& operator=(const TreeSearch::TreeWalk& )