1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
|
/*
* Copyright 2018 Google
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "Firestore/core/src/firebase/firestore/util/hashing.h"
#include <map>
#include <string>
#include "absl/strings/string_view.h"
#include "gtest/gtest.h"
namespace firebase {
namespace firestore {
namespace util {
struct HasHashMember {
size_t Hash() const {
return 42;
}
};
TEST(HashingTest, HasStdHash) {
EXPECT_TRUE(impl::has_std_hash<float>::value);
EXPECT_TRUE(impl::has_std_hash<double>::value);
EXPECT_TRUE(impl::has_std_hash<int>::value);
EXPECT_TRUE(impl::has_std_hash<int64_t>::value);
EXPECT_TRUE(impl::has_std_hash<std::string>::value);
EXPECT_TRUE(impl::has_std_hash<void*>::value);
EXPECT_TRUE(impl::has_std_hash<const char*>::value);
struct Foo {};
EXPECT_FALSE(impl::has_std_hash<Foo>::value);
EXPECT_FALSE(impl::has_std_hash<absl::string_view>::value);
EXPECT_FALSE((impl::has_std_hash<std::map<std::string, std::string>>::value));
}
TEST(HashingTest, Int) {
ASSERT_EQ(std::hash<int>{}(0), Hash(0));
}
TEST(HashingTest, Float) {
ASSERT_EQ(std::hash<double>{}(1.0), Hash(1.0));
}
TEST(HashingTest, String) {
ASSERT_EQ(std::hash<std::string>{}("foobar"), Hash(std::string{"foobar"}));
}
TEST(HashingTest, StringView) {
// For StringView we expect the range-based hasher to kick in. This is
// basically terrible, but no worse than Java's `String.hashCode()`. Another
// possibility would be just to create a temporary std::string and std::hash
// that, but that requires an explicit specialization. Since we're only
// defining this for compatibility with Objective-C and not really sensitive
// to performance or hash quality here, this is good enough.
size_t expected = 'a';
expected = 31u * expected + 1;
ASSERT_EQ(expected, Hash(absl::string_view{"a"}));
}
TEST(HashingTest, SizeT) {
ASSERT_EQ(42u, Hash(size_t{42u}));
}
TEST(HashingTest, Array) {
int values[] = {0, 1, 2};
size_t expected = 0;
expected = 31 * expected + 1;
expected = 31 * expected + 2;
expected = 31 * expected + 3; // length of array
ASSERT_EQ(expected, Hash(values));
}
TEST(HashingTest, HasHashMember) {
ASSERT_EQ(static_cast<size_t>(42), Hash(HasHashMember{}));
}
TEST(HashingTest, RangeOfStdHashable) {
std::vector<int> values{42};
ASSERT_EQ(31u * 42u + 1, Hash(values));
std::vector<int> values_leading_zero{0, 42};
std::vector<int> values_trailing_zero{42, 0};
EXPECT_NE(Hash(values), Hash(values_leading_zero));
EXPECT_NE(Hash(values), Hash(values_trailing_zero));
EXPECT_NE(Hash(values_leading_zero), Hash(values_trailing_zero));
}
TEST(HashingTest, RangeOfHashMember) {
std::vector<HasHashMember> values{HasHashMember{}};
ASSERT_EQ(31u * 42u + 1, Hash(values));
}
TEST(HashingTest, Composite) {
// Verify the result ends up as if hand-rolled
EXPECT_EQ(1u, Hash(1));
EXPECT_EQ(31u, Hash(1, 0));
EXPECT_EQ(31u * 31u, Hash(1, 0, 0));
size_t expected = Hash(1);
expected = 31 * expected + Hash(2);
expected = 31 * expected + Hash(3);
EXPECT_EQ(expected, Hash(1, 2, 3));
}
} // namespace util
} // namespace firestore
} // namespace firebase
|
