|
const SmallVector & | operator= (const SmallVector &RHS) |
|
const SmallVector & | operator= (SmallVector &&RHS) |
|
const SmallVector & | operator= (SmallVectorImpl< T > &&RHS) |
|
const SmallVector & | operator= (std::initializer_list< T > IL) |
|
| SmallVector () |
|
| SmallVector (const SmallVector &RHS) |
|
template<typename ItTy > |
| SmallVector (ItTy S, ItTy E) |
|
| SmallVector (size_t Size, const T &Value=T()) |
|
| SmallVector (SmallVector &&RHS) |
|
| SmallVector (SmallVectorImpl< T > &&RHS) |
|
| SmallVector (std::initializer_list< T > IL) |
|
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, unsigned N>
class llvm_vecsmall::SmallVector< T, N >
This is a 'vector' (really, a variable-sized array), optimized for the case when the array is small. It contains some number of elements in-place, which allows it to avoid heap allocation when the actual number of elements is below that threshold. This allows normal "small" cases to be fast without losing generality for large inputs.
Note that this does not attempt to be exception safe.
Definition at line 1029 of file SmallVector.h.