mongo::UnorderedFastKeyTable< K_L, K_S, V, H, E, C, C_LS > Class Template Reference

Classes
class	const_iterator

Public Member Functions
	UnorderedFastKeyTable (unsigned startingCapacity=DEFAULT_STARTING_CAPACITY, double maxProbeRatio=0.05)
size_t	size () const
size_t	erase (const K_L &key)
const_iterator	find (const K_L &key) const

Constructor & Destructor Documentation

UnorderedFastKeyTable()

template<typename K_L , typename K_S , typename V , typename H , typename E , typename C , typename C_LS >

mongo::UnorderedFastKeyTable< K_L, K_S, V, H, E, C, C_LS >::UnorderedFastKeyTable ( unsigned  startingCapacity = DEFAULT_STARTING_CAPACITY, double  maxProbeRatio = 0.05  )

inline

Parameters

startingCapacity	how many buckets should exist on initial creation DEFAULT_STARTING_CAPACITY
maxProbeRatio	the percentage of buckets we're willing to probe no defined default as you can't have a static const double on windows

Member Function Documentation

erase()

template<typename K_L , typename K_S , typename V , typename H , typename E , typename C , typename C_LS >

size_t mongo::UnorderedFastKeyTable< K_L, K_S, V, H, E, C, C_LS >::erase ( const K_L &  key )

inline

Returns

number of elements removed

find()

template<typename K_L , typename K_S , typename V , typename H , typename E , typename C , typename C_LS >

UnorderedFastKeyTable< K_L, K_S, V, H, E, C, C_LS >::const_iterator mongo::UnorderedFastKeyTable< K_L, K_S, V, H, E, C, C_LS >::find ( const K_L &  key ) const

inline

Returns

either a one-shot iterator with the key, or end()

size()

template<typename K_L , typename K_S , typename V , typename H , typename E , typename C , typename C_LS = UnorderedFastKeyTable_LS_C<K_L, K_S>>

size_t mongo::UnorderedFastKeyTable< K_L, K_S, V, H, E, C, C_LS >::size ( ) const

inline

Returns

number of elements in map

---

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

• src/mongo/util/unordered_fast_key_table.h
• src/mongo/util/unordered_fast_key_table_internal.h