hash.hpp

Go to the documentation of this file.

//    Copyright 2020-2025 Jij Inc.
 
//    Licensed under the Apache License, Version 2.0 (the "License");
//    you may not use this file except in compliance with the License.
//    You may obtain a copy of the License at
 
//        http://www.apache.org/licenses/LICENSE-2.0
 
//    Unless required by applicable law or agreed to in writing, software
//    distributed under the License is distributed on an "AS IS" BASIS,
//    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
//    See the License for the specific language governing permissions and
//    limitations under the License.
 
#pragma once
 
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>
 
template<typename T>
inline void hash_combine( std::size_t& seed, const T& val ) {
  std::hash<T> hasher;
  seed ^= hasher( val ) + 0x9e3779b9 + ( seed << 6 ) + ( seed >> 2 );
}
 
template<class... TupleArgs>
struct std::hash<std::tuple<TupleArgs...>> {
private:
  //  this is a termination condition
  //  N == sizeof...(TupleTypes)
  //
  template<size_t Idx, typename... TupleTypes>
  inline typename std::enable_if<Idx == sizeof...( TupleTypes ), void>::type
  hash_combine_tup( size_t& /*seed*/, const std::tuple<TupleTypes...>& /*tup*/ ) const {
  }
 
  //  this is the computation function
  //  continues till condition N < sizeof...(TupleTypes) holds
  //
  template<size_t Idx, typename... TupleTypes>
      inline typename std::enable_if < Idx<sizeof...( TupleTypes ), void>::type
      hash_combine_tup( size_t& seed, const std::tuple<TupleTypes...>& tup ) const {
    hash_combine( seed, std::get<Idx>( tup ) );
 
    //  on to next element
    hash_combine_tup<Idx + 1>( seed, tup );
  }
 
public:
  size_t operator()( const std::tuple<TupleArgs...>& tupleValue ) const {
    size_t seed = 0;
    //  begin with the first iteration
    hash_combine_tup<0>( seed, tupleValue );
    return seed;
  }
};
 
namespace cimod {
  struct pair_hash {
    template<class T1, class T2>
    std::size_t operator()( const std::pair<T1, T2>& p ) const {
      std::size_t lhs = std::hash<T1>()( p.first ), rhs = std::hash<T2>()( p.second );
      return lhs ^ ( rhs + 0x9e3779b9 + ( lhs << 6 ) + ( lhs >> 2 ) );
    }
  };
 
  struct vector_hash {
 
    template<class T>
    std::size_t operator()( const std::vector<T>& V ) const {
      std::size_t hash = V.size();
      for ( auto& i : V ) {
        hash ^= std::hash<T>()( i ) + 0x9e3779b9 + ( hash << 6 ) + ( hash >> 2 );
      }
      return hash;
    }
  };
 
} // namespace cimod