INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc > Class Template Reference

#include <InterpKernelHashTable.hxx>

Inheritance diagram for INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >:

Public Types
typedef _Key	key_type
typedef _Val	value_type
typedef _HashFcn	hasher
typedef _EqualKey	key_equal
typedef std::size_t	size_type
typedef std::ptrdiff_t	difference_type
typedef value_type *	pointer
typedef const value_type *	const_pointer
typedef value_type &	reference
typedef const value_type &	const_reference
typedef _Alloc::template rebind< value_type >::other	allocator_type
typedef _Hashtable_iterator < _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >	iterator
typedef _Hashtable_const_iterator < _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >	const_iterator
Public Member Functions
hasher	hash_funct () const
key_equal	key_eq () const
allocator_type	get_allocator () const
	hashtable (size_type __n, const _HashFcn &__hf, const _EqualKey &__eql, const _ExtractKey &__ext, const allocator_type &__a=allocator_type())
	hashtable (size_type __n, const _HashFcn &__hf, const _EqualKey &__eql, const allocator_type &__a=allocator_type())
	hashtable (const hashtable &__ht)
hashtable &	operator= (const hashtable &__ht)
	~hashtable ()
size_type	size () const
size_type	max_size () const
bool	empty () const
void	swap (hashtable &__ht)
iterator	begin ()
iterator	end ()
const_iterator	begin () const
const_iterator	end () const
size_type	bucket_count () const
size_type	max_bucket_count () const
size_type	elems_in_bucket (size_type __bucket) const
std::pair< iterator, bool >	insert_unique (const value_type &__obj)
iterator	insert_equal (const value_type &__obj)
std::pair< iterator, bool >	insert_unique_noresize (const value_type &__obj)
iterator	insert_equal_noresize (const value_type &__obj)
template<class _InputIterator >
void	insert_unique (_InputIterator __f, _InputIterator __l)
template<class _InputIterator >
void	insert_equal (_InputIterator __f, _InputIterator __l)
template<class _InputIterator >
void	insert_unique (_InputIterator __f, _InputIterator __l, std::input_iterator_tag)
template<class _InputIterator >
void	insert_equal (_InputIterator __f, _InputIterator __l, std::input_iterator_tag)
template<class _ForwardIterator >
void	insert_unique (_ForwardIterator __f, _ForwardIterator __l, std::forward_iterator_tag)
template<class _ForwardIterator >
void	insert_equal (_ForwardIterator __f, _ForwardIterator __l, std::forward_iterator_tag)
reference	find_or_insert (const value_type &__obj)
iterator	find (const key_type &__key)
const_iterator	find (const key_type &__key) const
size_type	count (const key_type &__key) const
std::pair< iterator, iterator >	equal_range (const key_type &__key)
std::pair< const_iterator, const_iterator >	equal_range (const key_type &__key) const
size_type	erase (const key_type &__key)
void	erase (const iterator &__it)
void	erase (iterator __first, iterator __last)
void	erase (const const_iterator &__it)
void	erase (const_iterator __first, const_iterator __last)
void	resize (size_type __num_elements_hint)
void	clear ()
Private Types
typedef _Hashtable_node< _Val >	_Node
typedef _Alloc::template rebind< _Node >::other	_Node_Alloc
typedef _Alloc::template rebind< _Node * >::other	_Nodeptr_Alloc
typedef std::vector< _Node *, _Nodeptr_Alloc >	_Vector_type
Private Member Functions
_Node *	_M_get_node ()
void	_M_put_node (_Node *__p)
size_type	_M_next_size (size_type __n) const
void	_M_initialize_buckets (size_type __n)
size_type	_M_bkt_num_key (const key_type &__key) const
size_type	_M_bkt_num (const value_type &__obj) const
size_type	_M_bkt_num_key (const key_type &__key, std::size_t __n) const
size_type	_M_bkt_num (const value_type &__obj, std::size_t __n) const
_Node *	_M_new_node (const value_type &__obj)
void	_M_delete_node (_Node *__n)
void	_M_erase_bucket (const size_type __n, _Node *__first, _Node *__last)
void	_M_erase_bucket (const size_type __n, _Node *__last)
void	_M_copy_from (const hashtable &__ht)
Private Attributes
_Node_Alloc	_M_node_allocator
hasher	_M_hash
key_equal	_M_equals
_ExtractKey	_M_get_key
_Vector_type	_M_buckets
size_type	_M_num_elements
Friends
struct	_Hashtable_iterator< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >
struct	_Hashtable_const_iterator< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >
template<class _Vl , class _Ky , class _HF , class _Ex , class _Eq , class _Al >
bool	operator== (const hashtable< _Vl, _Ky, _HF, _Ex, _Eq, _Al > &, const hashtable< _Vl, _Ky, _HF, _Ex, _Eq, _Al > &)

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>
class INTERP_KERNEL::hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >

---

Member Typedef Documentation

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef _Key INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.key_type

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef _Val INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.value_type

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef _HashFcn INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.hasher

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef _EqualKey INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.key_equal

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef std::size_t INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.size_type

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef std::ptrdiff_t INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.difference_type

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef value_type* INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.pointer

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef const value_type* INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.const_pointer

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef value_type& INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.reference

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef const value_type& INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.const_reference

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef _Hashtable_node<_Val> INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._Node [private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef _Alloc::template rebind<value_type>::other INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.allocator_type

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef _Alloc::template rebind<_Node>::other INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._Node_Alloc [private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef _Alloc::template rebind<_Node*>::other INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._Nodeptr_Alloc [private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef std::vector<_Node*, _Nodeptr_Alloc> INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._Vector_type [private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef _Hashtable_iterator<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc> INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.iterator

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

typedef _Hashtable_const_iterator<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc> INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.const_iterator

---

Constructor & Destructor Documentation

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.hashtable	(	size_type	__n,
		const _HashFcn &	__hf,
		const _EqualKey &	__eql,
		const _ExtractKey &	__ext,
		const allocator_type &	__a = allocator_type()
	)

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.hashtable	(	size_type	__n,
		const _HashFcn &	__hf,
		const _EqualKey &	__eql,
		const allocator_type &	__a = allocator_type()
	)

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.hashtable

(

const hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc > &

__ht

)

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.~hashtable

(

)

---

Member Function Documentation

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

hasher INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.hash_funct

(

)

const

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

key_equal INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.key_eq

(

)

const

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

allocator_type INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.get_allocator

(

)

const

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

_Node* INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_get_node

(

)

[private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

void INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_put_node

(

_Node *

__p

)

[private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

hashtable& INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.operator=

(

const hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc > &

__ht

)

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

size_type INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.size

(

)

const

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

size_type INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.max_size

(

)

const

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

bool INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.empty

(

)

const

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

void INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.swap

(

hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc > &

__ht

)

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

iterator INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.begin

(

)

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

iterator INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.end

(

)

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

const_iterator INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.begin

(

)

const

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

const_iterator INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.end

(

)

const

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

size_type INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.bucket_count

(

)

const

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

size_type INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.max_bucket_count

(

)

const

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

size_type INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.elems_in_bucket

(

size_type

__bucket

)

const

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

std::pair<iterator, bool> INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.insert_unique

(

const value_type &

__obj

)

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

iterator INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.insert_equal

(

const value_type &

__obj

)

template<class _Val , class _Key , class _HF , class _Ex , class _Eq , class _All >

std::pair< typename hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::iterator, bool > INTERP_KERNEL.hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::insert_unique_noresize

(

const value_type &

__obj

)

References INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_bkt_num(), INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_buckets, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_equals, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_get_key, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_new_node(), INTERP_KERNEL._Hashtable_node< _Val >._M_next, and INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_num_elements.

template<class _Val , class _Key , class _HF , class _Ex , class _Eq , class _All >

hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::iterator INTERP_KERNEL.hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::insert_equal_noresize

(

const value_type &

__obj

)

References INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_bkt_num(), INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_buckets, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_equals, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_get_key, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_new_node(), INTERP_KERNEL._Hashtable_node< _Val >._M_next, and INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_num_elements.

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

template<class _InputIterator >

void INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.insert_unique	(	_InputIterator	__f,
		_InputIterator	__l
	)

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

template<class _InputIterator >

void INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.insert_equal	(	_InputIterator	__f,
		_InputIterator	__l
	)

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

template<class _InputIterator >

void INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.insert_unique	(	_InputIterator	__f,
		_InputIterator	__l,
		std::input_iterator_tag
	)

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

template<class _InputIterator >

void INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.insert_equal	(	_InputIterator	__f,
		_InputIterator	__l,
		std::input_iterator_tag
	)

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

template<class _ForwardIterator >

void INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.insert_unique	(	_ForwardIterator	__f,
		_ForwardIterator	__l,
		std::forward_iterator_tag
	)

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

template<class _ForwardIterator >

void INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.insert_equal	(	_ForwardIterator	__f,
		_ForwardIterator	__l,
		std::forward_iterator_tag
	)

template<class _Val , class _Key , class _HF , class _Ex , class _Eq , class _All >

hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::reference INTERP_KERNEL.hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::find_or_insert

(

const value_type &

__obj

)

References INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_bkt_num(), INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_buckets, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_equals, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_get_key, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_new_node(), INTERP_KERNEL._Hashtable_node< _Val >._M_next, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_num_elements, INTERP_KERNEL._Hashtable_node< _Val >._M_val, and INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.resize().

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

iterator INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.find

(

const key_type &

__key

)

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

const_iterator INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.find

(

const key_type &

__key

)

const

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

size_type INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.count

(

const key_type &

__key

)

const

template<class _Val , class _Key , class _HF , class _Ex , class _Eq , class _All >

std::pair< typename hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::iterator, typename hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::iterator > INTERP_KERNEL.hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::equal_range

(

const key_type &

__key

)

References INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_bkt_num_key(), INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_buckets, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_equals, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_get_key, INTERP_KERNEL._Hashtable_node< _Val >._M_next, INTERP_KERNEL._Hashtable_node< _Val >._M_val, and INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.end().

template<class _Val , class _Key , class _HF , class _Ex , class _Eq , class _All >

std::pair< typename hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::const_iterator, typename hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::const_iterator > INTERP_KERNEL.hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::equal_range

(

const key_type &

__key

)

const

References INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_bkt_num_key(), INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_buckets, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_equals, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_get_key, INTERP_KERNEL._Hashtable_node< _Val >._M_next, INTERP_KERNEL._Hashtable_node< _Val >._M_val, and INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.end().

template<class _Val , class _Key , class _HF , class _Ex , class _Eq , class _All >

hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::size_type INTERP_KERNEL.hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::erase

(

const key_type &

__key

)

References INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_bkt_num_key(), INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_buckets, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_delete_node(), INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_equals, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_get_key, INTERP_KERNEL._Hashtable_node< _Val >._M_next, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_num_elements, and INTERP_KERNEL._Hashtable_node< _Val >._M_val.

template<class _Val , class _Key , class _HF , class _Ex , class _Eq , class _All >

void INTERP_KERNEL.hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::erase

(

const iterator &

__it

)

References INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_bkt_num(), INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_buckets, INTERP_KERNEL._Hashtable_iterator< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_cur, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_delete_node(), INTERP_KERNEL._Hashtable_node< _Val >._M_next, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_num_elements, and INTERP_KERNEL._Hashtable_node< _Val >._M_val.

template<class _Val , class _Key , class _HF , class _Ex , class _Eq , class _All >

void INTERP_KERNEL.hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::erase	(	iterator	__first,
		iterator	__last
	)

References INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_bkt_num(), INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_buckets, INTERP_KERNEL._Hashtable_iterator< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_cur, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_erase_bucket(), and INTERP_KERNEL._Hashtable_node< _Val >._M_val.

template<class _Val , class _Key , class _HF , class _Ex , class _Eq , class _All >

void INTERP_KERNEL.hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::erase

(

const const_iterator &

__it

)

References INTERP_KERNEL._Hashtable_const_iterator< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_cur, INTERP_KERNEL._Hashtable_const_iterator< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_ht, and INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.erase().

template<class _Val , class _Key , class _HF , class _Ex , class _Eq , class _All >

void INTERP_KERNEL.hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::erase	(	const_iterator	__first,
		const_iterator	__last
	)

References INTERP_KERNEL._Hashtable_const_iterator< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_cur, INTERP_KERNEL._Hashtable_const_iterator< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_ht, and INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.erase().

template<class _Val , class _Key , class _HF , class _Ex , class _Eq , class _All >

void INTERP_KERNEL.hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::resize

(

size_type

__num_elements_hint

)

References INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_bkt_num(), INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_buckets, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_delete_node(), INTERP_KERNEL._Hashtable_node< _Val >._M_next, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_next_size(), and INTERP_KERNEL._Hashtable_node< _Val >._M_val.

template<class _Val , class _Key , class _HF , class _Ex , class _Eq , class _All >

void INTERP_KERNEL.hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::clear

(

)

References INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_buckets, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_delete_node(), INTERP_KERNEL._Hashtable_node< _Val >._M_next, and INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_num_elements.

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

size_type INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_next_size

(

size_type

__n

)

const [private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

void INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_initialize_buckets

(

size_type

__n

)

[private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

size_type INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_bkt_num_key

(

const key_type &

__key

)

const [private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

size_type INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_bkt_num

(

const value_type &

__obj

)

const [private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

size_type INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_bkt_num_key	(	const key_type &	__key,
		std::size_t	__n
	)			const [private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

size_type INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_bkt_num	(	const value_type &	__obj,
		std::size_t	__n
	)			const [private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

_Node* INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_new_node

(

const value_type &

__obj

)

[private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

void INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_delete_node

(

_Node *

__n

)

[private]

template<class _Val , class _Key , class _HF , class _Ex , class _Eq , class _All >

void INTERP_KERNEL.hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::_M_erase_bucket	(	const size_type	__n,
		_Node *	__first,
		_Node *	__last
	)			[private]

References INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_buckets, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_delete_node(), INTERP_KERNEL._Hashtable_node< _Val >._M_next, and INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_num_elements.

template<class _Val , class _Key , class _HF , class _Ex , class _Eq , class _All >

void INTERP_KERNEL.hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::_M_erase_bucket	(	const size_type	__n,
		_Node *	__last
	)			[private]

References INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_buckets, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_delete_node(), INTERP_KERNEL._Hashtable_node< _Val >._M_next, and INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_num_elements.

template<class _Val , class _Key , class _HF , class _Ex , class _Eq , class _All >

void INTERP_KERNEL.hashtable< _Val, _Key, _HF, _Ex, _Eq, _All >::_M_copy_from

(

const hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc > &

__ht

)

[private]

References INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_buckets, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_new_node(), INTERP_KERNEL._Hashtable_node< _Val >._M_next, INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_num_elements, INTERP_KERNEL._Hashtable_node< _Val >._M_val, and INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >.clear().

---

Friends And Related Function Documentation

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

friend struct _Hashtable_iterator< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc > [friend]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

friend struct _Hashtable_const_iterator< _Val, _Key, _HashFcn, _ExtractKey,_EqualKey, _Alloc > [friend]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

template<class _Vl , class _Ky , class _HF , class _Ex , class _Eq , class _Al >

bool operator==	(	const hashtable< _Vl, _Ky, _HF, _Ex, _Eq, _Al > &	,
		const hashtable< _Vl, _Ky, _HF, _Ex, _Eq, _Al > &
	)			[friend]

---

Field Documentation

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

_Node_Alloc INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_node_allocator [private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

hasher INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_hash [private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

key_equal INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_equals [private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

_ExtractKey INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_get_key [private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

_Vector_type INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_buckets [private]

template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc>

size_type INTERP_KERNEL.hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >._M_num_elements [private]