unbounded_hashmap_traits< Key, Value > Struct Template Reference

#include <hash-map-traits.h>

Inheritance diagram for unbounded_hashmap_traits< Key, Value >:

Public Types
typedef Key::value_type	key_type

Static Public Member Functions
static hashval_t	hash (const typename Key::value_type &)
static bool	equal_keys (const typename Key::value_type &, const typename Key::compare_type &)
template<typename T >
static void	remove (T &)
template<typename T >
static bool	is_empty (const T &)
template<typename T >
static bool	is_deleted (const T &)
template<typename T >
static void	mark_empty (T &)
template<typename T >
static void	mark_deleted (T &)

Static Public Attributes
static const bool	empty_zero_p = default_hash_traits <Value>::empty_zero_p

Detailed Description

template<typename Key, typename Value>
struct unbounded_hashmap_traits< Key, Value >

Implement traits for a hash_map with keys of type Key and values of
type Value for cases in which the key cannot represent empty and
deleted slots.  Instead record empty and deleted entries in Value.   

Member Typedef Documentation

key_type

template<typename Key , typename Value >

Key::value_type unbounded_hashmap_traits< Key, Value >::key_type

Member Function Documentation

equal_keys()

template<typename Key , typename Value >

bool unbounded_hashmap_traits< Key, Value >::equal_keys ( const typename Key::value_type & x, const typename Key::compare_type & y )

inlinestatic

References y.

hash()

template<typename Key , typename Value >

hashval_t unbounded_hashmap_traits< Key, Value >::hash ( const typename Key::value_type & key )

inlinestatic

is_deleted()

template<typename Key , typename Value >

template<typename T >

bool unbounded_hashmap_traits< Key, Value >::is_deleted ( const T & entry )

inlinestatic

is_empty()

template<typename Key , typename Value >

template<typename T >

bool unbounded_hashmap_traits< Key, Value >::is_empty ( const T & entry )

inlinestatic

mark_deleted()

template<typename Key , typename Value >

template<typename T >

void unbounded_hashmap_traits< Key, Value >::mark_deleted ( T & entry )

inlinestatic

mark_empty()

template<typename Key , typename Value >

template<typename T >

void unbounded_hashmap_traits< Key, Value >::mark_empty ( T & entry )

inlinestatic

remove()

template<typename Key , typename Value >

template<typename T >

void unbounded_hashmap_traits< Key, Value >::remove ( T & entry )

inlinestatic

Field Documentation

empty_zero_p

template<typename Key , typename Value >

const bool unbounded_hashmap_traits< Key, Value >::empty_zero_p = default_hash_traits <Value>::empty_zero_p

static

---

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

• hash-map-traits.h