Lines Matching defs:end
75 ASSERT_TRUE(after_it == hash_set.end());
79 ASSERT_TRUE(it == hash_set.end());
91 ASSERT_TRUE(it != hash_set.end());
98 ASSERT_TRUE(it != hash_set.end());
105 ASSERT_TRUE(it == hash_set.end());
109 ASSERT_TRUE(it != hash_set.end());
116 ASSERT_TRUE(hash_set.begin() == hash_set.end());
134 for (auto it = hash_set.begin(); it != hash_set.end();) {
194 EXPECT_NE(hash_set.end(), hash_set.Find(initial_string))
250 ASSERT_EQ(it1 == hash_set.end(), it2 == std_set.end());
251 if (it1 != hash_set.end()) {
291 size_t HashIntSequence(T begin, T end) {
293 for (auto iter = begin; iter != end; ++iter) {
301 return HashIntSequence(item.begin(), item.end());
305 return HashIntSequence(item.begin(), item.end());
315 while (aiter != a.end() && biter != b.end()) {
322 return (aiter == a.end() && biter == b.end());
330 ASSERT_EQ(hash_set.end(), hash_set.Find(std::vector<int>({1, 1, 1, 1})));
331 ASSERT_NE(hash_set.end(), hash_set.Find(std::vector<int>({1, 2, 3, 4})));
332 ASSERT_EQ(hash_set.end(), hash_set.Find(std::forward_list<int>({1, 1, 1, 1})));
333 ASSERT_NE(hash_set.end(), hash_set.Find(std::forward_list<int>({1, 2, 3, 4})));