#include <LinkTraverse.h>
◆ LinkTraverse() [1/3]
LinkTraverse::LinkTraverse |
( |
| ) |
|
◆ LinkTraverse() [2/3]
LinkTraverse::LinkTraverse |
( |
int |
size | ) |
|
◆ LinkTraverse() [3/3]
LinkTraverse::LinkTraverse |
( |
Link * |
root, |
|
|
bool |
doUpward = false , |
|
|
bool |
doDownward = true |
|
) |
| |
◆ ~LinkTraverse()
LinkTraverse::~LinkTraverse |
( |
| ) |
|
|
virtual |
◆ begin()
std::vector<Link*>::const_iterator cnoid::LinkTraverse::begin |
( |
| ) |
const |
|
inline |
◆ calcForwardKinematics()
void LinkTraverse::calcForwardKinematics |
( |
bool |
calcVelocity = false , |
|
|
bool |
calcAcceleration = false |
|
) |
| const |
◆ clear()
void LinkTraverse::clear |
( |
| ) |
|
◆ empty()
bool cnoid::LinkTraverse::empty |
( |
| ) |
const |
|
inline |
◆ end()
std::vector<Link*>::const_iterator cnoid::LinkTraverse::end |
( |
| ) |
const |
|
inline |
◆ find()
void LinkTraverse::find |
( |
Link * |
root, |
|
|
bool |
doUpward = false , |
|
|
bool |
doDownward = true |
|
) |
| |
|
virtual |
◆ isDownward()
bool cnoid::LinkTraverse::isDownward |
( |
int |
index | ) |
const |
|
inline |
If the connection from the queried link to the next link is downward (forward) direction, the method returns true. Otherwise, returns false. The range of valid indices is 0 to (numLinks() - 2).
◆ link()
Link* cnoid::LinkTraverse::link |
( |
int |
index | ) |
const |
|
inline |
◆ numLinks()
int cnoid::LinkTraverse::numLinks |
( |
| ) |
const |
|
inline |
◆ operator[]()
Link* cnoid::LinkTraverse::operator[] |
( |
int |
index | ) |
const |
|
inline |
◆ rootLink()
Link* cnoid::LinkTraverse::rootLink |
( |
| ) |
const |
|
inline |
◆ size()
std::size_t cnoid::LinkTraverse::size |
( |
| ) |
const |
|
inline |
◆ links
std::vector<Link*> cnoid::LinkTraverse::links |
|
protected |
◆ numUpwardConnections
int cnoid::LinkTraverse::numUpwardConnections |
|
protected |
The documentation for this class was generated from the following files: