In This Package:

HashMap.h

Go to the documentation of this file.

// $Id: HashMap.h,v 1.7 2008/11/01 14:30:21 marcocle Exp $
#ifndef GAUDIKERNEL_HASHMAP_H
#define GAUDIKERNEL_HASHMAP_H 1

// Include files
#include "Map.h"
#include "Hash.h"

#if defined(_WIN32) || defined(__ICC) || defined(__ECC)
#include <hash_map>
#elif __GNUC__ < 4 || ( __GNUC__ == 4 && __GNUC_MINOR__ < 3 )
#include <ext/hash_map>
#elif __GNUC__ >= 4
// Marco Cl.: in gcc >= 4.3 the hash_map has been replaced by unordered_map
//#include <tr1/unordered_map>
//            but gccxml has problems with it
#include <ext/hash_map>
#endif

namespace GaudiUtils {

  template <typename K, typename T,
            typename H = Hash<K>,
#if defined(_WIN32)
// Marco Cl.: (work-around) it seems that Windows implementation of hash map is extremely slow
// we use a normal map instead.
//            typename M = stdext::hash_map<K,T,H>
            typename M = std::map<K,T>
#elif defined(__ICC) || defined(__ECC)
            typename M = std::hash_map<K,T,H>
#elif __GNUC__ < 4 || ( __GNUC__ == 4 && __GNUC_MINOR__ < 3 )
          typename M = __gnu_cxx::hash_map<K,T,H>
#elif __GNUC__ >= 4
// Marco Cl.: in gcc >= 4.3 the hash_map has been replaced by unordered_map
//          typename M = std::tr1::unordered_map<K,T,H>
          typename M = __gnu_cxx::hash_map<K,T,H>
//            but gccxml has problems with it
#endif
            >
  class HashMap: public Map<K,T,M> {

  public:
    typedef H hasher;

    inline hasher hash_funct() const {
// Marco Cl.: since on windows we are using a std::map, we have to provide a different implementation
// for GaudiUtils::HashMap::hash_funct(). (std::map::hash_funct does not exist)
#ifdef _WIN32
      return hasher();
#else
      return this->m_map.hash_funct();
#endif
    }
  };
} // namespace GaudiUtils

#endif // GAUDIKERNEL_GAUDIHASHMAP_H

---