Util::FixedArray< TYPE > Class Template Reference
#include <fixedarray.h>
Detailed Description
template<class TYPE>
class Util::FixedArray< TYPE >
Implements a fixed size one-dimensional array.(C) 2006 Radon Labs GmbH
Public Types | |
| typedef TYPE * | Iterator |
| define element iterator | |
Public Member Functions | |
| FixedArray () | |
| default constructor | |
| FixedArray (SizeT s) | |
| constructor with size | |
| FixedArray (SizeT s, const TYPE &initialValue) | |
| constructor with size and initial value | |
| FixedArray (const FixedArray< TYPE > &rhs) | |
| copy constructor | |
| ~FixedArray () | |
| destructor | |
| void | operator= (const FixedArray< TYPE > &rhs) |
| assignment operator | |
| TYPE & | operator[] (IndexT index) const |
| write [] operator | |
| bool | operator== (const FixedArray< TYPE > &rhs) const |
| equality operator | |
| bool | operator!= (const FixedArray< TYPE > &rhs) const |
| inequality operator | |
| void | SetSize (SizeT s) |
| set number of elements (clears existing content) | |
| SizeT | Size () const |
| get number of elements | |
| void | Clear (const TYPE &val) |
| clear the array with value | |
| void | Fill (IndexT first, SizeT num, const TYPE &val) |
| fill array range with element | |
| Iterator | Begin () const |
| get iterator to first element | |
| Iterator | End () const |
| get iterator past last element | |
| Iterator | Find (const TYPE &val) const |
| find identical element in unsorted array (slow) | |
| IndexT | FindIndex (const TYPE &val) const |
| find index of identical element in unsorted array (slow) | |
| void | Sort () |
| sort the array | |
| IndexT | BinarySearchIndex (const TYPE &val) const |
| do a binary search, requires a sorted array | |
Member Function Documentation
template<class TYPE>
| IndexT Util::FixedArray< TYPE >::BinarySearchIndex | ( | const TYPE & | elm | ) | const [inline] |