-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsearch.py
441 lines (417 loc) · 13.5 KB
/
search.py
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
# This is @generated code; do not edit!
#from token import ENDMARKER, NAME, NEWLINE, NUMBER, STRING
from search_parser.search_token import ENDMARKER, WORD, NEWLINE, NUMBER, STRING
from search_parser.memo import memoize, memoize_left_rec, no_memoize
from search_parser.node import Node
from search_parser.parser import Parser
# Grammar for searching for protocols or general annotated documents
from typing import Union
from functools import reduce
from bson import SON
from mongoengine.queryset.visitor import Q, QCombination
def acc_text(*acc):
"""
Merge all fulltext pieces into one single fulltext query (can only be used once)
and returned it combined with whatever else queries there are.
"""
text = []
query = None
for x in acc:
if isinstance(x, (Q, QCombination)):
if query:
query &= x
else:
query = x
elif isinstance(x, list):
text.extend(x)
else:
raise ValueError("neither Q nor list!\n {}: {}\n ( {} )".format(type(x), x, repr(acc)))
if len(text) > 0:
q_text = Q(__raw__={"$text": SON({"$search": ' '.join(text)})})
if query:
query &= q_text
else:
query = q_text
return query
def negate(atom: Union[Q, QCombination]) -> Union[Q, QCombination]:
if isinstance(atom, QCombination):
atom.operation = atom.OR if atom.operation == atom.AND else atom.AND
for i in range(len(atom.children)):
atom.children[i] = negate(atom.children[i])
elif isinstance(atom, Q):
for k, v in atom.query.items():
if '$not' in v:
atom.query[k] = v['$not']
else:
atom.query[k] = {'$not': v}
else:
raise ValueError('atom neither Q nor QCombination: {}: {}'.format(type(atom), repr(atom)))
return atom
class SearchParser(Parser):
@memoize
def start(self):
self.show_rule('start', [['expr', 'ENDMARKER']])
pos = self.mark()
if (True
and self.show_index(0, 0)
and (expr := self.expr()) is not None
and self.show_index(0, 1)
and (endmarker := self.expect(ENDMARKER)) is not None
):
self.show_index(0, 0, 2)
retval = expr
if retval is not None:
return retval
self.reset(pos)
self.show_index(0, 0, 0)
return None
@memoize
def expr(self):
self.show_rule('expr', [['term_or_text', 'term_or_text*']])
pos = self.mark()
if (True
and self.show_index(0, 0)
and (term_or_text := self.term_or_text()) is not None
and self.show_index(0, 1)
and (acc := self.loop(False, self.term_or_text)) is not None
):
self.show_index(0, 0, 2)
retval = acc_text ( term_or_text , * acc )
if retval is not None:
return retval
self.reset(pos)
self.show_index(0, 0, 0)
return None
@memoize
def term_or_text(self):
self.show_rule('term_or_text', [['term'], ['fulltext']])
pos = self.mark()
if (True
and self.show_index(0, 0)
and (term := self.term()) is not None
):
self.show_index(0, 0, 1)
retval = term
if retval is not None:
return retval
self.reset(pos)
if (True
and self.show_index(1, 0)
and (fulltext := self.fulltext()) is not None
):
self.show_index(1, 0, 1)
retval = fulltext
if retval is not None:
return retval
self.reset(pos)
self.show_index(0, 0, 0)
return None
@memoize
def term(self):
self.show_rule('term', [['and_'], ['or_'], ['atom']])
pos = self.mark()
if (True
and self.show_index(0, 0)
and (and_ := self.and_()) is not None
):
self.show_index(0, 0, 1)
retval = and_
if retval is not None:
return retval
self.reset(pos)
if (True
and self.show_index(1, 0)
and (or_ := self.or_()) is not None
):
self.show_index(1, 0, 1)
retval = or_
if retval is not None:
return retval
self.reset(pos)
if (True
and self.show_index(2, 0)
and (atom := self.atom()) is not None
):
self.show_index(2, 0, 1)
retval = atom
if retval is not None:
return retval
self.reset(pos)
self.show_index(0, 0, 0)
return None
@memoize
def and_(self):
self.show_rule('and_', [['atom', '_synthetic_rule_0+']])
pos = self.mark()
if (True
and self.show_index(0, 0)
and (atom := self.atom()) is not None
and self.show_index(0, 1)
and (acc := self.loop(True, self._synthetic_rule_0)) is not None
):
self.show_index(0, 0, 2)
retval = reduce ( lambda a , b : a & b , acc , atom )
if retval is not None:
return retval
self.reset(pos)
self.show_index(0, 0, 0)
return None
@memoize
def or_(self):
self.show_rule('or_', [['atom', '_synthetic_rule_1+']])
pos = self.mark()
if (True
and self.show_index(0, 0)
and (atom := self.atom()) is not None
and self.show_index(0, 1)
and (acc := self.loop(True, self._synthetic_rule_1)) is not None
):
self.show_index(0, 0, 2)
retval = reduce ( lambda a , b : a | b , acc , atom )
if retval is not None:
return retval
self.reset(pos)
self.show_index(0, 0, 0)
return None
@memoize
def atom(self):
self.show_rule('atom', [['not_'], ['keyval'], ["'('", 'term', "')'"]])
pos = self.mark()
if (True
and self.show_index(0, 0)
and (not_ := self.not_()) is not None
):
self.show_index(0, 0, 1)
retval = not_
if retval is not None:
return retval
self.reset(pos)
if (True
and self.show_index(1, 0)
and (keyval := self.keyval()) is not None
):
self.show_index(1, 0, 1)
retval = keyval
if retval is not None:
return retval
self.reset(pos)
if (True
and self.show_index(2, 0)
and self.expect('(') is not None
and self.show_index(2, 1)
and (term := self.term()) is not None
and self.show_index(2, 2)
and self.expect(')') is not None
):
self.show_index(2, 0, 3)
retval = term
if retval is not None:
return retval
self.reset(pos)
self.show_index(0, 0, 0)
return None
@memoize
def not_(self):
self.show_rule('not_', [["':'", "'not'", 'atom']])
pos = self.mark()
if (True
and self.show_index(0, 0)
and self.expect(':') is not None
and self.show_index(0, 1)
and self.expect('not') is not None
and self.show_index(0, 2)
and (atom := self.atom()) is not None
):
self.show_index(0, 0, 3)
retval = negate ( atom )
if retval is not None:
return retval
self.reset(pos)
self.show_index(0, 0, 0)
return None
@memoize
def keyval(self):
self.show_rule('keyval', [["':'", 'WORD', 'value']])
pos = self.mark()
if (True
and self.show_index(0, 0)
and self.expect(':') is not None
and self.show_index(0, 1)
and (word := self.expect(WORD)) is not None
and self.show_index(0, 2)
and (value := self.value()) is not None
):
self.show_index(0, 0, 3)
retval = Q ( ** {word . string : value} )
if retval is not None:
return retval
self.reset(pos)
self.show_index(0, 0, 0)
return None
@memoize
def value(self):
self.show_rule('value', [['WORD'], ['STRING'], ['NUMBER'], ['list']])
pos = self.mark()
if (True
and self.show_index(0, 0)
and (word := self.expect(WORD)) is not None
):
self.show_index(0, 0, 1)
retval = word . string
if retval is not None:
return retval
self.reset(pos)
if (True
and self.show_index(1, 0)
and (string := self.expect(STRING)) is not None
):
self.show_index(1, 0, 1)
retval = string . string
if retval is not None:
return retval
self.reset(pos)
if (True
and self.show_index(2, 0)
and (number := self.expect(NUMBER)) is not None
):
self.show_index(2, 0, 1)
retval = float ( number . string )
if retval is not None:
return retval
self.reset(pos)
if (True
and self.show_index(3, 0)
and (list := self.list()) is not None
):
self.show_index(3, 0, 1)
retval = list
if retval is not None:
return retval
self.reset(pos)
self.show_index(0, 0, 0)
return None
@memoize
def list(self):
self.show_rule('list', [["'['", 'value', '_synthetic_rule_2*', "']'"]])
pos = self.mark()
if (True
and self.show_index(0, 0)
and self.expect('[') is not None
and self.show_index(0, 1)
and (value := self.value()) is not None
and self.show_index(0, 2)
and (acc := self.loop(False, self._synthetic_rule_2)) is not None
and self.show_index(0, 3)
and self.expect(']') is not None
):
self.show_index(0, 0, 4)
retval = [ value ] + acc
if retval is not None:
return retval
self.reset(pos)
self.show_index(0, 0, 0)
return None
@memoize
def fulltext(self):
self.show_rule('fulltext', [['_synthetic_rule_3+']])
pos = self.mark()
if (True
and self.show_index(0, 0)
and (text := self.loop(True, self._synthetic_rule_3)) is not None
):
self.show_index(0, 0, 1)
retval = text
if retval is not None:
return retval
self.reset(pos)
self.show_index(0, 0, 0)
return None
@memoize
def _synthetic_rule_0(self):
self.show_rule('_synthetic_rule_0', [["':'", "'and'", 'atom']])
pos = self.mark()
if (True
and self.show_index(0, 0)
and self.expect(':') is not None
and self.show_index(0, 1)
and self.expect('and') is not None
and self.show_index(0, 2)
and (atom := self.atom()) is not None
):
self.show_index(0, 0, 3)
retval = atom
if retval is not None:
return retval
self.reset(pos)
self.show_index(0, 0, 0)
return None
@memoize
def _synthetic_rule_1(self):
self.show_rule('_synthetic_rule_1', [["':'", "'or'", 'atom']])
pos = self.mark()
if (True
and self.show_index(0, 0)
and self.expect(':') is not None
and self.show_index(0, 1)
and self.expect('or') is not None
and self.show_index(0, 2)
and (atom := self.atom()) is not None
):
self.show_index(0, 0, 3)
retval = atom
if retval is not None:
return retval
self.reset(pos)
self.show_index(0, 0, 0)
return None
@memoize
def _synthetic_rule_2(self):
self.show_rule('_synthetic_rule_2', [["','", 'value']])
pos = self.mark()
if (True
and self.show_index(0, 0)
and self.expect(',') is not None
and self.show_index(0, 1)
and (value := self.value()) is not None
):
self.show_index(0, 0, 2)
retval = value
if retval is not None:
return retval
self.reset(pos)
self.show_index(0, 0, 0)
return None
@memoize
def _synthetic_rule_3(self):
self.show_rule('_synthetic_rule_3', [['STRING'], ['NUMBER'], ['WORD']])
pos = self.mark()
if (True
and self.show_index(0, 0)
and (string := self.expect(STRING)) is not None
):
self.show_index(0, 0, 1)
retval = string . string
if retval is not None:
return retval
self.reset(pos)
if (True
and self.show_index(1, 0)
and (number := self.expect(NUMBER)) is not None
):
self.show_index(1, 0, 1)
retval = number . string
if retval is not None:
return retval
self.reset(pos)
if (True
and self.show_index(2, 0)
and (word := self.expect(WORD)) is not None
):
self.show_index(2, 0, 1)
retval = word . string
if retval is not None:
return retval
self.reset(pos)
self.show_index(0, 0, 0)
return None
# The end.