Lines Matching refs:hash_set
69 HashSet<std::string, IsEmptyFnString> hash_set; in TEST_F() local
71 ASSERT_TRUE(hash_set.empty()); in TEST_F()
72 ASSERT_EQ(hash_set.size(), 0U); in TEST_F()
73 hash_set.insert(test_string); in TEST_F()
74 auto it = hash_set.find(test_string); in TEST_F()
76 auto after_it = hash_set.erase(it); in TEST_F()
77 ASSERT_TRUE(after_it == hash_set.end()); in TEST_F()
78 ASSERT_TRUE(hash_set.empty()); in TEST_F()
79 ASSERT_EQ(hash_set.size(), 0U); in TEST_F()
80 it = hash_set.find(test_string); in TEST_F()
81 ASSERT_TRUE(it == hash_set.end()); in TEST_F()
85 HashSet<std::string, IsEmptyFnString> hash_set; in TEST_F() local
91 hash_set.insert(strings[i]); in TEST_F()
92 auto it = hash_set.find(strings[i]); in TEST_F()
93 ASSERT_TRUE(it != hash_set.end()); in TEST_F()
96 ASSERT_EQ(strings.size(), hash_set.size()); in TEST_F()
99 auto it = hash_set.find(strings[i]); in TEST_F()
100 ASSERT_TRUE(it != hash_set.end()); in TEST_F()
102 hash_set.erase(it); in TEST_F()
106 auto it = hash_set.find(strings[i]); in TEST_F()
107 ASSERT_TRUE(it == hash_set.end()); in TEST_F()
110 auto it = hash_set.find(strings[i]); in TEST_F()
111 ASSERT_TRUE(it != hash_set.end()); in TEST_F()
117 HashSet<std::string, IsEmptyFnString> hash_set; in TEST_F() local
118 ASSERT_TRUE(hash_set.begin() == hash_set.end()); in TEST_F()
124 hash_set.insert(strings[i]); in TEST_F()
128 for (const std::string& s : hash_set) { in TEST_F()
136 for (auto it = hash_set.begin(); it != hash_set.end();) { in TEST_F()
138 it = hash_set.erase(it); in TEST_F()
139 ASSERT_EQ(hash_set.Verify(), 0U); in TEST_F()
164 HashSet<std::string, IsEmptyFnString> hash_set; in TEST_F() local
168 hash_set.insert(strings[i]); in TEST_F()
171 hash_set.ShrinkToMaximumLoad(); in TEST_F()
172 const double initial_load = hash_set.CalculateLoadFactor(); in TEST_F()
179 hash_set.insert(random_strings[i]); in TEST_F()
184 hash_set.erase(hash_set.find(random_strings[i])); in TEST_F()
187 const double bad_load = hash_set.CalculateLoadFactor(); in TEST_F()
191 hash_set.ShrinkToMaximumLoad(); in TEST_F()
192 EXPECT_DOUBLE_EQ(initial_load, hash_set.CalculateLoadFactor()); in TEST_F()
196 EXPECT_NE(hash_set.end(), hash_set.find(initial_string)) in TEST_F()
202 HashSet<std::string, IsEmptyFnString> hash_set; in TEST_F() local
206 hash_set.insert(RandomString(i % 10 + 1)); in TEST_F()
209 EXPECT_GE(hash_set.CalculateLoadFactor() + kEpsilon, hash_set.GetMinLoadFactor()); in TEST_F()
210 EXPECT_LE(hash_set.CalculateLoadFactor() - kEpsilon, hash_set.GetMaxLoadFactor()); in TEST_F()
211 hash_set.SetLoadFactor(0.1, 0.3); in TEST_F()
212 EXPECT_DOUBLE_EQ(0.1, hash_set.GetMinLoadFactor()); in TEST_F()
213 EXPECT_DOUBLE_EQ(0.3, hash_set.GetMaxLoadFactor()); in TEST_F()
214 EXPECT_LE(hash_set.CalculateLoadFactor() - kEpsilon, hash_set.GetMaxLoadFactor()); in TEST_F()
215 hash_set.SetLoadFactor(0.6, 0.8); in TEST_F()
216 EXPECT_LE(hash_set.CalculateLoadFactor() - kEpsilon, hash_set.GetMaxLoadFactor()); in TEST_F()
220 HashSet<std::string, IsEmptyFnString> hash_set; in TEST_F() local
233 ASSERT_EQ(hash_set.size(), std_set.size()); in TEST_F()
235 static_cast<ssize_t>(hash_set.size())); in TEST_F()
238 hash_set.clear(); in TEST_F()
240 ASSERT_TRUE(hash_set.empty()); in TEST_F()
245 hash_set.insert(s); in TEST_F()
247 ASSERT_EQ(*hash_set.find(s), *std_set.find(s)); in TEST_F()
250 auto it1 = hash_set.find(s); in TEST_F()
252 ASSERT_EQ(it1 == hash_set.end(), it2 == std_set.end()); in TEST_F()
253 if (it1 != hash_set.end()) { in TEST_F()
255 hash_set.erase(it1); in TEST_F()
329 HashSet<std::vector<int>, IsEmptyFnVectorInt, VectorIntHashEquals, VectorIntHashEquals> hash_set; in TEST_F() local
330 hash_set.insert(std::vector<int>({1, 2, 3, 4})); in TEST_F()
331 hash_set.insert(std::vector<int>({4, 2})); in TEST_F()
332 ASSERT_EQ(hash_set.end(), hash_set.find(std::vector<int>({1, 1, 1, 1}))); in TEST_F()
333 ASSERT_NE(hash_set.end(), hash_set.find(std::vector<int>({1, 2, 3, 4}))); in TEST_F()
334 ASSERT_EQ(hash_set.end(), hash_set.find(std::forward_list<int>({1, 1, 1, 1}))); in TEST_F()
335 ASSERT_NE(hash_set.end(), hash_set.find(std::forward_list<int>({1, 2, 3, 4}))); in TEST_F()
339 HashSet<std::string, IsEmptyFnString> hash_set; in TEST_F() local
342 hash_set.reserve(size); in TEST_F()
343 const size_t buckets_before = hash_set.NumBuckets(); in TEST_F()
345 CHECK_GE(hash_set.ElementsUntilExpand(), size); in TEST_F()
348 while (hash_set.size() < size) { in TEST_F()
349 hash_set.insert(std::to_string(hash_set.size())); in TEST_F()
351 CHECK_EQ(hash_set.NumBuckets(), buckets_before); in TEST_F()
355 hash_set.reserve(size); in TEST_F()
356 CHECK_GE(hash_set.ElementsUntilExpand(), size); in TEST_F()
361 HashSet<std::string> hash_set; in TEST_F() local
362 HashSet<std::string>::iterator it = hash_set.insert(test_string).first; in TEST_F()
370 HashSet<std::string> hash_set; in TEST_F() local
371 HashSet<std::string>::iterator insert_pos = hash_set.insert(test_string).first; in TEST_F()
372 HashSet<std::string>::iterator it = hash_set.find(std::string_view(test_string)); in TEST_F()
378 HashSet<std::string> hash_set; in TEST_F() local
379 hash_set.insert(test_string); in TEST_F()
380 hash_set.insert(test_string); in TEST_F()
381 ASSERT_EQ(1u, hash_set.size()); in TEST_F()