|
template<typename in_iter > |
void | append (in_iter in_start, in_iter in_end) |
| Add the specified range to the end of the SmallVector. More...
|
|
void | append (size_type NumInputs, const T &Elt) |
| Add the specified range to the end of the SmallVector. More...
|
|
void | append (std::initializer_list< T > IL) |
|
void | assign (size_type NumElts, const T &Elt) |
|
void | assign (std::initializer_list< T > IL) |
|
void | clear () |
|
template<typename... ArgTypes> |
void | emplace_back (ArgTypes &&... Args) |
|
iterator | erase (const_iterator CI) |
|
iterator | erase (const_iterator CS, const_iterator CE) |
|
iterator | insert (iterator I, const T &Elt) |
|
template<typename ItTy > |
iterator | insert (iterator I, ItTy From, ItTy To) |
|
iterator | insert (iterator I, size_type NumToInsert, const T &Elt) |
|
void | insert (iterator I, std::initializer_list< T > IL) |
|
iterator | insert (iterator I, T &&Elt) |
|
bool | operator!= (const SmallVectorImpl &RHS) const |
|
bool | operator< (const SmallVectorImpl &RHS) const |
|
SmallVectorImpl & | operator= (const SmallVectorImpl &RHS) |
|
SmallVectorImpl & | operator= (SmallVectorImpl &&RHS) |
|
bool | operator== (const SmallVectorImpl &RHS) const |
|
LLVM_VECSMALL_NODISCARD T | pop_back_val () |
|
void | reserve (size_type N) |
|
void | resize (size_type N) |
|
void | resize (size_type N, const T &NV) |
|
void | set_size (size_type N) |
|
void | swap (SmallVectorImpl &RHS) |
|
| ~SmallVectorImpl () |
|
void | pop_back () |
|
void | push_back (const T &Elt) |
|
void | push_back (T &&Elt) |
|
reference | back () |
|
const_reference | back () const |
|
LLVM_VECSMALL_ATTRIBUTE_ALWAYS_INLINE iterator | begin () |
|
LLVM_VECSMALL_ATTRIBUTE_ALWAYS_INLINE const_iterator | begin () const |
|
size_t | capacity () const |
| Return the total number of elements in the currently allocated buffer. More...
|
|
pointer | data () |
| Return a pointer to the vector's buffer, even if empty(). More...
|
|
const_pointer | data () const |
| Return a pointer to the vector's buffer, even if empty(). More...
|
|
LLVM_VECSMALL_ATTRIBUTE_ALWAYS_INLINE iterator | end () |
|
LLVM_VECSMALL_ATTRIBUTE_ALWAYS_INLINE const_iterator | end () const |
|
reference | front () |
|
const_reference | front () const |
|
size_type | max_size () const |
|
LLVM_VECSMALL_ATTRIBUTE_ALWAYS_INLINE reference | operator[] (size_type idx) |
|
LLVM_VECSMALL_ATTRIBUTE_ALWAYS_INLINE const_reference | operator[] (size_type idx) const |
|
reverse_iterator | rbegin () |
|
const_reverse_iterator | rbegin () const |
|
reverse_iterator | rend () |
|
const_reverse_iterator | rend () const |
|
LLVM_VECSMALL_ATTRIBUTE_ALWAYS_INLINE size_type | size () const |
|
size_t | capacity_in_bytes () const |
| capacity_in_bytes - This returns capacity()*sizeof(T). More...
|
|
LLVM_VECSMALL_NODISCARD bool | empty () const |
|
size_t | size_in_bytes () const |
| This returns size()*sizeof(T). More...
|
|
template<typename T>
class llvm_vecsmall::SmallVectorImpl< T >
This class consists of common code factored out of the SmallVector class to reduce code duplication based on the SmallVector 'N' template parameter.
Definition at line 439 of file SmallVector.h.
Set the array size to N
, which the current array must have enough capacity for.
This does not construct or destroy any elements in the vector.
Clients can use this in conjunction with capacity() to write past the end of the buffer when they know that more elements are available, and only update the size later. This avoids the cost of value initializing elements which will only be overwritten.
Definition at line 828 of file SmallVector.h.