Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <full_binary_tree.h>
Public Member Functions | |
Traverser (std::vector< NodeType > *data_, Tpos pos_, Tpos left_, Tpos right_) | |
NodeType & | operator* () |
const NodeType & | operator* () const |
Traverser | left () |
Traverser | right () |
Traverser | parent () |
Tpos | range_left () const |
Tpos | range_right () const |
Private Attributes | |
std::vector< NodeType > * | data_ptr |
Tpos | pos |
Tpos | r_left |
Tpos | r_right |
interval_trees::FullBinaryTree< NodeType >::Traverser::Traverser | ( | std::vector< NodeType > * | data_, |
Tpos | pos_, | ||
Tpos | left_, | ||
Tpos | right_ | ||
) | [inline, explicit] |
Traverser interval_trees::FullBinaryTree< NodeType >::Traverser::left | ( | ) | [inline] |
const NodeType& interval_trees::FullBinaryTree< NodeType >::Traverser::operator* | ( | ) | const [inline] |
NodeType& interval_trees::FullBinaryTree< NodeType >::Traverser::operator* | ( | ) | [inline] |
Traverser interval_trees::FullBinaryTree< NodeType >::Traverser::parent | ( | ) | [inline] |
Tpos interval_trees::FullBinaryTree< NodeType >::Traverser::range_left | ( | ) | const [inline] |
Tpos interval_trees::FullBinaryTree< NodeType >::Traverser::range_right | ( | ) | const [inline] |
Traverser interval_trees::FullBinaryTree< NodeType >::Traverser::right | ( | ) | [inline] |
std::vector<NodeType>* interval_trees::FullBinaryTree< NodeType >::Traverser::data_ptr [private] |
Tpos interval_trees::FullBinaryTree< NodeType >::Traverser::pos [private] |
Tpos interval_trees::FullBinaryTree< NodeType >::Traverser::r_left [private] |
Tpos interval_trees::FullBinaryTree< NodeType >::Traverser::r_right [private] |