-
-
Notifications
You must be signed in to change notification settings - Fork 492
/
sphinxjsonquery.cpp
2833 lines (2268 loc) · 71.9 KB
/
sphinxjsonquery.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
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
//
// Copyright (c) 2017-2019, Manticore Software LTD (http://manticoresearch.com)
// 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 "sphinxquery.h"
#include "sphinxsearch.h"
#include "sphinxplugin.h"
#include "sphinxutils.h"
#include "searchdaemon.h"
#include "sphinxjson.h"
#include "attribute.h"
#include "json/cJSON.h"
static const char * g_szAll = "_all";
static const char * g_szFilter = "_@filter_";
static const char g_sHighlight[] = "_@highlight_";
static const char g_sOrder[] = "_@order_";
static bool IsFilter ( const JsonObj_c & tJson )
{
if ( !tJson )
return false;
CSphString sName = tJson.Name();
if ( sName=="equals" )
return true;
if ( sName=="range" )
return true;
if ( sName=="geo_distance" )
return true;
return false;
}
//////////////////////////////////////////////////////////////////////////
class QueryTreeBuilder_c : public XQParseHelper_c
{
public:
QueryTreeBuilder_c ( const CSphQuery * pQuery, const ISphTokenizer * pQueryTokenizerQL, const CSphIndexSettings & tSettings );
void CollectKeywords ( const char * szStr, XQNode_t * pNode, const XQLimitSpec_t & tLimitSpec );
bool HandleFieldBlockStart ( const char * & /*pPtr*/ ) override { return true; }
bool HandleSpecialFields ( const char * & pPtr, FieldMask_t & dFields ) override;
bool NeedTrailingSeparator() override { return false; }
XQNode_t * CreateNode ( XQLimitSpec_t & tLimitSpec );
const ISphTokenizer * GetQLTokenizer() { return m_pQueryTokenizerQL; }
const CSphIndexSettings & GetIndexSettings() { return m_tSettings; }
const CSphQuery * GetQuery() { return m_pQuery; }
private:
const CSphQuery * m_pQuery {nullptr};
const ISphTokenizer * m_pQueryTokenizerQL {nullptr};
const CSphIndexSettings & m_tSettings;
void AddChildKeyword ( XQNode_t * pParent, const char * szKeyword, int iSkippedPosBeforeToken, const XQLimitSpec_t & tLimitSpec );
};
QueryTreeBuilder_c::QueryTreeBuilder_c ( const CSphQuery * pQuery, const ISphTokenizer * pQueryTokenizerQL, const CSphIndexSettings & tSettings )
: m_pQuery ( pQuery )
, m_pQueryTokenizerQL ( pQueryTokenizerQL )
, m_tSettings ( tSettings )
{}
void QueryTreeBuilder_c::CollectKeywords ( const char * szStr, XQNode_t * pNode, const XQLimitSpec_t & tLimitSpec )
{
m_pTokenizer->SetBuffer ( (const BYTE*)szStr, strlen ( szStr ) );
while (true)
{
int iSkippedPosBeforeToken = 0;
if ( m_bWasBlended )
{
iSkippedPosBeforeToken = m_pTokenizer->SkipBlended();
// just add all skipped blended parts except blended head (already added to atomPos)
if ( iSkippedPosBeforeToken>1 )
m_iAtomPos += iSkippedPosBeforeToken - 1;
}
const char * sToken = (const char *) m_pTokenizer->GetToken ();
if ( !sToken )
{
AddChildKeyword ( pNode, nullptr, iSkippedPosBeforeToken, tLimitSpec );
break;
}
// now let's do some token post-processing
m_bWasBlended = m_pTokenizer->TokenIsBlended();
int iPrevDeltaPos = 0;
if ( m_pPlugin && m_pPlugin->m_fnPushToken )
sToken = m_pPlugin->m_fnPushToken ( m_pPluginData, (char*)sToken, &iPrevDeltaPos, m_pTokenizer->GetTokenStart(), m_pTokenizer->GetTokenEnd() - m_pTokenizer->GetTokenStart() );
m_iAtomPos += 1 + iPrevDeltaPos;
bool bMultiDestHead = false;
bool bMultiDest = false;
int iDestCount = 0;
// do nothing inside phrase
if ( !m_pTokenizer->m_bPhrase )
bMultiDest = m_pTokenizer->WasTokenMultiformDestination ( bMultiDestHead, iDestCount );
// check for stopword, and create that node
// temp buffer is required, because GetWordID() might expand (!) the keyword in-place
BYTE sTmp [ MAX_TOKEN_BYTES ];
strncpy ( (char*)sTmp, sToken, MAX_TOKEN_BYTES );
sTmp[MAX_TOKEN_BYTES-1] = '\0';
int iStopWord = 0;
if ( m_pPlugin && m_pPlugin->m_fnPreMorph )
m_pPlugin->m_fnPreMorph ( m_pPluginData, (char*)sTmp, &iStopWord );
SphWordID_t uWordId = iStopWord ? 0 : m_pDict->GetWordID ( sTmp );
if ( uWordId && m_pPlugin && m_pPlugin->m_fnPostMorph )
{
int iRes = m_pPlugin->m_fnPostMorph ( m_pPluginData, (char*)sTmp, &iStopWord );
if ( iStopWord )
uWordId = 0;
else if ( iRes )
uWordId = m_pDict->GetWordIDNonStemmed ( sTmp );
}
if ( !uWordId )
{
sToken = nullptr;
// stopwords with step=0 must not affect pos
if ( m_bEmptyStopword )
m_iAtomPos--;
}
if ( bMultiDest && !bMultiDestHead )
{
assert ( m_dMultiforms.GetLength() );
m_dMultiforms.Last().m_iDestCount++;
m_dDestForms.Add ( sToken );
} else
AddChildKeyword ( pNode, sToken, iSkippedPosBeforeToken, tLimitSpec );
if ( bMultiDestHead )
{
MultiformNode_t & tMulti = m_dMultiforms.Add();
tMulti.m_pNode = pNode;
tMulti.m_iDestStart = m_dDestForms.GetLength();
tMulti.m_iDestCount = 0;
}
}
}
bool QueryTreeBuilder_c::HandleSpecialFields ( const char * & pPtr, FieldMask_t & dFields )
{
if ( *pPtr=='_' )
{
int iLen = strlen(g_szAll);
if ( !strncmp ( pPtr, g_szAll, iLen ) )
{
pPtr += iLen;
dFields.SetAll();
return true;
}
}
return false;
}
XQNode_t * QueryTreeBuilder_c::CreateNode ( XQLimitSpec_t & tLimitSpec )
{
auto * pNode = new XQNode_t(tLimitSpec);
m_dSpawned.Add ( pNode );
return pNode;
}
void QueryTreeBuilder_c::AddChildKeyword ( XQNode_t * pParent, const char * szKeyword, int iSkippedPosBeforeToken, const XQLimitSpec_t & tLimitSpec )
{
XQKeyword_t tKeyword ( szKeyword, m_iAtomPos );
tKeyword.m_iSkippedBefore = iSkippedPosBeforeToken;
auto * pNode = new XQNode_t ( tLimitSpec );
pNode->m_pParent = pParent;
pNode->m_dWords.Add ( tKeyword );
pParent->m_dChildren.Add ( pNode );
m_dSpawned.Add ( pNode );
}
//////////////////////////////////////////////////////////////////////////
class QueryParserJson_c : public QueryParser_i
{
public:
bool IsFullscan ( const CSphQuery & tQuery ) const final;
bool IsFullscan ( const XQQuery_t & tQuery ) const final;
bool ParseQuery ( XQQuery_t & tParsed, const char * sQuery, const CSphQuery * pQuery,
const ISphTokenizer * pQueryTokenizer, const ISphTokenizer * pQueryTokenizerJson,
const CSphSchema * pSchema, CSphDict * pDict, const CSphIndexSettings & tSettings ) const final;
private:
XQNode_t * ConstructMatchNode ( const JsonObj_c & tJson, bool bPhrase, QueryTreeBuilder_c & tBuilder ) const;
XQNode_t * ConstructBoolNode ( const JsonObj_c & tJson, QueryTreeBuilder_c & tBuilder ) const;
XQNode_t * ConstructQLNode ( const JsonObj_c & tJson, QueryTreeBuilder_c & tBuilder ) const;
XQNode_t * ConstructMatchAllNode ( QueryTreeBuilder_c & tBuilder ) const;
bool ConstructBoolNodeItems ( const JsonObj_c & tClause, CSphVector<XQNode_t *> & dItems, QueryTreeBuilder_c & tBuilder ) const;
bool ConstructNodeOrFilter ( const JsonObj_c & tItem, CSphVector<XQNode_t *> & dNodes, QueryTreeBuilder_c & tBuilder ) const;
XQNode_t * ConstructNode ( const JsonObj_c & tJson, QueryTreeBuilder_c & tBuilder ) const;
};
bool QueryParserJson_c::IsFullscan ( const CSphQuery & tQuery ) const
{
// fixme: add more checks here
return tQuery.m_sQuery.IsEmpty();
}
bool QueryParserJson_c::IsFullscan ( const XQQuery_t & tQuery ) const
{
return !tQuery.m_pRoot || ( !tQuery.m_pRoot->m_dChildren.GetLength() && !tQuery.m_pRoot->m_dWords.GetLength() );
}
bool QueryParserJson_c::ParseQuery ( XQQuery_t & tParsed, const char * szQuery, const CSphQuery * pQuery,
const ISphTokenizer * pQueryTokenizerQL, const ISphTokenizer * pQueryTokenizerJson, const CSphSchema * pSchema, CSphDict * pDict,
const CSphIndexSettings & tSettings ) const
{
JsonObj_c tRoot ( szQuery );
// take only the first item of the query; ignore the rest
int iNumIndexes = tRoot.Size();
if ( !iNumIndexes )
{
tParsed.m_sParseError = "\"query\" property is empty";
return false;
}
ISphTokenizerRefPtr_c pMyJsonTokenizer { pQueryTokenizerJson->Clone ( SPH_CLONE_QUERY_LIGHTWEIGHT ) };
CSphDictRefPtr_c pMyDict { GetStatelessDict ( pDict ) };
QueryTreeBuilder_c tBuilder ( pQuery, pQueryTokenizerQL, tSettings );
tBuilder.Setup ( pSchema, pMyJsonTokenizer, pMyDict, &tParsed, tSettings );
tParsed.m_pRoot = ConstructNode ( tRoot[0], tBuilder );
if ( tBuilder.IsError() )
{
tBuilder.Cleanup();
return false;
}
XQLimitSpec_t tLimitSpec;
tParsed.m_pRoot = tBuilder.FixupTree ( tParsed.m_pRoot, tLimitSpec );
if ( tBuilder.IsError() )
{
tBuilder.Cleanup();
return false;
}
return true;
}
static const char * g_szOperatorNames[]=
{
"and",
"or"
};
static XQOperator_e StrToNodeOp ( const char * szStr )
{
if ( !szStr )
return SPH_QUERY_TOTAL;
int iOp=0;
for ( auto i : g_szOperatorNames )
{
if ( !strcmp ( szStr, i ) )
return XQOperator_e(iOp);
iOp++;
}
return SPH_QUERY_TOTAL;
}
XQNode_t * QueryParserJson_c::ConstructMatchNode ( const JsonObj_c & tJson, bool bPhrase, QueryTreeBuilder_c & tBuilder ) const
{
if ( !tJson.IsObj() )
{
tBuilder.Error ( "\"match\" value should be an object" );
return nullptr;
}
if ( tJson.Size()!=1 )
{
tBuilder.Error ( "ill-formed \"match\" property" );
return nullptr;
}
JsonObj_c tFields = tJson[0];
tBuilder.SetString ( tFields.Name() );
XQLimitSpec_t tLimitSpec;
const char * szQuery = nullptr;
XQOperator_e eNodeOp = bPhrase ? SPH_QUERY_PHRASE : SPH_QUERY_OR;
bool bIgnore = false;
if ( !tBuilder.ParseFields ( tLimitSpec.m_dFieldMask, tLimitSpec.m_iFieldMaxPos, bIgnore ) )
return nullptr;
if ( bIgnore )
{
tBuilder.Warning ( R"(ignoring fields in "%s", using "_all")", tFields.Name() );
tLimitSpec.Reset();
}
tLimitSpec.m_bFieldSpec = true;
if ( tFields.IsObj() )
{
// matching with flags
CSphString sError;
JsonObj_c tQuery = tFields.GetStrItem ( "query", sError );
if ( !tQuery )
{
tBuilder.Error ( "%s", sError.cstr() );
return nullptr;
}
szQuery = tQuery.SzVal();
if ( !bPhrase )
{
JsonObj_c tOp = tFields.GetItem ( "operator" );
if ( tOp ) // "and", "or"
{
eNodeOp = StrToNodeOp ( tOp.SzVal() );
if ( eNodeOp==SPH_QUERY_TOTAL )
{
tBuilder.Error ( "unknown operator: \"%s\"", tOp.SzVal() );
return nullptr;
}
}
}
} else
{
// simple list of keywords
if ( !tFields.IsStr() )
{
tBuilder.Warning ( "values of properties in \"match\" should be strings or objects" );
return nullptr;
}
szQuery = tFields.SzVal();
}
assert ( szQuery );
XQNode_t * pNewNode = tBuilder.CreateNode ( tLimitSpec );
pNewNode->SetOp ( eNodeOp );
tBuilder.CollectKeywords ( szQuery, pNewNode, tLimitSpec );
return pNewNode;
}
bool QueryParserJson_c::ConstructNodeOrFilter ( const JsonObj_c & tItem, CSphVector<XQNode_t *> & dNodes, QueryTreeBuilder_c & tBuilder ) const
{
// we created filters before, no need to process them again
if ( !IsFilter ( tItem ) )
{
XQNode_t * pNode = ConstructNode ( tItem, tBuilder );
if ( !pNode )
return false;
dNodes.Add ( pNode );
}
return true;
}
bool QueryParserJson_c::ConstructBoolNodeItems ( const JsonObj_c & tClause, CSphVector<XQNode_t *> & dItems, QueryTreeBuilder_c & tBuilder ) const
{
if ( tClause.IsArray() )
{
for ( const auto & tObject : tClause )
{
if ( !tObject.IsObj() )
{
tBuilder.Error ( "\"%s\" array value should be an object", tClause.Name() );
return false;
}
if ( !ConstructNodeOrFilter ( tObject[0], dItems, tBuilder ) )
return false;
}
} else if ( tClause.IsObj() )
{
if ( !ConstructNodeOrFilter ( tClause[0], dItems, tBuilder ) )
return false;
} else
{
tBuilder.Error ( "\"%s\" value should be an object or an array", tClause.Name() );
return false;
}
return true;
}
XQNode_t * QueryParserJson_c::ConstructBoolNode ( const JsonObj_c & tJson, QueryTreeBuilder_c & tBuilder ) const
{
if ( !tJson.IsObj() )
{
tBuilder.Error ( "\"bool\" value should be an object" );
return nullptr;
}
CSphVector<XQNode_t *> dMust, dShould, dMustNot;
for ( const auto & tClause : tJson )
{
CSphString sName = tClause.Name();
if ( sName=="must" )
{
if ( !ConstructBoolNodeItems ( tClause, dMust, tBuilder ) )
return nullptr;
} else if ( sName=="should" )
{
if ( !ConstructBoolNodeItems ( tClause, dShould, tBuilder ) )
return nullptr;
} else if ( sName=="must_not" )
{
if ( !ConstructBoolNodeItems ( tClause, dMustNot, tBuilder ) )
return nullptr;
} else
{
tBuilder.Error ( "unknown bool query type: \"%s\"", sName.cstr() );
return nullptr;
}
}
XQNode_t * pMustNode = nullptr;
XQNode_t * pShouldNode = nullptr;
XQNode_t * pMustNotNode = nullptr;
XQLimitSpec_t tLimitSpec;
if ( dMust.GetLength() )
{
// no need to construct AND node for a single child
if ( dMust.GetLength()==1 )
pMustNode = dMust[0];
else
{
XQNode_t * pAndNode = tBuilder.CreateNode ( tLimitSpec );
pAndNode->SetOp ( SPH_QUERY_AND );
for ( auto & i : dMust )
{
pAndNode->m_dChildren.Add(i);
i->m_pParent = pAndNode;
}
pMustNode = pAndNode;
}
}
if ( dShould.GetLength() )
{
if ( dShould.GetLength()==1 )
pShouldNode = dShould[0];
else
{
XQNode_t * pOrNode = tBuilder.CreateNode ( tLimitSpec );
pOrNode->SetOp ( SPH_QUERY_OR );
for ( auto & i : dShould )
{
pOrNode->m_dChildren.Add(i);
i->m_pParent = pOrNode;
}
pShouldNode = pOrNode;
}
}
// slightly different case - we need to construct the NOT node anyway
if ( dMustNot.GetLength() )
{
XQNode_t * pNotNode = tBuilder.CreateNode ( tLimitSpec );
pNotNode->SetOp ( SPH_QUERY_NOT );
if ( dMustNot.GetLength()==1 )
{
pNotNode->m_dChildren.Add ( dMustNot[0] );
dMustNot[0]->m_pParent = pNotNode;
} else
{
XQNode_t * pOrNode = tBuilder.CreateNode ( tLimitSpec );
pOrNode->SetOp ( SPH_QUERY_OR );
for ( auto & i : dMustNot )
{
pOrNode->m_dChildren.Add ( i );
i->m_pParent = pOrNode;
}
pNotNode->m_dChildren.Add ( pOrNode );
pOrNode->m_pParent = pNotNode;
}
pMustNotNode = pNotNode;
}
int iTotalNodes = 0;
iTotalNodes += pMustNode ? 1 : 0;
iTotalNodes += pShouldNode ? 1 : 0;
iTotalNodes += pMustNotNode ? 1 : 0;
if ( !iTotalNodes )
return nullptr;
else if ( iTotalNodes==1 )
{
XQNode_t * pResultNode = nullptr;
if ( pMustNode )
pResultNode = pMustNode;
else if ( pShouldNode )
pResultNode = pShouldNode;
else
pResultNode = pMustNotNode;
assert ( pResultNode );
return pResultNode;
} else
{
XQNode_t * pResultNode = pMustNode ? pMustNode : pMustNotNode;
assert ( pResultNode );
// combine 'must' and 'must_not' with AND
if ( pMustNode && pMustNotNode )
{
XQNode_t * pAndNode = tBuilder.CreateNode(tLimitSpec);
pAndNode->SetOp(SPH_QUERY_AND);
pAndNode->m_dChildren.Add ( pMustNode );
pAndNode->m_dChildren.Add ( pMustNotNode );
pMustNode->m_pParent = pAndNode;
pMustNotNode->m_pParent = pAndNode;
pResultNode = pAndNode;
}
// combine 'result' node and 'should' node with MAYBE
if ( pShouldNode )
{
XQNode_t * pMaybeNode = tBuilder.CreateNode ( tLimitSpec );
pMaybeNode->SetOp ( SPH_QUERY_MAYBE );
pMaybeNode->m_dChildren.Add ( pResultNode );
pMaybeNode->m_dChildren.Add ( pShouldNode );
pShouldNode->m_pParent = pMaybeNode;
pResultNode->m_pParent = pMaybeNode;
pResultNode = pMaybeNode;
}
return pResultNode;
}
return nullptr;
}
XQNode_t * QueryParserJson_c::ConstructQLNode ( const JsonObj_c & tJson, QueryTreeBuilder_c & tBuilder ) const
{
if ( !tJson.IsStr() )
{
tBuilder.Error ( "\"query_string\" value should be an string" );
return nullptr;
}
XQQuery_t tParsed;
if ( !sphParseExtendedQuery ( tParsed, tJson.StrVal().cstr(), tBuilder.GetQuery(), tBuilder.GetQLTokenizer(), tBuilder.GetSchema(), tBuilder.GetDict(), tBuilder.GetIndexSettings() ) )
{
tBuilder.Error ( "%s", tParsed.m_sParseError.cstr() );
return nullptr;
}
if ( !tParsed.m_sParseWarning.IsEmpty() )
tBuilder.Warning ( "%s", tParsed.m_sParseWarning.cstr() );
XQNode_t * pRoot = tParsed.m_pRoot;
tParsed.m_pRoot = nullptr;
return pRoot;
}
XQNode_t * QueryParserJson_c::ConstructMatchAllNode ( QueryTreeBuilder_c & tBuilder ) const
{
XQLimitSpec_t tLimitSpec;
XQNode_t * pNewNode = tBuilder.CreateNode ( tLimitSpec );
pNewNode->SetOp ( SPH_QUERY_NULL );
return pNewNode;
}
XQNode_t * QueryParserJson_c::ConstructNode ( const JsonObj_c & tJson, QueryTreeBuilder_c & tBuilder ) const
{
CSphString sName = tJson.Name();
if ( !tJson || sName.IsEmpty() )
{
tBuilder.Error ( "empty json found" );
return nullptr;
}
bool bMatch = sName=="match";
bool bPhrase = sName=="match_phrase";
if ( bMatch || bPhrase )
return ConstructMatchNode ( tJson, bPhrase, tBuilder );
if ( sName=="match_all" )
return ConstructMatchAllNode ( tBuilder );
if ( sName=="bool" )
return ConstructBoolNode ( tJson, tBuilder );
if ( sName=="query_string" )
return ConstructQLNode ( tJson, tBuilder );
return nullptr;
}
bool NonEmptyQuery ( const JsonObj_c & tQuery )
{
return ( tQuery.HasItem("match")
|| tQuery.HasItem("match_phrase")
|| tQuery.HasItem("bool") )
|| tQuery.HasItem("query_string");
}
//////////////////////////////////////////////////////////////////////////
struct LocationField_t
{
float m_fLat =0.0f;
float m_fLon = 0.0f;
};
struct LocationSource_t
{
CSphString m_sLat;
CSphString m_sLon;
};
static bool ParseLocation ( const char * sName, const JsonObj_c & tLoc, LocationField_t * pField, LocationSource_t * pSource, CSphString & sError );
class GeoDistInfo_c
{
public:
bool Parse ( const JsonObj_c & tRoot, bool bNeedDistance, CSphString & sError, CSphString & sWarning );
CSphString BuildExprString() const;
bool IsGeoDist() const { return m_bGeodist; }
float GetDistance() const { return m_fDistance; }
private:
bool m_bGeodist {false};
bool m_bGeodistAdaptive {true};
float m_fDistance {0.0f};
LocationField_t m_tLocAnchor;
LocationSource_t m_tLocSource;
bool ParseDistance ( const JsonObj_c & tDistance, CSphString & sError );
};
bool GeoDistInfo_c::Parse ( const JsonObj_c & tRoot, bool bNeedDistance, CSphString & sError, CSphString & sWarning )
{
JsonObj_c tLocAnchor = tRoot.GetItem("location_anchor");
JsonObj_c tLocSource = tRoot.GetItem("location_source");
if ( !tLocAnchor || !tLocSource )
{
if ( !tLocAnchor && !tLocSource )
sError = R"("location_anchor" and "location_source" properties missing)";
else
sError.SetSprintf ( "\"%s\" property missing", ( !tLocAnchor ? "location_anchor" : "location_source" ) );
return false;
}
if ( !ParseLocation ( "location_anchor", tLocAnchor, &m_tLocAnchor, nullptr, sError )
|| !ParseLocation ( "location_source", tLocSource, nullptr, &m_tLocSource, sError ) )
return false;
JsonObj_c tType = tRoot.GetStrItem ( "distance_type", sError, true );
if ( tType )
{
CSphString sType = tType.StrVal();
if ( sType!="adaptive" && sType!="haversine" )
{
sWarning.SetSprintf ( R"("distance_type" property type is invalid: "%s", defaulting to "adaptive")", sType.cstr() );
m_bGeodistAdaptive = true;
} else
m_bGeodistAdaptive = sType=="adaptive";
} else if ( !sError.IsEmpty() )
return false;
JsonObj_c tDistance = tRoot.GetItem("distance");
if ( tDistance )
{
if ( !ParseDistance ( tDistance, sError ) )
return false;
} else if ( bNeedDistance )
{
sError = "\"distance\" not specified";
return false;
}
m_bGeodist = true;
return true;
}
bool GeoDistInfo_c::ParseDistance ( const JsonObj_c & tDistance, CSphString & sError )
{
if ( tDistance.IsNum() )
{
// no units specified, meters assumed
m_fDistance = tDistance.FltVal();
return true;
}
if ( !tDistance.IsStr() )
{
sError = "\"distance\" property should be a number or a string";
return false;
}
const char * p = tDistance.SzVal();
assert ( p );
while ( *p && sphIsSpace(*p) )
p++;
const char * szNumber = p;
while ( *p && ( *p=='.' || ( *p>='0' && *p<='9' ) ) )
p++;
CSphString sNumber;
sNumber.SetBinary ( szNumber, p-szNumber );
while ( *p && sphIsSpace(*p) )
p++;
const char * szUnit = p;
while ( *p && sphIsAlpha(*p) )
p++;
CSphString sUnit;
sUnit.SetBinary ( szUnit, p-szUnit );
m_fDistance = (float)atof ( sNumber.cstr() );
float fCoeff = 1.0f;
if ( !sphGeoDistanceUnit ( sUnit.cstr(), fCoeff ) )
{
sError.SetSprintf ( "unknown distance unit: %s", sUnit.cstr() );
return false;
}
m_fDistance *= fCoeff;
return true;
}
CSphString GeoDistInfo_c::BuildExprString() const
{
CSphString sResult;
sResult.SetSprintf ( "GEODIST(%f, %f, %s, %s, {in=deg, out=m, method=%s})", m_tLocAnchor.m_fLat, m_tLocAnchor.m_fLon, m_tLocSource.m_sLat.cstr(), m_tLocSource.m_sLon.cstr(), m_bGeodistAdaptive ? "adaptive" : "haversine" );
return sResult;
}
//////////////////////////////////////////////////////////////////////////
static void AddToSelectList ( CSphQuery & tQuery, const CSphVector<CSphQueryItem> & dItems, int iFirstItem = 0 )
{
for ( int i = iFirstItem; i < dItems.GetLength(); i++ )
tQuery.m_sSelect.SetSprintf ( "%s, %s as %s", tQuery.m_sSelect.cstr(), dItems[i].m_sExpr.cstr(), dItems[i].m_sAlias.cstr() );
}
static JsonObj_c GetFilterColumn ( const JsonObj_c & tJson, CSphString & sError )
{
if ( !tJson.IsObj() )
{
sError = "filter should be an object";
return JsonNull;
}
if ( tJson.Size()!=1 )
{
sError = "\"equals\" filter should have only one element";
return JsonNull;
}
JsonObj_c tColumn = tJson[0];
if ( !tColumn )
{
sError = "empty filter found";
return JsonNull;
}
return tColumn;
}
static bool ConstructEqualsFilter ( const JsonObj_c & tJson, CSphVector<CSphFilterSettings> & dFilters, CSphString & sError )
{
JsonObj_c tColumn = GetFilterColumn ( tJson, sError );
if ( !tColumn )
return false;
if ( !tColumn.IsNum() && !tColumn.IsStr() )
{
sError = "\"equals\" filter expects numeric or string values";
return false;
}
CSphFilterSettings tFilter;
tFilter.m_sAttrName = tColumn.Name();
sphColumnToLowercase ( const_cast<char *>( tFilter.m_sAttrName.cstr() ) );
if ( tColumn.IsInt() )
{
tFilter.m_eType = SPH_FILTER_VALUES;
tFilter.m_dValues.Add ( tColumn.IntVal() );
} else if ( tColumn.IsNum() )
{
tFilter.m_eType = SPH_FILTER_FLOATRANGE;
tFilter.m_fMinValue = tColumn.FltVal();
tFilter.m_fMaxValue = tColumn.FltVal();
tFilter.m_bHasEqualMin = true;
tFilter.m_bHasEqualMax = true;
tFilter.m_bExclude = false;
} else
{
tFilter.m_eType = SPH_FILTER_STRING;
tFilter.m_dStrings.Add ( tColumn.StrVal() );
tFilter.m_bExclude = false;
}
dFilters.Add ( tFilter );
return true;
}
static bool ConstructRangeFilter ( const JsonObj_c & tJson, CSphVector<CSphFilterSettings> & dFilters, CSphString & sError )
{
JsonObj_c tColumn = GetFilterColumn ( tJson, sError );
if ( !tColumn )
return false;
CSphFilterSettings tNewFilter;
tNewFilter.m_sAttrName = tColumn.Name();
sphColumnToLowercase ( const_cast<char *>( tNewFilter.m_sAttrName.cstr() ) );
tNewFilter.m_bHasEqualMin = false;
tNewFilter.m_bHasEqualMax = false;
JsonObj_c tLess = tColumn.GetItem("lt");
if ( !tLess )
{
tLess = tColumn.GetItem("lte");
tNewFilter.m_bHasEqualMax = tLess;
}
JsonObj_c tGreater = tColumn.GetItem("gt");
if ( !tGreater )
{
tGreater = tColumn.GetItem("gte");
tNewFilter.m_bHasEqualMin = tGreater;
}
bool bLess = tLess;
bool bGreater = tGreater;
if ( !bLess && !bGreater )
{
sError = "empty filter found";
return false;
}
if ( ( bLess && !tLess.IsNum() ) || ( bGreater && !tGreater.IsNum() ) )
{
sError = "range filter expects numeric values";
return false;
}
bool bIntFilter = ( bLess && tLess.IsInt() ) || ( bGreater && tGreater.IsInt() );
if ( bLess )
{
if ( bIntFilter )
tNewFilter.m_iMaxValue = tLess.IntVal();
else
tNewFilter.m_fMaxValue = tLess.FltVal();
tNewFilter.m_bOpenLeft = !bGreater;
}
if ( bGreater )
{
if ( bIntFilter )
tNewFilter.m_iMinValue = tGreater.IntVal();
else
tNewFilter.m_fMinValue = tGreater.FltVal();
tNewFilter.m_bOpenRight = !bLess;
}
tNewFilter.m_eType = bIntFilter ? SPH_FILTER_RANGE : SPH_FILTER_FLOATRANGE;
// float filters don't support open ranges
if ( !bIntFilter )
{
if ( tNewFilter.m_bOpenRight )
tNewFilter.m_fMaxValue = FLT_MAX;
if ( tNewFilter.m_bOpenLeft )
tNewFilter.m_fMinValue = FLT_MIN;
}
dFilters.Add ( tNewFilter );
return true;
}
static bool ConstructGeoFilter ( const JsonObj_c & tJson, CSphVector<CSphFilterSettings> & dFilters, CSphVector<CSphQueryItem> & dQueryItems, int & iQueryItemId, CSphString & sError, CSphString & sWarning )
{
GeoDistInfo_c tGeoDist;
if ( !tGeoDist.Parse ( tJson, true, sError, sWarning ) )
return false;
CSphQueryItem & tQueryItem = dQueryItems.Add();
tQueryItem.m_sExpr = tGeoDist.BuildExprString();
tQueryItem.m_sAlias.SetSprintf ( "%s%d", g_szFilter, iQueryItemId++ );
CSphFilterSettings & tFilter = dFilters.Add();
tFilter.m_sAttrName = tQueryItem.m_sAlias;
tFilter.m_bOpenLeft = true;
tFilter.m_bHasEqualMax = true;
tFilter.m_fMaxValue = tGeoDist.GetDistance();
tFilter.m_eType = SPH_FILTER_FLOATRANGE;
return true;
}
static bool ConstructFilter ( const JsonObj_c & tJson, CSphVector<CSphFilterSettings> & dFilters, CSphVector<CSphQueryItem> & dQueryItems, int & iQueryItemId, CSphString & sError, CSphString & sWarning )
{
if ( !IsFilter ( tJson ) )
return true;
CSphString sName = tJson.Name();
if ( sName=="equals" )
return ConstructEqualsFilter ( tJson, dFilters, sError );
if ( sName=="range" )
return ConstructRangeFilter ( tJson, dFilters, sError );
if ( sName=="geo_distance" )
return ConstructGeoFilter ( tJson, dFilters, dQueryItems, iQueryItemId, sError, sWarning );
sError.SetSprintf ( "unknown filter type: %s", sName.cstr() );
return false;
}