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
|
package query
import (
"fmt"
"strings"
"github.com/jpappel/atlas/pkg/util"
)
const MAX_CLAUSE_DEPTH int = 16
type CompilationArtifact struct {
Query string
Args []any
}
func (art CompilationArtifact) String() string {
b := strings.Builder{}
fmt.Fprintln(&b, art.Query)
b.WriteByte('[')
for i, arg := range art.Args {
if i != len(art.Args)-1 {
fmt.Fprintf(&b, "`%s`, ", arg)
} else {
fmt.Fprintf(&b, "`%s`", arg)
}
}
b.WriteByte(']')
return b.String()
}
func (s Statements) buildCompile(b *strings.Builder, delim string) ([]any, error) {
var args []any
sCount := 0
for cat, catStmts := range s.CategoryPartition() {
if len(catStmts) == 0 {
continue
}
var catStr string
switch cat {
case CAT_PATH:
catStr = "path "
case CAT_AUTHOR:
catStr = "author "
case CAT_DATE:
catStr = "date "
case CAT_FILETIME:
catStr = "fileTime "
case CAT_LINKS:
catStr = "link "
case CAT_META:
catStr = "meta "
case CAT_TAGS:
catStr = "tag "
case CAT_HEADINGS:
catStr = "headings "
case CAT_TITLE:
catStr = "title "
default:
return nil, &CompileError{
fmt.Sprintf("unexpected query.catType %#v", cat),
}
}
for op, opStmts := range catStmts.OperatorPartition() {
if len(opStmts) == 0 {
continue
}
var opStr string
switch op {
case OP_AP:
if cat.IsOrdered() {
opStr = "BETWEEN "
} else {
opStr = "MATCH "
}
case OP_EQ:
if cat.IsSet() {
opStr = "IN "
} else {
opStr = "= "
}
case OP_GE:
opStr = ">= "
case OP_GT:
opStr = "> "
case OP_LE:
opStr = "<= "
case OP_LT:
opStr = "< "
case OP_RE:
opStr = "REGEXP "
case OP_NE:
if cat.IsSet() {
opStr = "NOT IN "
} else {
opStr = "!= "
}
default:
return nil, &CompileError{
fmt.Sprintf("unexpected query.opType %#v", op),
}
}
if op == OP_RE {
idx := 0
for _, stmt := range opStmts {
b.WriteString("( ")
b.WriteString(catStr)
b.WriteString("IS NOT NULL AND ")
if stmt.Negated {
b.WriteString("NOT ")
}
b.WriteString(catStr)
b.WriteString(opStr)
arg, ok := stmt.Value.buildCompile(b)
b.WriteString(" )")
if ok {
args = append(args, arg)
}
b.WriteByte(' ')
if idx != len(opStmts)-1 {
b.WriteString(delim)
b.WriteByte(' ')
}
idx++
sCount++
}
} else if cat.IsSet() && op != OP_AP {
b.WriteString(catStr)
b.WriteString(opStr)
b.WriteByte('(')
idx := 0
for _, stmt := range opStmts {
arg, ok := stmt.Value.buildCompile(b)
if ok {
args = append(args, arg)
}
if idx != len(opStmts)-1 {
b.WriteByte(',')
}
sCount++
idx++
}
b.WriteString(") ")
} else if cat.IsSet() && op == OP_AP {
b.WriteString("( ")
idx := 0
for _, stmt := range opStmts {
b.WriteString(catStr)
b.WriteString(opStr)
arg, ok := stmt.Value.buildCompile(b)
if ok {
args = append(args, arg)
}
if idx != len(opStmts)-1 {
b.WriteString(" " + delim + " ")
}
sCount++
idx++
}
b.WriteString(" ) ")
} else if cat.IsOrdered() && op == OP_AP {
idx := 0
for _, stmt := range opStmts {
b.WriteString(catStr)
d, ok := stmt.Value.(DatetimeValue)
if !ok {
panic("type corruption, expected DatetimeValue")
}
start, end := util.FuzzDatetime(d.D)
if stmt.Negated {
b.WriteString("NOT ")
}
b.WriteString(opStr)
fmt.Fprint(b, start.Unix(), " ")
b.WriteString("AND ")
fmt.Fprint(b, end.Unix(), " ")
if idx != len(opStmts)-1 {
b.WriteString(delim)
b.WriteByte(' ')
}
idx++
sCount++
}
} else {
idx := 0
for _, stmt := range opStmts {
if stmt.Negated {
b.WriteString("NOT ")
}
b.WriteString(catStr)
b.WriteString(opStr)
arg, ok := stmt.Value.buildCompile(b)
if ok {
args = append(args, arg)
}
b.WriteByte(' ')
if idx != len(opStmts)-1 {
b.WriteString(delim)
b.WriteByte(' ')
}
idx++
sCount++
}
}
if sCount != len(s) {
b.WriteString(delim)
b.WriteByte(' ')
}
}
}
return args, nil
}
func (root Clause) Compile() (CompilationArtifact, error) {
if d := root.Depth(); d > MAX_CLAUSE_DEPTH {
return CompilationArtifact{}, &CompileError{
fmt.Sprintf("exceeded maximum clause depth: %d > %d", d, MAX_CLAUSE_DEPTH),
}
}
b := strings.Builder{}
args, err := root.buildCompile(&b)
if err != nil {
return CompilationArtifact{}, err
} else if b.Len() == 0 {
return CompilationArtifact{}, fmt.Errorf("Empty query")
}
return CompilationArtifact{b.String(), args}, nil
}
func (c Clause) buildCompile(b *strings.Builder) ([]any, error) {
isRoot := b.Len() == 0
if !isRoot {
b.WriteString("( ")
}
var delim string
switch c.Operator {
case COP_AND:
delim = "AND"
case COP_OR:
delim = "OR"
default:
return nil, &CompileError{fmt.Sprint("invalid clause operator ", c.Operator)}
}
args, err := c.Statements.buildCompile(b, delim)
if err != nil {
return nil, err
}
for _, clause := range c.Clauses {
b.WriteString(delim)
b.WriteByte(' ')
newArgs, err := clause.buildCompile(b)
if err != nil {
return nil, err
} else if newArgs != nil {
args = append(args, newArgs...)
}
}
if !isRoot {
b.WriteString(") ")
}
return args, nil
}
|
