kakoune/src/hash.hh

64 lines
1.3 KiB
C++
Raw Normal View History

#ifndef hash_hh_INCLUDED
#define hash_hh_INCLUDED
#include <type_traits>
#include <functional>
2015-02-02 19:46:55 +01:00
#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>
typename std::enable_if<std::is_enum<Type>::value, size_t>::type
hash_value(const Type& val)
{
return hash_value((typename std::underlying_type<Type>::type)val);
}
template<typename Type>
size_t hash_values(Type&& t)
{
return hash_value(std::forward<Type>(t));
}
2015-06-20 16:04:31 +02:00
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)...);
2015-06-20 16:04:31 +02:00
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);
}
};
}
#endif // hash_hh_INCLUDED