LLVM API Documentation
#include <SmallVector.h>
Inherits llvm::SmallVectorImpl< T >.
Public Member Functions | |
SmallVector () | |
SmallVector (unsigned Size, const T &Value=T()) | |
template<typename ItTy > | |
SmallVector (ItTy S, ItTy E) | |
SmallVector (const SmallVector &RHS) | |
const SmallVector & | operator= (const SmallVector &RHS) |
![]() | |
~SmallVectorImpl () | |
void | clear () |
void | resize (unsigned N) |
void | resize (unsigned N, const T &NV) |
void | reserve (unsigned N) |
T LLVM_ATTRIBUTE_UNUSED_RESULT | pop_back_val () |
void | swap (SmallVectorImpl &RHS) |
template<typename in_iter > | |
void | append (in_iter in_start, in_iter in_end) |
void | append (size_type NumInputs, const T &Elt) |
void | assign (unsigned NumElts, const T &Elt) |
iterator | erase (iterator I) |
iterator | erase (iterator S, iterator E) |
iterator | insert (iterator I, const T &Elt) |
iterator | insert (iterator I, size_type NumToInsert, const T &Elt) |
template<typename ItTy > | |
iterator | insert (iterator I, ItTy From, ItTy To) |
SmallVectorImpl & | operator= (const SmallVectorImpl &RHS) |
bool | operator== (const SmallVectorImpl &RHS) const |
bool | operator!= (const SmallVectorImpl &RHS) const |
bool | operator< (const SmallVectorImpl &RHS) const |
void | set_size (unsigned N) |
![]() | |
void | push_back (const T &Elt) |
void | pop_back () |
![]() | |
iterator | begin () |
const_iterator | begin () const |
iterator | end () |
const_iterator | end () const |
reverse_iterator | rbegin () |
const_reverse_iterator | rbegin () const |
reverse_iterator | rend () |
const_reverse_iterator | rend () const |
size_type | size () const |
size_type | max_size () const |
size_t | capacity () const |
pointer | data () |
data - Return a pointer to the vector's buffer, even if empty(). More... | |
const_pointer | data () const |
data - Return a pointer to the vector's buffer, even if empty(). More... | |
reference | operator[] (unsigned idx) |
const_reference | operator[] (unsigned idx) const |
reference | front () |
const_reference | front () const |
reference | back () |
const_reference | back () const |
![]() | |
size_t | size_in_bytes () const |
size_in_bytes - This returns size()*sizeof(T). More... | |
size_t | capacity_in_bytes () const |
capacity_in_bytes - This returns capacity()*sizeof(T). More... | |
bool LLVM_ATTRIBUTE_UNUSED_RESULT | empty () const |
Additional Inherited Members | |
![]() | |
typedef SuperClass::iterator | iterator |
typedef SuperClass::size_type | size_type |
![]() | |
typedef size_t | size_type |
typedef ptrdiff_t | difference_type |
typedef T | value_type |
typedef T * | iterator |
typedef const T * | const_iterator |
typedef std::reverse_iterator < const_iterator > | const_reverse_iterator |
typedef std::reverse_iterator < iterator > | reverse_iterator |
typedef T & | reference |
typedef const T & | const_reference |
typedef T * | pointer |
typedef const T * | const_pointer |
![]() | |
SmallVectorImpl (unsigned N) | |
![]() | |
SmallVectorTemplateBase (size_t Size) | |
void | grow (size_t MinSize=0) |
![]() | |
SmallVectorTemplateCommon (size_t Size) | |
void | grow_pod (size_t MinSizeInBytes, size_t TSize) |
bool | isSmall () const |
void | resetToSmall () |
resetToSmall - Put this vector in a state of being small. More... | |
void | setEnd (T *P) |
iterator | capacity_ptr () |
const_iterator | capacity_ptr () const |
![]() | |
SmallVectorBase (void *FirstEl, size_t Size) | |
void | grow_pod (void *FirstEl, size_t MinSizeInBytes, size_t TSize) |
![]() | |
static void | destroy_range (T *S, T *E) |
static It2 | move (It1 I, It1 E, It2 Dest) |
static It2 | move_backward (It1 I, It1 E, It2 Dest) |
static void | uninitialized_move (It1 I, It1 E, It2 Dest) |
static void | uninitialized_copy (It1 I, It1 E, It2 Dest) |
![]() | |
void * | BeginX |
void * | EndX |
void * | CapacityX |
SmallVector - 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 880 of file SmallVector.h.
|
inline |
Definition at line 884 of file SmallVector.h.
|
inlineexplicit |
Definition at line 887 of file SmallVector.h.
|
inline |
Definition at line 893 of file SmallVector.h.
|
inline |
Definition at line 897 of file SmallVector.h.
|
inline |
Definition at line 902 of file SmallVector.h.