Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <fenwick.h>
Public Member Functions | |
void | initialize (SizeType size) |
void | increment (SizeType pos, T value) |
T | get_prefix_sum (SizeType pos) |
Private Types | |
typedef class FenwickTree< T, BinaryPlus< T > > | FenwickType |
typedef FenwickType::SizeType | SizeType |
Private Attributes | |
FenwickType | fenwick |
typedef class FenwickTree< T, BinaryPlus< T > > interval_trees::fenwick::FenwickSumTree< T >::FenwickType [private] |
Underlying Fenwick tree type
typedef FenwickType::SizeType interval_trees::fenwick::FenwickSumTree< T >::SizeType [private] |
Type of indexes
T interval_trees::fenwick::FenwickSumTree< T >::get_prefix_sum | ( | SizeType | pos | ) | [inline] |
void interval_trees::fenwick::FenwickSumTree< T >::increment | ( | SizeType | pos, |
T | value | ||
) | [inline] |
void interval_trees::fenwick::FenwickSumTree< T >::initialize | ( | SizeType | size | ) | [inline] |
FenwickType interval_trees::fenwick::FenwickSumTree< T >::fenwick [private] |
Underlying fenwick tree implementation