Fixed-sized vector. More...
Inheritance diagram for dueca::fixvector< N, T >:
Public Types | |
| typedef T | value_type |
| Type of the contained object. | |
| typedef T * | pointer |
| Type of a pointer to the contained object. | |
| typedef T & | reference |
| Type of a reference to the contained object. | |
| typedef const T & | const_reference |
| Type of a reference to the contained object. | |
| typedef const T * | const_pointer |
| Type of a pointer to the contained object. | |
| typedef pointer | iterator |
| Define the iterator type. | |
| typedef const_pointer | const_iterator |
| Define the const iterator type. | |
| typedef ::std::reverse_iterator< const_iterator > | const_reverse_iterator |
| Define the reverse const iterator type. | |
| typedef ::std::reverse_iterator< iterator > | reverse_iterator |
| Define the reverse iterator type. | |
| typedef ::std::random_access_iterator_tag | iterator_category |
| Show random access is possible. | |
| typedef ::size_t | size_type |
| Size of the underlying thing. | |
| typedef ::std::ptrdiff_t | difference_type |
| Pointer difference. | |
Public Member Functions | |
| fixvector (const T &defval) | |
| constructor with default value for the data More... | |
| fixvector (const std::initializer_list< T > &e) | |
| constructor with initializer list | |
| fixvector () | |
| constructor without default value for the data | |
| fixvector (const fixvector< N, T > &other) | |
| copy constructor; copies the data | |
| template<class InputIt > | |
| fixvector (InputIt first, InputIt last) | |
| construct from iterators | |
| ~fixvector () | |
| destructor | |
| operator pointer (void) | |
| obtain a pointer directly to the data | |
| operator const_pointer (void) const | |
| obtain a const pointer directly to the data | |
| iterator | begin () |
| more-or-less stl-compatible iterator | |
| iterator | end () |
| more-or-less stl-compatible iterator | |
| const_iterator | begin () const |
| more-or-less stl-compatible iterator | |
| const_iterator | end () const |
| more-or-less stl-compatible iterator | |
| size_t | size () const |
| size of the vector | |
| fixvector< N, T > & | operator= (const fixvector< N, T > &other) |
| assignment operator | |
| fixvector< N, T > & | operator= (const T &val) |
| assignment operator, to value type | |
| bool | operator== (const fixvector< N, T > &other) const |
| equality test | |
| bool | operator!= (const fixvector< N, T > &other) const |
| inequality test | |
| template<typename idx_t > | |
| const T & | operator[] (idx_t ii) const |
| access elements of the vector. More... | |
| template<typename idx_t > | |
| T & | operator[] (idx_t ii) |
| access elements of the vector. More... | |
| void | resize (size_t s) |
| forced resize of the vector, is seldom possible, so may throw | |
| const T * | ptr () const |
| access as const pointer | |
| T * | ptr () |
| access as pointer | |
| reference | front () |
| access first element | |
| const_reference | front () const |
| access first element | |
| reference | back () |
| access last element | |
| const_reference | back () const |
| access last element | |
Protected Attributes | |
| T | d [N] |
| Data space. | |
Detailed Description
template<size_t N, typename T>
class dueca::fixvector< N, T >
Fixed-sized vector.
Implementing most stl-like interfaces, but using a fixed vector length; efficiently packed in DCO objects.
Constructor & Destructor Documentation
◆ fixvector()
template<size_t N, typename T >
|
inline |
constructor with default value for the data
- Parameters
-
defval default fill value
Member Function Documentation
◆ operator[]() [1/2]
template<size_t N, typename T >
template<typename idx_t >
|
inline |
access elements of the vector.
Note that indexing is checked
◆ operator[]() [2/2]
template<size_t N, typename T >
template<typename idx_t >
|
inline |
access elements of the vector.
Note that indexing is checked
The documentation for this class was generated from the following file:
- /usr/src/packages/BUILD/dueca/fixvector.hxx