![]() |
|
Typedefs | |
using | iterator = ElementType * |
Iterator type. More... | |
using | const_iterator = ElementType const * |
Const iterator type. More... | |
typedef boost::reverse_iterator< iterator > | reverse_iterator |
Reverse iterator type. More... | |
typedef boost::reverse_iterator< const_iterator > | const_reverse_iterator |
Reverse const iterator type. More... | |
typedef ElementType & | reference |
Reference type. More... | |
typedef ElementType const & | const_reference |
Const reference type. More... | |
typedef ElementType * | pointer |
Pointer type. More... | |
typedef ElementType const * | const_pointer |
Const pointer type. More... | |
Functions | |
iterator | begin () |
Return a non-const iterator to the start of the array. More... | |
iterator | end () |
Returns a non-const iterator to the end of the array. More... | |
const_iterator | begin () const |
Return a const iterator to the start of the array. More... | |
const_iterator | end () const |
Return a const iterator to the end of the array. More... | |
const_iterator | cbegin () const |
Return a const iterator to the start of the array. More... | |
const_iterator | cend () const |
Return a const iterator to the end of the array. More... | |
reverse_iterator | rbegin () |
Return a non-const reverse iterator to the end of the array. More... | |
reverse_iterator | rend () |
Return a reverse iterator to the start of the array. More... | |
const_reverse_iterator | rbegin () const |
Return a const reverse iterator to the end of the array. More... | |
const_reverse_iterator | rend () const |
Return a const reverse iterator to the start of the array. More... | |
const_reverse_iterator | crbegin () const |
Return a const reverse iterator to the end of the array. More... | |
const_reverse_iterator | crend () const |
Return a const reverse iterator to the start of the array. More... | |
pointer | data () |
Return a non-const pointer to this array's data. More... | |
const_pointer | data () const |
Return a const pointer to this array's data. More... | |
const_pointer | cdata () const |
Return a const pointer to the data held by this array. More... | |
template<typename... Args> | |
void | emplace_back (Args &&... args) |
Initializes a new element at the end of the array. More... | |
void | push_back (ElementType const &element) |
Appends an element at the end of the array. More... | |
void | push_back (ElementType &&element) |
Appends an element at the end of the array. More... | |
void | pop_back () |
Remove the last element of an array. More... | |
size_t | size () const |
Return the total number of elements in this array. More... | |
size_t | capacity () const |
Return the number of items this container can grow to hold without triggering a (re)allocation. More... | |
constexpr size_t | max_size () const |
Return a theoretical maximum size limit for the container. More... | |
bool | empty () const |
Return true if this array contains no elements, false otherwise. More... | |
void | reserve (size_t num) |
Ensure enough memory is allocated to hold num elements. More... | |
reference | front () |
Return a non-const reference to the first element in this array. More... | |
const_reference | front () const |
Return a const reference to the first element in this array. More... | |
const_reference | cfront () const |
Return a const reference to the first element in this array. More... | |
reference | back () |
Return a reference to the last element in this array. More... | |
const_reference | back () const |
Return a const reference to the last element in this array. More... | |
const_reference | cback () const |
Return a const reference to the last element in this array. More... | |
void | resize (size_t newSize) |
Resize this array. More... | |
template<class FillElemsFn > | |
void | resize (size_t newSize, FillElemsFn &&fillElems) |
Resize this array. More... | |
void | clear () |
Equivalent to resize(0). More... | |
iterator | erase (const_iterator pos) |
Removes a single element at pos from the array. More... | |
iterator | erase (const_iterator first, const_iterator last) |
Remove a range of elements [first , last ) from the array. More... | |
template<class ForwardIter > | |
std::enable_if<!std::is_integral< ForwardIter >::value >::type | assign (ForwardIter first, ForwardIter last) |
Assign array contents. More... | |
void | assign (size_t n, const value_type &fill) |
Assign array contents. More... | |
void | assign (std::initializer_list< ELEM > initializerList) |
Assign array contents via intializer list Equivalent to: More... | |
void | swap (VtArray &other) |
Swap the contents of this array with other . More... | |
using const_iterator = ElementType const * |
typedef ElementType const* const_pointer |
typedef ElementType const& const_reference |
typedef boost::reverse_iterator<const_iterator> const_reverse_iterator |
using iterator = ElementType * |
typedef ElementType* pointer |
typedef ElementType& reference |
typedef boost::reverse_iterator<iterator> reverse_iterator |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
Initializes a new element at the end of the array.
The underlying data is first copied if it is not uniquely owned.
|
inline |
|
inline |
|
inline |
|
inline |
Removes a single element at pos
from the array.
To match the behavior of std::vector, returns an iterator pointing to the position following the removed element.
Since the returned iterator is mutable, when the array is not uniquely owned, a copy will be required.
Erase invalidates all iterators (unlike std::vector where iterators prior to pos
remain valid).
|
inline |
Remove a range of elements [first
, last
) from the array.
To match the behavior of std::vector, returns an iterator at the position following the removed element. If no elements are removed, a non-const iterator pointing to last will be returned.
Since the returned iterator is mutable, when the array is not uniquely owned, a copy will be required even when the contents are unchanged.
Erase invalidates all iterators (unlike std::vector where iterators prior to first
remain valid).
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
Appends an element at the end of the array.
The underlying data is first copied if it is not uniquely owned.
|
inline |
Appends an element at the end of the array.
The underlying data is first copied if it is not uniquely owned.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
Resize this array.
Preserve existing elements that remain, value-initialize any newly added elements. For example, calling resize(10) on an array of size 5 would change the size to 10, the first 5 elements would be left unchanged and the last 5 elements would be value-initialized.
|
inline |
Resize this array.
Preserve existing elements that remain, initialize any newly added elements by calling fillElems(first, last)
. Note that this function is passed pointers to uninitialized memory, so the elements must be filled with something like placement-new.
|
inline |