LLVM
8.0.1
|
A SetVector that performs no allocations if smaller than a certain size. More...
#include "llvm/ADT/SetVector.h"
Public Member Functions | |
SmallSetVector ()=default | |
template<typename It > | |
SmallSetVector (It Start, It End) | |
Initialize a SmallSetVector with a range of elements. More... | |
Public Member Functions inherited from llvm::SetVector< T, SmallVector< T, N >, SmallDenseSet< T, N > > | |
SetVector ()=default | |
Construct an empty SetVector. More... | |
SetVector (It Start, It End) | |
Initialize a SetVector with a range of elements. More... | |
ArrayRef< T > | getArrayRef () const |
SmallVector< T, N > | takeVector () |
Clear the SetVector and return the underlying vector. More... | |
bool | empty () const |
Determine if the SetVector is empty or not. More... | |
size_type | size () const |
Determine the number of elements in the SetVector. More... | |
iterator | begin () |
Get an iterator to the beginning of the SetVector. More... | |
const_iterator | begin () const |
Get a const_iterator to the beginning of the SetVector. More... | |
iterator | end () |
Get an iterator to the end of the SetVector. More... | |
const_iterator | end () const |
Get a const_iterator to the end of the SetVector. More... | |
reverse_iterator | rbegin () |
Get an reverse_iterator to the end of the SetVector. More... | |
const_reverse_iterator | rbegin () const |
Get a const_reverse_iterator to the end of the SetVector. More... | |
reverse_iterator | rend () |
Get a reverse_iterator to the beginning of the SetVector. More... | |
const_reverse_iterator | rend () const |
Get a const_reverse_iterator to the beginning of the SetVector. More... | |
const T & | front () const |
Return the first element of the SetVector. More... | |
const T & | back () const |
Return the last element of the SetVector. More... | |
const_reference | operator[] (size_type n) const |
Index into the SetVector. More... | |
bool | insert (const value_type &X) |
Insert a new element into the SetVector. More... | |
void | insert (It Start, It End) |
Insert a range of elements into the SetVector. More... | |
bool | remove (const value_type &X) |
Remove an item from the set vector. More... | |
iterator | erase (iterator I) |
Erase a single element from the set vector. More... | |
bool | remove_if (UnaryPredicate P) |
Remove items from the set vector based on a predicate function. More... | |
size_type | count (const key_type &key) const |
Count the number of elements of a given key in the SetVector. More... | |
void | clear () |
Completely clear the SetVector. More... | |
void | pop_back () |
Remove the last element of the SetVector. More... | |
LLVM_NODISCARD T | 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. More... | |
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. More... | |
Additional Inherited Members | |
Public Types inherited from llvm::SetVector< T, SmallVector< T, N >, SmallDenseSet< T, N > > | |
using | value_type = T |
using | key_type = T |
using | reference = T & |
using | const_reference = const T & |
using | set_type = SmallDenseSet< T, N > |
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 |
A SetVector that performs no allocations if smaller than a certain size.
Definition at line 298 of file SetVector.h.
|
default |
|
inline |
Initialize a SmallSetVector with a range of elements.
Definition at line 305 of file SetVector.h.