hash_utility.h

Go to the documentation of this file.

// Author(s): Jan Friso Groote
// Copyright: see the accompanying file COPYING or copy at
// https://github.com/mCRL2org/mCRL2/blob/master/COPYING
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
 
#ifndef MCRL2_UTILITIES_HASH_UTILITY_H
#define MCRL2_UTILITIES_HASH_UTILITY_H
 
#include <cstddef>
#include <vector>
#include <map>
 
namespace mcrl2
{
namespace utilities
{
namespace detail
{
 
inline std::size_t hash_combine(const std::size_t h1, const std::size_t h2)
{
  // This hash function is inpired by boost.
  return h1 ^  (h2 + 0x9e3779b9 + (h1<<6) + (h1>>2));
}
 
inline std::size_t hash_combine_cheap(const std::size_t seed, const std::size_t hash_number)
{
  // Addition works better than xor, because xor maps equal inputs to 0 which
  // can lead to many collisions. However, with addition we also want to prevent
  // symmetry, i.e a + b equals b + a, so a relative cheap solution is to multiply
  // one side by a number. For this purpose we chose hnr + floor(2.5 * seed);
  return hash_number + (seed << 1) + (seed >> 1);
}
 
} //end namespace detail
} //end namespace utilities
} //end namespace mcrl2
 
namespace std
{
 
template <class X>
struct hash< std::vector < X > >
{
  std::size_t operator()(const std::vector < X >& v) const
  {
    hash<X> hasher;
    // This follows boost.
    std::size_t hash=0;
    for(const X& x: v)
    {
      hash = mcrl2::utilities::detail::hash_combine(hash,hasher(x)); 
    }
    return hash;
  }
};
 
template <class X, class Y>
struct hash< std::map < X, Y > >
{
  std::size_t operator()(const std::map < X, Y >& v) const
  {
    hash<X> hasher1;
    hash<Y> hasher2;
    // This follows boost.
    std::size_t hash=0;
    for(const std::pair< X, Y>& p: v)
    {
      hash = mcrl2::utilities::detail::hash_combine(hash,
                   mcrl2::utilities::detail::hash_combine(hasher1(p.first),
                                                          hasher2(p.second)));
    }
    return hash;
  }
};
 
template <class X, class Y>
struct hash< std::pair < X, Y > >
{
  hash() = default;
 
  std::size_t operator()(const std::pair < X, Y >& p) const
  {
    hash<X> hasher1;
    hash<Y> hasher2;
    
    return mcrl2::utilities::detail::hash_combine(hasher1(p.first),hasher2(p.second));
  }
};
 
} // namespace std
 
 
#endif // MCRL2_UTILITIES_HASH_UTILITY_H