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
|
// Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "third_party/libaddressinput/chromium/trie.h"
#include <stdint.h>
#include <set>
#include <string>
#include "testing/gtest/include/gtest/gtest.h"
namespace autofill {
namespace {
std::vector<uint8_t> ToByteArray(const std::string& text) {
std::vector<uint8_t> result(text.length() + 1, 0);
result.assign(text.begin(), text.end());
return result;
}
} // namespace
TEST(TrieTest, EmptyTrieHasNoData) {
Trie<std::string> trie;
std::set<std::string> result;
trie.FindDataForKeyPrefix(ToByteArray("key"), &result);
EXPECT_TRUE(result.empty());
}
TEST(TrieTest, CanGetDataByExactKey) {
Trie<std::string> trie;
trie.AddDataForKey(ToByteArray("hello"), "world");
std::set<std::string> result;
trie.FindDataForKeyPrefix(ToByteArray("hello"), &result);
std::set<std::string> expected;
expected.insert("world");
EXPECT_EQ(expected, result);
}
TEST(TrieTest, CanGetDataByPrefix) {
Trie<std::string> trie;
trie.AddDataForKey(ToByteArray("hello"), "world");
std::set<std::string> result;
trie.FindDataForKeyPrefix(ToByteArray("he"), &result);
std::set<std::string> expected;
expected.insert("world");
EXPECT_EQ(expected, result);
}
TEST(TrieTest, KeyTooLongNoData) {
Trie<std::string> trie;
trie.AddDataForKey(ToByteArray("hello"), "world");
std::set<std::string> result;
trie.FindDataForKeyPrefix(ToByteArray("helloo"), &result);
EXPECT_TRUE(result.empty());
}
TEST(TrieTest, CommonPrefixFindsMultipleData) {
Trie<std::string> trie;
trie.AddDataForKey(ToByteArray("hello"), "world");
trie.AddDataForKey(ToByteArray("howdy"), "buddy");
trie.AddDataForKey(ToByteArray("foo"), "bar");
std::set<std::string> results;
trie.FindDataForKeyPrefix(ToByteArray("h"), &results);
std::set<std::string> expected;
expected.insert("world");
expected.insert("buddy");
EXPECT_EQ(expected, results);
}
TEST(TrieTest, KeyCanBePrefixOfOtherKey) {
Trie<std::string> trie;
trie.AddDataForKey(ToByteArray("hello"), "world");
trie.AddDataForKey(ToByteArray("helloo"), "woorld");
trie.AddDataForKey(ToByteArray("hella"), "warld");
std::set<std::string> results;
trie.FindDataForKeyPrefix(ToByteArray("hello"), &results);
std::set<std::string> expected;
expected.insert("world");
expected.insert("woorld");
EXPECT_EQ(expected, results);
}
TEST(TrieTest, AllowMutlipleKeys) {
Trie<std::string> trie;
trie.AddDataForKey(ToByteArray("hello"), "world");
trie.AddDataForKey(ToByteArray("hello"), "woorld");
std::set<std::string> results;
trie.FindDataForKeyPrefix(ToByteArray("hello"), &results);
std::set<std::string> expected;
expected.insert("world");
expected.insert("woorld");
EXPECT_EQ(expected, results);
}
TEST(TrieTest, CanFindVeryLongKey) {
Trie<std::string> trie;
static const char kVeryLongKey[] = "1234567890qwertyuioasdfghj";
trie.AddDataForKey(ToByteArray(kVeryLongKey), "world");
std::set<std::string> result;
trie.FindDataForKeyPrefix(ToByteArray(kVeryLongKey), &result);
std::set<std::string> expected;
expected.insert("world");
EXPECT_EQ(expected, result);
}
} // namespace autofill
|
