LLVM: llvm::SmallDenseMap< KeyT, ValueT, InlineBuckets, KeyInfoT, BucketT (original) (raw)

#include "[llvm/ADT/DenseMap.h](DenseMap%5F8h%5Fsource.html)"

Inherits llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >.

Public Member Functions
	SmallDenseMap (unsigned NumElementsToReserve=0)
	SmallDenseMap (const SmallDenseMap &other)
	SmallDenseMap (SmallDenseMap &&other)
template
	SmallDenseMap (const InputIt &I, const InputIt &E)
template
	SmallDenseMap (llvm::from_range_t, const RangeT &Range)
	SmallDenseMap (std::initializer_list< typename BaseT::value_type > Vals)
	~SmallDenseMap ()
SmallDenseMap &	operator= (const SmallDenseMap &other)
SmallDenseMap &	operator= (SmallDenseMap &&other)
Public Member Functions inherited from llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >
iterator	begin ()
iterator	end ()
const_iterator	begin () const
const_iterator	end () const
auto	keys ()
auto	values ()
auto	keys () const
auto	values () const
bool	empty () const
unsigned	size () const
void	reserve (size_type NumEntries)
	Grow the densemap so that it can contain at least NumEntries items before resizing again.
void	clear ()
void	shrink_and_clear ()
bool	contains (const_arg_type_t< KeyT > Val) const
	Return true if the specified key is in the map, false otherwise.
size_type	count (const_arg_type_t< KeyT > Val) const
	Return 1 if the specified key is in the map, 0 otherwise.
iterator	find (const_arg_type_t< KeyT > Val)
const_iterator	find (const_arg_type_t< KeyT > Val) const
template
iterator	find_as (const LookupKeyT &Val)
	Alternate version of find() which allows a different, and possibly less expensive, key type.
template
const_iterator	find_as (const LookupKeyT &Val) const
ValueT	lookup (const_arg_type_t< KeyT > Val) const
	lookup - Return the entry for the specified key, or a default constructed value if no such entry exists.
template<typename U = std::remove_cv_t>
ValueT	lookup_or (const_arg_type_t< KeyT > Val, U &&Default) const
ValueT &	at (const_arg_type_t< KeyT > Val)
	at - Return the entry for the specified key, or abort if no such entry exists.
const ValueT &	at (const_arg_type_t< KeyT > Val) const
	at - Return the entry for the specified key, or abort if no such entry exists.
std::pair< iterator, bool >	insert (const std::pair< KeyT, ValueT > &KV)
std::pair< iterator, bool >	insert (std::pair< KeyT, ValueT > &&KV)
template<typename... Ts>
std::pair< iterator, bool >	try_emplace (KeyT &&Key, Ts &&...Args)
template<typename... Ts>
std::pair< iterator, bool >	try_emplace (const KeyT &Key, Ts &&...Args)
template
std::pair< iterator, bool >	insert_as (std::pair< KeyT, ValueT > &&KV, const LookupKeyT &Val)
	Alternate version of insert() which allows a different, and possibly less expensive, key type.
template
void	insert (InputIt I, InputIt E)
	insert - Range insertion of pairs.
template<typename Range>
void	insert_range (Range &&R)
	Inserts range of 'std::pair<KeyT, ValueT>' values into the map.
template
std::pair< iterator, bool >	insert_or_assign (const KeyT &Key, V &&Val)
template
std::pair< iterator, bool >	insert_or_assign (KeyT &&Key, V &&Val)
template<typename... Ts>
std::pair< iterator, bool >	emplace_or_assign (const KeyT &Key, Ts &&...Args)
template<typename... Ts>
std::pair< iterator, bool >	emplace_or_assign (KeyT &&Key, Ts &&...Args)
bool	erase (const KeyT &Val)
void	erase (iterator I)
ValueT &	operator[] (const KeyT &Key)
ValueT &	operator[] (KeyT &&Key)
bool	isPointerIntoBucketsArray (const void *Ptr) const
	isPointerIntoBucketsArray - Return true if the specified pointer points somewhere into the DenseMap's array of buckets (i.e.
const void *	getPointerIntoBucketsArray () const
	getPointerIntoBucketsArray() - Return an opaque pointer into the buckets array.
void	swap (DerivedT &RHS)
size_t	getMemorySize () const
	Return the approximate size (in bytes) of the actual map.
Public Member Functions inherited from llvm::DebugEpochBase
void	incrementEpoch ()

Additional Inherited Members
Public Types inherited from llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >
using	size_type = unsigned
using	key_type = KeyT
using	mapped_type = ValueT
using	value_type = BucketT
using	iterator = DenseMapIterator<KeyT, ValueT, KeyInfoT, BucketT>
using	const_iterator
Protected Member Functions inherited from llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >
	DenseMapBase ()=default
void	initWithExactBucketCount (unsigned NewNumBuckets)
void	destroyAll ()
void	initEmpty ()
unsigned	getMinBucketToReserveForEntries (unsigned NumEntries)
	Returns the number of buckets to allocate to ensure that the DenseMap can accommodate NumEntries without need to grow().
void	moveFrom (DerivedT &Other)
void	copyFrom (const DerivedT &other)

template<typename KeyT, typename ValueT, unsigned InlineBuckets = 4, typename KeyInfoT = DenseMapInfo, typename BucketT = llvm::detail::DenseMapPair<KeyT, ValueT>>
class llvm::SmallDenseMap< KeyT, ValueT, InlineBuckets, KeyInfoT, BucketT >

Definition at line 874 of file DenseMap.h.