llvm::SmallSetVector< T, N > Class Template Reference
A SetVector that performs no allocations if smaller than a certain size. More...
#include "llvm/ADT/SetVector.h"
Inheritance diagram for llvm::SmallSetVector< T, N >:
Additional Inherited Members | |
| Public Types inherited from llvm::SetVector< T, SmallVector< T, N >, DenseSet< T >, N > | |
| using | value_type |
| using | key_type |
| using | reference |
| using | const_reference |
| using | set_type |
| using | vector_type |
| using | iterator |
| using | const_iterator |
| using | reverse_iterator |
| using | const_reverse_iterator |
| using | size_type |
| Public Member Functions inherited from llvm::SetVector< T, SmallVector< T, N >, DenseSet< T >, N > | |
| SetVector ()=default | |
| Construct an empty SetVector. | |
| 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. | |
| iterator | end () |
| Get an iterator to the end of the SetVector. | |
| reverse_iterator | rbegin () |
| Get an reverse_iterator to the end of the SetVector. | |
| reverse_iterator | rend () |
| Get a 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_range (Range &&R) |
| 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) |
Detailed Description
A SetVector that performs no allocations if smaller than a certain size.
Definition at line 356 of file SetVector.h.
The documentation for this class was generated from the following file:
- include/llvm/ADT/SetVector.h
Generated on for LLVM by
1.14.0