hash_map< K, T > Class Template Reference

Public Types
typedef unsigned int	size_type
typedef std::pair< const K, T >	value_type
typedef hash_map_iterator	iterator
typedef hash_map_iterator	const_iterator
Public Member Functions
	hash_map (const T &dv=T(), size_type n=107)
	~hash_map ()
void	set_load (float m=0.7, float g=1.7)
size_type	size () const
size_type	bucket_count () const
void	resize (size_type s)
T &	operator[] (const K &key)
iterator	find (const K &key) const
size_type	erase (const K &key)
void	clear ()
iterator	end () const
Data Structures
struct	Entry
class	hash_map_iterator

---

Detailed Description

template<class K, class T>
class hash_map< K, T >

Definition at line 25 of file hash_map.icc.

---

Member Typedef Documentation

template<class K, class T>

typedef hash_map_iterator hash_map< K, T >::const_iterator

Definition at line 52 of file hash_map.icc.

template<class K, class T>

typedef hash_map_iterator hash_map< K, T >::iterator

Definition at line 51 of file hash_map.icc.

template<class K, class T>

typedef unsigned int hash_map< K, T >::size_type

Definition at line 49 of file hash_map.icc.

template<class K, class T>

typedef std::pair<const K,T> hash_map< K, T >::value_type

Definition at line 50 of file hash_map.icc.

---

Constructor & Destructor Documentation

template<class K, class T>

hash_map< K, T >::hash_map	(	const T &	dv = T(),
		size_type	n = 107
	)			[inline]

Definition at line 83 of file hash_map.icc.

References CLHEP::detail::n, hash_map< K, T >::resize(), and hash_map< K, T >::set_load().

    : table(0), cur_size(0), max_size(0), default_value(dv)
  {
    set_load();
    resize(n);
  }

template<class K, class T>

hash_map< K, T >::~hash_map

(

)

[inline]

Definition at line 91 of file hash_map.icc.

References CLHEP::detail::n, and hash_map< K, T >::Entry::next.

              {
    for(size_type i=0; i<max_size; i++) {
      Entry* n = table[i];
      while(n) { Entry* p = n; n = p->next; delete p; }
    }
    delete [] table;
  }    

---

Member Function Documentation

template<class K, class T>

size_type hash_map< K, T >::bucket_count

(

)

const [inline]

Definition at line 106 of file hash_map.icc.

{ return max_size; }

template<class K, class T>

void hash_map< K, T >::clear

(

)

[inline]

Definition at line 171 of file hash_map.icc.

References G4InuclParticleNames::pp.

               {
    for(size_type i=0; i<max_size; i++) {
      for (Entry* p=table[i]; p;) {
        Entry* pp = p; p = p->next; delete pp;
      }
    table[i] = 0;
    }
    cur_size = 0;
  }

template<class K, class T>

iterator hash_map< K, T >::end

(

)

const [inline]

Definition at line 182 of file hash_map.icc.

Referenced by hash_map< K, T >::find().

{ return iterator(); }

template<class K, class T>

size_type hash_map< K, T >::erase

(

const K &

key

)

[inline]

Definition at line 152 of file hash_map.icc.

References hash_map< K, T >::Entry::data, hash_map< K, T >::Entry::next, and G4InuclParticleNames::pp.

                                 {
    size_type i = hash(key) % max_size;
    Entry* p = table[i];
    if (p == 0) return 0;
    if (eq(key,p->data.first)) {
      table[i] = p->next; delete p; cur_size--; return 1;
    }
    Entry** pp = &table[i];
    for (p=p->next; p; p=p->next) {
      if (eq(key,p->data.first)) {
        *pp = p->next; delete p; cur_size--; return 1;
      }else{
        pp = &(p->next);
      }
    }
    return 0;
  }

template<class K, class T>

iterator hash_map< K, T >::find

(

const K &

key

)

const [inline]

Definition at line 143 of file hash_map.icc.

References hash_map< K, T >::end(), and hash_map< K, T >::Entry::next.

                                     {
    size_type i = hash(key) % max_size;
    for (Entry* p=table[i]; p; p=p->next) {
      if (eq(key,p->data.first)) return iterator(*p);
    }
    return end();
  }

template<class K, class T>

T& hash_map< K, T >::operator[]

(

const K &

key

)

[inline]

Definition at line 129 of file hash_map.icc.

References hash_map< K, T >::Entry::data, and hash_map< K, T >::resize().

                                {
    size_type i = hash(key) % max_size;
    for (Entry* p=table[hash(key) % max_size]; p; p=p->next) {
      if (eq(key,p->data.first)) return p->data.second;
    }
    if (cur_size++ >= max_size*max_load) {
      resize(size_type(max_size*grow));
      i = hash(key) % max_size;
    }
    table[i] = new Entry(key, default_value, table[i]);
    return table[i]->data.second;
  }

template<class K, class T>

void hash_map< K, T >::resize

(

size_type

s

)

[inline]

Definition at line 109 of file hash_map.icc.

References CLHEP::detail::n, and hash_map< K, T >::Entry::next.

Referenced by hash_map< K, T >::hash_map(), and hash_map< K, T >::operator[]().

                           {
    if (s <= max_size) return;
    Entry** tmp = table;
    table = new Entry* [s];
    for (size_type k=0; k<s; k++) table[k] = 0;
    for (size_type i=0; i<max_size; i++) {
      Entry* n = tmp[i];
      while(n) {
        Entry* p = n;
        n = p->next;
        size_type ii = hash(p->data.first) % s;
        p->next = table[ii];
        table[ii] = p;
      }
    }
    max_size = s;
    delete [] tmp;
  }

template<class K, class T>

void hash_map< K, T >::set_load	(	float	m = 0.7,
		float	g = 1.7
	)			[inline]

Definition at line 100 of file hash_map.icc.

Referenced by hash_map< K, T >::hash_map().

{ max_load = m; grow = g; } 

template<class K, class T>

size_type hash_map< K, T >::size

(

)

const [inline]

Definition at line 103 of file hash_map.icc.

{ return cur_size; }

---

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

• hash_map.icc

---