SG::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys > Class Template Reference

List of all members.

Public Types
typedef Allocator	allocator_type
typedef Value	value_type
typedef Key	key_type
typedef Equal	key_equal
typedef Allocator::difference_type	difference_type
typedef Allocator::size_type	size_type
typedef Allocator::reference	reference
typedef Allocator::const_reference	const_reference
typedef Internal::node_iterator < value_type, constant_iterators, cache_hash_code >	local_iterator
typedef Internal::node_const_iterator < value_type, constant_iterators, cache_hash_code >	const_local_iterator
typedef Internal::hashtable_iterator < value_type, constant_iterators, cache_hash_code >	iterator
typedef Internal::hashtable_const_iterator < value_type, constant_iterators, cache_hash_code >	const_iterator
Public Member Functions
	hashtable (size_type bucket_hint, const H1 &, const H2 &, const H &, const Equal &, const ExtractKey &, const allocator_type &)
template<typename InIter >
	hashtable (InIter first, InIter last, size_type bucket_hint, const H1 &, const H2 &, const H &, const Equal &, const ExtractKey &, const allocator_type &)
	hashtable (const hashtable &)
hashtable &	operator= (const hashtable &)
void	swap (hashtable &)
iterator	begin ()
const_iterator	begin () const
iterator	end ()
const_iterator	end () const
size_type	size () const
bool	empty () const
allocator_type	get_allocator () const
size_type	max_size () const
key_equal	key_eq () const
size_type	bucket_count () const
size_type	max_bucket_count () const
size_type	bucket_size (size_type n) const
size_type	bucket (const key_type &k) const
local_iterator	begin (size_type n)
local_iterator	end (size_type)
const_local_iterator	begin (size_type n) const
const_local_iterator	end (size_type) const
float	load_factor () const
const RehashPolicy &	rehash_policy () const
void	rehash_policy (const RehashPolicy &)
iterator	find (const key_type &)
const_iterator	find (const key_type &k) const
size_type	count (const key_type &k) const
std::pair< iterator, iterator >	equal_range (const key_type &k)
std::pair< const_iterator, const_iterator >	equal_range (const key_type &k) const
Insert_Return_Type	insert (const value_type &v)
iterator	insert (iterator, const value_type &v)
const_iterator	insert (const_iterator, const value_type &v)
template<typename InIter >
void	insert (InIter first, InIter last)
iterator	erase (iterator)
const_iterator	erase (const_iterator)
size_type	erase (const key_type &)
iterator	erase (iterator, iterator)
const_iterator	erase (const_iterator, const_iterator)
void	clear ()
void	rehash (size_type n)
Friends
struct	CxxUtils_Internal::hashtable_iterator_base< Value, cache_hash_code >

template<typename Key, typename Value, typename Allocator, typename ExtractKey, typename Equal, typename H1, typename H2, typename H, typename RehashPolicy, bool cache_hash_code, bool constant_iterators, bool unique_keys>
class SG::hashtable< Key, Value, Allocator, ExtractKey, Equal, H1, H2, H, RehashPolicy, cache_hash_code, constant_iterators, unique_keys >

---

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

• /cvmfs/atlas.cern.ch/repo/sw/ASG/AnalysisBase/2.4.31/CxxUtils/CxxUtils/hashtable.h