![]() |
AmpGen 2.1
|
Can only be navigated using quasi foward-iterators. Designed such that very large sets can be operated on if only some value from the set is required at the end of the computation, for example, for computing large sets of multidimensional integral is is more efficient to tranch the computation onto blocks of events.
Definition at line 19 of file DynamicContainer.h.
Classes | |
class | Iterator |
Public Member Functions | |
template<class GENERATOR> | |
DynamicContainer (const size_t &totalSize, const GENERATOR &generator) | |
Iterator | begin () |
Iterator | end () |
const size_t & | size () const |
TYPE & | operator[] (const size_t &pos) |
const TYPE & | operator[] (const size_t &pos) const |
void | refresh () |
CONTAINER_TYPE & | buffer () |
|
inline |
Definition at line 54 of file DynamicContainer.h.
|
inline |
Definition at line 59 of file DynamicContainer.h.
|
inline |
Definition at line 69 of file DynamicContainer.h.
|
inline |
Definition at line 60 of file DynamicContainer.h.
|
inline |
Definition at line 62 of file DynamicContainer.h.
|
inline |
Definition at line 63 of file DynamicContainer.h.
|
inline |
Definition at line 64 of file DynamicContainer.h.
|
inline |
Definition at line 61 of file DynamicContainer.h.