Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <full_binary_tree.h>
Classes | |
class | Traverser |
Public Member Functions | |
FullBinaryTree () | |
void | _clear () |
void | initialize (Tpos size) |
void | initialize (Tpos size_, const Tpos &default_value) |
Traverser | root () |
Traverser | leaf (Tpos pos) |
Private Types | |
typedef size_t | Tpos |
Private Attributes | |
std::vector< NodeType > | data |
Simple interval tree with get/set value and get_max over interval
typedef size_t interval_trees::FullBinaryTree< NodeType >::Tpos [private] |
interval_trees::FullBinaryTree< NodeType >::FullBinaryTree | ( | ) | [inline] |
void interval_trees::FullBinaryTree< NodeType >::_clear | ( | ) | [inline] |
Clear tree and set it's size to zero.
void interval_trees::FullBinaryTree< NodeType >::initialize | ( | Tpos | size | ) | [inline] |
Shorthand for initialization
void interval_trees::FullBinaryTree< NodeType >::initialize | ( | Tpos | size_, |
const Tpos & | default_value | ||
) | [inline] |
Initialize tree
Traverser interval_trees::FullBinaryTree< NodeType >::leaf | ( | Tpos | pos | ) | [inline] |
Traverser interval_trees::FullBinaryTree< NodeType >::root | ( | ) | [inline] |
std::vector<NodeType> interval_trees::FullBinaryTree< NodeType >::data [private] |
number of leaves in heap structure. Also, pos+base is the index of leaf in data