LLVM  16.0.0git
Public Types | Public Member Functions | List of all members
llvm::SmallSet< T, N, C > Class Template Reference

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"

Inheritance diagram for llvm::SmallSet< T, N, C >:
Inheritance graph
[legend]

Public Types

using size_type = size_t
 
using const_iterator = SmallSetIterator< T, N, C >
 

Public Member Functions

 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. More...
 
std::pair< const_iterator, bool > insert (const T &V)
 insert - Insert an element into the set if it isn't already there. More...
 
template<typename IterT >
void insert (IterT I, IterT E)
 
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. More...
 

Detailed Description

template<typename T, unsigned N, typename C = std::less<T>>
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 136 of file SmallSet.h.

Member Typedef Documentation

◆ const_iterator

template<typename T , unsigned N, typename C = std::less<T>>
using llvm::SmallSet< T, N, C >::const_iterator = SmallSetIterator<T, N, C>

Definition at line 154 of file SmallSet.h.

◆ size_type

template<typename T , unsigned N, typename C = std::less<T>>
using llvm::SmallSet< T, N, C >::size_type = size_t

Definition at line 153 of file SmallSet.h.

Constructor & Destructor Documentation

◆ SmallSet()

template<typename T , unsigned N, typename C = std::less<T>>
llvm::SmallSet< T, N, C >::SmallSet ( )
default

Member Function Documentation

◆ begin()

template<typename T , unsigned N, typename C = std::less<T>>
const_iterator llvm::SmallSet< T, N, C >::begin ( ) const
inline

Definition at line 222 of file SmallSet.h.

Referenced by INITIALIZE_PASS().

◆ clear()

template<typename T , unsigned N, typename C = std::less<T>>
void llvm::SmallSet< T, N, C >::clear ( )
inline

◆ contains()

template<typename T , unsigned N, typename C = std::less<T>>
bool llvm::SmallSet< T, N, C >::contains ( const T V) const
inline

◆ count()

template<typename T , unsigned N, typename C = std::less<T>>
size_type llvm::SmallSet< T, N, C >::count ( const T V) const
inline

◆ empty()

template<typename T , unsigned N, typename C = std::less<T>>
bool llvm::SmallSet< T, N, C >::empty ( ) const
inline

◆ end()

template<typename T , unsigned N, typename C = std::less<T>>
const_iterator llvm::SmallSet< T, N, C >::end ( ) const
inline

Definition at line 228 of file SmallSet.h.

◆ erase()

template<typename T , unsigned N, typename C = std::less<T>>
bool llvm::SmallSet< T, N, C >::erase ( const T V)
inline

Definition at line 206 of file SmallSet.h.

Referenced by llvm::finalizeBundle(), INITIALIZE_PASS(), and IsValueFullyAvailableInBlock().

◆ insert() [1/2]

template<typename T , unsigned N, typename C = std::less<T>>
std::pair<const_iterator, bool> llvm::SmallSet< T, N, C >::insert ( const T V)
inline

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 178 of file SmallSet.h.

Referenced by addArgumentAttrs(), addArgumentReturnedAttrs(), llvm::SPIRV::RequirementHandler::addExtension(), llvm::SPIRV::RequirementHandler::addExtensions(), addHints(), addMemoryAttrs(), addNoAliasAttrs(), addNonNullAttrs(), addNoRecurseAttrs(), addNoReturnAttrs(), addWillReturn(), AntiDepEdges(), llvm::AMDGPURegisterBankInfo::applyMappingSBufferLoad(), llvm::OpenMPIRBuilder::applySimd(), llvm::DomTreeUpdater::applyUpdatesPermissive(), llvm::ARMBaseInstrInfo::ARMBaseInstrInfo(), AssignProtectedObjSet(), llvm::CallGraphDOTInfo::CallGraphDOTInfo(), llvm::changeToUnreachable(), CheckForLiveRegDefMasked(), llvm::AMDGPURegisterBankInfo::collectWaterfallOperands(), combineShuffleOfScalars(), llvm::SMSchedule::computeUnpipelineableNodes(), llvm::ConstantFoldTerminator(), llvm::ARMBaseInstrInfo::copyPhysReg(), deriveAttrsInPostOrder(), despeculateCountZeros(), llvm::Instruction::dropUnknownNonDebugMetadata(), llvm::HexagonRegisterInfo::eliminateFrameIndex(), llvm::HexagonHazardRecognizer::EmitInstruction(), llvm::WebAssemblyAsmPrinter::EmitProducerInfo(), emitSelectPseudo(), llvm::finalizeBundle(), findConsecutiveLoad(), llvm::DWARFDie::findRecursively(), llvm::R600InstrInfo::fitsConstReadLimitations(), llvm::rdf::Liveness::getAllReachingDefs(), llvm::SystemZRegisterInfo::getRegAllocationHints(), llvm::X86RegisterInfo::getRegAllocationHints(), llvm::TargetRegisterInfo::getRegAllocationHints(), llvm::slpvectorizer::BoUpSLP::LookAheadHeuristics::getScoreAtLevelRec(), llvm::MachineInstr::getUsedDebugRegs(), handleNormalInst(), hoistAndMergeSGPRInits(), INITIALIZE_PASS(), llvm::SmallSet< unsigned, 16 >::insert(), llvm::MemorySSAUpdater::insertDef(), llvm::AMDGPU::isClobberedInFunction(), isLoadCombineCandidate(), IsSafeAndProfitableToMove(), IsValueFullyAvailableInBlock(), liesBetween(), llvm::SelectionDAGBuilder::LowerStatepoint(), lowerStatepointMetaArgs(), mustExecuteUBIfPoisonOnPathTo(), llvm::LoopVectorizationPlanner::plan(), llvm::PointerMayBeCaptured(), llvm::WebAssemblyInstPrinter::printInst(), llvm::HexagonFrameLowering::processFunctionBeforeFrameFinalized(), ProcessSourceNode(), llvm::SwiftErrorValueTracking::propagateVRegs(), llvm::MachineDominatorTree::recordSplitCriticalEdge(), replaceAllUsesWith(), llvm::MachineBasicBlock::SplitCriticalEdge(), TryToSinkInstruction(), unique_unsorted(), and verifyCTRBranch().

◆ insert() [2/2]

template<typename T , unsigned N, typename C = std::less<T>>
template<typename IterT >
void llvm::SmallSet< T, N, C >::insert ( IterT  I,
IterT  E 
)
inline

Definition at line 201 of file SmallSet.h.

◆ size()

template<typename T , unsigned N, typename C = std::less<T>>
size_type llvm::SmallSet< T, N, C >::size ( ) const
inline

The documentation for this class was generated from the following file: