blob: 4213b32490cddf1546176a4e72d6afe1b747fd6c [file] [log] [blame]
// Copyright 2022 The Tint 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.
#include "src/tint/utils/hashset.h"
#include <array>
#include <random>
#include <string>
#include <tuple>
#include <unordered_set>
#include "gmock/gmock.h"
namespace tint::utils {
namespace {
constexpr std::array kPrimes{
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53,
59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131,
137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223,
227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311,
313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409,
};
TEST(Hashset, Empty) {
Hashset<std::string, 8> set;
EXPECT_EQ(set.Count(), 0u);
}
TEST(Hashset, AddRemove) {
Hashset<std::string, 8> set;
EXPECT_TRUE(set.Add("hello"));
EXPECT_EQ(set.Count(), 1u);
EXPECT_TRUE(set.Contains("hello"));
EXPECT_FALSE(set.Contains("world"));
EXPECT_FALSE(set.Add("hello"));
EXPECT_EQ(set.Count(), 1u);
EXPECT_TRUE(set.Remove("hello"));
EXPECT_EQ(set.Count(), 0u);
EXPECT_FALSE(set.Contains("hello"));
EXPECT_FALSE(set.Contains("world"));
}
TEST(Hashset, AddMany) {
Hashset<int, 8> set;
for (size_t i = 0; i < kPrimes.size(); i++) {
int prime = kPrimes[i];
ASSERT_TRUE(set.Add(prime)) << "i: " << i;
ASSERT_FALSE(set.Add(prime)) << "i: " << i;
ASSERT_EQ(set.Count(), i + 1);
set.ValidateIntegrity();
}
ASSERT_EQ(set.Count(), kPrimes.size());
for (int prime : kPrimes) {
ASSERT_TRUE(set.Contains(prime)) << prime;
}
}
TEST(Hashset, Iterator) {
Hashset<std::string, 8> set;
set.Add("one");
set.Add("four");
set.Add("three");
set.Add("two");
EXPECT_THAT(set, testing::UnorderedElementsAre("one", "two", "three", "four"));
}
TEST(Hashset, Soak) {
std::mt19937 rnd;
std::unordered_set<std::string> reference;
Hashset<std::string, 8> set;
for (size_t i = 0; i < 1000000; i++) {
std::string value = std::to_string(rnd() & 0x100);
switch (rnd() % 8) {
case 0: { // Add
auto expected = reference.emplace(value).second;
ASSERT_EQ(set.Add(value), expected) << "i: " << i;
ASSERT_TRUE(set.Contains(value)) << "i: " << i;
break;
}
case 1: { // Replace
reference.emplace(value);
set.Replace(value);
ASSERT_TRUE(set.Contains(value)) << "i: " << i;
break;
}
case 2: { // Remove
auto expected = reference.erase(value) != 0;
ASSERT_EQ(set.Remove(value), expected) << "i: " << i;
ASSERT_FALSE(set.Contains(value)) << "i: " << i;
break;
}
case 3: { // Contains
auto expected = reference.count(value) != 0;
ASSERT_EQ(set.Contains(value), expected) << "i: " << i;
break;
}
case 4: { // Get
if (reference.count(value) != 0) {
ASSERT_TRUE(set.Get(value).has_value()) << "i: " << i;
ASSERT_EQ(set.Get(value), value) << "i: " << i;
} else {
ASSERT_FALSE(set.Get(value).has_value()) << "i: " << i;
}
break;
}
case 5: { // Find
if (reference.count(value) != 0) {
ASSERT_EQ(*set.Find(value), value) << "i: " << i;
} else {
ASSERT_EQ(set.Find(value), nullptr) << "i: " << i;
}
break;
}
case 6: { // Copy / Move
Hashset<std::string, 8> tmp(set);
set = std::move(tmp);
break;
}
case 7: { // Clear
reference.clear();
set.Clear();
break;
}
}
set.ValidateIntegrity();
}
}
} // namespace
} // namespace tint::utils