18#ifndef __LIBSTD_ARRAY_H
19#define __LIBSTD_ARRAY_H
57 for (
Size i = 0; i < N; i++)
91 virtual const T *
get(
Size position)
const
110 virtual const T &
at(
Size position)
const
This is a wrapper class for a fixed size array.
virtual Size size() const
Returns the maximum size of this Array.
virtual const T * get(Size position) const
Returns the item at the given position.
T m_array[N]
The actual array where the data is stored.
virtual const T & at(Size position) const
Returns a reference to the item at the given position.
virtual Size count() const
Returns the number of items in the Array.
Array(const Array< T, N > &a)
Copy constructor.
virtual const T value(Size position) const
Return value at the given position.
Array()
Default constructor.
virtual bool insert(Size position, const T &item)
Puts the given item at the given position.
Sequences are containers that provide indexed based storage of items.
unsigned int Size
Any sane size indicator cannot go negative.