A fixed size vector backed by an array. The container inherits the properties of a fixed size array of type T. The container keeps all N elements alive until its lifetime ends, even if elements are popped/removed from the vector. It is guaranteed that no dynamic memory allocation takes place.
More...
#include <TArrayVector.h>
|
| | TArrayVector () |
| |
| template<typename U > |
| void | pushBack (U &&item) |
| | Add an item to the back of the vector. The item originally at the target index will be overwritten.
|
| |
| void | popBack () |
| | Removes an item from the back of the vector. The item originally at the target index is still alive after this call.
|
| |
| T & | front () |
| |
| const T & | front () const |
| |
| T & | back () |
| |
| const T & | back () const |
| |
| std::size_t | size () const |
| |
| void | clear () |
| |
| bool | isEmpty () const |
| |
| bool | isFull () const |
| |
| T * | get (std::size_t index) |
| |
| const T * | get (std::size_t index) const |
| |
| T & | operator[] (std::size_t index) |
| |
| const T & | operator[] (std::size_t index) const |
| |
|
Iterators for stored objects.
|
| std::array< T, N >::iterator | begin () noexcept |
| |
| std::array< T, N >::const_iterator | begin () const noexcept |
| |
| std::array< T, N >::iterator | end () noexcept |
| |
| std::array< T, N >::const_iterator | end () const noexcept |
| |
template<typename T, std::size_t N>
class ph::TArrayVector< T, N >
A fixed size vector backed by an array. The container inherits the properties of a fixed size array of type T. The container keeps all N elements alive until its lifetime ends, even if elements are popped/removed from the vector. It is guaranteed that no dynamic memory allocation takes place.
◆ TArrayVector()
template<typename T , std::size_t N>
◆ back() [1/2]
template<typename T , std::size_t N>
◆ back() [2/2]
template<typename T , std::size_t N>
◆ begin() [1/2]
template<typename T , std::size_t N>
◆ begin() [2/2]
template<typename T , std::size_t N>
◆ clear()
template<typename T , std::size_t N>
◆ end() [1/2]
template<typename T , std::size_t N>
◆ end() [2/2]
template<typename T , std::size_t N>
◆ front() [1/2]
template<typename T , std::size_t N>
◆ front() [2/2]
template<typename T , std::size_t N>
◆ get() [1/2]
template<typename T , std::size_t N>
◆ get() [2/2]
template<typename T , std::size_t N>
◆ isEmpty()
template<typename T , std::size_t N>
◆ isFull()
template<typename T , std::size_t N>
◆ operator[]() [1/2]
template<typename T , std::size_t N>
◆ operator[]() [2/2]
template<typename T , std::size_t N>
◆ popBack()
template<typename T , std::size_t N>
Removes an item from the back of the vector. The item originally at the target index is still alive after this call.
◆ pushBack()
template<typename T , std::size_t N>
template<typename U >
Add an item to the back of the vector. The item originally at the target index will be overwritten.
◆ size()
template<typename T , std::size_t N>
The documentation for this class was generated from the following files: