commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual > Class Template Reference

#include <HMap.h>

Public Types
typedef Key	key_type
typedef T	value_type
typedef Hasher	hasher
typedef KeyEqual	key_equal
typedef T &	reference
typedef const T &	const_reference
typedef T *	pointer
typedef const T *	const_pointer
typedef size_t	size_type
typedef ptrdiff_t	difference_type
typedef hash_table_iterator< T >	iterator
typedef hash_table_const_iterator< T >	const_iterator

Public Member Functions
	hash_table (size_type table_size, const Hasher &hf, const KeyEqual &ke, float load_ratio, bool insert_always=false)
	hash_table (iterator first, iterator last, size_type table_size, const Hasher &hf, const KeyEqual &ke, float load_ratio, bool insert_always=false)
	hash_table (const hash_table< Key, T, KeyOfValue, Hasher, KeyEqual > &other)
	~hash_table ()
hash_table< Key, T, KeyOfValue, Hasher, KeyEqual > &	operator= (const hash_table< Key, T, KeyOfValue, Hasher, KeyEqual > &other)
void	swap (hash_table< Key, T, KeyOfValue, Hasher, KeyEqual > &other)
hasher	hash_funct () const
key_equal	key_eq () const
iterator	begin ()
const_iterator	begin () const
const_iterator	cbegin () const
iterator	end ()
const_iterator	end () const
const_iterator	cend () const
bool	empty () const
size_type	size () const
size_type	max_size () const
pair< hash_table_iterator< T > , bool >	insert (const T &value)
void	insert (const T *first, const T *last)
void	insert (const_iterator first, const_iterator last)
void	erase (iterator pos)
size_type	erase (const key_type &key)
void	erase (iterator first, iterator last)
iterator	find (const key_type &key)
const_iterator	find (const key_type &key) const
size_type	count (const key_type &key) const
pair< hash_table_iterator< T > , hash_table_iterator< T > >	equal_range (const key_type &key)
pair < hash_table_const_iterator< T > , hash_table_const_iterator< T > >	equal_range (const key_type &key) const
size_type	bucket_count () const
void	resize (size_type buckets)
void	clear ()

Member Typedef Documentation

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

typedef hash_table_const_iterator<T> commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::const_iterator

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

typedef const T* commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::const_pointer

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

typedef const T& commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::const_reference

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

typedef ptrdiff_t commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::difference_type

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

typedef Hasher commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::hasher

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

typedef hash_table_iterator<T> commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::iterator

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

typedef KeyEqual commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::key_equal

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

typedef Key commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::key_type

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

typedef T* commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::pointer

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

typedef T& commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::reference

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

typedef size_t commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::size_type

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

typedef T commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::value_type

Constructor & Destructor Documentation

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::hash_table ( size_type  table_size, const Hasher &  hf, const KeyEqual &  ke, float  load_ratio, bool  insert_always = false  )

inline

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::hash_table ( iterator  first, iterator  last, size_type  table_size, const Hasher &  hf, const KeyEqual &  ke, float  load_ratio, bool  insert_always = false  )

inline

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::hash_table ( const hash_table< Key, T, KeyOfValue, Hasher, KeyEqual > &  other )

inline

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::~hash_table ( )

inline

Member Function Documentation

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

iterator commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::begin ( )

inline

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

const_iterator commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::begin ( ) const

inline

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

size_type commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::bucket_count ( ) const

inline

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

const_iterator commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::cbegin ( ) const

inline

Get a cbegin const iterator cbegin is identical to the const version of begin() but it ensures, in any context, to be recognized by the compiler as returning a const_iterator

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

const_iterator commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::cend ( ) const

inline

Get a cend const iterator cend is identical to the const version of end() but it ensures, in any context, to be recognized by the compiler as returning a const_iterator

template<class Key , class T , class KeyOfValue , class Hasher , class KeyEqual >

void commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::clear

(

)

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

size_type commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::count

(

const key_type &

key

)

const

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

bool commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::empty ( ) const

inline

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

iterator commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::end ( )

inline

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

const_iterator commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::end ( ) const

inline

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

pair< hash_table_iterator < T >, hash_table_iterator < T > > commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::equal_range

(

const key_type &

key

)

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

pair< hash_table_const_iterator < T >, hash_table_const_iterator < T > > commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::equal_range

(

const key_type &

key

)

const

template<class Key , class T , class KeyOfValue , class Hasher , class KeyEqual >

void commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::erase

(

iterator

pos

)

template<class Key , class T , class KeyOfValue , class Hasher , class KeyEqual >

size_t commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::erase

(

const key_type &

key

)

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

void commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::erase	(	iterator	first,
		iterator	last
	)

template<class Key , class T , class KeyOfValue , class Hasher , class KeyEqual >

hash_table_iterator< T > commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::find

(

const key_type &

key

)

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

const_iterator commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::find

(

const key_type &

key

)

const

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

hasher commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::hash_funct ( ) const

inline

template<class Key , class T, class KeyOfValue , class Hasher , class KeyEqual >

pair< hash_table_iterator< T >, bool > commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::insert

(

const T &

value

)

template<class Key , class T, class KeyOfValue , class Hasher , class KeyEqual >

void commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::insert	(	const T *	first,
		const T *	last
	)

template<class Key , class T, class KeyOfValue , class Hasher , class KeyEqual >

void commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::insert	(	const_iterator	first,
		const_iterator	last
	)

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

key_equal commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::key_eq ( ) const

inline

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

size_type commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::max_size ( ) const

inline

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

hash_table< Key, T, KeyOfValue, Hasher, KeyEqual>& commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::operator= ( const hash_table< Key, T, KeyOfValue, Hasher, KeyEqual > &  other )

inline

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

void commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::resize ( size_type  buckets )

inline

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

size_type commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::size ( ) const

inline

template<class Key, class T, class KeyOfValue, class Hasher, class KeyEqual>

void commore::hash_table< Key, T, KeyOfValue, Hasher, KeyEqual >::swap ( hash_table< Key, T, KeyOfValue, Hasher, KeyEqual > &  other )

inline

---

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

• commore/src/HMap.h