LatMRG Guide  1.0
A software package to test and search for new linear congruential random number generators
tinyxml2::DynArray< T, INITIAL_SIZE > Class Template Reference

#include <tinyxml2.h>

Public Member Functions

 DynArray ()
 
 ~DynArray ()
 
int Capacity () const
 
void Clear ()
 
bool Empty () const
 
const T * Mem () const
 
T * Mem ()
 
T & operator[] (int i)
 
const T & operator[] (int i) const
 
const T & PeekTop () const
 
Pop ()
 
void PopArr (int count)
 
void Push (T t)
 
T * PushArr (int count)
 
int Size () const
 
void SwapRemove (int i)
 

Private Member Functions

 DynArray (const DynArray &)
 
void EnsureCapacity (int cap)
 
void operator= (const DynArray &)
 

Private Attributes

int _allocated
 
T * _mem
 
_pool [INITIAL_SIZE]
 
int _size
 

Constructor & Destructor Documentation

◆ DynArray() [1/2]

template<class T, int INITIAL_SIZE>
tinyxml2::DynArray< T, INITIAL_SIZE >::DynArray ( )
inline

◆ ~DynArray()

template<class T, int INITIAL_SIZE>
tinyxml2::DynArray< T, INITIAL_SIZE >::~DynArray ( )
inline

◆ DynArray() [2/2]

template<class T, int INITIAL_SIZE>
tinyxml2::DynArray< T, INITIAL_SIZE >::DynArray ( const DynArray< T, INITIAL_SIZE > &  )
private

Member Function Documentation

◆ Capacity()

template<class T, int INITIAL_SIZE>
int tinyxml2::DynArray< T, INITIAL_SIZE >::Capacity ( ) const
inline

◆ Clear()

template<class T, int INITIAL_SIZE>
void tinyxml2::DynArray< T, INITIAL_SIZE >::Clear ( )
inline

◆ Empty()

template<class T, int INITIAL_SIZE>
bool tinyxml2::DynArray< T, INITIAL_SIZE >::Empty ( ) const
inline

◆ EnsureCapacity()

template<class T, int INITIAL_SIZE>
void tinyxml2::DynArray< T, INITIAL_SIZE >::EnsureCapacity ( int  cap)
inlineprivate

◆ Mem() [1/2]

template<class T, int INITIAL_SIZE>
const T* tinyxml2::DynArray< T, INITIAL_SIZE >::Mem ( ) const
inline

◆ Mem() [2/2]

template<class T, int INITIAL_SIZE>
T* tinyxml2::DynArray< T, INITIAL_SIZE >::Mem ( )
inline

◆ operator=()

template<class T, int INITIAL_SIZE>
void tinyxml2::DynArray< T, INITIAL_SIZE >::operator= ( const DynArray< T, INITIAL_SIZE > &  )
private

◆ operator[]() [1/2]

template<class T, int INITIAL_SIZE>
T& tinyxml2::DynArray< T, INITIAL_SIZE >::operator[] ( int  i)
inline

◆ operator[]() [2/2]

template<class T, int INITIAL_SIZE>
const T& tinyxml2::DynArray< T, INITIAL_SIZE >::operator[] ( int  i) const
inline

◆ PeekTop()

template<class T, int INITIAL_SIZE>
const T& tinyxml2::DynArray< T, INITIAL_SIZE >::PeekTop ( ) const
inline

◆ Pop()

template<class T, int INITIAL_SIZE>
T tinyxml2::DynArray< T, INITIAL_SIZE >::Pop ( )
inline

◆ PopArr()

template<class T, int INITIAL_SIZE>
void tinyxml2::DynArray< T, INITIAL_SIZE >::PopArr ( int  count)
inline

◆ Push()

template<class T, int INITIAL_SIZE>
void tinyxml2::DynArray< T, INITIAL_SIZE >::Push ( t)
inline

◆ PushArr()

template<class T, int INITIAL_SIZE>
T* tinyxml2::DynArray< T, INITIAL_SIZE >::PushArr ( int  count)
inline

◆ Size()

template<class T, int INITIAL_SIZE>
int tinyxml2::DynArray< T, INITIAL_SIZE >::Size ( ) const
inline

◆ SwapRemove()

template<class T, int INITIAL_SIZE>
void tinyxml2::DynArray< T, INITIAL_SIZE >::SwapRemove ( int  i)
inline

Member Data Documentation

◆ _allocated

template<class T, int INITIAL_SIZE>
int tinyxml2::DynArray< T, INITIAL_SIZE >::_allocated
private

◆ _mem

template<class T, int INITIAL_SIZE>
T* tinyxml2::DynArray< T, INITIAL_SIZE >::_mem
private

◆ _pool

template<class T, int INITIAL_SIZE>
T tinyxml2::DynArray< T, INITIAL_SIZE >::_pool[INITIAL_SIZE]
private

◆ _size

template<class T, int INITIAL_SIZE>
int tinyxml2::DynArray< T, INITIAL_SIZE >::_size
private

The documentation for this class was generated from the following file: