Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
IntervalMaxArray< ValueType > Class Template Reference

#include <interval_array.h>

List of all members.

Public Member Functions

void initialize (SizeType size)
void set (SizeType start, SizeType end, ValueType value)
void update (SizeType start, SizeType end, ValueType value)
ValueType get_max (SizeType start, SizeType end)

Private Types

typedef std::vector< ValueType >
::size_type 
SizeType

Private Attributes

std::vector< ValueType > data

Detailed Description

template<typename ValueType>
class IntervalMaxArray< ValueType >

Interval-tree-like implementation done in a simple array.

Warning:
This class is inefficient, use only for testing!

Member Typedef Documentation

template<typename ValueType >
typedef std::vector<ValueType>::size_type IntervalMaxArray< ValueType >::SizeType [private]

Member Function Documentation

template<typename ValueType >
ValueType IntervalMaxArray< ValueType >::get_max ( SizeType  start,
SizeType  end 
) [inline]

get maximum of interval [start, end)

template<typename ValueType >
void IntervalMaxArray< ValueType >::initialize ( SizeType  size) [inline]
template<typename ValueType >
void IntervalMaxArray< ValueType >::set ( SizeType  start,
SizeType  end,
ValueType  value 
) [inline]

sets value on whole interval [start, end)

template<typename ValueType >
void IntervalMaxArray< ValueType >::update ( SizeType  start,
SizeType  end,
ValueType  value 
) [inline]

update interval with new max [start, end)


Member Data Documentation

template<typename ValueType >
std::vector<ValueType> IntervalMaxArray< ValueType >::data [private]

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