cartobase
5.0.5
|
This array class extends the STL. More...
#include <cartobase/containers/block.h>
Public Types | |
typedef T | value_type |
typedef value_type * | pointer |
typedef const value_type * | const_pointer |
typedef value_type & | reference |
typedef const value_type & | const_reference |
typedef ptrdiff_t | difference_type |
typedef size_t | size_type |
typedef pointer | iterator |
typedef const_pointer | const_iterator |
typedef std::reverse_iterator< iterator > | reverse_iterator |
typedef std::reverse_iterator< const_iterator > | const_reverse_iterator |
Public Member Functions | |
reference | operator[] (size_t d) |
const_reference | operator[] (size_t d) const |
iterator | begin () |
iterator | end () |
const_iterator | begin () const |
const_iterator | end () const |
reverse_iterator | rbegin () |
reverse_iterator | rend () |
const_reverse_iterator | rbegin () const |
const_reverse_iterator | rend () const |
size_type | size () const |
size_type | max_size () const |
bool | empty () const |
Public Attributes | |
T | data [N] |
This array class extends the STL.
It is defined in http://www2.awl.com/cseng/titles/0-201-30956-4/ Generic Programming and the STL, pp. 60-67. See also http://www2.awl.com/cseng/titles/0-201-88954-4/ The C++ Programming Language, 3rd edition, pp. 496-497, for a similar class named c_array
.
This container class works like a std::vector (STL) but with a fixed size in order to provide a fast and efficient allocation. So it has iterators and begin() / end() methods, but no push_back() / insert() functions.
typedef const_pointer carto::block< T, N >::const_iterator |
typedef const value_type* carto::block< T, N >::const_pointer |
typedef const value_type& carto::block< T, N >::const_reference |
typedef std::reverse_iterator< const_iterator > carto::block< T, N >::const_reverse_iterator |
typedef ptrdiff_t carto::block< T, N >::difference_type |
typedef pointer carto::block< T, N >::iterator |
typedef value_type* carto::block< T, N >::pointer |
typedef value_type& carto::block< T, N >::reference |
typedef std::reverse_iterator< iterator > carto::block< T, N >::reverse_iterator |
typedef size_t carto::block< T, N >::size_type |
typedef T carto::block< T, N >::value_type |
|
inline |
Definition at line 139 of file block.h.
References carto::block< T, N >::data.
Referenced by carto::block< T, N >::rend().
|
inline |
Definition at line 160 of file block.h.
References carto::block< T, N >::data.
|
inline |
|
inline |
Definition at line 149 of file block.h.
References carto::block< T, N >::data.
Referenced by carto::block< T, N >::rbegin().
|
inline |
Definition at line 170 of file block.h.
References carto::block< T, N >::data.
|
inline |
|
inline |
Definition at line 116 of file block.h.
References carto::block< T, N >::data.
|
inline |
Definition at line 128 of file block.h.
References carto::block< T, N >::data.
|
inline |
Definition at line 180 of file block.h.
References carto::block< T, N >::end().
|
inline |
Definition at line 201 of file block.h.
References carto::block< T, N >::end().
|
inline |
Definition at line 190 of file block.h.
References carto::block< T, N >::begin().
|
inline |
Definition at line 212 of file block.h.
References carto::block< T, N >::begin().
|
inline |
T carto::block< T, N >::data[N] |
Definition at line 105 of file block.h.
Referenced by carto::block< T, N >::begin(), carto::block< T, N >::end(), operator==(), and carto::block< T, N >::operator[]().