#include <rutz/arrays.h>


Public Types | |
| typedef T | value_type |
| STL value type. | |
| typedef T * | pointer |
| STL pointer type. | |
| typedef const T * | const_pointer |
| STL const pointer type. | |
| typedef T & | reference |
| STL reference type. | |
| typedef const T & | const_reference |
| STL const reference type. | |
| typedef pointer | iterator |
| STL iterator type. | |
| typedef const_pointer | const_iterator |
| STL const iterator type. | |
| typedef size_t | size_type |
| STL size type. | |
| typedef ptrdiff_t | difference_type |
| STL iterator difference type. | |
Public Member Functions | |
| fixed_block (size_type n) | |
| Construct with a given size. | |
| ~fixed_block () | |
| Destructor. | |
| template<class Itr> | |
| fixed_block (Itr itr, Itr end) | |
| Construct by copying from a given iterator range. | |
| iterator | begin () |
| Iterator to array start. | |
| iterator | end () |
| Iterator to array one-past-the-end. | |
| const_iterator | begin () const |
| Const iterator to array start. | |
| const_iterator | end () const |
| Const iterator to array one-past-the-end. | |
| reference | operator[] (size_type n) |
| Unchecked non-const array index. | |
| const_reference | operator[] (size_type n) const |
| Unchecked const array index. | |
| reference | at (size_type n) |
| Checked non-const array index (rutz::out_of_range thrown on bounds error). | |
| const_reference | at (size_type n) const |
| Checked const array index (rutz::out_of_range thrown on bounds error). | |
| size_type | size () const |
| Size of array. | |
| size_type | max_size () const |
| Maximum size of array type. | |
| bool | is_empty () const |
| Query whether size is zero. | |
| void | swap (fixed_block &other) |
| Swap with another fixed_block. | |
Copying and assignment are not allowed.
Definition at line 157 of file arrays.h.
| void rutz::fixed_block< T >::swap | ( | fixed_block< T > & | other | ) | [inline] |
Swap with another fixed_block.
This is fast since it only requires swapping the interal pointers to the dynamically-allocated arrays; no element-wise swap is needed.