hpp::fcl::detail::SparseHashTable< Key, Data, HashFnc, TableT > Class Template Reference

A hash table implemented using unordered_map. More...

#include <hpp/fcl/broadphase/detail/sparse_hash_table.h>

Collaboration diagram for hpp::fcl::detail::SparseHashTable< Key, Data, HashFnc, TableT >:

Public Member Functions
	SparseHashTable (const HashFnc &h)
void	init (size_t)
	Init the hash table. The bucket size is dynamically decided. More...
void	insert (Key key, Data value)
	insert one key-value pair into the hash table More...
std::vector< Data >	query (Key key) const
	find the elements whose key is the same as the query More...
void	remove (Key key, Data value)
	remove one key-value pair from the hash table More...
void	clear ()
	clear the hash table More...

Protected Types
typedef std::list< Data >	Bin
typedef TableT< size_t, Bin >	Table

Protected Attributes
HashFnc	h_
Table	table_

Detailed Description

template<typename Key, typename Data, typename HashFnc, template< typename, typename > class TableT = unordered_map_hash_table>
class hpp::fcl::detail::SparseHashTable< Key, Data, HashFnc, TableT >

A hash table implemented using unordered_map.

Member Typedef Documentation

Bin

template<typename Key , typename Data , typename HashFnc , template< typename, typename > class TableT = unordered_map_hash_table>

typedef std::list<Data> hpp::fcl::detail::SparseHashTable< Key, Data, HashFnc, TableT >::Bin

protected

Table

template<typename Key , typename Data , typename HashFnc , template< typename, typename > class TableT = unordered_map_hash_table>

typedef TableT<size_t, Bin> hpp::fcl::detail::SparseHashTable< Key, Data, HashFnc, TableT >::Table

protected

Constructor & Destructor Documentation

SparseHashTable()

template<typename Key , typename Data , typename HashFnc , template< typename, typename > class TableT>

hpp::fcl::detail::SparseHashTable< Key, Data, HashFnc, TableT >::SparseHashTable

(

const HashFnc &

h

)

Member Function Documentation

clear()

template<typename Key , typename Data , typename HashFnc , template< typename, typename > class TableT>

void hpp::fcl::detail::SparseHashTable< Key, Data, HashFnc, TableT >::clear

clear the hash table

init()

template<typename Key , typename Data , typename HashFnc , template< typename, typename > class TableT>

void hpp::fcl::detail::SparseHashTable< Key, Data, HashFnc, TableT >::init

(

size_t

)

Init the hash table. The bucket size is dynamically decided.

insert()

template<typename Key , typename Data , typename HashFnc , template< typename, typename > class TableT>

void hpp::fcl::detail::SparseHashTable< Key, Data, HashFnc, TableT >::insert	(	Key	key,
		Data	value
	)

insert one key-value pair into the hash table

query()

template<typename Key , typename Data , typename HashFnc , template< typename, typename > class TableT>

std::vector< Data > hpp::fcl::detail::SparseHashTable< Key, Data, HashFnc, TableT >::query

(

Key

key

)

const

find the elements whose key is the same as the query

remove()

template<typename Key , typename Data , typename HashFnc , template< typename, typename > class TableT>

void hpp::fcl::detail::SparseHashTable< Key, Data, HashFnc, TableT >::remove	(	Key	key,
		Data	value
	)

remove one key-value pair from the hash table

Member Data Documentation

h_

template<typename Key , typename Data , typename HashFnc , template< typename, typename > class TableT = unordered_map_hash_table>

HashFnc hpp::fcl::detail::SparseHashTable< Key, Data, HashFnc, TableT >::h_

protected

table_

template<typename Key , typename Data , typename HashFnc , template< typename, typename > class TableT = unordered_map_hash_table>

Table hpp::fcl::detail::SparseHashTable< Key, Data, HashFnc, TableT >::table_

protected

---

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

• include/hpp/fcl/broadphase/detail/sparse_hash_table.h
• include/hpp/fcl/broadphase/detail/sparse_hash_table-inl.h