@@ -250,7 +250,7 @@ template <typename T>
250
250
struct hash <T, typename std::hash<T>::is_avalanching> {
251
251
using is_avalanching = void ;
252
252
auto operator ()(T const & obj) const noexcept (noexcept (std::declval<std::hash<T>>().operator()(std::declval<T const &>())))
253
- -> uint64_t {
253
+ -> std:: uint64_t {
254
254
return std::hash<T>{}(obj);
255
255
}
256
256
};
@@ -312,24 +312,24 @@ struct tuple_hash_helper {
312
312
// Converts the value into 64bit. If it is an integral type, just cast it. Mixing is doing the rest.
313
313
// If it isn't an integral we need to hash it.
314
314
template <typename Arg>
315
- [[nodiscard]] constexpr static auto to64 (Arg const & arg) -> uint64_t {
315
+ [[nodiscard]] constexpr static auto to64 (Arg const & arg) -> std:: uint64_t {
316
316
if constexpr (std::is_integral_v<Arg> || std::is_enum_v<Arg>) {
317
- return static_cast <uint64_t >(arg);
317
+ return static_cast <std:: uint64_t >(arg);
318
318
} else {
319
319
return hash<Arg>{}(arg);
320
320
}
321
321
}
322
322
323
- [[nodiscard]] static auto mix64 (uint64_t state, uint64_t v) -> uint64_t {
324
- return detail::wyhash::mix (state + v, uint64_t {0x9ddfea08eb382d69 });
323
+ [[nodiscard]] static auto mix64 (std:: uint64_t state, std:: uint64_t v) -> std:: uint64_t {
324
+ return detail::wyhash::mix (state + v, std:: uint64_t {0x9ddfea08eb382d69 });
325
325
}
326
326
327
327
// Creates a buffer that holds all the data from each element of the tuple. If possible we memcpy the data directly. If
328
328
// not, we hash the object and use this for the array. Size of the array is known at compile time, and memcpy is optimized
329
329
// away, so filling the buffer is highly efficient. Finally, call wyhash with this buffer.
330
330
template <typename T, std::size_t ... Idx>
331
- [[nodiscard]] static auto calc_hash (T const & t, std::index_sequence<Idx...>) noexcept -> uint64_t {
332
- auto h = uint64_t {};
331
+ [[nodiscard]] static auto calc_hash (T const & t, std::index_sequence<Idx...>) noexcept -> std:: uint64_t {
332
+ auto h = std:: uint64_t {};
333
333
((h = mix64 (h, to64 (std::get<Idx>(t)))), ...);
334
334
return h;
335
335
}
@@ -338,15 +338,15 @@ struct tuple_hash_helper {
338
338
template <typename ... Args>
339
339
struct hash <std::tuple<Args...>> : tuple_hash_helper<Args...> {
340
340
using is_avalanching = void ;
341
- auto operator ()(std::tuple<Args...> const & t) const noexcept -> uint64_t {
341
+ auto operator ()(std::tuple<Args...> const & t) const noexcept -> std:: uint64_t {
342
342
return tuple_hash_helper<Args...>::calc_hash (t, std::index_sequence_for<Args...>{});
343
343
}
344
344
};
345
345
346
346
template <typename A, typename B>
347
347
struct hash <std::pair<A, B>> : tuple_hash_helper<A, B> {
348
348
using is_avalanching = void ;
349
- auto operator ()(std::pair<A, B> const & t) const noexcept -> uint64_t {
349
+ auto operator ()(std::pair<A, B> const & t) const noexcept -> std:: uint64_t {
350
350
return tuple_hash_helper<A, B>::calc_hash (t, std::index_sequence_for<A, B>{});
351
351
}
352
352
};
@@ -968,7 +968,7 @@ class table : public std::conditional_t<is_map_v<T>, base_table_type_map<T>, bas
968
968
if constexpr (has_reserve<bucket_container_type>) {
969
969
m_buckets.reserve (num_buckets);
970
970
}
971
- for (size_t i = m_buckets.size (); i < num_buckets; ++i) {
971
+ for (std:: size_t i = m_buckets.size (); i < num_buckets; ++i) {
972
972
m_buckets.emplace_back ();
973
973
}
974
974
} else {
0 commit comments