HashTable< T, Key > Class Template Reference

Hash table. More...

#include <givhashtable.h>

Data Structures
struct	_E
class	Iterator
class	IteratorKey

Public Member Functions
	HashTable (int n=0)
void	allocate (int n)
	~HashTable ()
void	freeing ()
void	insert (const T &item, const Key &k)
void	insertLast (const T &item, const Key &k)
void	insertFront (const T &item, const Key &k)
void	remove (const Key &k)
void	removeall ()
int	get (T &item, const Key &k) const
int	getrmv (T &item, const Key &k)
int	num_item (const Key &k) const

Data Fields
int	num
_E **	tabH
_E **	tabE

Detailed Description

template<class T, class Key>
class Givaro::HashTable< T, Key >

Hash table.

Constructor & Destructor Documentation

HashTable()

template<class T, class Key>

HashTable

(

int

n = 0

)

~HashTable()

template<class T, class Key>

~HashTable

(

)

Member Function Documentation

allocate()

template<class T, class Key>

void allocate

(

int

n

)

freeing()

template<class T, class Key>

void freeing

(

)

insert()

template<class T, class Key>

void insert	(	const T &	item,
		const Key &	k )

insertLast()

template<class T, class Key>

void insertLast	(	const T &	item,
		const Key &	k )

insertFront()

template<class T, class Key>

void insertFront	(	const T &	item,
		const Key &	k )

remove()

template<class T, class Key>

void remove

(

const Key &

k

)

removeall()

template<class T, class Key>

void removeall

(

)

get()

template<class T, class Key>

int get	(	T &	item,
		const Key &	k ) const

getrmv()

template<class T, class Key>

int getrmv	(	T &	item,
		const Key &	k )

num_item()

template<class T, class Key>

int num_item

(

const Key &

k

)

const

Field Documentation

num

template<class T, class Key>

int num

tabH

template<class T, class Key>

_E** tabH

tabE

template<class T, class Key>

_E** tabE

---

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

• givhashtable.h
• givhashtable.inl