77   ASSERT_TRUE(after_it == hash_set.end());  in TEST_F()
81   ASSERT_TRUE(it == hash_set.end());  in TEST_F()
93     ASSERT_TRUE(it != hash_set.end());  in TEST_F()
100     ASSERT_TRUE(it != hash_set.end());  in TEST_F()
107     ASSERT_TRUE(it == hash_set.end());  in TEST_F()
111     ASSERT_TRUE(it != hash_set.end());  in TEST_F()
118   ASSERT_TRUE(hash_set.begin() == hash_set.end());  in TEST_F()
136   for (auto it = hash_set.begin(); it != hash_set.end();) {  in TEST_F()
196     EXPECT_NE(hash_set.end(), hash_set.find(initial_string))  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()
280   ASSERT_EQ(it, hash_map.end());  in TEST_F()
293 size_t HashIntSequence(T begin, T end) {  in HashIntSequence()  argument
295   for (auto iter = begin; iter != end; ++iter) {  in HashIntSequence()
303     return HashIntSequence(item.begin(), item.end());  in operator ()()
307     return HashIntSequence(item.begin(), item.end());  in operator ()()
317     while (aiter != a.end() && biter != b.end()) {  in operator ()()
324     return (aiter == a.end() && biter == b.end());  in operator ()()
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()
470     ASSERT_FALSE(it == hash_set.end());  in TEST_F()
473   ASSERT_TRUE(hash_set.find("missing") == hash_set.end());  in TEST_F()
478     ASSERT_FALSE(it == hash_set.end());  in TEST_F()
485   ASSERT_FALSE(remove_it == hash_set.end());  in TEST_F()
488   ASSERT_TRUE(search_it == hash_set.end());  in TEST_F()