15 #ifndef FINDAPPROXLEVELENTRY_H 16 #define FINDAPPROXLEVELENTRY_H 18 #include "pandabase.h" 20 #include "findApproxPath.h" 21 #include "workingNodePath.h" 36 INLINE FindApproxLevelEntry(
const FindApproxLevelEntry &parent,
38 FindApproxLevelEntry *next);
39 INLINE FindApproxLevelEntry(
const FindApproxLevelEntry ©);
40 INLINE
void operator = (
const FindApproxLevelEntry ©);
41 ALLOC_DELETED_CHAIN(FindApproxLevelEntry);
46 FindApproxLevelEntry *&next_level,
47 int max_matches,
int increment)
const;
49 FindApproxLevelEntry *&next_level,
53 void output(ostream &out)
const;
54 void write_level(ostream &out,
int indent_level)
const;
66 FindApproxLevelEntry *_next;
72 static void init_type() {
73 register_type(_type_handle,
"FindApproxLevelEntry");
86 #include "findApproxLevelEntry.I" A basic node of the scene graph or data graph.
bool is_solution(int increment) const
Returns true if this entry represents a solution to the search; i.e.
This class is local to this package only; it doesn't get exported.
This class is local to this package only; it doesn't get exported.
bool next_is_stashed(int increment) const
Returns true if the next node matched by this entry must be a stashed node, false otherwise...
void write_level(ostream &out, int indent_level) const
Writes the entire level (a linked list of entries beginning at this entry).
This is a class designed to support low-overhead traversals of the complete scene graph...
bool consider_node(NodePathCollection &result, FindApproxLevelEntry *&next_level, int max_matches, int increment) const
Considers the node represented by the entry for matching the find path.
void output(ostream &out) const
Formats the entry for meaningful output.
void consider_next_step(PandaNode *child_node, FindApproxLevelEntry *&next_level, int increment) const
Compares the indicated child node (which is assumed to be a child of _node_path) with the next compon...
TypeHandle is the identifier used to differentiate C++ class types.
This is a set of zero or more NodePaths.