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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/searchlib/attribute/enumcomparator.h>
#include <vespa/vespalib/btree/btreeroot.h>
#include <vespa/vespalib/testkit/testapp.h>
#include <vespa/searchlib/attribute/enumstore.hpp>
#include <vespa/log/log.h>
LOG_SETUP("enum_comparator_test");
using namespace vespalib::btree;
using vespalib::datastore::AtomicEntryRef;
namespace search {
using NumericEnumStore = EnumStoreT<int32_t>;
using FloatEnumStore = EnumStoreT<float>;
using StringEnumStore = EnumStoreT<const char*>;
using EnumIndex = IEnumStore::Index;
using TreeType = BTreeRoot<AtomicEntryRef, BTreeNoLeafData,
vespalib::btree::NoAggregated,
const vespalib::datastore::EntryComparatorWrapper>;
using NodeAllocator = TreeType::NodeAllocatorType;
TEST("requireThatNumericLessIsWorking")
{
NumericEnumStore es(false, DictionaryConfig::Type::BTREE);
EnumIndex e1 = es.insert(10);
EnumIndex e2 = es.insert(30);
const auto & cmp1 = es.get_comparator();
EXPECT_TRUE(cmp1.less(e1, e2));
EXPECT_FALSE(cmp1.less(e2, e1));
EXPECT_FALSE(cmp1.less(e1, e1));
auto cmp2 = es.make_comparator(20);
EXPECT_TRUE(cmp2.less(EnumIndex(), e2));
EXPECT_FALSE(cmp2.less(e2, EnumIndex()));
}
TEST("requireThatNumericEqualIsWorking")
{
NumericEnumStore es(false, DictionaryConfig::Type::BTREE);
EnumIndex e1 = es.insert(10);
EnumIndex e2 = es.insert(30);
const auto & cmp1 = es.get_comparator();
EXPECT_FALSE(cmp1.equal(e1, e2));
EXPECT_FALSE(cmp1.equal(e2, e1));
EXPECT_TRUE(cmp1.equal(e1, e1));
auto cmp2 = es.make_comparator(20);
EXPECT_FALSE(cmp2.equal(EnumIndex(), e2));
EXPECT_FALSE(cmp2.equal(e2, EnumIndex()));
EXPECT_TRUE(cmp2.equal(EnumIndex(), EnumIndex()));
}
TEST("requireThatFloatLessIsWorking")
{
FloatEnumStore es(false, DictionaryConfig::Type::BTREE);
EnumIndex e1 = es.insert(10.5);
EnumIndex e2 = es.insert(30.5);
EnumIndex e3 = es.insert(std::numeric_limits<float>::quiet_NaN());
const auto & cmp1 = es.get_comparator();
EXPECT_TRUE(cmp1.less(e1, e2));
EXPECT_FALSE(cmp1.less(e2, e1));
EXPECT_FALSE(cmp1.less(e1, e1));
EXPECT_TRUE(cmp1.less(e3, e1)); // nan
EXPECT_FALSE(cmp1.less(e1, e3)); // nan
EXPECT_FALSE(cmp1.less(e3, e3)); // nan
auto cmp2 = es.make_comparator(20.5);
EXPECT_TRUE(cmp2.less(EnumIndex(), e2));
EXPECT_FALSE(cmp2.less(e2, EnumIndex()));
}
TEST("requireThatFloatEqualIsWorking")
{
FloatEnumStore es(false, DictionaryConfig::Type::BTREE);
EnumIndex e1 = es.insert(10.5);
EnumIndex e2 = es.insert(30.5);
EnumIndex e3 = es.insert(std::numeric_limits<float>::quiet_NaN());
const auto & cmp1 = es.get_comparator();
EXPECT_FALSE(cmp1.equal(e1, e2));
EXPECT_FALSE(cmp1.equal(e2, e1));
EXPECT_TRUE(cmp1.equal(e1, e1));
EXPECT_FALSE(cmp1.equal(e3, e1)); // nan
EXPECT_FALSE(cmp1.equal(e1, e3)); // nan
EXPECT_TRUE(cmp1.equal(e3, e3)); // nan
auto cmp2 = es.make_comparator(20.5);
EXPECT_FALSE(cmp2.equal(EnumIndex(), e2));
EXPECT_FALSE(cmp2.equal(e2, EnumIndex()));
EXPECT_TRUE(cmp2.equal(EnumIndex(), EnumIndex()));
}
TEST("requireThatStringLessIsWorking")
{
StringEnumStore es(false, DictionaryConfig::Type::BTREE);
EnumIndex e1 = es.insert("Aa");
EnumIndex e2 = es.insert("aa");
EnumIndex e3 = es.insert("aB");
const auto & cmp1 = es.get_comparator();
EXPECT_TRUE(cmp1.less(e1, e2)); // similar folded, fallback to regular
EXPECT_FALSE(cmp1.less(e2, e1));
EXPECT_FALSE(cmp1.less(e1, e1));
EXPECT_TRUE(cmp1.less(e2, e3)); // folded compare
EXPECT_TRUE(strcmp("aa", "aB") > 0); // regular
auto cmp2 = es.make_comparator("AB");
EXPECT_TRUE(cmp2.less(EnumIndex(), e3));
EXPECT_FALSE(cmp2.less(e3, EnumIndex()));
}
TEST("requireThatStringEqualIsWorking")
{
StringEnumStore es(false, DictionaryConfig::Type::BTREE);
EnumIndex e1 = es.insert("Aa");
EnumIndex e2 = es.insert("aa");
EnumIndex e3 = es.insert("aB");
const auto & cmp1 = es.get_comparator();
EXPECT_FALSE(cmp1.equal(e1, e2)); // similar folded, fallback to regular
EXPECT_FALSE(cmp1.equal(e2, e1));
EXPECT_TRUE(cmp1.equal(e1, e1));
EXPECT_FALSE(cmp1.equal(e2, e3)); // folded compare
auto cmp2 = es.make_comparator("AB");
EXPECT_FALSE(cmp2.equal(EnumIndex(), e3));
EXPECT_FALSE(cmp2.equal(e3, EnumIndex()));
EXPECT_TRUE(cmp2.equal(EnumIndex(), EnumIndex()));
}
TEST("requireThatComparatorWithTreeIsWorking")
{
NumericEnumStore es(false, DictionaryConfig::Type::BTREE);
vespalib::GenerationHandler g;
TreeType t;
NodeAllocator m;
for (int32_t v = 100; v > 0; --v) {
auto cmp = es.make_comparator(v);
EXPECT_FALSE(t.find(AtomicEntryRef(), m, cmp).valid());
EnumIndex idx = es.insert(v);
t.insert(AtomicEntryRef(idx), BTreeNoLeafData(), m, cmp);
}
EXPECT_EQUAL(100u, t.size(m));
int32_t exp = 1;
for (TreeType::Iterator itr = t.begin(m); itr.valid(); ++itr) {
EXPECT_EQUAL(exp++, es.get_value(itr.getKey().load_relaxed()));
}
EXPECT_EQUAL(101, exp);
t.clear(m);
m.freeze();
m.assign_generation(g.getCurrentGeneration());
g.incGeneration();
m.reclaim_memory(g.get_oldest_used_generation());
}
TEST("requireThatFoldedLessIsWorking")
{
StringEnumStore es(false, DictionaryConfig::Type::BTREE);
EnumIndex e1 = es.insert("Aa");
EnumIndex e2 = es.insert("aa");
EnumIndex e3 = es.insert("aB");
EnumIndex e4 = es.insert("Folded");
const auto & cmp1 = es.get_folded_comparator();
EXPECT_FALSE(cmp1.less(e1, e2)); // similar folded
EXPECT_FALSE(cmp1.less(e2, e1)); // similar folded
EXPECT_TRUE(cmp1.less(e2, e3)); // folded compare
EXPECT_FALSE(cmp1.less(e3, e2)); // folded compare
auto cmp2 = es.make_folded_comparator("fol");
auto cmp3 = es.make_folded_comparator_prefix("fol");
EXPECT_TRUE(cmp2.less(EnumIndex(), e4));
EXPECT_FALSE(cmp2.less(e4, EnumIndex()));
EXPECT_FALSE(cmp3.less(EnumIndex(), e4)); // similar when prefix
EXPECT_FALSE(cmp3.less(e4, EnumIndex())); // similar when prefix
}
TEST("requireThatFoldedEqualIsWorking")
{
StringEnumStore es(false, DictionaryConfig::Type::BTREE);
EnumIndex e1 = es.insert("Aa");
EnumIndex e2 = es.insert("aa");
EnumIndex e3 = es.insert("aB");
EnumIndex e4 = es.insert("Folded");
const auto & cmp1 = es.get_folded_comparator();
EXPECT_TRUE(cmp1.equal(e1, e1)); // similar folded
EXPECT_TRUE(cmp1.equal(e2, e1)); // similar folded
EXPECT_TRUE(cmp1.equal(e2, e1));
EXPECT_FALSE(cmp1.equal(e2, e3)); // folded compare
EXPECT_FALSE(cmp1.equal(e3, e2)); // folded compare
auto cmp2 = es.make_folded_comparator("fol");
auto cmp3 = es.make_folded_comparator_prefix("fol");
EXPECT_FALSE(cmp2.equal(EnumIndex(), e4));
EXPECT_FALSE(cmp2.equal(e4, EnumIndex()));
EXPECT_TRUE(cmp2.equal(EnumIndex(), EnumIndex()));
EXPECT_FALSE(cmp3.equal(EnumIndex(), e4)); // similar when prefix
EXPECT_FALSE(cmp3.equal(e4, EnumIndex())); // similar when prefix
EXPECT_TRUE(cmp3.equal(EnumIndex(), EnumIndex())); // similar when prefix
}
}
TEST_MAIN() { TEST_RUN_ALL(); }
|
