Export of internal Abseil changes.
-- 4eacae3ff1b14b1d309e8092185bc10e8a6203cf by Derek Mauro <dmauro@google.com>: Release SwissTable - a fast, efficient, cache-friendly hash table. https://www.youtube.com/watch?v=ncHmEUmJZf4 PiperOrigin-RevId: 214816527 -- df8c3dfab3cfb2f4365909a84d0683b193cfbb11 by Derek Mauro <dmauro@google.com>: Internal change PiperOrigin-RevId: 214785288 -- 1eabd5266bbcebc33eecc91e5309b751856a75c8 by Abseil Team <absl-team@google.com>: Internal change PiperOrigin-RevId: 214722931 -- 2ebbfac950f83146b46253038e7dd7dcde9f2951 by Derek Mauro <dmauro@google.com>: Internal change PiperOrigin-RevId: 214701684 GitOrigin-RevId: 4eacae3ff1b14b1d309e8092185bc10e8a6203cf Change-Id: I9ba64e395b22ad7863213d157b8019b082adc19d
This commit is contained in:
parent
e291c279e4
commit
48cd2c3f35
55 changed files with 18696 additions and 0 deletions
150
absl/container/internal/hash_generator_testing.h
Normal file
150
absl/container/internal/hash_generator_testing.h
Normal file
|
|
@ -0,0 +1,150 @@
|
|||
// Copyright 2018 The Abseil Authors.
|
||||
//
|
||||
// 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.
|
||||
//
|
||||
// Generates random values for testing. Specialized only for the few types we
|
||||
// care about.
|
||||
|
||||
#ifndef ABSL_CONTAINER_INTERNAL_HASH_GENERATOR_TESTING_H_
|
||||
#define ABSL_CONTAINER_INTERNAL_HASH_GENERATOR_TESTING_H_
|
||||
|
||||
#include <stdint.h>
|
||||
#include <algorithm>
|
||||
#include <iosfwd>
|
||||
#include <random>
|
||||
#include <tuple>
|
||||
#include <type_traits>
|
||||
#include <utility>
|
||||
|
||||
#include "absl/container/internal/hash_policy_testing.h"
|
||||
#include "absl/meta/type_traits.h"
|
||||
#include "absl/strings/string_view.h"
|
||||
|
||||
namespace absl {
|
||||
namespace container_internal {
|
||||
namespace hash_internal {
|
||||
namespace generator_internal {
|
||||
|
||||
template <class Container, class = void>
|
||||
struct IsMap : std::false_type {};
|
||||
|
||||
template <class Map>
|
||||
struct IsMap<Map, absl::void_t<typename Map::mapped_type>> : std::true_type {};
|
||||
|
||||
} // namespace generator_internal
|
||||
|
||||
std::mt19937_64* GetThreadLocalRng();
|
||||
|
||||
enum Enum {
|
||||
kEnumEmpty,
|
||||
kEnumDeleted,
|
||||
};
|
||||
|
||||
enum class EnumClass : uint64_t {
|
||||
kEmpty,
|
||||
kDeleted,
|
||||
};
|
||||
|
||||
inline std::ostream& operator<<(std::ostream& o, const EnumClass& ec) {
|
||||
return o << static_cast<uint64_t>(ec);
|
||||
}
|
||||
|
||||
template <class T, class E = void>
|
||||
struct Generator;
|
||||
|
||||
template <class T>
|
||||
struct Generator<T, typename std::enable_if<std::is_integral<T>::value>::type> {
|
||||
T operator()() const {
|
||||
std::uniform_int_distribution<T> dist;
|
||||
return dist(*GetThreadLocalRng());
|
||||
}
|
||||
};
|
||||
|
||||
template <>
|
||||
struct Generator<Enum> {
|
||||
Enum operator()() const {
|
||||
std::uniform_int_distribution<typename std::underlying_type<Enum>::type>
|
||||
dist;
|
||||
while (true) {
|
||||
auto variate = dist(*GetThreadLocalRng());
|
||||
if (variate != kEnumEmpty && variate != kEnumDeleted)
|
||||
return static_cast<Enum>(variate);
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
template <>
|
||||
struct Generator<EnumClass> {
|
||||
EnumClass operator()() const {
|
||||
std::uniform_int_distribution<
|
||||
typename std::underlying_type<EnumClass>::type>
|
||||
dist;
|
||||
while (true) {
|
||||
EnumClass variate = static_cast<EnumClass>(dist(*GetThreadLocalRng()));
|
||||
if (variate != EnumClass::kEmpty && variate != EnumClass::kDeleted)
|
||||
return static_cast<EnumClass>(variate);
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
template <>
|
||||
struct Generator<std::string> {
|
||||
std::string operator()() const;
|
||||
};
|
||||
|
||||
template <>
|
||||
struct Generator<absl::string_view> {
|
||||
absl::string_view operator()() const;
|
||||
};
|
||||
|
||||
template <>
|
||||
struct Generator<NonStandardLayout> {
|
||||
NonStandardLayout operator()() const {
|
||||
return NonStandardLayout(Generator<std::string>()());
|
||||
}
|
||||
};
|
||||
|
||||
template <class K, class V>
|
||||
struct Generator<std::pair<K, V>> {
|
||||
std::pair<K, V> operator()() const {
|
||||
return std::pair<K, V>(Generator<typename std::decay<K>::type>()(),
|
||||
Generator<typename std::decay<V>::type>()());
|
||||
}
|
||||
};
|
||||
|
||||
template <class... Ts>
|
||||
struct Generator<std::tuple<Ts...>> {
|
||||
std::tuple<Ts...> operator()() const {
|
||||
return std::tuple<Ts...>(Generator<typename std::decay<Ts>::type>()()...);
|
||||
}
|
||||
};
|
||||
|
||||
template <class U>
|
||||
struct Generator<U, absl::void_t<decltype(std::declval<U&>().key()),
|
||||
decltype(std::declval<U&>().value())>>
|
||||
: Generator<std::pair<
|
||||
typename std::decay<decltype(std::declval<U&>().key())>::type,
|
||||
typename std::decay<decltype(std::declval<U&>().value())>::type>> {};
|
||||
|
||||
template <class Container>
|
||||
using GeneratedType = decltype(
|
||||
std::declval<const Generator<
|
||||
typename std::conditional<generator_internal::IsMap<Container>::value,
|
||||
typename Container::value_type,
|
||||
typename Container::key_type>::type>&>()());
|
||||
|
||||
} // namespace hash_internal
|
||||
} // namespace container_internal
|
||||
} // namespace absl
|
||||
|
||||
#endif // ABSL_CONTAINER_INTERNAL_HASH_GENERATOR_TESTING_H_
|
||||
Loading…
Add table
Add a link
Reference in a new issue