#include "llvm/ADT/DenseMap.h"

Inheritance diagram for llvm::SmallDenseMap< KeyT, ValueT, InlineBuckets, KeyInfoT, BucketT >:

[legend]

Collaboration diagram for llvm::SmallDenseMap< KeyT, ValueT, InlineBuckets, KeyInfoT, BucketT >:

Public Member Functions
	SmallDenseMap (unsigned NumInitBuckets=0)

	SmallDenseMap (const SmallDenseMap &other)

	SmallDenseMap (SmallDenseMap &&other)

template<typename InputIt >
	SmallDenseMap (const InputIt &I, const InputIt &E)

	~SmallDenseMap ()

void	swap (SmallDenseMap &RHS)

SmallDenseMap &	operator= (const SmallDenseMap &other)

SmallDenseMap &	operator= (SmallDenseMap &&other)

void	copyFrom (const SmallDenseMap &other)

void	init (unsigned InitBuckets)

void	grow (unsigned AtLeast)

void	shrink_and_clear ()

Public Member Functions inherited from llvm::DenseMapBase< SmallDenseMap< KeyT, ValueT, InlineBuckets, KeyInfoT, BucketT >, KeyT, ValueT, KeyInfoT, BucketT >
iterator	begin ()

const_iterator	begin () const

iterator	end ()

const_iterator	end () const

LLVM_NODISCARD 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. More...

void	clear ()

size_type	count (const_arg_type_t< KeyT > Val) const
	Return 1 if the specified key is in the map, 0 otherwise. More...

iterator	find (const_arg_type_t< KeyT > Val)

const_iterator	find (const_arg_type_t< KeyT > Val) const

iterator	find_as (const LookupKeyT &Val)
	Alternate version of find() which allows a different, and possibly less expensive, key type. More...

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. More...

std::pair< iterator, bool >	insert (const std::pair< KeyT, ValueT > &KV)

std::pair< iterator, bool >	insert (std::pair< KeyT, ValueT > &&KV)

void	insert (InputIt I, InputIt E)
	insert - Range insertion of pairs. More...

std::pair< iterator, bool >	try_emplace (KeyT &&Key, Ts &&... Args)

std::pair< iterator, bool >	try_emplace (const KeyT &Key, Ts &&... Args)

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. More...

bool	erase (const KeyT &Val)

void	erase (iterator I)

value_type &	FindAndConstruct (const KeyT &Key)

value_type &	FindAndConstruct (KeyT &&Key)

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. More...

const void *	getPointerIntoBucketsArray () const
	getPointerIntoBucketsArray() - Return an opaque pointer into the buckets array. More...

size_t	getMemorySize () const
	Return the approximate size (in bytes) of the actual map. More...

Public Member Functions inherited from llvm::DebugEpochBase
	DebugEpochBase ()

void	incrementEpoch ()
	Calling incrementEpoch invalidates all handles pointing into the calling instance. More...

	~DebugEpochBase ()
	The destructor calls incrementEpoch to make use-after-free bugs more likely to crash deterministically. More...

Friends
class	DenseMapBase< SmallDenseMap, KeyT, ValueT, KeyInfoT, BucketT >

Additional Inherited Members
Public Types inherited from llvm::DenseMapBase< SmallDenseMap< KeyT, ValueT, InlineBuckets, KeyInfoT, BucketT >, 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 = DenseMapIterator< KeyT, ValueT, KeyInfoT, BucketT, true >

Protected Member Functions inherited from llvm::DenseMapBase< SmallDenseMap< KeyT, ValueT, InlineBuckets, KeyInfoT, BucketT >, KeyT, ValueT, KeyInfoT, BucketT >
	DenseMapBase ()=default

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(). More...

void	moveFromOldBuckets (BucketT OldBucketsBegin, BucketT OldBucketsEnd)

void	copyFrom (const DenseMapBase< OtherBaseT, KeyT, ValueT, KeyInfoT, BucketT > &other)

Static Protected Member Functions inherited from llvm::DenseMapBase< SmallDenseMap< KeyT, ValueT, InlineBuckets, KeyInfoT, BucketT >, KeyT, ValueT, KeyInfoT, BucketT >
static unsigned	getHashValue (const KeyT &Val)

static unsigned	getHashValue (const LookupKeyT &Val)

static const KeyT	getEmptyKey ()

static const KeyT	getTombstoneKey ()

Detailed Description