This is a 'vector' (really, a variable-sized array), optimized for the case when the array is small.
More...
|
| SmallVector () |
|
| ~SmallVector () |
|
| SmallVector (size_t Size, const T &Value=T()) |
|
template<typename ItTy , typename = typename std::enable_if<std::is_convertible< typename std::iterator_traits<ItTy>::iterator_category, std::input_iterator_tag>::value>::type> |
| SmallVector (ItTy S, ItTy E) |
|
template<typename RangeTy > |
| SmallVector (const iterator_range< RangeTy > &R) |
|
| SmallVector (std::initializer_list< T > IL) |
|
| SmallVector (const SmallVector &RHS) |
|
const SmallVector & | operator= (const SmallVector &RHS) |
|
| SmallVector (SmallVector &&RHS) |
|
| SmallVector (SmallVectorImpl< T > &&RHS) |
|
const SmallVector & | operator= (SmallVector &&RHS) |
|
const SmallVector & | operator= (SmallVectorImpl< T > &&RHS) |
|
const SmallVector & | operator= (std::initializer_list< T > IL) |
|
| SmallVectorImpl (const SmallVectorImpl &)=delete |
|
| ~SmallVectorImpl () |
|
void | clear () |
|
void | resize (size_type N) |
|
void | resize (size_type N, const T &NV) |
|
void | reserve (size_type N) |
|
LLVM_NODISCARD T | pop_back_val () |
|
void | swap (SmallVectorImpl &RHS) |
|
template<typename in_iter , typename = typename std::enable_if<std::is_convertible< typename std::iterator_traits<in_iter>::iterator_category, std::input_iterator_tag>::value>::type> |
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) |
|
template<typename in_iter , typename = typename std::enable_if<std::is_convertible< typename std::iterator_traits<in_iter>::iterator_category, std::input_iterator_tag>::value>::type> |
void | assign (in_iter in_start, in_iter in_end) |
|
void | assign (std::initializer_list< T > IL) |
|
iterator | erase (const_iterator CI) |
|
iterator | erase (const_iterator CS, const_iterator CE) |
|
iterator | insert (iterator I, T &&Elt) |
|
iterator | insert (iterator I, const T &Elt) |
|
iterator | insert (iterator I, size_type NumToInsert, const T &Elt) |
|
template<typename ItTy , typename = typename std::enable_if<std::is_convertible< typename std::iterator_traits<ItTy>::iterator_category, std::input_iterator_tag>::value>::type> |
iterator | insert (iterator I, ItTy From, ItTy To) |
|
void | insert (iterator I, std::initializer_list< T > IL) |
|
template<typename... ArgTypes> |
void | emplace_back (ArgTypes &&... Args) |
|
SmallVectorImpl & | operator= (const SmallVectorImpl &RHS) |
|
SmallVectorImpl & | operator= (SmallVectorImpl &&RHS) |
|
bool | operator== (const SmallVectorImpl &RHS) const |
|
bool | operator!= (const SmallVectorImpl &RHS) const |
|
bool | operator< (const SmallVectorImpl &RHS) const |
|
void | push_back (const T &Elt) |
|
void | push_back (T &&Elt) |
|
void | pop_back () |
|
LLVM_ATTRIBUTE_ALWAYS_INLINE iterator | begin () |
|
LLVM_ATTRIBUTE_ALWAYS_INLINE const_iterator | begin () const |
|
LLVM_ATTRIBUTE_ALWAYS_INLINE iterator | end () |
|
LLVM_ATTRIBUTE_ALWAYS_INLINE const_iterator | end () const |
|
reverse_iterator | rbegin () |
|
const_reverse_iterator | rbegin () const |
|
reverse_iterator | rend () |
|
const_reverse_iterator | rend () const |
|
size_type | size_in_bytes () const |
|
size_type | max_size () const |
|
size_t | capacity_in_bytes () const |
|
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_ATTRIBUTE_ALWAYS_INLINE reference | operator[] (size_type idx) |
|
LLVM_ATTRIBUTE_ALWAYS_INLINE const_reference | operator[] (size_type idx) const |
|
reference | front () |
|
const_reference | front () const |
|
reference | back () |
|
const_reference | back () const |
|
size_t | size () const |
|
size_t | capacity () const |
|
LLVM_NODISCARD bool | empty () const |
|
void | set_size (size_t Size) |
| Set the array size to N , which the current array must have enough capacity for. More...
|
|
|
using | iterator = typename SuperClass::iterator |
|
using | const_iterator = typename SuperClass::const_iterator |
|
using | size_type = typename SuperClass::size_type |
|
using | size_type = size_t |
|
using | difference_type = ptrdiff_t |
|
using | value_type = T |
|
using | iterator = T * |
|
using | const_iterator = const T * |
|
using | const_reverse_iterator = std::reverse_iterator< const_iterator > |
|
using | reverse_iterator = std::reverse_iterator< iterator > |
|
using | reference = T & |
|
using | const_reference = const T & |
|
using | pointer = T * |
|
using | const_pointer = const T * |
|
| SmallVectorImpl (unsigned N) |
|
| SmallVectorTemplateBase (size_t Size) |
|
void | grow (size_t MinSize=0) |
| Grow the allocated memory (without initializing new elements), doubling the size of the allocated memory. More...
|
|
| SmallVectorTemplateCommon (size_t Size) |
|
void | grow_pod (size_t MinCapacity, size_t TSize) |
|
bool | isSmall () const |
| Return true if this is a smallvector which has not had dynamic memory allocated for it. More...
|
|
void | resetToSmall () |
| Put this vector in a state of being small. More...
|
|
| SmallVectorBase ()=delete |
|
| SmallVectorBase (void *FirstEl, size_t Capacity) |
|
void | grow_pod (void *FirstEl, size_t MinCapacity, size_t TSize) |
| This is an implementation of the grow() method which only works on POD-like data types and is out of line to reduce code duplication. More...
|
|
static void | destroy_range (T *S, T *E) |
|
static void | uninitialized_move (It1 I, It1 E, It2 Dest) |
| Move the range [I, E) into the uninitialized memory starting with "Dest", constructing elements as needed. More...
|
|
static void | uninitialized_copy (It1 I, It1 E, It2 Dest) |
| Copy the range [I, E) onto the uninitialized memory starting with "Dest", constructing elements as needed. More...
|
|
void * | BeginX |
|
unsigned | Size = 0 |
|
unsigned | Capacity |
|
template<typename T, unsigned N>
class llvm::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 847 of file SmallVector.h.