-
Notifications
You must be signed in to change notification settings - Fork 37
/
mods.go
403 lines (322 loc) · 7.65 KB
/
mods.go
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
package dialect
import (
"io"
"github.com/stephenafamo/bob"
"github.com/stephenafamo/bob/clause"
"github.com/stephenafamo/bob/expr"
"github.com/stephenafamo/bob/mods"
)
func With[Q interface{ AppendWith(clause.CTE) }](name string, columns ...string) CTEChain[Q] {
return CTEChain[Q](func() clause.CTE {
return clause.CTE{
Name: name,
Columns: columns,
}
})
}
type CTEChain[Q interface{ AppendWith(clause.CTE) }] func() clause.CTE
func (c CTEChain[Q]) Apply(q Q) {
q.AppendWith(c())
}
func (c CTEChain[Q]) As(q bob.Query) CTEChain[Q] {
cte := c()
cte.Query = q
return CTEChain[Q](func() clause.CTE {
return cte
})
}
func (c CTEChain[Q]) NotMaterialized() CTEChain[Q] {
b := false
cte := c()
cte.Materialized = &b
return CTEChain[Q](func() clause.CTE {
return cte
})
}
func (c CTEChain[Q]) Materialized() CTEChain[Q] {
b := true
cte := c()
cte.Materialized = &b
return CTEChain[Q](func() clause.CTE {
return cte
})
}
func OrAbort[Q interface{ SetOr(string) }]() bob.Mod[Q] {
return mods.QueryModFunc[Q](func(i Q) {
i.SetOr("ABORT")
})
}
func OrFail[Q interface{ SetOr(string) }]() bob.Mod[Q] {
return mods.QueryModFunc[Q](func(i Q) {
i.SetOr("FAIL")
})
}
func OrIgnore[Q interface{ SetOr(string) }]() bob.Mod[Q] {
return mods.QueryModFunc[Q](func(i Q) {
i.SetOr("IGNORE")
})
}
func OrReplace[Q interface{ SetOr(string) }]() bob.Mod[Q] {
return mods.QueryModFunc[Q](func(i Q) {
i.SetOr("REPLACE")
})
}
func OrRollback[Q interface{ SetOr(string) }]() bob.Mod[Q] {
return mods.QueryModFunc[Q](func(i Q) {
i.SetOr("ROLLBACK")
})
}
type fromable interface {
SetTable(any)
SetTableAlias(alias string, columns ...string)
SetIndexedBy(*string)
}
func From[Q fromable](table any) FromChain[Q] {
return FromChain[Q](func() clause.From {
return clause.From{
Table: table,
}
})
}
type FromChain[Q fromable] func() clause.From
func (f FromChain[Q]) Apply(q Q) {
from := f()
q.SetTable(from.Table)
if from.Alias != "" {
q.SetTableAlias(from.Alias, from.Columns...)
}
q.SetIndexedBy(from.IndexedBy)
}
func (f FromChain[Q]) As(alias string) FromChain[Q] {
fr := f()
fr.Alias = alias
return FromChain[Q](func() clause.From {
return fr
})
}
func (f FromChain[Q]) NotIndexed() bob.Mod[Q] {
i := ""
fr := f()
fr.SetIndexedBy(&i)
return FromChain[Q](func() clause.From {
return fr
})
}
func (f FromChain[Q]) IndexedBy(indexName string) bob.Mod[Q] {
fr := f()
fr.SetIndexedBy(&indexName)
return FromChain[Q](func() clause.From {
return fr
})
}
type JoinChain[Q interface{ AppendJoin(clause.Join) }] func() clause.Join
func (j JoinChain[Q]) Apply(q Q) {
q.AppendJoin(j())
}
func (f JoinChain[Q]) NotIndexed() bob.Mod[Q] {
i := ""
jo := f()
jo.To.SetIndexedBy(&i)
return JoinChain[Q](func() clause.Join {
return jo
})
}
func (f JoinChain[Q]) IndexedBy(indexName string) bob.Mod[Q] {
jo := f()
jo.To.SetIndexedBy(&indexName)
return JoinChain[Q](func() clause.Join {
return jo
})
}
func (j JoinChain[Q]) As(alias string) JoinChain[Q] {
jo := j()
jo.To.Alias = alias
return JoinChain[Q](func() clause.Join {
return jo
})
}
func (j JoinChain[Q]) Natural() bob.Mod[Q] {
jo := j()
jo.Natural = true
return mods.Join[Q](jo)
}
func (j JoinChain[Q]) On(on ...bob.Expression) bob.Mod[Q] {
jo := j()
jo.On = append(jo.On, on...)
return mods.Join[Q](jo)
}
func (j JoinChain[Q]) OnEQ(a, b bob.Expression) bob.Mod[Q] {
jo := j()
jo.On = append(jo.On, expr.X[Expression, Expression](a).EQ(b))
return mods.Join[Q](jo)
}
func (j JoinChain[Q]) Using(using ...string) bob.Mod[Q] {
jo := j()
jo.Using = using
return mods.Join[Q](jo)
}
type Joinable interface{ AppendJoin(clause.Join) }
func Join[Q Joinable](typ string, e any) JoinChain[Q] {
return JoinChain[Q](func() clause.Join {
return clause.Join{
Type: typ,
To: clause.From{Table: e},
}
})
}
func InnerJoin[Q Joinable](e any) JoinChain[Q] {
return Join[Q](clause.InnerJoin, e)
}
func LeftJoin[Q Joinable](e any) JoinChain[Q] {
return Join[Q](clause.LeftJoin, e)
}
func RightJoin[Q Joinable](e any) JoinChain[Q] {
return Join[Q](clause.RightJoin, e)
}
func FullJoin[Q Joinable](e any) JoinChain[Q] {
return Join[Q](clause.FullJoin, e)
}
func CrossJoin[Q Joinable](e any) bob.Mod[Q] {
return Join[Q](clause.CrossJoin, e)
}
type OrderBy[Q interface{ AppendOrder(clause.OrderDef) }] func() clause.OrderDef
func (s OrderBy[Q]) Apply(q Q) {
q.AppendOrder(s())
}
func (o OrderBy[Q]) Collate(collation string) OrderBy[Q] {
order := o()
order.CollationName = collation
return OrderBy[Q](func() clause.OrderDef {
return order
})
}
func (o OrderBy[Q]) Asc() OrderBy[Q] {
order := o()
order.Direction = "ASC"
return OrderBy[Q](func() clause.OrderDef {
return order
})
}
func (o OrderBy[Q]) Desc() OrderBy[Q] {
order := o()
order.Direction = "DESC"
return OrderBy[Q](func() clause.OrderDef {
return order
})
}
func (o OrderBy[Q]) NullsFirst() OrderBy[Q] {
order := o()
order.Nulls = "FIRST"
return OrderBy[Q](func() clause.OrderDef {
return order
})
}
func (o OrderBy[Q]) NullsLast() OrderBy[Q] {
order := o()
order.Nulls = "LAST"
return OrderBy[Q](func() clause.OrderDef {
return order
})
}
type WindowMod[Q interface{ AppendWindow(clause.NamedWindow) }] struct {
Name string
*WindowChain[*WindowMod[Q]]
}
func (w *WindowMod[Q]) Apply(q Q) {
q.AppendWindow(clause.NamedWindow{
Name: w.Name,
Definition: w.def,
})
}
type WindowChain[T any] struct {
def clause.WindowDef
Wrap T
}
func (w *WindowChain[T]) From(name string) T {
w.def.SetFrom(name)
return w.Wrap
}
func (w *WindowChain[T]) PartitionBy(condition ...any) T {
w.def.AddPartitionBy(condition...)
return w.Wrap
}
func (w *WindowChain[T]) OrderBy(order ...any) T {
w.def.AddOrderBy(order...)
return w.Wrap
}
func (w *WindowChain[T]) Range() T {
w.def.SetMode("RANGE")
return w.Wrap
}
func (w *WindowChain[T]) Rows() T {
w.def.SetMode("ROWS")
return w.Wrap
}
func (w *WindowChain[T]) Groups() T {
w.def.SetMode("GROUPS")
return w.Wrap
}
func (w *WindowChain[T]) FromUnboundedPreceding() T {
w.def.SetStart("UNBOUNDED PRECEDING")
return w.Wrap
}
func (w *WindowChain[T]) FromPreceding(exp any) T {
w.def.SetStart(bob.ExpressionFunc(
func(w io.Writer, d bob.Dialect, start int) ([]any, error) {
return bob.ExpressIf(w, d, start, exp, true, "", " PRECEDING")
}),
)
return w.Wrap
}
func (w *WindowChain[T]) FromCurrentRow() T {
w.def.SetStart("CURRENT ROW")
return w.Wrap
}
func (w *WindowChain[T]) FromFollowing(exp any) T {
w.def.SetStart(bob.ExpressionFunc(
func(w io.Writer, d bob.Dialect, start int) ([]any, error) {
return bob.ExpressIf(w, d, start, exp, true, "", " FOLLOWING")
}),
)
return w.Wrap
}
func (w *WindowChain[T]) ToPreceding(exp any) T {
w.def.SetEnd(bob.ExpressionFunc(
func(w io.Writer, d bob.Dialect, start int) ([]any, error) {
return bob.ExpressIf(w, d, start, exp, true, "", " PRECEDING")
}),
)
return w.Wrap
}
func (w *WindowChain[T]) ToCurrentRow(count int) T {
w.def.SetEnd("CURRENT ROW")
return w.Wrap
}
func (w *WindowChain[T]) ToFollowing(exp any) T {
w.def.SetEnd(bob.ExpressionFunc(
func(w io.Writer, d bob.Dialect, start int) ([]any, error) {
return bob.ExpressIf(w, d, start, exp, true, "", " FOLLOWING")
}),
)
return w.Wrap
}
func (w *WindowChain[T]) ToUnboundedFollowing() T {
w.def.SetEnd("UNBOUNDED FOLLOWING")
return w.Wrap
}
func (w *WindowChain[T]) ExcludeNoOthers() T {
w.def.SetExclusion("NO OTHERS")
return w.Wrap
}
func (w *WindowChain[T]) ExcludeCurrentRow() T {
w.def.SetExclusion("CURRENT ROW")
return w.Wrap
}
func (w *WindowChain[T]) ExcludeGroup() T {
w.def.SetExclusion("GROUP")
return w.Wrap
}
func (w *WindowChain[T]) ExcludeTies() T {
w.def.SetExclusion("TIES")
return w.Wrap
}