forked from mixxxdj/mixxx
-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathsearchquery.cpp
More file actions
923 lines (824 loc) · 30.5 KB
/
Copy pathsearchquery.cpp
File metadata and controls
923 lines (824 loc) · 30.5 KB
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
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
#include "library/searchquery.h"
#include <QLocale>
#include <QRegularExpression>
#include "library/dao/trackschema.h"
#include "library/queryutil.h"
#include "library/trackset/crate/crateschema.h"
#include "library/trackset/crate/cratestorage.h" // for CrateTrackSelectResult
#include "track/keyutils.h"
#include "track/track.h"
#include "util/db/dbconnection.h"
#include "util/db/sqllikewildcards.h"
namespace {
constexpr double kLibraryRoundRange = 0.05;
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("^(<=|>=|=|<|>)(.*)$"));
const QRegularExpression kNullRegex(QStringLiteral("^([0.,]+)$"));
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();
} else if (column == LIBRARYTABLE_ID) {
return pTrack->getId().toVariant();
}
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 {
for (const auto& pNode : m_nodes) {
if (pNode->match(pTrack)) {
return true;
}
}
return false;
}
QString OrNode::toSql() const {
if (m_nodes.empty()) {
return "FALSE";
}
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,
const StringMatch matchMode)
: m_database(database),
m_sqlColumns(sqlColumns),
m_argument(argument),
m_matchMode(matchMode) {
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 (m_matchMode == StringMatch::Equals) {
if (strValue == m_argument) {
return true;
}
} else {
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;
// Using a switch-case without default case to get a compile-time -Wswitch warning
switch (m_matchMode) {
case StringMatch::Contains:
escapedArgument = escaper.escapeString(
kSqlLikeMatchAll + argument + kSqlLikeMatchAll);
break;
case StringMatch::Equals:
escapedArgument = escaper.escapeString(argument);
break;
}
QStringList searchClauses;
for (const auto& sqlColumn : m_sqlColumns) {
searchClauses << QString("%1 IS NOT NULL AND %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;
}
// static
constexpr double BpmFilterNode::kRelativeRangeDefault;
// static
double BpmFilterNode::s_relativeRange = kRelativeRangeDefault;
// static
void BpmFilterNode::setBpmRelativeRange(double range) {
// range < 0 would yield zero results because m_dRangeLow > m_dRangeHigh
VERIFY_OR_DEBUG_ASSERT(range >= 0) {
return;
}
s_relativeRange = range;
}
namespace {
inline QString rangeSqlString(double lower, double upper) {
// 'BETWEEN' is inclusive, i.e. returns true if lower <= value <= upper
return QStringLiteral("bpm BETWEEN %1 AND %2")
.arg(QString::number(lower),
QString::number(upper));
}
inline QString rangeUpperExclusiveSqlString(double lower, double upper) {
return QStringLiteral("bpm >= %1 AND bpm < %2")
.arg(QString::number(lower),
QString::number(upper));
}
inline std::pair<double, double> rangeFromTrailingDecimal(double bpm) {
// Set up a range if we have decimals. This will include matches
// for which we show rounded values in the library. For example
// 124.0 finds 123.95 - 124.05
// 124.1 finds 124.05 - 124.15
// 124.92 finds 124.915 - 124.925
if (bpm == 0.0) {
return std::pair<double, double>(bpm, bpm);
}
int numDecimals = 1;
double intPart;
double fractPart = std::modf(bpm, &intPart);
if (fractPart != 0.0) {
QString decimals = QString::number(fractPart);
numDecimals = decimals.split('.').at(1).length();
}
double roundRange = 5 / pow(10, numDecimals + 1);
// Don't search for negative BPM
double lower = std::max(0.0, bpm - roundRange);
double upper = bpm + roundRange;
return std::pair<double, double>(lower, upper);
}
} // namespace
BpmFilterNode::BpmFilterNode(QString& argument, bool fuzzy, bool negate)
: m_matchMode(MatchMode::Invalid),
m_operator("="),
m_bpm(0.0),
m_rangeLower(0.0),
m_rangeUpper(0.0),
m_bpmHalfLower(0.0),
m_bpmHalfUpper(0.0),
m_bpmDoubleLower(0.0),
m_bpmDoubleUpper(0.0) {
QRegularExpressionMatch nullMatch = kNullRegex.match(argument);
if (argument == kMissingFieldSearchTerm || // explicit empty
argument == "-" || // displayed in the BPM column
nullMatch.hasMatch()) { // displayed in the BPM widgets
m_matchMode = MatchMode::Null;
return;
}
QRegularExpressionMatch opMatch = kNumericOperatorRegex.match(argument);
if (opMatch.hasMatch()) {
if (fuzzy) {
// fuzzy can't be combined with operators
// m_matchMode is already Invalid.
return;
}
m_operator = opMatch.captured(1);
argument = opMatch.captured(2);
}
// Replace the locale's decimal separator with .
// This is handy if numbers are typed with the numpad.
argument.replace(',', '.');
bool isDouble = false;
double bpm = argument.toDouble(&isDouble);
if (isDouble) {
// Check if the arg has a decimal separator (even if no digits after that)
#if QT_VERSION >= QT_VERSION_CHECK(6, 0, 0)
bool strictMatch = argument.split('.', Qt::SkipEmptyParts).length() > 1;
#else
bool strictMatch = argument.split('.', QString::SkipEmptyParts).length() > 1;
#endif
if (fuzzy) {
// fuzzy search +- n%
m_matchMode = MatchMode::Fuzzy;
} else if (!opMatch.hasMatch() && !negate) {
// Simple 'bpm:NNN' search.
// Also searches for half/double matches (rounded up/down)
// Center value is turned into range in order to ...
if (strictMatch) {
// find rounded values (hiddendecimals in tracks table / BPM widgets)
m_matchMode = MatchMode::HalveDoubleStrict;
} else {
// find all values with same int base
m_matchMode = MatchMode::HalveDouble;
}
} else {
// Operator or basic query, optional negate
if (m_operator == '=') {
// Explicit search.
// Same center range as HalveDouble/~Strict
// TODO What about -bpm: ? ExplicitNot
if (strictMatch) {
m_matchMode = MatchMode::ExplicitStrict;
} else {
m_matchMode = MatchMode::Explicit;
}
} else {
m_matchMode = MatchMode::Operator;
}
}
} else {
if (fuzzy) {
// fuzzy can't be combined with range
return;
}
// Test if this is a valid range query
QStringList rangeArgs = argument.split("-");
if (rangeArgs.length() == 2) {
bool lowOk = false;
bool highOk = false;
double rangeLower = rangeArgs[0].toDouble(&lowOk);
double rangeUpper = rangeArgs[1].toDouble(&highOk);
if (lowOk && highOk && rangeLower <= rangeUpper) {
// Assign values now to avoid moving bounds out of scope
m_matchMode = MatchMode::Range;
m_rangeLower = rangeLower;
m_rangeUpper = rangeUpper;
return;
}
}
// m_matchMode is already Invalid.
return;
}
// Build/prepare match functions
switch (m_matchMode) {
case MatchMode::Explicit: {
// No decimals: 114 finds 113.95 - 114.99999
m_rangeLower = rangeFromTrailingDecimal(bpm).first;
m_rangeUpper = floor(bpm + 1);
break;
}
case MatchMode::ExplicitStrict: {
// Decimals: 114.0 finds 113.95 - 114.05
std::tie(m_rangeLower, m_rangeUpper) = rangeFromTrailingDecimal(bpm);
break;
}
case MatchMode::Fuzzy: {
m_rangeLower = floor((1 - s_relativeRange) * bpm);
m_rangeUpper = ceil((1 + s_relativeRange) * bpm);
break;
}
case MatchMode::HalveDouble: {
DEBUG_ASSERT(bpm == floor(bpm));
// For instance bpm = 127
// We find everything that is displayed as 127.** in the library
m_rangeLower = bpm - kLibraryRoundRange; // [126.95
m_rangeUpper = bpm + 1; // ]128
double halfBpm = bpm / 2;
if (floor(halfBpm) != halfBpm) {
// In case bpm / 2 is a fractional, we include the *.0 value neighbours
// since fractional bpm values are less common in some genres.
m_bpmHalfLower = floor(halfBpm) - kLibraryRoundRange; // [62.95
} else {
// Here we are for instance with 126
// We find everything that is displayed as 63.** in the library
m_bpmHalfLower = halfBpm - kLibraryRoundRange; // [62.95
}
m_bpmHalfUpper = halfBpm + 1; // ]64
// We find everything which would be found when editing the beat grid via / 2
m_bpmDoubleLower = (bpm * 2) - kLibraryRoundRange; // [253.95
m_bpmDoubleUpper = m_rangeUpper * 2; // ]256
break;
}
case MatchMode::HalveDoubleStrict: { // 57.0
std::tie(m_rangeLower, m_rangeUpper) =
rangeFromTrailingDecimal(bpm); // 56.95 - 57.05
std::tie(m_bpmHalfLower, m_bpmHalfUpper) =
rangeFromTrailingDecimal(bpm / 2); // 28.45 - 28.55
std::tie(m_bpmDoubleLower, m_bpmDoubleUpper) =
rangeFromTrailingDecimal(bpm * 2); // 113.95 - 114.05
break;
}
case MatchMode::Operator: {
m_bpm = bpm;
break;
}
default:
return;
}
}
bool BpmFilterNode::match(const TrackPointer& pTrack) const {
double value = pTrack->getBpm();
switch (m_matchMode) {
case MatchMode::Null: {
return value == 0.0;
}
case MatchMode::Explicit: {
return value >= m_rangeLower && value < m_rangeUpper;
}
case MatchMode::ExplicitStrict:
case MatchMode::Fuzzy:
case MatchMode::Range: {
return value >= m_rangeLower && value <= m_rangeUpper;
}
case MatchMode::HalveDouble: {
return (value >= m_rangeLower && value <= m_rangeUpper) ||
(value >= m_bpmHalfLower && value <= m_bpmHalfUpper) ||
(value >= m_bpmDoubleLower && value <= m_bpmDoubleUpper);
}
case MatchMode::HalveDoubleStrict: {
return (value >= m_rangeLower && value < m_rangeUpper) ||
(value >= m_bpmHalfLower && value <= m_bpmHalfUpper) ||
(value >= m_bpmDoubleLower && value <= m_bpmDoubleUpper);
}
case MatchMode::Operator: {
return (m_operator == "=" && value == m_bpm) ||
(m_operator == "<" && value < m_bpm) ||
(m_operator == ">" && value > m_bpm) ||
(m_operator == "<=" && value <= m_bpm) ||
(m_operator == ">=" && value >= m_bpm);
}
default: // e.g. MatchMode::Invalid
// Show no results to indicate the query is invalid.
// Is this good UX?
return false;
}
}
QString BpmFilterNode::toSql() const {
switch (m_matchMode) {
case MatchMode::Null: {
return QString("bpm IS 0");
}
case MatchMode::Explicit: {
return QStringLiteral("bpm >= %1 AND bpm < %2")
.arg(QString::number(m_rangeLower),
QString::number(m_rangeUpper));
}
case MatchMode::ExplicitStrict:
case MatchMode::Fuzzy:
case MatchMode::Range: {
return rangeSqlString(m_rangeLower, m_rangeUpper);
}
case MatchMode::HalveDouble: {
QStringList searchClauses;
searchClauses << rangeUpperExclusiveSqlString(m_rangeLower, m_rangeUpper);
searchClauses << rangeUpperExclusiveSqlString(m_bpmHalfLower, m_bpmHalfUpper);
searchClauses << rangeUpperExclusiveSqlString(m_bpmDoubleLower, m_bpmDoubleUpper);
return concatSqlClauses(searchClauses, "OR");
}
case MatchMode::HalveDoubleStrict: {
QStringList searchClauses;
searchClauses << rangeSqlString(m_rangeLower, m_rangeUpper);
searchClauses << rangeSqlString(m_bpmHalfLower, m_bpmHalfUpper);
searchClauses << rangeSqlString(m_bpmDoubleLower, m_bpmDoubleUpper);
return concatSqlClauses(searchClauses, "OR");
}
case MatchMode::Operator: {
return QString("bpm %1 %2").arg(m_operator, QString::number(m_bpm));
}
default: // MatchMode::Invalid
return QString("bpm IS NULL");
}
}
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) {
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();
}
// TODO Convert to DateFilterNode and allow searching for "last_played"
DateAddedFilterNode::DateAddedFilterNode(const QString& argument)
: m_operatorQuery(false),
m_equalsQuery(false),
m_operator("=") {
QDateTime date;
QRegularExpressionMatch opMatch = kNumericOperatorRegex.match(argument);
if (opMatch.hasMatch()) {
// Explicit operator
m_operator = opMatch.captured(1);
date = parseDate(opMatch.captured(2));
} else {
// This is an implicit 'equals' filter with ':'.
// Try parsing the date and use default '=' operator.
date = parseDate(argument);
}
if (!date.isValid()) {
return;
}
if (m_operator == '=') {
// Note: due to literal = time comparison in Sql we need to set up
// a range from [date]T00:00:00.000 to [date]T23:59:59.999
m_equalsQuery = true;
m_dateStart = date;
m_dateEnd = date.addDays(1);
return;
}
m_operatorQuery = true;
if (m_operator == '>') {
// "added:>25.10.2025" would include any time from 2025-10-25T00:00:00Z001
// Add one day for >= 25.10.2026T00:00:00Z000 to exclude the whole day
date = date.addDays(1);
m_operator = ">=";
}
m_opDate = date;
// TODO Add literal parser, for example:
// added:7days
// added:4weeks-2weeks etc.
}
QDateTime DateAddedFilterNode::parseDate(const QString& dateStr) const {
// Prior to Qt 6.7 QLocale::toDate() with QLocale::ShortFormat used the
// base year 1900. With 6.7+ we can specify the century, ie. 20 for 2000.
// Mixxx was created aftre 2000 :)
#if QT_VERSION < QT_VERSION_CHECK(6, 7, 0)
QDate date = QLocale().toDate(dateStr, QLocale::ShortFormat);
#else
QDate date = QLocale().toDate(dateStr, QLocale::ShortFormat, 20);
#endif
if (!date.isValid()) {
return {};
}
if (date.year() < 2000) {
date = date.addYears(100);
}
// Return local date/time, don't convert to UTC, yet
return QDateTime(date, QTime(0, 0)).toUTC();
}
QString DateAddedFilterNode::dateStringIsoNoZ(const QDateTime& date) const {
QString dateStr = date.toString(Qt::ISODateWithMs);
// sqlite can't handle 'Z' suffix, strip if present
if (dateStr.endsWith('Z')) {
dateStr.chop(1);
}
return dateStr;
}
bool DateAddedFilterNode::match(const TrackPointer& pTrack) const {
if (!m_operatorQuery && !m_equalsQuery) {
// invalid query, don't filter
return true;
}
QDateTime trackDate = pTrack->getDateAdded();
if (!trackDate.isValid()) {
return true;
}
if (m_operatorQuery &&
((m_operator == "<" && trackDate < m_opDate) ||
(m_operator == "<=" && trackDate <= m_opDate) ||
(m_operator == ">=" && trackDate >= m_opDate))) {
return true;
} else if (m_equalsQuery && trackDate >= m_dateStart && trackDate < m_dateEnd) {
return true;
}
// valid query with no matches
return false;
}
QString DateAddedFilterNode::toSql() const {
if (m_operatorQuery) {
return QStringLiteral("datetime_added %1 '%2'")
.arg(m_operator, dateStringIsoNoZ(m_opDate));
} else if (m_equalsQuery) {
return QStringLiteral("datetime_added >= '%1' AND datetime_added < '%2'")
.arg(dateStringIsoNoZ(m_dateStart), dateStringIsoNoZ(m_dateEnd));
}
return QString();
}