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
|
;;; Guix Data Service -- Information about Guix over time
;;; Copyright © 2019 Christopher Baines <mail@cbaines.net>
;;;
;;; This program is free software: you can redistribute it and/or
;;; modify it under the terms of the GNU Affero General Public License
;;; as published by the Free Software Foundation, either version 3 of
;;; the License, or (at your option) any later version.
;;;
;;; This program is distributed in the hope that it will be useful,
;;; but WITHOUT ANY WARRANTY; without even the implied warranty of
;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
;;; Affero General Public License for more details.
;;;
;;; You should have received a copy of the GNU Affero General Public
;;; License along with this program. If not, see
;;; <http://www.gnu.org/licenses/>.
(define-module (guix-data-service model utils)
#:use-module (srfi srfi-1)
#:use-module (ice-9 match)
#:use-module (ice-9 vlist)
#:use-module (ice-9 receive)
#:use-module (squee)
#:use-module (guix-data-service database)
#:use-module (guix-data-service utils)
#:export (NULL
quote-string
value->quoted-string-or-null
non-empty-string-or-false
exec-query->vhash
two-lists->vhash
parse-postgresql-array-string
deduplicate-strings
group-list-by-first-n-fields
group-to-alist
group-to-alist/vector
insert-missing-data-and-return-all-ids))
(define NULL '())
(define (quote-string s)
(string-append "$STR$" s "$STR$"))
(define (value->quoted-string-or-null value)
(if (string? value)
(string-append "$STR$" value "$STR$")
"NULL"))
(define (non-empty-string-or-false s)
(if (string? s)
(if (string-null? s)
#f
s)
#f))
(define* (exec-query->vhash conn query field-function value-function
#:key (vhash vlist-null))
(fold (lambda (row result)
(vhash-cons (field-function row)
(value-function row)
result))
vhash
(exec-query-with-null-handling conn query)))
(define (two-lists->vhash l1 l2)
(fold (lambda (key value result)
(vhash-cons key value result))
vlist-null
l1
l2))
(define (parse-postgresql-array-string s)
(if (string=? s "{}")
'()
(string-split
(string-drop-right
(string-drop s 1)
1)
#\,)))
(define (deduplicate-strings strings)
(pair-fold
(lambda (pair result)
(if (null? (cdr pair))
(cons (first pair) result)
(if (string=? (first pair) (second pair))
result
(cons (first pair) result))))
'()
(sort strings string<?)))
(define (group-list-by-first-n-fields n lists)
(fold (lambda (lst groups)
(receive (key vals)
(split-at lst n)
(append
(alist-delete key groups)
`((,key . ,(append
(or (assoc-ref groups key)
'())
(list vals)))))))
'()
lists))
(define (group-to-alist process lst)
(fold (lambda (element result)
(match (process element)
((key . value)
(match (assoc key result)
((_ . existing-values)
`((,key . ,(cons value existing-values))
,@(alist-delete key result)))
(#f
`((,key . (,value))
,@result))))))
'()
lst))
(define (group-to-alist/vector process lst)
(map
(match-lambda
((label . items)
(cons label (list->vector items))))
(group-to-alist process lst)))
(define (table-schema conn table-name)
(let ((results
(exec-query
conn
"
SELECT column_name, data_type, is_nullable
FROM information_schema.columns
WHERE table_name = $1"
(list table-name))))
(if (null? results)
(error
(simple-format #f "missing schema for ~A: ~A"
table-name
results))
(map
(match-lambda
((column_name data_type is_nullable)
(list column_name
data_type
(string=? is_nullable "YES"))))
results))))
(define* (insert-missing-data-and-return-all-ids
conn
table-name
fields
data
#:key
sets-of-data?
delete-duplicates?
use-temporary-table?)
(define field-strings
(map symbol->string fields))
(define value->sql
(match-lambda
((? string? s)
(string-append "$STR$" s "$STR$"))
((? symbol? s)
(string-append "$STR$"
(symbol->string s)
"$STR$"))
((? number? n)
(number->string n))
((? boolean? b)
(if b "TRUE" "FALSE"))
((? null?)
"NULL")
((cast . value)
(string-append
(value->sql value) "::" cast))
(v
(error
(simple-format #f "error: unknown type for value: ~A" v)))))
(define (delete-duplicates* data)
(delete-duplicates/sort!
(list-copy data)
(lambda (full-a full-b)
(let loop ((a full-a)
(b full-b))
(if (null? a)
#f
(let ((a-val (match (car a)
((_ . val) val)
((? symbol? val) (symbol->string val))
(val val)))
(b-val (match (car b)
((_ . val) val)
((? symbol? val) (symbol->string val))
(val val))))
(cond
((null? a-val)
(if (null? b-val)
(loop (cdr a) (cdr b))
#t))
((null? b-val)
#f)
(else
(match a-val
((? string? v)
(if (string=? a-val b-val)
(loop (cdr a) (cdr b))
(string<? a-val b-val)))
((? number? v)
(if (= a-val b-val)
(loop (cdr a) (cdr b))
(< a-val b-val)))
((? boolean? v)
(if (eq? a-val b-val)
(loop (cdr a) (cdr b))
a-val)))))))))))
(define schema-details
(table-schema conn table-name))
(define (field-can-be-null? field)
(match (find (lambda (column-data)
(string=? field
(car column-data)))
schema-details)
((column-name data-type is-nullable?) is-nullable?)
(#f
(simple-format
(current-error-port)
"error: couldn't find data for ~A in ~A\n"
field
schema-details)
(error "error: field-can-be-null?"))))
(define (select-query data)
(string-append
"SELECT id,\n"
(string-join (map (lambda (field)
(string-append table-name "." field))
field-strings)
",\n")
" FROM " table-name
" JOIN (VALUES "
(string-join
(map
(lambda (field-values)
(string-append
"("
(string-join (map value->sql field-values) ",")
")"))
data)
", ")
")\n AS vals (" (string-join field-strings ", ") ") "
"ON "
(string-join
(map (lambda (field)
(string-concatenate
`("("
,table-name "." ,field " = vals." ,field
,@(if (field-can-be-null? field)
`(" OR (" ,table-name "." ,field " IS NULL AND"
" vals." ,field " IS NULL"
")")
'())
")")))
field-strings)
" AND\n ")))
(define (temp-table-select-query temp-table-name)
(string-append
"SELECT " table-name ".id, "
(string-join (map (lambda (field)
(string-append table-name "." field))
field-strings)
", ")
" FROM " table-name
" INNER JOIN " temp-table-name
" ON "
(string-join
(map (lambda (field)
(string-concatenate
`("("
,table-name "." ,field " = " ,temp-table-name "." ,field
,@(if (field-can-be-null? field)
`(" OR ("
,table-name "." ,field " IS NULL"
" AND "
,temp-table-name "." ,field " IS NULL"
")")
'())
")")))
field-strings)
" AND ")))
(define* (insert-sql missing-data
#:key
(table-name table-name))
(string-append
"INSERT INTO " table-name " (\n"
(string-join field-strings ",\n")
") VALUES "
(string-join
(map (lambda (field-values)
(string-append
"("
(string-join
(map (lambda (value)
(value->sql value))
field-values)
", ")
")"))
missing-data)
", ")
" RETURNING id"))
(define (format-json json)
;; PostgreSQL formats JSON strings differently to guile-json, so use
;; PostgreSQL to do the formatting
(caar
(exec-query
conn
(string-append
"SELECT $STR$" json "$STR$::jsonb"))))
(define (normalise-values data)
(map (match-lambda
((? boolean? b)
(if b "t" "f"))
((? number? n)
(number->string n))
((? symbol? s)
(symbol->string s))
((? string? s)
s)
((? null? n)
;; exec-query-with-null-handling specifies NULL values as '()
n)
((cast . value)
(if (string=? cast "jsonb")
(format-json value)
value))
(unknown
(error (simple-format #f "normalise-values: error: ~A\n" unknown))))
data))
(let* ((existing-entries
(if use-temporary-table?
(let ((temp-table-name
(string-append "temp_" table-name))
(data
(if sets-of-data?
(delete-duplicates* (concatenate data))
(if delete-duplicates?
(delete-duplicates* data)
data))))
;; Create a temporary table to store the data
(exec-query
conn
(string-append "CREATE TEMPORARY TABLE "
temp-table-name
" (LIKE "
table-name
" INCLUDING ALL)"))
(exec-query
conn
(string-append
"ANALYZE " temp-table-name))
;; Populate the temporary table
(if (null? data)
'()
(with-time-logging (string-append "populating " temp-table-name)
(exec-query conn
(insert-sql data
#:table-name temp-table-name))))
;; Use the temporary table to find the existing values
(let ((result
(with-time-logging
(string-append "querying the " temp-table-name)
(exec-query->vhash
conn
(temp-table-select-query temp-table-name)
cdr
(lambda (result)
(string->number (first result)))))))
(exec-query conn (string-append "DROP TABLE " temp-table-name))
result))
;; If not using a temporary table, just do a single SELECT query
(if (null? data)
'()
(fold
(lambda (data-chunk result)
(exec-query->vhash conn
(select-query data-chunk)
cdr
(lambda (result)
(string->number (first result)))
#:vhash result))
vlist-null
(chunk (if sets-of-data?
(delete-duplicates*
(concatenate data))
data)
3000)))))
(missing-entries
(let loop ((lst (if sets-of-data?
(concatenate data)
data))
(result '()))
(if (null? lst)
(if delete-duplicates?
(delete-duplicates* result)
result)
(let ((field-values (car lst)))
(if (vhash-assoc
;; Normalise at this point, so that the proper value
;; to insert is carried forward
(normalise-values field-values)
existing-entries)
(loop (cdr lst)
result)
(loop (cdr lst)
(cons field-values result)))))))
(new-entries
(if (null? missing-entries)
'()
(append-map!
(lambda (missing-entries-chunk)
(map (lambda (result)
(string->number (first result)))
(exec-query conn
(insert-sql missing-entries-chunk))))
(chunk missing-entries 3000))))
(new-entries-lookup-vhash
(two-lists->vhash missing-entries
new-entries))
(all-ids
(if sets-of-data?
(map (lambda (field-value-lists)
;; Normalise the result at this point, ensuring that the id's
;; in the set are sorted
(sort
(map (lambda (field-values)
(cdr
(or (vhash-assoc (normalise-values field-values)
existing-entries)
(vhash-assoc field-values
new-entries-lookup-vhash)
(error "missing entry" field-values))))
field-value-lists)
<))
data)
(map (lambda (field-values)
(cdr
(or (vhash-assoc (normalise-values field-values)
existing-entries)
(vhash-assoc field-values
new-entries-lookup-vhash)
(error "missing entry" field-values))))
data))))
(values all-ids
new-entries)))
|