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
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
|
/*
Copyright (c) 2015 Christian Mollekopf <mollekopf@kolabsys.com>
This library is free software; you can redistribute it and/or modify it
under the terms of the GNU Library General Public License as published by
the Free Software Foundation; either version 2 of the License, or (at your
option) any later version.
This library is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public
License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
*/
#include "typeindex.h"
#include "log.h"
#include "index.h"
#include <QDateTime>
#include <QDataStream>
using namespace Sink;
static QByteArray getByteArray(const QVariant &value)
{
if (value.type() == QVariant::DateTime) {
QByteArray result;
QDataStream ds(&result, QIODevice::WriteOnly);
ds << value.toDateTime();
return result;
}
if (value.type() == QVariant::Bool) {
return value.toBool() ? "t" : "f";
}
if (value.canConvert<Sink::ApplicationDomain::Reference>()) {
const auto ba = value.value<Sink::ApplicationDomain::Reference>().value;
if (!ba.isEmpty()) {
return ba;
}
}
if (value.isValid() && !value.toByteArray().isEmpty()) {
return value.toByteArray();
}
// LMDB can't handle empty keys, so use something different
return "toplevel";
}
static QByteArray toSortableByteArray(const QDateTime &date)
{
// Sort invalid last
if (!date.isValid()) {
return QByteArray::number(std::numeric_limits<unsigned int>::max());
}
return QByteArray::number(std::numeric_limits<unsigned int>::max() - date.toTime_t());
}
TypeIndex::TypeIndex(const QByteArray &type, const Sink::Log::Context &ctx) : mLogCtx(ctx), mType(type)
{
}
QByteArray TypeIndex::indexName(const QByteArray &property, const QByteArray &sortProperty) const
{
if (sortProperty.isEmpty()) {
return mType + ".index." + property;
}
return mType + ".index." + property + ".sort." + sortProperty;
}
template <>
void TypeIndex::addProperty<QByteArray>(const QByteArray &property)
{
auto indexer = [this, property](bool add, const QByteArray &identifier, const QVariant &value, Sink::Storage::DataStore::Transaction &transaction) {
// SinkTraceCtx(mLogCtx) << "Indexing " << mType + ".index." + property << value.toByteArray();
if (add) {
Index(indexName(property), transaction).add(getByteArray(value), identifier);
} else {
Index(indexName(property), transaction).remove(getByteArray(value), identifier);
}
};
mIndexer.insert(property, indexer);
mProperties << property;
}
template <>
void TypeIndex::addProperty<bool>(const QByteArray &property)
{
auto indexer = [this, property](bool add, const QByteArray &identifier, const QVariant &value, Sink::Storage::DataStore::Transaction &transaction) {
if (add) {
Index(indexName(property), transaction).add(getByteArray(value), identifier);
} else {
Index(indexName(property), transaction).remove(getByteArray(value), identifier);
}
};
mIndexer.insert(property, indexer);
mProperties << property;
}
template <>
void TypeIndex::addProperty<QString>(const QByteArray &property)
{
auto indexer = [this, property](bool add, const QByteArray &identifier, const QVariant &value, Sink::Storage::DataStore::Transaction &transaction) {
// SinkTraceCtx(mLogCtx) << "Indexing " << mType + ".index." + property << value.toByteArray();
if (add) {
Index(indexName(property), transaction).add(getByteArray(value), identifier);
} else {
Index(indexName(property), transaction).remove(getByteArray(value), identifier);
}
};
mIndexer.insert(property, indexer);
mProperties << property;
}
template <>
void TypeIndex::addProperty<QDateTime>(const QByteArray &property)
{
auto indexer = [this, property](bool add, const QByteArray &identifier, const QVariant &value, Sink::Storage::DataStore::Transaction &transaction) {
//SinkTraceCtx(mLogCtx) << "Indexing " << mType + ".index." + property << getByteArray(value);
if (add) {
Index(indexName(property), transaction).add(getByteArray(value), identifier);
} else {
Index(indexName(property), transaction).remove(getByteArray(value), identifier);
}
};
mIndexer.insert(property, indexer);
mProperties << property;
}
template <>
void TypeIndex::addProperty<ApplicationDomain::Reference>(const QByteArray &property)
{
addProperty<QByteArray>(property);
}
template <>
void TypeIndex::addPropertyWithSorting<QByteArray, QDateTime>(const QByteArray &property, const QByteArray &sortProperty)
{
auto indexer = [=](bool add, const QByteArray &identifier, const QVariant &value, const QVariant &sortValue, Sink::Storage::DataStore::Transaction &transaction) {
const auto date = sortValue.toDateTime();
const auto propertyValue = getByteArray(value);
if (add) {
Index(indexName(property, sortProperty), transaction).add(propertyValue + toSortableByteArray(date), identifier);
} else {
Index(indexName(property, sortProperty), transaction).remove(propertyValue + toSortableByteArray(date), identifier);
}
};
mSortIndexer.insert(property + sortProperty, indexer);
mSortedProperties.insert(property, sortProperty);
}
template <>
void TypeIndex::addPropertyWithSorting<ApplicationDomain::Reference, QDateTime>(const QByteArray &property, const QByteArray &sortProperty)
{
addPropertyWithSorting<QByteArray, QDateTime>(property, sortProperty);
}
void TypeIndex::updateIndex(bool add, const QByteArray &identifier, const Sink::ApplicationDomain::ApplicationDomainType &entity, Sink::Storage::DataStore::Transaction &transaction)
{
for (const auto &property : mProperties) {
const auto value = entity.getProperty(property);
auto indexer = mIndexer.value(property);
indexer(add, identifier, value, transaction);
}
for (auto it = mSortedProperties.constBegin(); it != mSortedProperties.constEnd(); it++) {
const auto value = entity.getProperty(it.key());
const auto sortValue = entity.getProperty(it.value());
auto indexer = mSortIndexer.value(it.key() + it.value());
indexer(add, identifier, value, sortValue, transaction);
}
for (const auto &indexer : mCustomIndexer) {
indexer->setup(this, &transaction);
if (add) {
indexer->add(entity);
} else {
indexer->remove(entity);
}
}
}
void TypeIndex::add(const QByteArray &identifier, const Sink::ApplicationDomain::ApplicationDomainType &entity, Sink::Storage::DataStore::Transaction &transaction)
{
updateIndex(true, identifier, entity, transaction);
}
void TypeIndex::remove(const QByteArray &identifier, const Sink::ApplicationDomain::ApplicationDomainType &entity, Sink::Storage::DataStore::Transaction &transaction)
{
updateIndex(false, identifier, entity, transaction);
}
static QVector<QByteArray> indexLookup(Index &index, QueryBase::Comparator filter)
{
QVector<QByteArray> keys;
QByteArrayList lookupKeys;
if (filter.comparator == Query::Comparator::Equals) {
lookupKeys << getByteArray(filter.value);
} else if (filter.comparator == Query::Comparator::In) {
lookupKeys = filter.value.value<QByteArrayList>();
} else {
Q_ASSERT(false);
}
for (const auto &lookupKey : lookupKeys) {
index.lookup(lookupKey, [&](const QByteArray &value) { keys << value; },
[lookupKey](const Index::Error &error) { SinkWarning() << "Lookup error in index: " << error.message << lookupKey; }, true);
}
return keys;
}
QVector<QByteArray> TypeIndex::query(const Sink::QueryBase &query, QSet<QByteArray> &appliedFilters, QByteArray &appliedSorting, Sink::Storage::DataStore::Transaction &transaction)
{
QVector<QByteArray> keys;
for (auto it = mSortedProperties.constBegin(); it != mSortedProperties.constEnd(); it++) {
if (query.hasFilter(it.key()) && query.sortProperty() == it.value()) {
Index index(indexName(it.key(), it.value()), transaction);
keys << indexLookup(index, query.getFilter(it.key()));
appliedFilters << it.key();
appliedSorting = it.value();
SinkTraceCtx(mLogCtx) << "Index lookup on " << it.key() << it.value() << " found " << keys.size() << " keys.";
return keys;
}
}
for (const auto &property : mProperties) {
if (query.hasFilter(property)) {
Index index(indexName(property), transaction);
keys << indexLookup(index, query.getFilter(property));
appliedFilters << property;
SinkTraceCtx(mLogCtx) << "Index lookup on " << property << " found " << keys.size() << " keys.";
return keys;
}
}
SinkTraceCtx(mLogCtx) << "No matching index";
return keys;
}
QVector<QByteArray> TypeIndex::lookup(const QByteArray &property, const QVariant &value, Sink::Storage::DataStore::Transaction &transaction)
{
SinkTraceCtx(mLogCtx) << "Index lookup on property: " << property << mSecondaryProperties.keys() << mProperties;
if (mProperties.contains(property)) {
QVector<QByteArray> keys;
Index index(indexName(property), transaction);
const auto lookupKey = getByteArray(value);
index.lookup(
lookupKey, [&](const QByteArray &value) { keys << value; }, [property](const Index::Error &error) { SinkWarning() << "Error in index: " << error.message << property; });
SinkTraceCtx(mLogCtx) << "Index lookup on " << property << " found " << keys.size() << " keys.";
return keys;
} else if (mSecondaryProperties.contains(property)) {
//Lookups on secondary indexes first lookup the key, and then lookup the results again to resolve to entity id's
QVector<QByteArray> keys;
auto resultProperty = mSecondaryProperties.value(property);
QVector<QByteArray> secondaryKeys;
Index index(indexName(property + resultProperty), transaction);
const auto lookupKey = getByteArray(value);
index.lookup(
lookupKey, [&](const QByteArray &value) { secondaryKeys << value; }, [property](const Index::Error &error) { SinkWarning() << "Error in index: " << error.message << property; });
SinkTraceCtx(mLogCtx) << "Looked up secondary keys: " << secondaryKeys;
for (const auto &secondary : secondaryKeys) {
keys += lookup(resultProperty, secondary, transaction);
}
return keys;
} else {
SinkWarning() << "Tried to lookup " << property << " but couldn't find value";
}
return QVector<QByteArray>();
}
template <>
void TypeIndex::index<QByteArray, QByteArray>(const QByteArray &leftName, const QByteArray &rightName, const QVariant &leftValue, const QVariant &rightValue, Sink::Storage::DataStore::Transaction &transaction)
{
Index(indexName(leftName + rightName), transaction).add(getByteArray(leftValue), getByteArray(rightValue));
}
template <>
void TypeIndex::index<QString, QByteArray>(const QByteArray &leftName, const QByteArray &rightName, const QVariant &leftValue, const QVariant &rightValue, Sink::Storage::DataStore::Transaction &transaction)
{
Index(indexName(leftName + rightName), transaction).add(getByteArray(leftValue), getByteArray(rightValue));
}
template <>
void TypeIndex::unindex<QByteArray, QByteArray>(const QByteArray &leftName, const QByteArray &rightName, const QVariant &leftValue, const QVariant &rightValue, Sink::Storage::DataStore::Transaction &transaction)
{
Index(indexName(leftName + rightName), transaction).remove(getByteArray(leftValue), getByteArray(rightValue));
}
template <>
void TypeIndex::unindex<QString, QByteArray>(const QByteArray &leftName, const QByteArray &rightName, const QVariant &leftValue, const QVariant &rightValue, Sink::Storage::DataStore::Transaction &transaction)
{
Index(indexName(leftName + rightName), transaction).remove(getByteArray(leftValue), getByteArray(rightValue));
}
template <>
QVector<QByteArray> TypeIndex::secondaryLookup<QByteArray>(const QByteArray &leftName, const QByteArray &rightName, const QVariant &value)
{
QVector<QByteArray> keys;
Index index(indexName(leftName + rightName), *mTransaction);
const auto lookupKey = getByteArray(value);
index.lookup(
lookupKey, [&](const QByteArray &value) { keys << value; }, [=](const Index::Error &error) { SinkWarning() << "Lookup error in secondary index: " << error.message << value << lookupKey; });
return keys;
}
template <>
QVector<QByteArray> TypeIndex::secondaryLookup<QString>(const QByteArray &leftName, const QByteArray &rightName, const QVariant &value)
{
QVector<QByteArray> keys;
Index index(indexName(leftName + rightName), *mTransaction);
const auto lookupKey = getByteArray(value);
index.lookup(
lookupKey, [&](const QByteArray &value) { keys << value; }, [=](const Index::Error &error) { SinkWarning() << "Lookup error in secondary index: " << error.message << value << lookupKey; });
return keys;
}
|
