| OLD | NEW |
| 1 // Copyright 2013 The Chromium Authors. All rights reserved. | 1 // Copyright 2013 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "base/containers/hash_tables.h" | 5 #include "base/containers/hash_tables.h" |
| 6 | 6 |
| 7 #include <stdint.h> | 7 #include <stdint.h> |
| 8 #include <string> | 8 #include <string> |
| 9 | 9 |
| 10 #include "base/basictypes.h" | 10 #include "base/basictypes.h" |
| 11 #include "testing/gtest/include/gtest/gtest.h" | 11 #include "testing/gtest/googletest/include/gtest/gtest.h" |
| 12 | 12 |
| 13 namespace { | 13 namespace { |
| 14 | 14 |
| 15 class HashPairTest : public testing::Test { | 15 class HashPairTest : public testing::Test { |
| 16 }; | 16 }; |
| 17 | 17 |
| 18 #define INSERT_PAIR_TEST(Type, value1, value2) \ | 18 #define INSERT_PAIR_TEST(Type, value1, value2) \ |
| 19 { \ | 19 { \ |
| 20 Type pair(value1, value2); \ | 20 Type pair(value1, value2); \ |
| 21 base::hash_map<Type, int> map; \ | 21 base::hash_map<Type, int> map; \ |
| (...skipping 37 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 59 std::string str1("hello"); | 59 std::string str1("hello"); |
| 60 std::string str2("hello"); | 60 std::string str2("hello"); |
| 61 base::hash_set<const char*> set; | 61 base::hash_set<const char*> set; |
| 62 | 62 |
| 63 set.insert(str1.c_str()); | 63 set.insert(str1.c_str()); |
| 64 EXPECT_EQ(1u, set.count(str1.c_str())); | 64 EXPECT_EQ(1u, set.count(str1.c_str())); |
| 65 EXPECT_EQ(0u, set.count(str2.c_str())); | 65 EXPECT_EQ(0u, set.count(str2.c_str())); |
| 66 } | 66 } |
| 67 | 67 |
| 68 } // namespace | 68 } // namespace |
| OLD | NEW |