jspace::STaoTreeInfo::~STaoTreeInfo |
( |
| ) |
|
|
virtual |
bool jspace::STaoTreeInfo::sort |
( |
| ) |
|
Iterates over the info vector, making sure that each node sits at the position specified by its ID. Also does a sanity check afterwards, so don't ignore the return value. See also tao_consistency_check().
- Returns
- true if the sort succeeded (info[ii].id == id for all nodes), false if something went wrong (this happens e.g. when you have duplicate IDs or gaps in the sequence from 0..N-1).
The documentation for this struct was generated from the following files:
- /home/samir/Code/control/scl.git/src/scl/dynamics/tao/jspace/tao_util.hpp
- /home/samir/Code/control/scl.git/src/scl/dynamics/tao/jspace/tao_util.cpp