HashMap.h

Go to the documentation of this file.

/* Frobby: Software for monomial ideal computations.
   Copyright (C) 2009 University of Aarhus
   Contact Bjarke Hammersholt Roune for license information (www.broune.com)
 
   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2 of the License, or
   (at your option) any later version.
 
   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.
 
   You should have received a copy of the GNU General Public License
   along with this program.  If not, see http://www.gnu.org/licenses/.
*/
#ifndef HASH_MAP_GUARD
#define HASH_MAP_GUARD
 
template<class Key>
class FrobbyHash {};
 
// *********************************************************
#if defined(__GNUC__) || defined(__clang__)
#if 0
#include "hash_map/hash_map"
#include <string>
#endif
#include <unordered_map>
template<class Key, class Value>
  class HashMap : public std::unordered_map<Key, Value, FrobbyHash<Key>> { };
 
#if 0
template<>
class FrobbyHash<string> : public __gnu_cxx::hash<string> {
};
 
template<class Key, class Value>
class HashMap : public __gnu_cxx::hash_map<Key, Value,
  FrobbyHash<Key> > {
};
#endif
#else
// *********************************************************
#ifdef _MSC_VER // Only Microsoft C++ defines this macro
#include <hash_map>
#include <string>
 
template<class Key>
class HashWrapper : public stdext::hash_compare<Key, ::std::less<Key> >, FrobbyHash<Key> {
public:
  size_t operator()(const Key& key) const {
    return FrobbyHash<typename Key>::operator()(key);
  }
 
  bool operator()(const Key& a, const Key& b) const {
    return stdext::hash_compare<Key, ::std::less<Key> >::operator()(a, b);
  }
};
 
template<>
class HashWrapper<string> : public stdext::hash_compare<string, ::std::less<string> > {
};
 
template<class Key, class Value>
class HashMap : public stdext::hash_map<Key, Value, HashWrapper<Key> > {
};
 
// *********************************************************
#else // Fall-back for unknown compilers
#include <map>
template<class Key, class Value>
class HashMap :
  #if __cplusplus < 201103
       public std::map<Key, Value>
  #else
       public std::unordered_map<Key, Value>
#endif
{};
#endif
#endif
 
 
#endif