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
3 // found in the LICENSE file.
5 #include "base/containers/hash_tables.h"
9 #include "base/basictypes.h"
10 #include "testing/gtest/include/gtest/gtest.h"
14 class HashPairTest
: public testing::Test
{
17 #define INSERT_PAIR_TEST(Type, value1, value2) \
19 Type pair(value1, value2); \
20 base::hash_map<Type, int> map; \
24 // Verify that a hash_map can be constructed for pairs of integers of various
26 TEST_F(HashPairTest
, IntegerPairs
) {
27 typedef std::pair
<int16
, int16
> Int16Int16Pair
;
28 typedef std::pair
<int16
, int32
> Int16Int32Pair
;
29 typedef std::pair
<int16
, int64
> Int16Int64Pair
;
31 INSERT_PAIR_TEST(Int16Int16Pair
, 4, 6);
32 INSERT_PAIR_TEST(Int16Int32Pair
, 9, (1 << 29) + 378128932);
33 INSERT_PAIR_TEST(Int16Int64Pair
, 10,
34 (GG_INT64_C(1) << 60) + GG_INT64_C(78931732321));
36 typedef std::pair
<int32
, int16
> Int32Int16Pair
;
37 typedef std::pair
<int32
, int32
> Int32Int32Pair
;
38 typedef std::pair
<int32
, int64
> Int32Int64Pair
;
40 INSERT_PAIR_TEST(Int32Int16Pair
, 4, 6);
41 INSERT_PAIR_TEST(Int32Int32Pair
, 9, (1 << 29) + 378128932);
42 INSERT_PAIR_TEST(Int32Int64Pair
, 10,
43 (GG_INT64_C(1) << 60) + GG_INT64_C(78931732321));
45 typedef std::pair
<int64
, int16
> Int64Int16Pair
;
46 typedef std::pair
<int64
, int32
> Int64Int32Pair
;
47 typedef std::pair
<int64
, int64
> Int64Int64Pair
;
49 INSERT_PAIR_TEST(Int64Int16Pair
, 4, 6);
50 INSERT_PAIR_TEST(Int64Int32Pair
, 9, (1 << 29) + 378128932);
51 INSERT_PAIR_TEST(Int64Int64Pair
, 10,
52 (GG_INT64_C(1) << 60) + GG_INT64_C(78931732321));
55 // Verify that base::hash_set<const char*> compares by pointer value, not as C
57 TEST(HashTableTest
, CharPointers
) {
58 std::string
str1("hello");
59 std::string
str2("hello");
60 base::hash_set
<const char*> set
;
62 set
.insert(str1
.c_str());
63 EXPECT_EQ(1u, set
.count(str1
.c_str()));
64 EXPECT_EQ(0u, set
.count(str2
.c_str()));