LLVM 22.0.0git
Public Types | Public Member Functions | List of all members
llvm::MapVector< KeyT, ValueT, MapType, VectorType > Class Template Reference

This class implements a map that also provides access to all stored values in a deterministic order. More...

#include "llvm/ADT/MapVector.h"

Inherited by llvm::SmallMapVector< ValueType, SUList, 4 >, llvm::SmallMapVector< unsigned, LiveDebugValues::DbgValue, 8 >, llvm::SmallMapVector< std::pair< DIFile *, LineColumn >, SmallSetVector< DIScope *, 8 >, 8 >, llvm::SmallMapVector< llvm::Use *, llvm::Value *, 32 >, llvm::SmallMapVector< llvm::Value *, llvm::PointerIntPair< llvm::Value *, 1, bool >, 32 >, llvm::SmallMapVector< llvm::Value *, llvm::WeakTrackingVH, 16 >, llvm::SmallMapVector< llvm::Value *, llvm::Value *, 4 >, llvm::SmallMapVector< uint8_t, NVPTX::Scope, 8 >, llvm::SmallMapVector< const llvm::Value *, std::pair< llvm::Value *, llvm::Value * >, 4 >, and llvm::SmallMapVector< unsigned, unsigned, 4 >.

Public Types

using key_type = KeyT
 
using value_type = typename VectorType::value_type
 
using size_type = typename VectorType::size_type
 
using iterator = typename VectorType::iterator
 
using const_iterator = typename VectorType::const_iterator
 
using reverse_iterator = typename VectorType::reverse_iterator
 
using const_reverse_iterator = typename VectorType::const_reverse_iterator
 

Public Member Functions

VectorType takeVector ()
 Clear the MapVector and return the underlying vector.
 
ArrayRef< value_type > getArrayRef () const
 Returns an array reference of the underlying vector.
 
size_type size () const
 
void reserve (size_type NumEntries)
 Grow the MapVector so that it can contain at least NumEntries items before resizing again.
 
iterator begin ()
 
const_iterator begin () const
 
iterator end ()
 
const_iterator end () const
 
reverse_iterator rbegin ()
 
const_reverse_iterator rbegin () const
 
reverse_iterator rend ()
 
const_reverse_iterator rend () const
 
bool empty () const
 
std::pair< KeyT, ValueT > & front ()
 
const std::pair< KeyT, ValueT > & front () const
 
std::pair< KeyT, ValueT > & back ()
 
const std::pair< KeyT, ValueT > & back () const
 
void clear ()
 
void swap (MapVector &RHS)
 
ValueT & operator[] (const KeyT &Key)
 
ValueT lookup (const KeyT &Key) const
 
template<typename... Ts>
std::pair< iterator, bool > try_emplace (const KeyT &Key, Ts &&...Args)
 
template<typename... Ts>
std::pair< iterator, bool > try_emplace (KeyT &&Key, Ts &&...Args)
 
std::pair< iterator, bool > insert (const std::pair< KeyT, ValueT > &KV)
 
std::pair< iterator, bool > insert (std::pair< KeyT, ValueT > &&KV)
 
template<typename V >
std::pair< iterator, bool > insert_or_assign (const KeyT &Key, V &&Val)
 
template<typename V >
std::pair< iterator, bool > insert_or_assign (KeyT &&Key, V &&Val)
 
bool contains (const KeyT &Key) const
 
size_type count (const KeyT &Key) const
 
iterator find (const KeyT &Key)
 
const_iterator find (const KeyT &Key) const
 
void pop_back ()
 Remove the last element from the vector.
 
VectorType::iterator erase (typename VectorType::iterator Iterator)
 Remove the element given by Iterator.
 
size_type erase (const KeyT &Key)
 Remove all elements with the key value Key.
 
template<class Predicate >
void remove_if (Predicate Pred)
 Remove the elements that match the predicate.
 
template<class Function >
void remove_if (Function Pred)
 

Detailed Description

template<typename KeyT, typename ValueT, typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
class llvm::MapVector< KeyT, ValueT, MapType, VectorType >

This class implements a map that also provides access to all stored values in a deterministic order.

The values are kept in a SmallVector<*, 0> and the mapping is done with DenseMap from Keys to indexes in that vector.

Definition at line 36 of file MapVector.h.

Member Typedef Documentation

◆ const_iterator

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
using llvm::MapVector< KeyT, ValueT, MapType, VectorType >::const_iterator = typename VectorType::const_iterator

Definition at line 43 of file MapVector.h.

◆ const_reverse_iterator

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
using llvm::MapVector< KeyT, ValueT, MapType, VectorType >::const_reverse_iterator = typename VectorType::const_reverse_iterator

Definition at line 45 of file MapVector.h.

◆ iterator

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
using llvm::MapVector< KeyT, ValueT, MapType, VectorType >::iterator = typename VectorType::iterator

Definition at line 42 of file MapVector.h.

◆ key_type

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
using llvm::MapVector< KeyT, ValueT, MapType, VectorType >::key_type = KeyT

Definition at line 38 of file MapVector.h.

◆ reverse_iterator

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
using llvm::MapVector< KeyT, ValueT, MapType, VectorType >::reverse_iterator = typename VectorType::reverse_iterator

Definition at line 44 of file MapVector.h.

◆ size_type

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
using llvm::MapVector< KeyT, ValueT, MapType, VectorType >::size_type = typename VectorType::size_type

Definition at line 40 of file MapVector.h.

◆ value_type

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
using llvm::MapVector< KeyT, ValueT, MapType, VectorType >::value_type = typename VectorType::value_type

Definition at line 39 of file MapVector.h.

Member Function Documentation

◆ back() [1/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
std::pair< KeyT, ValueT > & llvm::MapVector< KeyT, ValueT, MapType, VectorType >::back ( )
inline

Definition at line 81 of file MapVector.h.

Referenced by llvm::sandboxir::SeedContainer::insert().

◆ back() [2/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
const std::pair< KeyT, ValueT > & llvm::MapVector< KeyT, ValueT, MapType, VectorType >::back ( ) const
inline

Definition at line 82 of file MapVector.h.

◆ begin() [1/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
iterator llvm::MapVector< KeyT, ValueT, MapType, VectorType >::begin ( )
inline

Definition at line 65 of file MapVector.h.

Referenced by llvm::GCStrategyMap::begin(), llvm::sandboxir::SeedContainer::begin(), llvm::DbgValueHistoryMap::begin(), llvm::DbgLabelInstrMap::begin(), llvm::ScheduleDAGInstrs::insertBarrierChain(), and llvm::writeIndex().

◆ begin() [2/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
const_iterator llvm::MapVector< KeyT, ValueT, MapType, VectorType >::begin ( ) const
inline

Definition at line 66 of file MapVector.h.

◆ clear()

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
void llvm::MapVector< KeyT, ValueT, MapType, VectorType >::clear ( )
inline

Definition at line 84 of file MapVector.h.

Referenced by ARM64ProcessEpilogs(), ARMEmitUnwindInfo(), llvm::AccelTable< DataT >::clear(), llvm::DbgValueHistoryMap::clear(), llvm::DbgLabelInstrMap::clear(), interpretValues(), llvm::StackMaps::reset(), llvm::writeMemProfFrameArray(), llvm::writeMemProfFrames(), and llvm::writeMemProfRecords().

◆ contains()

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
bool llvm::MapVector< KeyT, ValueT, MapType, VectorType >::contains ( const KeyT &  Key) const
inline

Definition at line 137 of file MapVector.h.

Referenced by ARM64ProcessEpilogs(), ARMEmitUnwindInfo(), llvm::LoopVectorizationCostModel::collectInstsToScalarize(), llvm::MapVector< KeyT, ValueT, MapType, VectorType >::count(), and llvm::SelectionDAGBuilder::shouldKeepJumpConditionsTogether().

◆ count()

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
size_type llvm::MapVector< KeyT, ValueT, MapType, VectorType >::count ( const KeyT &  Key) const
inline

Definition at line 139 of file MapVector.h.

References llvm::MapVector< KeyT, ValueT, MapType, VectorType >::contains().

Referenced by llvm::SIMachineFunctionInfo::allocateWWMSpill(), llvm::checkDebugInfoMetadata(), llvm::collectDebugInfoMetadata(), findBasePointer(), llvm::LoopVectorizationLegality::isInductionPhi(), llvm::LoopVectorizationLegality::isReductionVariable(), and llvm::SCCPInstVisitor::resetLatticeValueFor().

◆ empty()

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
bool llvm::MapVector< KeyT, ValueT, MapType, VectorType >::empty ( ) const
inline

Definition at line 75 of file MapVector.h.

Referenced by llvm::InterleavedAccessInfo::analyzeInterleaving(), llvm::sandboxir::SeedContainer::begin(), llvm::DbgValueHistoryMap::empty(), llvm::DbgLabelInstrMap::empty(), llvm::GCStrategyMap::empty(), foldCondBranchOnValueKnownInPredecessorImpl(), getSalvageOpsForGEP(), interpretNextInstr(), and llvm::writeIndex().

◆ end() [1/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
iterator llvm::MapVector< KeyT, ValueT, MapType, VectorType >::end ( )
inline

Definition at line 67 of file MapVector.h.

Referenced by llvm::ScheduleDAGInstrs::addChainDependencies(), llvm::MCLineSection::addEndEntry(), checkFunctions(), checkInstructions(), checkVars(), llvm::ScheduleDAGInstrs::Value2SUsMap::clearList(), computeBaseDerivedRelocateMap(), llvm::GCStrategyMap::end(), llvm::sandboxir::SeedContainer::end(), llvm::DbgValueHistoryMap::end(), llvm::DbgLabelInstrMap::end(), llvm::MapVector< KeyT, ValueT, MapType, VectorType >::erase(), findBasePointer(), llvm::LoopVectorizationCostModel::getInstructionCost(), llvm::ScheduleDAGInstrs::insertBarrierChain(), llvm::insertDebugValuesForPHIs(), llvm::GCStrategyMap::operator[](), llvm::sampleprof::SampleRecord::serialize(), and llvm::lto::thinBackend().

◆ end() [2/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
const_iterator llvm::MapVector< KeyT, ValueT, MapType, VectorType >::end ( ) const
inline

Definition at line 68 of file MapVector.h.

◆ erase() [1/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
size_type llvm::MapVector< KeyT, ValueT, MapType, VectorType >::erase ( const KeyT &  Key)
inline

Remove all elements with the key value Key.

Returns the number of elements removed.

Definition at line 186 of file MapVector.h.

References llvm::MapVector< KeyT, ValueT, MapType, VectorType >::end(), llvm::MapVector< KeyT, ValueT, MapType, VectorType >::erase(), and llvm::MapVector< KeyT, ValueT, MapType, VectorType >::find().

◆ erase() [2/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
VectorType::iterator llvm::MapVector< KeyT, ValueT, MapType, VectorType >::erase ( typename VectorType::iterator  Iterator)
inline

Remove the element given by Iterator.

Returns an iterator to the element following the one which was removed, which may be end().

Note
This is a deceivingly expensive operation (linear time). It's usually better to use remove_if() if possible.

Definition at line 167 of file MapVector.h.

References assert(), I, and Index.

Referenced by collectCallSiteParameters(), llvm::MapVector< KeyT, ValueT, MapType, VectorType >::erase(), llvm::sandboxir::SeedContainer::erase(), and interpretValues().

◆ find() [1/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
iterator llvm::MapVector< KeyT, ValueT, MapType, VectorType >::find ( const KeyT &  Key)
inline

Definition at line 141 of file MapVector.h.

Referenced by llvm::ScheduleDAGInstrs::addChainDependencies(), llvm::MCLineSection::addEndEntry(), llvm::InterleavedAccessInfo::analyzeInterleaving(), checkFunctions(), checkInstructions(), checkVars(), llvm::ScheduleDAGInstrs::Value2SUsMap::clearList(), clusterSortPtrAccesses(), computeBaseDerivedRelocateMap(), llvm::MapVector< KeyT, ValueT, MapType, VectorType >::erase(), findBasePointer(), llvm::LoopVectorizationCostModel::getInstructionCost(), llvm::LoopVectorizationLegality::getIntOrFpInductionDescriptor(), llvm::LoopVectorizationLegality::getPointerInductionDescriptor(), llvm::LoopVectorizationLegality::getRecurrenceDescriptor(), llvm::insertDebugValuesForPHIs(), llvm::GCStrategyMap::operator[](), llvm::sampleprof::SampleRecord::serialize(), and llvm::lto::thinBackend().

◆ find() [2/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
const_iterator llvm::MapVector< KeyT, ValueT, MapType, VectorType >::find ( const KeyT &  Key) const
inline

Definition at line 147 of file MapVector.h.

◆ front() [1/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
std::pair< KeyT, ValueT > & llvm::MapVector< KeyT, ValueT, MapType, VectorType >::front ( )
inline

Definition at line 79 of file MapVector.h.

Referenced by clusterSortPtrAccesses(), GEPToVectorIndex(), parseJumpTable(), and tryToRecognizeTableBasedCttz().

◆ front() [2/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
const std::pair< KeyT, ValueT > & llvm::MapVector< KeyT, ValueT, MapType, VectorType >::front ( ) const
inline

Definition at line 80 of file MapVector.h.

◆ getArrayRef()

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
ArrayRef< value_type > llvm::MapVector< KeyT, ValueT, MapType, VectorType >::getArrayRef ( ) const
inline

Returns an array reference of the underlying vector.

Definition at line 54 of file MapVector.h.

Referenced by llvm::memprof::DataAccessProfData::getStrToIndexMapRef().

◆ insert() [1/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
std::pair< iterator, bool > llvm::MapVector< KeyT, ValueT, MapType, VectorType >::insert ( const std::pair< KeyT, ValueT > &  KV)
inline

Definition at line 115 of file MapVector.h.

Referenced by addAllTypesFromDWP(), addAllTypesFromTypesSection(), llvm::SIMachineFunctionInfo::allocateWWMSpill(), llvm::checkDebugInfoMetadata(), collectCallSiteParameters(), llvm::collectDebugInfoMetadata(), llvm::LoopVectorizationCostModel::collectInstsToScalarize(), llvm::GEPOperator::collectOffset(), computeBaseDerivedRelocateMap(), findBasePointer(), foldCondBranchOnValueKnownInPredecessorImpl(), llvm::insertDebugValuesForPHIs(), and llvm::write().

◆ insert() [2/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
std::pair< iterator, bool > llvm::MapVector< KeyT, ValueT, MapType, VectorType >::insert ( std::pair< KeyT, ValueT > &&  KV)
inline

Definition at line 118 of file MapVector.h.

◆ insert_or_assign() [1/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
template<typename V >
std::pair< iterator, bool > llvm::MapVector< KeyT, ValueT, MapType, VectorType >::insert_or_assign ( const KeyT &  Key,
V &&  Val 
)
inline

Definition at line 123 of file MapVector.h.

References llvm::MapVector< KeyT, ValueT, MapType, VectorType >::try_emplace().

◆ insert_or_assign() [2/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
template<typename V >
std::pair< iterator, bool > llvm::MapVector< KeyT, ValueT, MapType, VectorType >::insert_or_assign ( KeyT &&  Key,
V &&  Val 
)
inline

Definition at line 130 of file MapVector.h.

References llvm::MapVector< KeyT, ValueT, MapType, VectorType >::try_emplace().

◆ lookup()

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
ValueT llvm::MapVector< KeyT, ValueT, MapType, VectorType >::lookup ( const KeyT &  Key) const
inline

Definition at line 99 of file MapVector.h.

Referenced by ARM64ProcessEpilogs(), ARMEmitUnwindInfo(), checkConstLocationCompatible(), createMergedFunction(), and llvm::VPlanTransforms::truncateToMinimalBitwidths().

◆ operator[]()

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
ValueT & llvm::MapVector< KeyT, ValueT, MapType, VectorType >::operator[] ( const KeyT &  Key)
inline

Definition at line 94 of file MapVector.h.

Referenced by llvm::ScheduleDAGInstrs::Value2SUsMap::insert().

◆ pop_back()

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
void llvm::MapVector< KeyT, ValueT, MapType, VectorType >::pop_back ( )
inline

Remove the last element from the vector.

Definition at line 154 of file MapVector.h.

◆ rbegin() [1/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
reverse_iterator llvm::MapVector< KeyT, ValueT, MapType, VectorType >::rbegin ( )
inline

Definition at line 70 of file MapVector.h.

Referenced by llvm::InterleavedAccessInfo::analyzeInterleaving(), and llvm::GCStrategyMap::rbegin().

◆ rbegin() [2/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
const_reverse_iterator llvm::MapVector< KeyT, ValueT, MapType, VectorType >::rbegin ( ) const
inline

Definition at line 71 of file MapVector.h.

◆ remove_if() [1/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
template<class Function >
void llvm::MapVector< KeyT, ValueT, MapType, VectorType >::remove_if ( Function  Pred)

Definition at line 224 of file MapVector.h.

References E, I, and llvm::Vector.

◆ remove_if() [2/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
template<class Predicate >
void llvm::MapVector< KeyT, ValueT, MapType, VectorType >::remove_if ( Predicate  Pred)

Remove the elements that match the predicate.

Erase all elements that match Pred in a single pass. Takes linear time.

Referenced by llvm::ScheduleDAGInstrs::insertBarrierChain().

◆ rend() [1/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
reverse_iterator llvm::MapVector< KeyT, ValueT, MapType, VectorType >::rend ( )
inline

Definition at line 72 of file MapVector.h.

Referenced by llvm::InterleavedAccessInfo::analyzeInterleaving(), and llvm::GCStrategyMap::rend().

◆ rend() [2/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
const_reverse_iterator llvm::MapVector< KeyT, ValueT, MapType, VectorType >::rend ( ) const
inline

Definition at line 73 of file MapVector.h.

◆ reserve()

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
void llvm::MapVector< KeyT, ValueT, MapType, VectorType >::reserve ( size_type  NumEntries)
inline

Grow the MapVector so that it can contain at least NumEntries items before resizing again.

Definition at line 60 of file MapVector.h.

◆ size()

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
size_type llvm::MapVector< KeyT, ValueT, MapType, VectorType >::size ( ) const
inline

Definition at line 56 of file MapVector.h.

Referenced by llvm::OpenMPIRBuilder::applySimd(), llvm::calculateRegisterUsageForPlan(), checkConstLocationCompatible(), clusterSortPtrAccesses(), llvm::collectDebugInfoMetadata(), collectOffsets(), llvm::AccelTableBase::computeBucketCount(), findBasePointer(), GEPToVectorIndex(), llvm::AccelTableBase::getUniqueNameCount(), parseJumpTable(), llvm::AArch64TTIImpl::preferPredicateOverEpilogue(), llvm::sandboxir::SeedContainer::size(), tryToRecognizeTableBasedCttz(), llvm::writeIndex(), and llvm::writeMemProfFrameArray().

◆ swap()

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
void llvm::MapVector< KeyT, ValueT, MapType, VectorType >::swap ( MapVector< KeyT, ValueT, MapType, VectorType > &  RHS)
inline

Definition at line 89 of file MapVector.h.

References RHS, and std::swap().

◆ takeVector()

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
VectorType llvm::MapVector< KeyT, ValueT, MapType, VectorType >::takeVector ( )
inline

Clear the MapVector and return the underlying vector.

Definition at line 48 of file MapVector.h.

Referenced by computeFunctionSummary().

◆ try_emplace() [1/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
template<typename... Ts>
std::pair< iterator, bool > llvm::MapVector< KeyT, ValueT, MapType, VectorType >::try_emplace ( const KeyT &  Key,
Ts &&...  Args 
)
inline

Definition at line 107 of file MapVector.h.

Referenced by llvm::SCCPInstVisitor::addTrackedFunction(), clusterSortPtrAccesses(), collectInstructionDeps(), llvm::coro::doRematerializations(), llvm::InstCombinerImpl::foldAggregateConstructionIntoAggregateReuse(), llvm::object::ELFFile< ELFT >::getSectionAndRelocations(), llvm::MapVector< KeyT, ValueT, MapType, VectorType >::insert_or_assign(), llvm::SelectionDAGBuilder::shouldKeepJumpConditionsTogether(), and llvm::GCStrategyMap::try_emplace().

◆ try_emplace() [2/2]

template<typename KeyT , typename ValueT , typename MapType = DenseMap<KeyT, unsigned>, typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
template<typename... Ts>
std::pair< iterator, bool > llvm::MapVector< KeyT, ValueT, MapType, VectorType >::try_emplace ( KeyT &&  Key,
Ts &&...  Args 
)
inline

Definition at line 111 of file MapVector.h.

The documentation for this class was generated from the following file:
Generated on Sat Aug 30 2025 18:36:28 for LLVM by doxygen 1.9.6