LLVM: llvm::SmallSetVector< T, N > Class Template Reference (original) (raw)
A SetVector that performs no allocations if smaller than a certain size. More...
#include "[llvm/ADT/SetVector.h](SetVector%5F8h%5Fsource.html)"
Public Member Functions | |
---|---|
SmallSetVector ()=default | |
template | |
SmallSetVector (It Start, It End) | |
Initialize a SmallSetVector with a range of elements. | |
![]() |
|
SetVector ()=default | |
Construct an empty SetVector. | |
SetVector (It Start, It End) | |
Initialize a SetVector with a range of elements. | |
ArrayRef< value_type > | getArrayRef () const |
SmallVector< T, N > | takeVector () |
Clear the SetVector and return the underlying vector. | |
bool | empty () const |
Determine if the SetVector is empty or not. | |
size_type | size () const |
Determine the number of elements in the SetVector. | |
iterator | begin () |
Get an iterator to the beginning of the SetVector. | |
const_iterator | begin () const |
Get a const_iterator to the beginning of the SetVector. | |
iterator | end () |
Get an iterator to the end of the SetVector. | |
const_iterator | end () const |
Get a const_iterator to the end of the SetVector. | |
reverse_iterator | rbegin () |
Get an reverse_iterator to the end of the SetVector. | |
const_reverse_iterator | rbegin () const |
Get a const_reverse_iterator to the end of the SetVector. | |
reverse_iterator | rend () |
Get a reverse_iterator to the beginning of the SetVector. | |
const_reverse_iterator | rend () const |
Get a const_reverse_iterator to the beginning of the SetVector. | |
const value_type & | front () const |
Return the first element of the SetVector. | |
const value_type & | back () const |
Return the last element of the SetVector. | |
const_reference | operator[] (size_type n) const |
Index into the SetVector. | |
bool | insert (const value_type &X) |
Insert a new element into the SetVector. | |
void | insert (It Start, It End) |
Insert a range of elements into the SetVector. | |
bool | remove (const value_type &X) |
Remove an item from the set vector. | |
iterator | erase (const_iterator I) |
Erase a single element from the set vector. | |
bool | remove_if (UnaryPredicate P) |
Remove items from the set vector based on a predicate function. | |
bool | contains (const key_type &key) const |
Check if the SetVector contains the given key. | |
size_type | count (const key_type &key) const |
Count the number of elements of a given key in the SetVector. | |
void | clear () |
Completely clear the SetVector. | |
void | pop_back () |
Remove the last element of the SetVector. | |
value_type | pop_back_val () |
bool | operator== (const SetVector &that) const |
bool | operator!= (const SetVector &that) const |
bool | set_union (const STy &S) |
Compute This := This u S, return whether 'This' changed. | |
void | set_subtract (const STy &S) |
Compute This := This - B TODO: We should be able to use set_subtract from SetOperations.h, but SetVector interface is inconsistent with DenseSet. | |
void | swap (SetVector< T, SmallVector< T, N >, DenseSet< T >, N > &RHS) |
Additional Inherited Members | |
---|---|
![]() |
|
using | value_type = typename Vector::value_type |
using | key_type = typename Set::key_type |
using | reference = value_type & |
using | const_reference = const value_type & |
using | set_type = DenseSet< T > |
using | vector_type = SmallVector< T, N > |
using | iterator = typename vector_type::const_iterator |
using | const_iterator = typename vector_type::const_iterator |
using | reverse_iterator = typename vector_type::const_reverse_iterator |
using | const_reverse_iterator = typename vector_type::const_reverse_iterator |
using | size_type = typename vector_type::size_type |
template<typename T, unsigned N>
class llvm::SmallSetVector< T, N >
A SetVector that performs no allocations if smaller than a certain size.
Definition at line 370 of file SetVector.h.
◆ SmallSetVector() [2/2]
The documentation for this class was generated from the following file:
- include/llvm/ADT/SetVector.h