, including all inherited members.
| a_in_z | LCPNode | [protected] |
| active | dpNode | [protected] |
| add_child(dpNode *n) | dpNode | [protected] |
| astar_cost | dpNode | [protected] |
| AstarCost() | dpNode | [inline] |
| brother | dpNode | [protected] |
| Brother() | dpNode | [inline] |
| calc_astar_cost(dpNode *potential_parent) | LCPNode | [inline, protected, virtual] |
| calc_cost() | LCPNode | [inline, protected, virtual] |
| calc_new_q(const fVec &q, const fMat &m_jr, int piv, fVec &q_new) | LCPNode | [inline, protected] |
| child | dpNode | [protected] |
| Child() | dpNode | [inline] |
| cost | dpNode | [protected] |
| Cost() | dpNode | [inline] |
| create_child_nodes(dpNode **&nodes) | LCPNode | [inline, protected, virtual] |
| depth | dpNode | [protected] |
| Depth(dpNode *target_p=0) | dpNode | [inline] |
| dp_main | dpNode | [protected] |
| dpNode() | dpNode | [inline] |
| dump(ostream &ost) | dpNode | [inline, protected, virtual] |
| dump_all(ostream &ost) | dpNode | [inline, protected] |
| dump_trajectory(ostream &ost) | dpNode | [inline, protected] |
| g_in_w | LCPNode | [protected] |
| GetParent(int id) | dpNode | [inline] |
| id | dpNode | [protected] |
| ID() | dpNode | [inline] |
| is_goal() | LCPNode | [inline, protected, virtual] |
| jr | LCPNode | [protected] |
| js | LCPNode | [protected] |
| lcp | LCPNode | [protected] |
| LCPNode(LCP *_lcp, LCPNode *parent_lcp, const fVec &_q_old, double _max_error, const vector< int > &_w2a, const vector< int > &_w2g, const vector< int > &_z2a, const vector< int > &_z2g, int _n_steps, int _js, int _jr, double _cost) | LCPNode | [inline] |
| Maa_inv | LCPNode | |
| max_error | LCPNode | [protected] |
| min_new_q(const fVec &q, const fMat &m_jr, int piv, double max_error, int z0_index=-1, double *new_q_z0=0) | LCPNode | [inline, protected] |
| n_steps | LCPNode | [protected] |
| n_vars | LCPNode | [protected] |
| new_jr | LCPNode | [protected] |
| next_breadth(dpNode *refnode) | dpNode | [inline, protected] |
| next_depth(dpNode *first_child=0) | dpNode | [inline, protected] |
| num_errors | LCPNode | [static] |
| num_loops | LCPNode | [static] |
| NumStep() | LCPNode | [inline] |
| open(int _max_nodes, int _max_goals) | dpNode | [protected] |
| parent | dpNode | [protected] |
| Parent() | dpNode | [inline] |
| q_old | LCPNode | |
| queue | dpNode | [protected] |
| Queue() | dpNode | [inline] |
| remove() | dpNode | [protected] |
| remove_single() | dpNode | [protected] |
| same_state(dpNode *refnode) | LCPNode | [inline, protected, virtual] |
| terminate | LCPNode | [protected] |
| total_astar_cost | dpNode | [protected] |
| total_cost | dpNode | [protected] |
| TotalAstarCost() | dpNode | [inline] |
| TotalCost() | dpNode | [inline] |
| w2a | LCPNode | |
| w2g | LCPNode | |
| yr2a | LCPNode | [protected] |
| yr2g | LCPNode | [protected] |
| ys2a | LCPNode | [protected] |
| ys2g | LCPNode | [protected] |
| z2a | LCPNode | |
| z2g | LCPNode | |
| ~dpNode() | dpNode | [inline, virtual] |
| ~LCPNode() | LCPNode | [inline] |