72 lines
1.5 KiB
C++
72 lines
1.5 KiB
C++
#ifndef hash_hh_INCLUDED
|
|
#define hash_hh_INCLUDED
|
|
|
|
#include <type_traits>
|
|
#include <functional>
|
|
|
|
#include <cstddef>
|
|
|
|
namespace Kakoune
|
|
{
|
|
|
|
size_t hash_data(const char* data, size_t len);
|
|
|
|
template<typename... Type>
|
|
size_t hash_value(const Type&... val)
|
|
{
|
|
static_assert(sizeof...(Type) == 1, "");
|
|
return std::hash<Type...>()(val...);
|
|
}
|
|
|
|
template<typename Type>
|
|
std::enable_if_t<std::is_enum<Type>::value, size_t>
|
|
hash_value(const Type& val)
|
|
{
|
|
return hash_value((std::underlying_type_t<Type>)val);
|
|
}
|
|
|
|
template<typename Type>
|
|
size_t hash_values(Type&& t)
|
|
{
|
|
return hash_value(std::forward<Type>(t));
|
|
}
|
|
|
|
inline size_t combine_hash(size_t lhs, size_t rhs)
|
|
{
|
|
return lhs ^ (rhs + 0x9e3779b9 + (lhs << 6) + (lhs >> 2));
|
|
}
|
|
|
|
template<typename Type, typename... RemainingTypes>
|
|
size_t hash_values(Type&& t, RemainingTypes&&... rt)
|
|
{
|
|
size_t seed = hash_values(std::forward<RemainingTypes>(rt)...);
|
|
return combine_hash(seed, hash_value(std::forward<Type>(t)));
|
|
}
|
|
|
|
template<typename T1, typename T2>
|
|
size_t hash_value(const std::pair<T1, T2>& val)
|
|
{
|
|
return hash_values(val.first, val.second);
|
|
}
|
|
|
|
template<typename Type>
|
|
struct Hash
|
|
{
|
|
size_t operator()(const Type& val) const
|
|
{
|
|
return hash_value(val);
|
|
}
|
|
};
|
|
|
|
// Traits specifying if two types have compatible hashing, that is,
|
|
// if lhs == rhs => hash_value(lhs) == hash_value(rhs)
|
|
template<typename Lhs, typename Rhs>
|
|
constexpr bool HashCompatible = false;
|
|
|
|
template<typename T>
|
|
constexpr bool HashCompatible<T, T> = true;
|
|
|
|
}
|
|
|
|
#endif // hash_hh_INCLUDED
|