Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
interval_trees::FullBinaryTree< NodeType >::Traverser Class Reference

#include <full_binary_tree.h>

List of all members.

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

template<typename NodeType>
class interval_trees::FullBinaryTree< NodeType >::Traverser


Constructor & Destructor Documentation

template<typename NodeType >
interval_trees::FullBinaryTree< NodeType >::Traverser::Traverser ( std::vector< NodeType > *  data_,
Tpos  pos_,
Tpos  left_,
Tpos  right_ 
) [inline, explicit]

Member Function Documentation

template<typename NodeType >
Traverser interval_trees::FullBinaryTree< NodeType >::Traverser::left ( ) [inline]
template<typename NodeType >
const NodeType& interval_trees::FullBinaryTree< NodeType >::Traverser::operator* ( ) const [inline]
template<typename NodeType >
NodeType& interval_trees::FullBinaryTree< NodeType >::Traverser::operator* ( ) [inline]
template<typename NodeType >
Traverser interval_trees::FullBinaryTree< NodeType >::Traverser::parent ( ) [inline]
template<typename NodeType >
Tpos interval_trees::FullBinaryTree< NodeType >::Traverser::range_left ( ) const [inline]
template<typename NodeType >
Tpos interval_trees::FullBinaryTree< NodeType >::Traverser::range_right ( ) const [inline]
template<typename NodeType >
Traverser interval_trees::FullBinaryTree< NodeType >::Traverser::right ( ) [inline]

Member Data Documentation

template<typename NodeType >
std::vector<NodeType>* interval_trees::FullBinaryTree< NodeType >::Traverser::data_ptr [private]
template<typename NodeType >
Tpos interval_trees::FullBinaryTree< NodeType >::Traverser::pos [private]
template<typename NodeType >
Tpos interval_trees::FullBinaryTree< NodeType >::Traverser::r_left [private]
template<typename NodeType >
Tpos interval_trees::FullBinaryTree< NodeType >::Traverser::r_right [private]

The documentation for this class was generated from the following file:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines