-
-
Notifications
You must be signed in to change notification settings - Fork 1.3k
/
Copy pathsearchquery.cpp
508 lines (445 loc) · 16.2 KB
/
searchquery.cpp
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
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
#include "library/searchquery.h"
#include <QRegularExpression>
#include <QtDebug>
#include "library/dao/trackschema.h"
#include "library/queryutil.h"
#include "library/trackset/crate/crateschema.h"
#include "track/keyutils.h"
#include "track/track.h"
#include "util/db/dbconnection.h"
#include "util/db/sqllikewildcards.h"
namespace {
const QRegularExpression kDurationRegex(QStringLiteral("^(\\d+)(m|:)?([0-5]?\\d)?s?$"));
// The ordering of operator alternatives separated by '|' is crucial to avoid incomplete
// partial matches, e.g. by capturing "<" + "=" + <arg> instead of "<=" + <arg>!
//
// See also: https://perldoc.perl.org/perlre
// > Alternatives are tried from left to right, so the first alternative found for which
// > the entire expression matches, is the one that is chosen. This means that alternatives
// > are not necessarily greedy.
const QRegularExpression kNumericOperatorRegex(QStringLiteral("^(<=|>=|=|<|>)(.*)$"));
QVariant getTrackValueForColumn(const TrackPointer& pTrack, const QString& column) {
if (column == LIBRARYTABLE_ARTIST) {
return pTrack->getArtist();
} else if (column == LIBRARYTABLE_TITLE) {
return pTrack->getTitle();
} else if (column == LIBRARYTABLE_ALBUM) {
return pTrack->getAlbum();
} else if (column == LIBRARYTABLE_ALBUMARTIST) {
return pTrack->getAlbumArtist();
} else if (column == LIBRARYTABLE_YEAR) {
// We use only the year that is part of the first four digits
// In all possible formats.
return pTrack->getYear().left(4);
} else if (column == LIBRARYTABLE_DATETIMEADDED) {
return pTrack->getDateAdded();
} else if (column == LIBRARYTABLE_GENRE) {
return pTrack->getGenre();
} else if (column == LIBRARYTABLE_COMPOSER) {
return pTrack->getComposer();
} else if (column == LIBRARYTABLE_GROUPING) {
return pTrack->getGrouping();
} else if (column == LIBRARYTABLE_FILETYPE) {
return pTrack->getType();
} else if (column == LIBRARYTABLE_TRACKNUMBER) {
return pTrack->getTrackNumber();
} else if (column == TRACKLOCATIONSTABLE_LOCATION) {
return QDir::toNativeSeparators(pTrack->getLocation());
} else if (column == LIBRARYTABLE_COMMENT) {
return pTrack->getComment();
} else if (column == LIBRARYTABLE_DURATION) {
return pTrack->getDuration();
} else if (column == LIBRARYTABLE_BITRATE) {
return pTrack->getBitrate();
} else if (column == LIBRARYTABLE_BPM) {
return pTrack->getBpm();
} else if (column == LIBRARYTABLE_PLAYED) {
return pTrack->getPlayCounter().isPlayed();
} else if (column == LIBRARYTABLE_TIMESPLAYED) {
return pTrack->getPlayCounter().getTimesPlayed();
} else if (column == LIBRARYTABLE_LAST_PLAYED_AT) {
return pTrack->getLastPlayedAt();
} else if (column == LIBRARYTABLE_RATING) {
return pTrack->getRating();
} else if (column == LIBRARYTABLE_KEY) {
return pTrack->getKeyText();
} else if (column == LIBRARYTABLE_KEY_ID) {
return static_cast<int>(pTrack->getKey());
} else if (column == LIBRARYTABLE_BPM_LOCK) {
return pTrack->isBpmLocked();
}
return QVariant();
}
QString concatSqlClauses(
const QStringList& sqlClauses, const QString& sqlConcatOp) {
switch (sqlClauses.size()) {
case 0:
return QString();
case 1:
return sqlClauses.front();
default:
// The component terms need to be wrapped into parentheses,
// but the whole expression does not. The composite node is
// always responsible for proper wrapping into parentheses!
return QChar('(') +
sqlClauses.join(
QStringLiteral(") ") + sqlConcatOp + QStringLiteral(" (")) +
QChar(')');
}
}
} // namespace
bool AndNode::match(const TrackPointer& pTrack) const {
for (const auto& pNode : m_nodes) {
if (!pNode->match(pTrack)) {
return false;
}
}
// An empty AND node always evaluates to true! This
// is consistent with the generated SQL query.
return true;
}
QString AndNode::toSql() const {
QStringList queryFragments;
queryFragments.reserve(static_cast<int>(m_nodes.size()));
for (const auto& pNode : m_nodes) {
QString sql = pNode->toSql();
if (!sql.isEmpty()) {
queryFragments << sql;
}
}
return concatSqlClauses(queryFragments, "AND");
}
bool OrNode::match(const TrackPointer& pTrack) const {
// An empty OR node would always evaluate to false
// which is inconsistent with the generated SQL query!
VERIFY_OR_DEBUG_ASSERT(!m_nodes.empty()) {
// Evaluate to true even if the correct choice would
// be false to keep the evaluation consistent with
// the generated SQL query.
return true;
}
for (const auto& pNode : m_nodes) {
if (pNode->match(pTrack)) {
return true;
}
}
return false;
}
QString OrNode::toSql() const {
QStringList queryFragments;
queryFragments.reserve(static_cast<int>(m_nodes.size()));
for (const auto& pNode : m_nodes) {
QString sql = pNode->toSql();
if (!sql.isEmpty()) {
queryFragments << sql;
}
}
return concatSqlClauses(queryFragments, "OR");
}
bool NotNode::match(const TrackPointer& pTrack) const {
return !m_pNode->match(pTrack);
}
QString NotNode::toSql() const {
QString sql(m_pNode->toSql());
if (sql.isEmpty()) {
return QString();
} else {
// The component term needs to be wrapped into parentheses,
// but the whole expression does not. The composite node is
// always responsible for proper wrapping into parentheses!
return "NOT (" % sql % ")";
}
}
TextFilterNode::TextFilterNode(const QSqlDatabase& database,
const QStringList& sqlColumns,
const QString& argument)
: m_database(database),
m_sqlColumns(sqlColumns),
m_argument(argument) {
mixxx::DbConnection::makeStringLatinLow(&m_argument);
}
bool TextFilterNode::match(const TrackPointer& pTrack) const {
for (const auto& sqlColumn : m_sqlColumns) {
QVariant value = getTrackValueForColumn(pTrack, sqlColumn);
if (!value.isValid() || !value.canConvert<QString>()) {
continue;
}
QString strValue = value.toString();
mixxx::DbConnection::makeStringLatinLow(&strValue);
if (strValue.contains(m_argument)) {
return true;
}
}
return false;
}
QString TextFilterNode::toSql() const {
FieldEscaper escaper(m_database);
QString argument = m_argument;
if (argument.size() > 0) {
if (argument[argument.size() - 1].isSpace()) {
// LIKE eats a trailing space. This can be avoided by adding a '_'
// as a delimiter that matches any following character.
argument.append('_');
}
}
QString escapedArgument = escaper.escapeString(
kSqlLikeMatchAll + argument + kSqlLikeMatchAll);
QStringList searchClauses;
for (const auto& sqlColumn : m_sqlColumns) {
searchClauses << QString("%1 LIKE %2").arg(sqlColumn, escapedArgument);
}
return concatSqlClauses(searchClauses, "OR");
}
bool NullOrEmptyTextFilterNode::match(const TrackPointer& pTrack) const {
if (!m_sqlColumns.isEmpty()) {
// only use the major column
QVariant value = getTrackValueForColumn(pTrack, m_sqlColumns.first());
if (!value.isValid() || !value.canConvert<QString>()) {
return true;
}
return value.toString().isEmpty();
}
return false;
}
QString NullOrEmptyTextFilterNode::toSql() const {
if (!m_sqlColumns.isEmpty()) {
// only use the major column
return QString("%1 IS NULL OR %1 IS ''").arg(m_sqlColumns.first());
}
return QString();
}
CrateFilterNode::CrateFilterNode(const CrateStorage* pCrateStorage,
const QString& crateNameLike)
: m_pCrateStorage(pCrateStorage),
m_crateNameLike(crateNameLike),
m_matchInitialized(false) {
}
bool CrateFilterNode::match(const TrackPointer& pTrack) const {
if (!m_matchInitialized) {
CrateTrackSelectResult crateTracks(
m_pCrateStorage->selectTracksSortedByCrateNameLike(m_crateNameLike));
while (crateTracks.next()) {
m_matchingTrackIds.push_back(crateTracks.trackId());
}
m_matchInitialized = true;
}
return std::binary_search(m_matchingTrackIds.begin(), m_matchingTrackIds.end(), pTrack->getId());
}
QString CrateFilterNode::toSql() const {
return QString("id IN (%1)")
.arg(m_pCrateStorage->formatQueryForTrackIdsByCrateNameLike(
m_crateNameLike));
}
NoCrateFilterNode::NoCrateFilterNode(const CrateStorage* pCrateStorage)
: m_pCrateStorage(pCrateStorage),
m_matchInitialized(false) {
}
bool NoCrateFilterNode::match(const TrackPointer& pTrack) const {
if (!m_matchInitialized) {
TrackSelectResult tracks(
m_pCrateStorage->selectAllTracksSorted());
while (tracks.next()) {
m_matchingTrackIds.push_back(tracks.trackId());
}
m_matchInitialized = true;
}
return !std::binary_search(m_matchingTrackIds.begin(), m_matchingTrackIds.end(), pTrack->getId());
}
QString NoCrateFilterNode::toSql() const {
return QString("%1 NOT IN (%2)")
.arg(CRATETABLE_ID,
CrateStorage::formatQueryForTrackIdsWithCrate());
}
NumericFilterNode::NumericFilterNode(const QStringList& sqlColumns)
: m_sqlColumns(sqlColumns),
m_bOperatorQuery(false),
m_bNullQuery(false),
m_operator("="),
m_dOperatorArgument(0.0),
m_bRangeQuery(false),
m_dRangeLow(0.0),
m_dRangeHigh(0.0) {
}
NumericFilterNode::NumericFilterNode(
const QStringList& sqlColumns, const QString& argument)
: NumericFilterNode(sqlColumns) {
init(argument);
}
void NumericFilterNode::init(QString argument) {
if (argument == kMissingFieldSearchTerm) {
m_bNullQuery = true;
return;
}
QRegularExpressionMatch match = kNumericOperatorRegex.match(argument);
if (match.hasMatch()) {
m_operator = match.captured(1);
argument = match.captured(2);
}
bool parsed = false;
// Try to convert to see if it parses.
m_dOperatorArgument = parse(argument, &parsed);
if (parsed) {
m_bOperatorQuery = true;
}
QStringList rangeArgs = argument.split("-");
if (rangeArgs.length() == 2) {
bool lowOk = false;
m_dRangeLow = parse(rangeArgs[0], &lowOk);
bool highOk = false;
m_dRangeHigh = parse(rangeArgs[1], &highOk);
if (lowOk && highOk && m_dRangeLow <= m_dRangeHigh) {
m_bRangeQuery = true;
}
}
}
double NumericFilterNode::parse(const QString& arg, bool* ok) {
return arg.toDouble(ok);
}
bool NumericFilterNode::match(const TrackPointer& pTrack) const {
for (const auto& sqlColumn : m_sqlColumns) {
QVariant value = getTrackValueForColumn(pTrack, sqlColumn);
if (!value.isValid() || !value.canConvert<double>()) {
if (m_bNullQuery) {
return true;
}
continue;
}
double dValue = value.toDouble();
if (m_bOperatorQuery) {
if ((m_operator == "=" && dValue == m_dOperatorArgument) ||
(m_operator == "<" && dValue < m_dOperatorArgument) ||
(m_operator == ">" && dValue > m_dOperatorArgument) ||
(m_operator == "<=" && dValue <= m_dOperatorArgument) ||
(m_operator == ">=" && dValue >= m_dOperatorArgument)) {
return true;
}
} else if (m_bRangeQuery && dValue >= m_dRangeLow &&
dValue <= m_dRangeHigh) {
return true;
}
}
return false;
}
QString NumericFilterNode::toSql() const {
if (m_bNullQuery) {
for (const auto& sqlColumn : m_sqlColumns) {
// only use the major column
return QString("%1 IS NULL").arg(sqlColumn);
}
return QString();
}
if (m_bOperatorQuery) {
QStringList searchClauses;
for (const auto& sqlColumn : m_sqlColumns) {
searchClauses << QString("%1 %2 %3")
.arg(sqlColumn,
m_operator,
QString::number(
m_dOperatorArgument));
}
return concatSqlClauses(searchClauses, "OR");
}
if (m_bRangeQuery) {
QStringList searchClauses;
for (const auto& sqlColumn : m_sqlColumns) {
searchClauses << QString(QStringLiteral("%1 BETWEEN %2 AND %3"))
.arg(sqlColumn,
QString::number(m_dRangeLow),
QString::number(m_dRangeHigh));
}
return concatSqlClauses(searchClauses, "OR");
}
return QString();
}
NullNumericFilterNode::NullNumericFilterNode(const QStringList& sqlColumns)
: m_sqlColumns(sqlColumns) {
}
bool NullNumericFilterNode::match(const TrackPointer& pTrack) const {
if (!m_sqlColumns.isEmpty()) {
// only use the major column
QVariant value = getTrackValueForColumn(pTrack, m_sqlColumns.first());
if (!value.isValid() || !value.canConvert<double>()) {
return true;
}
}
return false;
}
QString NullNumericFilterNode::toSql() const {
if (!m_sqlColumns.isEmpty()) {
// only use the major column
return QString("%1 IS NULL").arg(m_sqlColumns.first());
}
return QString();
}
DurationFilterNode::DurationFilterNode(
const QStringList& sqlColumns, const QString& argument)
: NumericFilterNode(sqlColumns) {
// init() has to be called from this class directly to invoke
// the implementation of this and not that of the base class!
init(argument);
}
double DurationFilterNode::parse(const QString& arg, bool* ok) {
QRegularExpressionMatch match = kDurationRegex.match(arg);
if (!match.hasMatch()) {
*ok = false;
return 0;
}
// You can check that the minutes are parsed to entry 2 of the list and the
// seconds are in the 4th entry. If you don't believe me or this doesn't
// work anymore because we changed our Qt version just have a look at caps.
// -- (kain88, Aug 2014)
double m = 0;
double s = 0;
// if only a number is entered parse as seconds
if (match.captured(3).isEmpty() && match.captured(2).isEmpty()) {
s = match.captured(1).toDouble(ok);
} else {
m = match.captured(1).toDouble(ok);
s = match.captured(3).toDouble();
}
if (!*ok) {
return 0;
}
*ok = true;
return 60 * m + s;
}
KeyFilterNode::KeyFilterNode(mixxx::track::io::key::ChromaticKey key,
bool fuzzy) {
if (fuzzy) {
m_matchKeys = KeyUtils::getCompatibleKeys(key);
} else {
m_matchKeys.push_back(key);
}
}
bool KeyFilterNode::match(const TrackPointer& pTrack) const {
return m_matchKeys.contains(pTrack->getKey());
}
QString KeyFilterNode::toSql() const {
QStringList searchClauses;
for (const auto& matchKey : m_matchKeys) {
searchClauses << QString("key_id IS %1").arg(QString::number(matchKey));
}
return concatSqlClauses(searchClauses, "OR");
}
YearFilterNode::YearFilterNode(
const QStringList& sqlColumns, const QString& argument)
: NumericFilterNode(sqlColumns, argument) {
}
QString YearFilterNode::toSql() const {
if (m_bNullQuery) {
return QStringLiteral("year IS NULL");
}
if (m_bOperatorQuery) {
return QString(
QStringLiteral("CAST(substr(year,1,4) AS INTEGER) %1 %2"))
.arg(m_operator, QString::number(m_dOperatorArgument));
}
if (m_bRangeQuery) {
QStringList rangeClauses;
return QString(
QStringLiteral("CAST(substr(year,1,4) AS INTEGER) BETWEEN %1 AND %2"))
.arg(QString::number(m_dRangeLow),
QString::number(m_dRangeHigh));
}
return QString();
}