Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
interval_trees::fenwick::FenwickMaxTree< T > Class Template Reference

#include <fenwick.h>

Collaboration diagram for interval_trees::fenwick::FenwickMaxTree< T >:

List of all members.

Public Member Functions

void initialize (FenwickDirection type, size_t size)
void update (int pos, T value)
get_max (int pos)

Private Types

typedef FenwickTree< T,
BinaryMax< T > > 
FenwickType

Private Attributes

FenwickType fenwick

template<typename T>
class interval_trees::fenwick::FenwickMaxTree< T >


Member Typedef Documentation

template<typename T >
typedef FenwickTree<T, BinaryMax<T> > interval_trees::fenwick::FenwickMaxTree< T >::FenwickType [private]

Member Function Documentation

template<typename T >
T interval_trees::fenwick::FenwickMaxTree< T >::get_max ( int  pos) [inline]
template<typename T >
void interval_trees::fenwick::FenwickMaxTree< T >::initialize ( FenwickDirection  type,
size_t  size 
) [inline]
template<typename T >
void interval_trees::fenwick::FenwickMaxTree< T >::update ( int  pos,
value 
) [inline]

Member Data Documentation

template<typename T >
FenwickType interval_trees::fenwick::FenwickMaxTree< T >::fenwick [private]

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