48cd2c3f35
-- 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
88 lines
3 KiB
C++
88 lines
3 KiB
C++
// 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.
|
|
|
|
#ifndef ABSL_CONTAINER_INTERNAL_UNORDERED_SET_LOOKUP_TEST_H_
|
|
#define ABSL_CONTAINER_INTERNAL_UNORDERED_SET_LOOKUP_TEST_H_
|
|
|
|
#include "gmock/gmock.h"
|
|
#include "gtest/gtest.h"
|
|
#include "absl/container/internal/hash_generator_testing.h"
|
|
#include "absl/container/internal/hash_policy_testing.h"
|
|
|
|
namespace absl {
|
|
namespace container_internal {
|
|
|
|
template <class UnordSet>
|
|
class LookupTest : public ::testing::Test {};
|
|
|
|
TYPED_TEST_CASE_P(LookupTest);
|
|
|
|
TYPED_TEST_P(LookupTest, Count) {
|
|
using T = hash_internal::GeneratedType<TypeParam>;
|
|
std::vector<T> values;
|
|
std::generate_n(std::back_inserter(values), 10,
|
|
hash_internal::Generator<T>());
|
|
TypeParam m;
|
|
for (const auto& v : values)
|
|
EXPECT_EQ(0, m.count(v)) << ::testing::PrintToString(v);
|
|
m.insert(values.begin(), values.end());
|
|
for (const auto& v : values)
|
|
EXPECT_EQ(1, m.count(v)) << ::testing::PrintToString(v);
|
|
}
|
|
|
|
TYPED_TEST_P(LookupTest, Find) {
|
|
using T = hash_internal::GeneratedType<TypeParam>;
|
|
std::vector<T> values;
|
|
std::generate_n(std::back_inserter(values), 10,
|
|
hash_internal::Generator<T>());
|
|
TypeParam m;
|
|
for (const auto& v : values)
|
|
EXPECT_TRUE(m.end() == m.find(v)) << ::testing::PrintToString(v);
|
|
m.insert(values.begin(), values.end());
|
|
for (const auto& v : values) {
|
|
typename TypeParam::iterator it = m.find(v);
|
|
static_assert(std::is_same<const typename TypeParam::value_type&,
|
|
decltype(*it)>::value,
|
|
"");
|
|
static_assert(std::is_same<const typename TypeParam::value_type*,
|
|
decltype(it.operator->())>::value,
|
|
"");
|
|
EXPECT_TRUE(m.end() != it) << ::testing::PrintToString(v);
|
|
EXPECT_EQ(v, *it) << ::testing::PrintToString(v);
|
|
}
|
|
}
|
|
|
|
TYPED_TEST_P(LookupTest, EqualRange) {
|
|
using T = hash_internal::GeneratedType<TypeParam>;
|
|
std::vector<T> values;
|
|
std::generate_n(std::back_inserter(values), 10,
|
|
hash_internal::Generator<T>());
|
|
TypeParam m;
|
|
for (const auto& v : values) {
|
|
auto r = m.equal_range(v);
|
|
ASSERT_EQ(0, std::distance(r.first, r.second));
|
|
}
|
|
m.insert(values.begin(), values.end());
|
|
for (const auto& v : values) {
|
|
auto r = m.equal_range(v);
|
|
ASSERT_EQ(1, std::distance(r.first, r.second));
|
|
EXPECT_EQ(v, *r.first);
|
|
}
|
|
}
|
|
|
|
REGISTER_TYPED_TEST_CASE_P(LookupTest, Count, Find, EqualRange);
|
|
|
|
} // namespace container_internal
|
|
} // namespace absl
|
|
#endif // ABSL_CONTAINER_INTERNAL_UNORDERED_SET_LOOKUP_TEST_H_
|