Repository navigation
Expand file tree
/
Copy pathsphinxfilter.cpp
More file actions
1456 lines (1211 loc) · 35.8 KB
/
Copy pathsphinxfilter.cpp
File metadata and controls
1456 lines (1211 loc) · 35.8 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
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//
// $Id$
//
//
// Copyright (c) 2001-2016, Andrew Aksyonoff
// Copyright (c) 2008-2016, Sphinx Technologies Inc
// All rights reserved
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License. You should have
// received a copy of the GPL license along with this program; if you
// did not, you can find it at http://www.gnu.org/
//
#include "sphinxfilter.h"
#include "sphinxint.h"
#include "sphinxjson.h"
#if USE_WINDOWS
#pragma warning(disable:4250) // inheritance via dominance is our intent
#endif
/// attribute-based
struct IFilter_Attr: virtual ISphFilter
{
CSphAttrLocator m_tLocator;
virtual void SetLocator ( const CSphAttrLocator & tLocator )
{
m_tLocator = tLocator;
}
};
/// values
struct IFilter_Values : virtual ISphFilter
{
const SphAttr_t * m_pValues;
int m_iValueCount;
IFilter_Values ()
: m_pValues ( NULL )
, m_iValueCount ( 0 )
{}
virtual void SetValues ( const SphAttr_t * pStorage, int iCount )
{
assert ( pStorage );
assert ( iCount > 0 );
#ifndef NDEBUG // values must be sorted
for ( int i = 1; i < iCount; i++ )
assert ( pStorage[i-1]<=pStorage[i] );
#endif
m_pValues = pStorage;
m_iValueCount = iCount;
}
inline SphAttr_t GetValue ( int iIndex ) const
{
assert ( iIndex>=0 && iIndex<m_iValueCount );
return m_pValues[iIndex];
}
bool EvalValues ( SphAttr_t uValue ) const;
bool EvalBlockValues ( SphAttr_t uBlockMin, SphAttr_t uBlockMax ) const;
};
bool IFilter_Values::EvalValues ( SphAttr_t uValue ) const
{
if ( !m_pValues )
return true;
const SphAttr_t * pA = m_pValues;
const SphAttr_t * pB = m_pValues + m_iValueCount - 1;
if ( uValue==*pA || uValue==*pB ) return true;
if ( uValue<(*pA) || uValue>(*pB) ) return false;
while ( pB-pA>1 )
{
const SphAttr_t * pM = pA + ((pB-pA)/2);
if ( uValue==(*pM) )
return true;
if ( uValue<(*pM) )
pB = pM;
else
pA = pM;
}
return false;
}
// OPTIMIZE: use binary search
bool IFilter_Values::EvalBlockValues ( SphAttr_t uBlockMin, SphAttr_t uBlockMax ) const
{
// is any of our values inside the block?
for ( int i = 0; i < m_iValueCount; i++ )
if ( GetValue(i)>=uBlockMin && GetValue(i)<=uBlockMax )
return true;
return false;
}
template<bool HAS_EQUAL>
bool EvalRange ( SphAttr_t uValue, SphAttr_t iMin, SphAttr_t iMax )
{
if_const ( HAS_EQUAL )
return uValue>=iMin && uValue<=iMax;
else
return uValue>iMin && uValue<iMax;
}
/// range
struct IFilter_Range: virtual ISphFilter
{
SphAttr_t m_iMinValue;
SphAttr_t m_iMaxValue;
virtual void SetRange ( SphAttr_t tMin, SphAttr_t tMax )
{
m_iMinValue = tMin;
m_iMaxValue = tMax;
}
};
/// filters
// attr
struct Filter_Values: public IFilter_Attr, IFilter_Values
{
virtual bool Eval ( const CSphMatch & tMatch ) const
{
return EvalValues ( tMatch.GetAttr ( m_tLocator ) );
}
virtual bool EvalBlock ( const DWORD * pMinDocinfo, const DWORD * pMaxDocinfo ) const
{
if ( m_tLocator.m_bDynamic )
return true; // ignore computed attributes
SphAttr_t uBlockMin = sphGetRowAttr ( DOCINFO2ATTRS ( pMinDocinfo ), m_tLocator );
SphAttr_t uBlockMax = sphGetRowAttr ( DOCINFO2ATTRS ( pMaxDocinfo ), m_tLocator );
return EvalBlockValues ( uBlockMin, uBlockMax );
}
};
struct Filter_SingleValue : public IFilter_Attr
{
SphAttr_t m_RefValue;
#ifndef NDEBUG
virtual void SetValues ( const SphAttr_t * pStorage, int iCount )
#else
virtual void SetValues ( const SphAttr_t * pStorage, int )
#endif
{
assert ( pStorage );
assert ( iCount==1 );
m_RefValue = (*pStorage);
}
virtual bool Eval ( const CSphMatch & tMatch ) const
{
return tMatch.GetAttr ( m_tLocator )==m_RefValue;
}
virtual bool EvalBlock ( const DWORD * pMinDocinfo, const DWORD * pMaxDocinfo ) const
{
if ( m_tLocator.m_bDynamic )
return true; // ignore computed attributes
SphAttr_t uBlockMin = sphGetRowAttr ( DOCINFO2ATTRS ( pMinDocinfo ), m_tLocator );
SphAttr_t uBlockMax = sphGetRowAttr ( DOCINFO2ATTRS ( pMaxDocinfo ), m_tLocator );
return ( uBlockMin<=m_RefValue && m_RefValue<=uBlockMax );
}
};
struct Filter_SingleValueStatic32 : public Filter_SingleValue
{
int m_iIndex;
virtual void SetLocator ( const CSphAttrLocator & tLoc )
{
assert ( tLoc.m_iBitCount==32 );
assert ( ( tLoc.m_iBitOffset % 32 )==0 );
assert ( !tLoc.m_bDynamic );
m_tLocator = tLoc;
m_iIndex = tLoc.m_iBitOffset / 32;
}
virtual bool Eval ( const CSphMatch & tMatch ) const
{
return tMatch.m_pStatic [ m_iIndex ]==m_RefValue;
}
};
template < bool HAS_EQUAL >
struct Filter_Range: public IFilter_Attr, IFilter_Range
{
virtual bool Eval ( const CSphMatch & tMatch ) const
{
return EvalRange<HAS_EQUAL> ( tMatch.GetAttr ( m_tLocator ), m_iMinValue, m_iMaxValue );
}
virtual bool EvalBlock ( const DWORD * pMinDocinfo, const DWORD * pMaxDocinfo ) const
{
if ( m_tLocator.m_bDynamic )
return true; // ignore computed attributes
SphAttr_t uBlockMin = sphGetRowAttr ( DOCINFO2ATTRS ( pMinDocinfo ), m_tLocator );
SphAttr_t uBlockMax = sphGetRowAttr ( DOCINFO2ATTRS ( pMaxDocinfo ), m_tLocator );
// not-reject
if_const ( HAS_EQUAL )
return ( m_iMaxValue>=uBlockMin && m_iMinValue<=uBlockMax );
else
return ( m_iMaxValue>uBlockMin && m_iMinValue<uBlockMax );
}
};
// float
template < bool HAS_EQUAL >
struct Filter_FloatRange : public IFilter_Attr
{
float m_fMinValue;
float m_fMaxValue;
virtual void SetRangeFloat ( float fMin, float fMax )
{
m_fMinValue = fMin;
m_fMaxValue = fMax;
}
virtual bool Eval ( const CSphMatch & tMatch ) const
{
const float & fValue = tMatch.GetAttrFloat ( m_tLocator );
if_const ( HAS_EQUAL )
return fValue>=m_fMinValue && fValue<=m_fMaxValue;
else
return fValue>m_fMinValue && fValue<m_fMaxValue;
}
virtual bool EvalBlock ( const DWORD * pMinDocinfo, const DWORD * pMaxDocinfo ) const
{
if ( m_tLocator.m_bDynamic )
return true; // ignore computed attributes
float fBlockMin = sphDW2F ( (DWORD)sphGetRowAttr ( DOCINFO2ATTRS ( pMinDocinfo ), m_tLocator ) );
float fBlockMax = sphDW2F ( (DWORD)sphGetRowAttr ( DOCINFO2ATTRS ( pMaxDocinfo ), m_tLocator ) );
// not-reject
if_const ( HAS_EQUAL )
return ( m_fMaxValue>=fBlockMin && m_fMinValue<=fBlockMax );
else
return ( m_fMaxValue>fBlockMin && m_fMinValue<fBlockMax );
}
};
// id
struct Filter_IdValues: public IFilter_Values
{
virtual bool Eval ( const CSphMatch & tMatch ) const
{
return EvalValues ( tMatch.m_uDocID );
}
bool EvalBlockValues ( SphAttr_t uBlockMin, SphAttr_t uBlockMax ) const
{
// is any of our values inside the block?
for ( int i = 0; i < m_iValueCount; i++ )
if ( (SphDocID_t)GetValue(i)>=(SphDocID_t)uBlockMin && (SphDocID_t)GetValue(i)<=(SphDocID_t)uBlockMax )
return true;
return false;
}
virtual bool EvalBlock ( const DWORD * pMinDocinfo, const DWORD * pMaxDocinfo ) const
{
const SphAttr_t uBlockMin = DOCINFO2ID ( pMinDocinfo );
const SphAttr_t uBlockMax = DOCINFO2ID ( pMaxDocinfo );
return EvalBlockValues ( uBlockMin, uBlockMax );
}
Filter_IdValues ()
{
m_bUsesAttrs = false;
}
};
template < bool HAS_EQUAL >
struct Filter_IdRange: public IFilter_Range
{
virtual void SetRange ( SphAttr_t tMin, SphAttr_t tMax )
{
m_iMinValue = (SphDocID_t)Max ( (SphDocID_t)tMin, 0u );
m_iMaxValue = tMax;
}
virtual bool Eval ( const CSphMatch & tMatch ) const
{
const SphDocID_t uID = tMatch.m_uDocID;
if_const ( HAS_EQUAL )
return uID>=(SphDocID_t)m_iMinValue && uID<=(SphDocID_t)m_iMaxValue;
else
return uID>(SphDocID_t)m_iMinValue && uID<(SphDocID_t)m_iMaxValue;
}
virtual bool EvalBlock ( const DWORD * pMinDocinfo, const DWORD * pMaxDocinfo ) const
{
const SphDocID_t uBlockMin = DOCINFO2ID ( pMinDocinfo );
const SphDocID_t uBlockMax = DOCINFO2ID ( pMaxDocinfo );
// not-reject
if_const ( HAS_EQUAL )
return ( (SphDocID_t)m_iMaxValue>=uBlockMin && (SphDocID_t)m_iMinValue<=uBlockMax );
else
return ( (SphDocID_t)m_iMaxValue>uBlockMin && (SphDocID_t)m_iMinValue<uBlockMax );
}
Filter_IdRange ()
{
m_bUsesAttrs = false;
}
};
struct Filter_WeightValues: public IFilter_Values
{
virtual bool Eval ( const CSphMatch & tMatch ) const
{
return EvalValues ( tMatch.m_iWeight );
}
Filter_WeightValues ()
{
m_bUsesAttrs = false;
}
};
template < bool HAS_EQUAL >
struct Filter_WeightRange: public IFilter_Range
{
virtual bool IsEarly () { return false; }
virtual bool Eval ( const CSphMatch & tMatch ) const
{
return EvalRange<HAS_EQUAL> ( tMatch.m_iWeight, m_iMinValue, m_iMaxValue );
}
Filter_WeightRange ()
{
m_bUsesAttrs = false;
}
};
//////////////////////////////////////////////////////////////////////////
// MVA
//////////////////////////////////////////////////////////////////////////
struct IFilter_MVA: virtual IFilter_Attr
{
const DWORD * m_pMvaStorage;
bool m_bArenaProhibit;
IFilter_MVA ()
: m_pMvaStorage ( NULL )
, m_bArenaProhibit ( false )
{}
virtual void SetMVAStorage ( const DWORD * pMva, bool bArenaProhibit )
{
m_pMvaStorage = pMva;
m_bArenaProhibit = bArenaProhibit;
}
inline bool LoadMVA ( const CSphMatch & tMatch, const DWORD ** pMva, const DWORD ** pMvaMax ) const
{
assert ( m_pMvaStorage );
*pMva = tMatch.GetAttrMVA ( m_tLocator, m_pMvaStorage, m_bArenaProhibit );
if ( !*pMva )
return false;
*pMvaMax = *pMva + (**pMva) + 1;
(*pMva)++;
return true;
}
};
template < typename T >
struct Filter_MVAValues_Any : public IFilter_MVA, IFilter_Values
{
virtual bool Eval ( const CSphMatch & tMatch ) const
{
const DWORD * pMva, * pMvaMax;
if ( !LoadMVA ( tMatch, &pMva, &pMvaMax ) )
return false;
return MvaEval ( pMva, pMvaMax );
}
bool MvaEval ( const DWORD * pMva, const DWORD * pMvaMax ) const
{
const SphAttr_t * pFilter = m_pValues;
const SphAttr_t * pFilterMax = pFilter + m_iValueCount;
const T * L = (const T *)pMva;
const T * R = (const T *)pMvaMax;
R--;
for ( ; pFilter < pFilterMax; pFilter++ )
{
while ( L<=R )
{
const T * pVal = L + (R - L) / 2;
if ( *pFilter > *pVal )
L = pVal + 1;
else if ( *pFilter < *pVal )
R = pVal - 1;
else
return true;
}
R = (const T *)pMvaMax;
R--;
}
return false;
}
};
template < typename T >
struct Filter_MVAValues_All : public IFilter_MVA, IFilter_Values
{
virtual bool Eval ( const CSphMatch & tMatch ) const
{
const DWORD * pMva, * pMvaMax;
if ( !LoadMVA ( tMatch, &pMva, &pMvaMax ) )
return false;
return MvaEval ( pMva, pMvaMax );
}
bool MvaEval ( const DWORD * pMva, const DWORD * pMvaMax ) const
{
const T * L = (const T *)pMva;
const T * R = (const T *)pMvaMax;
for ( const T * pVal=L; pVal<R; pVal++ )
{
const SphAttr_t iCheck = *pVal;
if ( !sphBinarySearch ( m_pValues, m_pValues + m_iValueCount - 1, iCheck ) )
return false;
}
return true;
}
};
static DWORD GetMvaValue ( const DWORD * pVal )
{
return *pVal;
}
static int64_t GetMvaValue ( const int64_t * pVal )
{
return MVA_UPSIZE ( (const DWORD *)pVal );
}
template < typename T, bool HAS_EQUAL >
struct Filter_MVARange_Any : public IFilter_MVA, IFilter_Range
{
virtual bool Eval ( const CSphMatch & tMatch ) const
{
const DWORD * pMva, * pMvaMax;
if ( !LoadMVA ( tMatch, &pMva, &pMvaMax ) )
return false;
return MvaEval ( pMva, pMvaMax );
}
bool MvaEval ( const DWORD * pMva, const DWORD * pMvaMax ) const
{
const T * pEnd = (const T *)pMvaMax;
const T * L = (const T *)pMva;
const T * R = pEnd - 1;
while ( L<=R )
{
const T * pVal = L + (R - L) / 2;
T iMva = GetMvaValue ( pVal );
if ( m_iMinValue>iMva )
L = pVal + 1;
else if ( m_iMinValue<iMva )
R = pVal - 1;
else
return ( HAS_EQUAL || pVal+1<pEnd );
}
if ( L==pEnd )
return false;
T iMvaL = GetMvaValue ( L );
if_const ( HAS_EQUAL )
return iMvaL<=m_iMaxValue;
else
return iMvaL<m_iMaxValue;
}
};
template < typename T, bool HAS_EQUAL >
struct Filter_MVARange_All : public IFilter_MVA, IFilter_Range
{
virtual bool Eval ( const CSphMatch & tMatch ) const
{
const DWORD * pMva, * pMvaMax;
if ( !LoadMVA ( tMatch, &pMva, &pMvaMax ) )
return false;
return MvaEval ( pMva, pMvaMax );
}
bool MvaEval ( const DWORD * pMva, const DWORD * pMvaMax ) const
{
const T * L = (const T *)pMva;
const T * pEnd = (const T *)pMvaMax;
const T * R = pEnd - 1;
if_const ( HAS_EQUAL )
return ( m_iMinValue<=*L && *R<=m_iMaxValue );
else
return ( m_iMinValue<*L && *R<m_iMaxValue );
}
};
SphStringCmp_fn CmpFn ( ESphCollation eCollation )
{
switch ( eCollation )
{
case SPH_COLLATION_LIBC_CI: return sphCollateLibcCI;
case SPH_COLLATION_LIBC_CS: return sphCollateLibcCS;
case SPH_COLLATION_UTF8_GENERAL_CI: return sphCollateUtf8GeneralCI;
default: return sphCollateBinary;
}
}
class FilterString_c : public IFilter_Attr
{
private:
CSphFixedVector<BYTE> m_dVal;
bool m_bEq;
protected:
SphStringCmp_fn m_fnStrCmp;
const BYTE * m_pStringBase;
bool m_bPacked;
public:
FilterString_c ( ESphCollation eCollation, ESphAttr eType, bool bEq )
: m_dVal ( 0 )
, m_bEq ( bEq )
, m_fnStrCmp ( CmpFn ( eCollation ) )
, m_pStringBase ( NULL )
, m_bPacked ( eType==SPH_ATTR_STRING )
{}
virtual void SetRefString ( const CSphString * pRef, int iCount )
{
assert ( iCount<2 );
const char * sVal = pRef ? pRef->cstr() : NULL;
int iLen = pRef ? pRef->Length() : 0;
if ( m_bPacked )
{
m_dVal.Reset ( iLen+4 );
int iPacked = sphPackStrlen ( m_dVal.Begin(), iLen );
memcpy ( m_dVal.Begin()+iPacked, sVal, iLen );
} else
{
m_dVal.Reset ( iLen+1 );
memcpy ( m_dVal.Begin(), sVal, iLen );
m_dVal[iLen] = '\0';
}
}
virtual void SetStringStorage ( const BYTE * pStrings )
{
m_pStringBase = pStrings;
}
virtual bool Eval ( const CSphMatch & tMatch ) const
{
if ( m_bPacked && !m_pStringBase )
return !m_bEq;
SphAttr_t uVal = tMatch.GetAttr ( m_tLocator );
const BYTE * pStr;
if ( !uVal )
pStr = (const BYTE*)"\0"; // 2 bytes, for packed strings
else if ( m_bPacked )
pStr = m_pStringBase + uVal;
else
pStr = (const BYTE *)uVal;
bool bEq = ( m_fnStrCmp ( pStr, m_dVal.Begin(), m_bPacked )==0 );
return ( m_bEq==bEq );
}
};
struct Filter_StringValues_c: FilterString_c
{
CSphVector<BYTE> m_dVal;
CSphVector<int> m_dOfs;
Filter_StringValues_c ( ESphCollation eCollation, ESphAttr eType )
: FilterString_c ( eCollation, eType, false )
{}
virtual void SetRefString ( const CSphString * pRef, int iCount )
{
assert ( pRef );
assert ( iCount>0 );
int iOfs = 0;
for ( int i=0; i<iCount; i++ )
{
const char * sRef = ( pRef + i )->cstr();
int iLen = ( pRef + i )->Length();
if ( m_bPacked )
{
m_dVal.Resize ( iOfs+iLen+4 );
int iPacked = sphPackStrlen ( m_dVal.Begin() + iOfs, iLen );
memcpy ( m_dVal.Begin() + iOfs + iPacked, sRef, iLen );
} else
{
m_dVal.Resize ( iOfs+iLen+1 );
memcpy ( m_dVal.Begin() + iOfs, sRef, iLen );
m_dVal[iOfs+iLen] = '\0';
}
m_dOfs.Add ( iOfs );
iOfs = m_dVal.GetLength();
}
}
virtual bool Eval ( const CSphMatch & tMatch ) const
{
SphAttr_t uVal = tMatch.GetAttr ( m_tLocator );
const BYTE * pStr;
if ( !uVal )
pStr = (const BYTE*)"\0";
else if ( m_bPacked )
pStr = m_pStringBase + uVal;
else
pStr = (const BYTE *)uVal;
ARRAY_FOREACH ( i, m_dOfs )
if ( m_fnStrCmp ( pStr, m_dVal.Begin() + m_dOfs[i], m_bPacked )==0 )
return true;
return false;
}
};
struct Filter_And2 : public ISphFilter
{
ISphFilter * m_pArg1;
ISphFilter * m_pArg2;
explicit Filter_And2 ( ISphFilter * pArg1, ISphFilter * pArg2, bool bUsesAttrs )
: m_pArg1 ( pArg1 )
, m_pArg2 ( pArg2 )
{
m_bUsesAttrs = bUsesAttrs;
}
~Filter_And2 ()
{
SafeDelete ( m_pArg1 );
SafeDelete ( m_pArg2 );
}
virtual bool Eval ( const CSphMatch & tMatch ) const
{
return m_pArg1->Eval ( tMatch ) && m_pArg2->Eval ( tMatch );
}
virtual bool EvalBlock ( const DWORD * pMin, const DWORD * pMax ) const
{
return m_pArg1->EvalBlock ( pMin, pMax ) && m_pArg2->EvalBlock ( pMin, pMax );
}
virtual ISphFilter * Join ( ISphFilter * pFilter )
{
ISphFilter * pJoined = new Filter_And2 ( m_pArg2, pFilter, m_bUsesAttrs );
m_pArg2 = pJoined;
return this;
}
virtual void SetMVAStorage ( const DWORD * pMva, bool bArenaProhibit )
{
m_pArg1->SetMVAStorage ( pMva, bArenaProhibit );
m_pArg2->SetMVAStorage ( pMva, bArenaProhibit );
}
virtual void SetStringStorage ( const BYTE * pStrings )
{
m_pArg1->SetStringStorage ( pStrings );
m_pArg2->SetStringStorage ( pStrings );
}
};
struct Filter_And3 : public ISphFilter
{
ISphFilter * m_pArg1;
ISphFilter * m_pArg2;
ISphFilter * m_pArg3;
explicit Filter_And3 ( ISphFilter * pArg1, ISphFilter * pArg2, ISphFilter * pArg3, bool bUsesAttrs )
: m_pArg1 ( pArg1 )
, m_pArg2 ( pArg2 )
, m_pArg3 ( pArg3 )
{
m_bUsesAttrs = bUsesAttrs;
}
~Filter_And3 ()
{
SafeDelete ( m_pArg1 );
SafeDelete ( m_pArg2 );
SafeDelete ( m_pArg3 );
}
virtual bool Eval ( const CSphMatch & tMatch ) const
{
return m_pArg1->Eval ( tMatch ) && m_pArg2->Eval ( tMatch ) && m_pArg3->Eval ( tMatch );
}
virtual bool EvalBlock ( const DWORD * pMin, const DWORD * pMax ) const
{
return m_pArg1->EvalBlock ( pMin, pMax ) && m_pArg2->EvalBlock ( pMin, pMax ) && m_pArg3->EvalBlock ( pMin, pMax );
}
virtual ISphFilter * Join ( ISphFilter * pFilter )
{
ISphFilter * pJoined = new Filter_And2 ( m_pArg3, pFilter, m_bUsesAttrs );
m_pArg3 = pJoined;
return this;
}
virtual void SetMVAStorage ( const DWORD * pMva, bool bArenaProhibit )
{
m_pArg1->SetMVAStorage ( pMva, bArenaProhibit );
m_pArg2->SetMVAStorage ( pMva, bArenaProhibit );
m_pArg3->SetMVAStorage ( pMva, bArenaProhibit );
}
virtual void SetStringStorage ( const BYTE * pStrings )
{
m_pArg1->SetStringStorage ( pStrings );
m_pArg2->SetStringStorage ( pStrings );
m_pArg3->SetStringStorage ( pStrings );
}
};
struct Filter_And: public ISphFilter
{
CSphVector<ISphFilter *> m_dFilters;
~Filter_And ()
{
ARRAY_FOREACH ( i, m_dFilters )
SafeDelete ( m_dFilters[i] );
}
void Add ( ISphFilter * pFilter )
{
m_dFilters.Add ( pFilter );
m_bUsesAttrs |= pFilter->UsesAttrs();
}
virtual bool Eval ( const CSphMatch & tMatch ) const
{
ARRAY_FOREACH ( i, m_dFilters )
if ( !m_dFilters[i]->Eval ( tMatch ) )
return false;
return true;
}
virtual bool EvalBlock ( const DWORD * pMinDocinfo, const DWORD * pMaxDocinfo ) const
{
ARRAY_FOREACH ( i, m_dFilters )
if ( !m_dFilters[i]->EvalBlock ( pMinDocinfo, pMaxDocinfo ) )
return false;
return true;
}
virtual ISphFilter * Join ( ISphFilter * pFilter )
{
Add ( pFilter );
return this;
}
Filter_And ()
{
m_bUsesAttrs = false;
}
virtual void SetMVAStorage ( const DWORD * pMva, bool bArenaProhibit )
{
ARRAY_FOREACH ( i, m_dFilters )
m_dFilters[i]->SetMVAStorage ( pMva, bArenaProhibit );
}
virtual void SetStringStorage ( const BYTE * pStrings )
{
ARRAY_FOREACH ( i, m_dFilters )
m_dFilters[i]->SetStringStorage ( pStrings );
}
virtual ISphFilter * Optimize()
{
if ( m_dFilters.GetLength()==2 )
{
ISphFilter * pOpt = new Filter_And2 ( m_dFilters[0], m_dFilters[1], m_bUsesAttrs );
m_dFilters.Reset();
delete this;
return pOpt;
}
if ( m_dFilters.GetLength()==3 )
{
ISphFilter * pOpt = new Filter_And3 ( m_dFilters[0], m_dFilters[1], m_dFilters[2], m_bUsesAttrs );
m_dFilters.Reset();
delete this;
return pOpt;
}
return this;
}
};
// not
struct Filter_Not: public ISphFilter
{
ISphFilter * m_pFilter;
explicit Filter_Not ( ISphFilter * pFilter )
: m_pFilter ( pFilter )
{
assert ( pFilter );
m_bUsesAttrs = pFilter->UsesAttrs();
}
~Filter_Not ()
{
SafeDelete ( m_pFilter );
}
virtual bool Eval ( const CSphMatch & tMatch ) const
{
return !m_pFilter->Eval ( tMatch );
}
virtual bool EvalBlock ( const DWORD *, const DWORD * ) const
{
// if block passes through the filter we can't just negate the
// result since it's imprecise at this point
return true;
}
virtual void SetMVAStorage ( const DWORD * pMva, bool bArenaProhibit )
{
m_pFilter->SetMVAStorage ( pMva, bArenaProhibit );
}
virtual void SetStringStorage ( const BYTE * pStrings )
{
m_pFilter->SetStringStorage ( pStrings );
}
};
/// impl
ISphFilter * ISphFilter::Join ( ISphFilter * pFilter )
{
Filter_And * pAnd = new Filter_And();
pAnd->Add ( this );
pAnd->Add ( pFilter );
return pAnd;
}
/// helper functions
static inline ISphFilter * ReportError ( CSphString & sError, const char * sMessage, ESphFilter eFilterType )
{
CSphString sFilterName;
switch ( eFilterType )
{
case SPH_FILTER_VALUES: sFilterName = "intvalues"; break;
case SPH_FILTER_RANGE: sFilterName = "intrange"; break;
case SPH_FILTER_FLOATRANGE: sFilterName = "floatrange"; break;
case SPH_FILTER_STRING: sFilterName = "string"; break;
case SPH_FILTER_NULL: sFilterName = "null"; break;
default: sFilterName.SetSprintf ( "(filter-type-%d)", eFilterType ); break;
}
sError.SetSprintf ( sMessage, sFilterName.cstr() );
return NULL;
}
static ISphFilter * CreateSpecialFilter ( const CSphString & sName, ESphFilter eFilterType, bool bHasEqual, CSphString & sError )
{
if ( sName=="@id" )
{
switch ( eFilterType )
{
case SPH_FILTER_VALUES: return new Filter_IdValues;
case SPH_FILTER_RANGE:
if ( bHasEqual )
return new Filter_IdRange<true>;
else
return new Filter_IdRange<false>;
default:
return ReportError ( sError, "unsupported filter type '%s' on @id", eFilterType );
}
} else if ( sName=="@weight" )
{
switch ( eFilterType )
{
case SPH_FILTER_VALUES: return new Filter_WeightValues;
case SPH_FILTER_RANGE:
if ( bHasEqual )
return new Filter_WeightRange<true>;
else
return new Filter_WeightRange<false>;
default:
return ReportError ( sError, "unsupported filter type '%s' on @weight", eFilterType );
}
}
return NULL;
}
static ISphFilter * CreateFilter ( ESphAttr eAttrType, ESphFilter eFilterType, ESphMvaFunc eMvaFunc, int iNumValues,
const CSphAttrLocator & tLoc, CSphString & sError, CSphString & sWarning, bool bHasEqual, ESphCollation eCollation )
{
// MVA
if ( eAttrType==SPH_ATTR_UINT32SET || eAttrType==SPH_ATTR_INT64SET )
{
if (!( eFilterType==SPH_FILTER_VALUES || eFilterType==SPH_FILTER_RANGE ))
return ReportError ( sError, "unsupported filter type '%s' on MVA column", eFilterType );
if ( eMvaFunc==SPH_MVAFUNC_NONE )
sWarning.SetSprintf ( "suggest an explicit ANY()/ALL() around a filter on MVA column" );
bool bWide = ( eAttrType==SPH_ATTR_INT64SET );
bool bRange = ( eFilterType==SPH_FILTER_RANGE );
bool bAll = ( eMvaFunc==SPH_MVAFUNC_ALL );
int iIndex = bWide*8 + bRange*4 + bAll*2 + bHasEqual;
switch ( iIndex )
{
case 0: return new Filter_MVAValues_Any<DWORD>();
case 1: return new Filter_MVAValues_Any<DWORD>();
case 2: return new Filter_MVAValues_All<DWORD>();
case 3: return new Filter_MVAValues_All<DWORD>();
case 4: return new Filter_MVARange_Any<DWORD, false>();
case 5: return new Filter_MVARange_Any<DWORD, true>();
case 6: return new Filter_MVARange_All<DWORD, false>();
case 7: return new Filter_MVARange_All<DWORD, true>();
case 8: return new Filter_MVAValues_Any<int64_t>();
case 9: return new Filter_MVAValues_Any<int64_t>();
case 10: return new Filter_MVAValues_All<int64_t>();
case 11: return new Filter_MVAValues_All<int64_t>();
case 12: return new Filter_MVARange_Any<int64_t, false>();
case 13: return new Filter_MVARange_Any<int64_t, true>();
case 14: return new Filter_MVARange_All<int64_t, false>();
case 15: return new Filter_MVARange_All<int64_t, true>();