#include <findApproxLevelEntry.h>
Public Member Functions | |
FindApproxLevelEntry (const WorkingNodePath &node_path, FindApproxPath &approx_path) | |
FindApproxLevelEntry (const FindApproxLevelEntry ©, int increment=0) | |
void | operator= (const FindApproxLevelEntry ©) |
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 | consider_node (NodePathCollection &result, FindApproxLevel &next_level, int max_matches, int increment) const |
void | consider_next_step (NodePathCollection &result, PandaNode *child_node, FindApproxLevel &next_level, int max_matches, int increment) const |
Compares the indicated child node (which is assumed to be a child of _node_path) with the next component of the path. | |
bool | is_solution (int increment) const |
Returns true if this entry represents a solution to the search; i.e. | |
void | output (ostream &out) const |
Formats the entry for meaningful output. | |
Public Attributes | |
WorkingNodePath | _node_path |
int | _i |
FindApproxPath & | _approx_path |
It represents a single node under consideration for matching at a single point in the breadth-first search.
Definition at line 46 of file findApproxLevelEntry.h.
|
Definition at line 31 of file findApproxLevelEntry.I. References _node_path. |
|
Definition at line 47 of file findApproxLevelEntry.I. References _approx_path, _i, _node_path, INLINE, WorkingNodePath::is_valid(), and nassertv. |
|
Compares the indicated child node (which is assumed to be a child of _node_path) with the next component of the path. If it matches, generates whatever additional entries are appropriate and stores them in next_level. If a complete solution is found, stores it in result. Definition at line 140 of file findApproxLevelEntry.cxx. |
|
Definition at line 57 of file findApproxLevelEntry.cxx. References _node_path, NodePathCollection::add_path(), WorkingNodePath::get_node_path(), and NodePathCollection::get_num_paths(). |
|
Returns true if this entry represents a solution to the search; i.e. all the components of the path have been successfully matched. Definition at line 99 of file findApproxLevelEntry.I. |
|
Returns true if the next node matched by this entry must be a stashed node, false otherwise.
Definition at line 82 of file findApproxLevelEntry.I. References _approx_path, and _i. |
|
Definition at line 63 of file findApproxLevelEntry.I. References _approx_path, _i, INLINE, and FindApproxPath::matches_stashed(). |
|
Formats the entry for meaningful output. For debugging only. Definition at line 38 of file findApproxLevelEntry.cxx. |
|
Definition at line 73 of file findApproxLevelEntry.h. Referenced by FindApproxLevelEntry(), next_is_stashed(), and operator=(). |
|
Definition at line 72 of file findApproxLevelEntry.h. Referenced by FindApproxLevelEntry(), next_is_stashed(), and operator=(). |
|
Definition at line 66 of file findApproxLevelEntry.h. Referenced by consider_node(), FindApproxLevelEntry(), and NodePath::set_billboard_point_eye(). |