Biomechanical Joint Model  Author: Anderson Maciel

---

hash_map.h

Go to the documentation of this file.

/*@#---------------------------------------------------------------------------
 PROJECT            : PHD THESIS
 MODULE             : PHYSICALLY-BASED DEFORMATION

 FILE               : hash_map.h
 CREATION DATE      : Mon Nov 29 12:10:54 MET 1999
 CREATION AUTHOR(S) : aubel 
 ------------------------------------------------------------------------------
 KEYWORD(S)         : marching cubes, voxelisation, volume
 DEFINED TYPE(S)    : HashMap
 RELATED TYPE(S)    : Voxel, Edge

 FUNCTIONALITY      : 
 ------------------------------------------------------------------------------
 LANGAGE            : Ansi C++
 SYSTEM             : UNIX V 6.x / SGI
 GRAPHIC LIBRARY    : SGI  
 ------------------------------------------------------------------------------
 PROJECT DIRECTOR   : D. THALMANN
 LAB                : EPFL- LIG
 --------------------------------------------------------------------------#@*/
#ifndef MC_HASH_MAP_VOXEL_H
#define MC_HASH_MAP_VOXEL_H

#include <vector>

//namespace MarchingCubes {

template <class T>
class HashMap
{
public:
   HashMap(int l=8, int m=8, int n=8) : l_(l), m_(m), n_(n), 
      elements( new vector<T> [l*m*n] ) {};   
   ~HashMap() { delete [] elements; };
      
   T& operator[](const idx3 &id);
   const T& operator[](const idx3 &id) const;  

private:
   int hash_func(const idx3 &id) const { return ((id.i%l_)*m_ + (id.j%m_))*n_ + id.k%n_; };
   
   vector<T> *elements;
   int l_, m_, n_;
};

template <class T>
T& HashMap<T>::operator[](const idx3 &id) 
{ 
   int index = hash_func(id);

   for (typename vector<T>::iterator it = elements[index].begin(); 
        it != elements[index].end(); it++)
   {      
      if (it->id == id) return *it;
   }

   // insert new element
   elements[index].push_back(T(id));
   return elements[index].back();
}

template <class T>
const T& HashMap<T>::operator[](const idx3 &id) const
{ 
   int index = hash_func(id);

   for ( typename vector<T>::iterator it = elements[index].begin(); 
        it != elements[index].end(); it++)
   {      
      if (it->id == id) return *it;
   }
   cout << "HashMap: cannot find element whose index is " << id << endl;
   exit(-1);
   // suppress cmpiler warning
   return elements[index][0];
}

//}
#endif

---