|
iterator | begin () |
| Return a non-const iterator to the start of the array.
|
|
iterator | end () |
| Returns a non-const iterator to the end of the array.
|
|
const_iterator | begin () const |
| Return a const iterator to the start of the array.
|
|
const_iterator | end () const |
| Return a const iterator to the end of the array.
|
|
const_iterator | cbegin () const |
| Return a const iterator to the start of the array.
|
|
const_iterator | cend () const |
| Return a const iterator to the end of the array.
|
|
reverse_iterator | rbegin () |
| Return a non-const reverse iterator to the end of the array.
|
|
reverse_iterator | rend () |
| Return a reverse iterator to the start of the array.
|
|
const_reverse_iterator | rbegin () const |
| Return a const reverse iterator to the end of the array.
|
|
const_reverse_iterator | rend () const |
| Return a const reverse iterator to the start of the array.
|
|
const_reverse_iterator | crbegin () const |
| Return a const reverse iterator to the end of the array.
|
|
const_reverse_iterator | crend () const |
| Return a const reverse iterator to the start of the array.
|
|
pointer | data () |
| Return a non-const pointer to this array's data.
|
|
const_pointer | data () const |
| Return a const pointer to this array's data.
|
|
const_pointer | cdata () const |
| Return a const pointer to the data held by this array.
|
|
template<typename... Args> |
void | emplace_back (Args &&... args) |
| Initializes a new element at the end of the array.
|
|
void | push_back (ElementType const &element) |
| Appends an element at the end of the array.
|
|
void | push_back (ElementType &&element) |
| Appends an element at the end of the array.
|
|
void | pop_back () |
| Remove the last element of an array.
|
|
size_t | size () const |
| Return the total number of elements in this array.
|
|
size_t | capacity () const |
| Return the number of items this container can grow to hold without triggering a (re)allocation.
|
|
constexpr size_t | max_size () const |
| Return a theoretical maximum size limit for the container.
|
|
bool | empty () const |
| Return true if this array contains no elements, false otherwise.
|
|
void | reserve (size_t num) |
| Ensure enough memory is allocated to hold num elements.
|
|
reference | front () |
| Return a non-const reference to the first element in this array.
|
|
const_reference | front () const |
| Return a const reference to the first element in this array.
|
|
const_reference | cfront () const |
| Return a const reference to the first element in this array.
|
|
reference | back () |
| Return a reference to the last element in this array.
|
|
const_reference | back () const |
| Return a const reference to the last element in this array.
|
|
const_reference | cback () const |
| Return a const reference to the last element in this array.
|
|
void | resize (size_t newSize) |
| Resize this array.
|
|
void | resize (size_t newSize, value_type const &value) |
| Resize this array.
|
|
void | resize (size_t newSize, value_type &value) |
| Resize this array.
|
|
void | resize (size_t newSize, value_type &&value) |
| Resize this array.
|
|
template<class FillElemsFn > |
void | resize (size_t newSize, FillElemsFn &&fillElems) |
| Resize this array.
|
|
void | clear () |
| Equivalent to resize(0).
|
|
iterator | erase (const_iterator pos) |
| Removes a single element at pos from the array.
|
|
iterator | erase (const_iterator first, const_iterator last) |
| Remove a range of elements [first , last ) from the array.
|
|
template<class ForwardIter > |
std::enable_if<!std::is_integral< ForwardIter >::value >::type | assign (ForwardIter first, ForwardIter last) |
| Assign array contents.
|
|
void | assign (size_t n, const value_type &fill) |
| Assign array contents.
|
|
void | assign (std::initializer_list< ELEM > initializerList) |
| Assign array contents via intializer list Equivalent to:
|
|
void | swap (VtArray &other) |
| Swap the contents of this array with other .
|
|
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).
- See also
- erase(const_iterator)
Definition at line 690 of file array.h.
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).
- See also
- erase(const_iterator, const_iterator)
Definition at line 670 of file array.h.