LLVM: llvm::SmallSet< T, N, C (original) (raw)
SmallSet - This maintains a set of unique values, optimizing for the case when the set is small (less than N). More...
#include "[llvm/ADT/SmallSet.h](SmallSet%5F8h%5Fsource.html)"
| Public Member Functions | |
|---|---|
| SmallSet ()=default | |
| SmallSet (const SmallSet &)=default | |
| SmallSet (SmallSet &&)=default | |
| template | |
| SmallSet (IterT Begin, IterT End) | |
| template<typename Range> | |
| SmallSet (llvm::from_range_t, Range &&R) | |
| SmallSet (std::initializer_list< T > L) | |
| SmallSet & | operator= (const SmallSet &)=default |
| SmallSet & | operator= (SmallSet &&)=default |
| bool | empty () const |
| size_type | size () const |
| size_type | count (const T &V) const |
| count - Return 1 if the element is in the set, 0 otherwise. | |
| std::pair< const_iterator, bool > | insert (const T &V) |
| insert - Insert an element into the set if it isn't already there. | |
| std::pair< const_iterator, bool > | insert (T &&V) |
| template | |
| void | insert (IterT I, IterT E) |
| template<typename Range> | |
| void | insert_range (Range &&R) |
| bool | erase (const T &V) |
| void | clear () |
| const_iterator | begin () const |
| const_iterator | end () const |
| bool | contains (const T &V) const |
| Check if the SmallSet contains the given element. |
template<typename T, unsigned N, typename C = std::less>
class llvm::SmallSet< T, N, C >
SmallSet - This maintains a set of unique values, optimizing for the case when the set is small (less than N).
In this case, the set can be maintained with no mallocs. If the set gets large, we expand to using an std::set to maintain reasonable lookup times.
Definition at line 133 of file SmallSet.h.
◆ const_iterator
template<typename T, unsigned N, typename C = std::less>
◆ key_type
template<typename T, unsigned N, typename C = std::less>
◆ size_type
template<typename T, unsigned N, typename C = std::less>
◆ value_type
template<typename T, unsigned N, typename C = std::less>
◆ SmallSet() [1/6]
template<typename T, unsigned N, typename C = std::less>
◆ SmallSet() [2/6]
template<typename T, unsigned N, typename C = std::less>
◆ SmallSet() [3/6]
template<typename T, unsigned N, typename C = std::less>
◆ SmallSet() [4/6]
template<typename T, unsigned N, typename C = std::less>
template
◆ SmallSet() [5/6]
template<typename T, unsigned N, typename C = std::less>
template<typename Range>
◆ SmallSet() [6/6]
template<typename T, unsigned N, typename C = std::less>
◆ begin()
template<typename T, unsigned N, typename C = std::less>
◆ clear()
template<typename T, unsigned N, typename C = std::less>
◆ contains()
template<typename T, unsigned N, typename C = std::less>
◆ count()
template<typename T, unsigned N, typename C = std::less>
count - Return 1 if the element is in the set, 0 otherwise.
Definition at line 175 of file SmallSet.h.
Referenced by addHints(), llvm::ARMBaseInstrInfo::copyPhysReg(), llvm::Instruction::dropUnknownNonDebugMetadata(), emitSelectPseudo(), emitSelectPseudo(), llvm::AMDGPURegisterBankInfo::executeInWaterfallLoop(), llvm::rdf::Liveness::getAllReachingDefs(), llvm::RISCVRegisterInfo::getRegAllocationHints(), llvm::SystemZRegisterInfo::getRegAllocationHints(), llvm::X86RegisterInfo::getRegAllocationHints(), slpvectorizer::BoUpSLP::LookAheadHeuristics::getScoreAtLevelRec(), getUniqueCaseValue(), hasPHICycleDFS(), llvm::WindowScheduler::initialize(), IsSafeAndProfitableToMove(), lowerStatepointMetaArgs(), MaySpeculate(), ProcessSourceNode(), and llvm::MachineBasicBlock::SplitCriticalEdge().
◆ empty()
template<typename T, unsigned N, typename C = std::less>
◆ end()
template<typename T, unsigned N, typename C = std::less>
◆ erase()
template<typename T, unsigned N, typename C = std::less>
◆ insert() [1/3]
template<typename T, unsigned N, typename C = std::less>
insert - Insert an element into the set if it isn't already there.
Returns a pair. The first value of it is an iterator to the inserted element or the existing element in the set. The second value is true if the element is inserted (it was not in the set before).
Definition at line 183 of file SmallSet.h.
Referenced by llvm::AAPointerInfo::OffsetInfo::addToAll(), llvm::GCNDownwardRPTracker::advanceBeforeNext(), AntiDepEdges(), llvm::AMDGPURegisterBankInfo::applyMappingSBufferLoad(), llvm::GenericDomTreeUpdater< DerivedT, DomTreeT, PostDomTreeT >::applyUpdatesPermissive(), AssignProtectedObjSet(), CheckForLiveRegDef(), CheckForLiveRegDef(), CheckForLiveRegDefMasked(), clobberRegEntries(), llvm::JumpThreadingPass::cloneInstructions(), collectPrivatizingConstructs(), llvm::AMDGPURegisterBankInfo::collectWaterfallOperands(), combineShuffleOfScalars(), llvm::PPCInstrInfo::convertToImmediateForm(), llvm::ARMBaseInstrInfo::copyPhysReg(), llvm::Instruction::dropUnknownNonDebugMetadata(), llvm::HexagonRegisterInfo::eliminateFrameIndex(), llvm::WebAssemblyAsmPrinter::EmitProducerInfo(), emitSelectPseudo(), emitSelectPseudo(), llvm::finalizeBundle(), llvm::DWARFDie::findRecursively(), llvm::R600InstrInfo::fitsConstReadLimitations(), gatherPossiblyVectorizableLoads(), llvm::rdf::Liveness::getAllReachingDefs(), llvm::RISCVRegisterInfo::getRegAllocationHints(), llvm::SystemZRegisterInfo::getRegAllocationHints(), llvm::TargetRegisterInfo::getRegAllocationHints(), llvm::X86RegisterInfo::getRegAllocationHints(), slpvectorizer::BoUpSLP::LookAheadHeuristics::getScoreAtLevelRec(), getUniqueCaseValue(), handleNormalInst(), hasAllNBitUsers(), hasAllNBitUsers(), hasPHICycleDFS(), llvm::WindowScheduler::initialize(), llvm::SmallSet< Register, 16 >::insert(), llvm::SmallSet< Register, 16 >::insert_range(), llvm::MemorySSAUpdater::insertDef(), isProfitable(), IsSafeAndProfitableToMove(), isSignExtendedW(), isSignExtendedW(), LowerAVXCONCAT_VECTORS(), llvm::SelectionDAGBuilder::LowerStatepoint(), lowerStatepointMetaArgs(), llvm::ShuffleBlockStrategy::mutate(), ProcessSourceNode(), simplifySwitchOfCmpIntrinsic(), llvm::SmallSet< Register, 16 >::SmallSet(), llvm::SmallSet< Register, 16 >::SmallSet(), llvm::MachineBasicBlock::SplitCriticalEdge(), llvm::InstCombinerImpl::tryToSinkInstructionDbgVariableRecords(), and llvm::DWARFCFIAnalysis::update().
◆ insert() [2/3]
template<typename T, unsigned N, typename C = std::less>
template
◆ insert() [3/3]
template<typename T, unsigned N, typename C = std::less>
◆ insert_range()
template<typename T, unsigned N, typename C = std::less>
template<typename Range>
◆ operator=() [1/2]
template<typename T, unsigned N, typename C = std::less>
◆ operator=() [2/2]
template<typename T, unsigned N, typename C = std::less>
◆ size()
template<typename T, unsigned N, typename C = std::less>
The documentation for this class was generated from the following file:
- include/llvm/ADT/SmallSet.h