Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <fenwick.h>
Public Member Functions | |
void | initialize (FenwickDirection type, size_t size) |
void | update (int pos, T value) |
T | get_max (int pos) |
Private Types | |
typedef FenwickTree< T, BinaryMax< T > > | FenwickType |
Private Attributes | |
FenwickType | fenwick |
typedef FenwickTree<T, BinaryMax<T> > interval_trees::fenwick::FenwickMaxTree< T >::FenwickType [private] |
T interval_trees::fenwick::FenwickMaxTree< T >::get_max | ( | int | pos | ) | [inline] |
void interval_trees::fenwick::FenwickMaxTree< T >::initialize | ( | FenwickDirection | type, |
size_t | size | ||
) | [inline] |
void interval_trees::fenwick::FenwickMaxTree< T >::update | ( | int | pos, |
T | value | ||
) | [inline] |
FenwickType interval_trees::fenwick::FenwickMaxTree< T >::fenwick [private] |