Vector with stack storage.
TODO: this is far from good (but it works for me TM)
Public Member Functions | |
constexpr size_type | size () const noexcept |
Size of the vector. | |
constexpr bool | empty () const noexcept |
Is the vector empty? | |
constexpr size_type | max_size () const noexcept |
Maximum number of elements that can be allocated in the vector. More... | |
constexpr size_type | capacity () const noexcept |
Maximum number of elements that can be allocated in the vector. | |
constexpr T * | data () noexcept |
Pointer to the vector's data. | |
constexpr const T * | data () const noexcept |
Pointer to the vector's data. | |
constexpr iterator | begin () noexcept |
Begin iterator. | |
constexpr const_iterator | begin () const noexcept |
Begin iterator. | |
constexpr const_iterator | cbegin () const noexcept |
Begin const iterator. | |
constexpr iterator | end () noexcept |
End iterator. | |
constexpr const_iterator | end () const noexcept |
End iterator. | |
constexpr const_iterator | cend () const noexcept |
End const iterator. | |
|
noexcept |
Maximum number of elements that can be allocated in the vector.
Note: just to be compatible with std::vector
References ndtree::v1::stack_vector< T, capacity_ >::capacity().