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
|
(define-module (calp util)
#:use-module (srfi srfi-1)
#:use-module (srfi srfi-88) ; postfix keywords
#:use-module ((ice-9 optargs) #:select (define*-public))
#:use-module ((sxml fold) #:select (fold-values))
#:use-module ((srfi srfi-9 gnu) #:select (set-fields))
#:re-export (define*-public fold-values)
#:export (for sort* sort*!
set/r!
catch-multiple
quote?
re-export-modules
-> ->> set set-> aif awhen
let-lazy let-env
case* define-many
and=>> label
print-and-return
)
#:replace (let* set! define-syntax
when unless))
((@ (guile) define-syntax) define-syntax
(syntax-rules ()
((_ (name args ...) body ...)
((@ (guile) define-syntax) name
(lambda (args ...)
body ...)))
((_ otherwise ...)
((@ (guile) define-syntax) otherwise ...))))
;; NOTE
;; Instead of returning the empty list a better default value
;; for when and unless would be the identity element for the
;; current context.
;; So (string-append (when #f ...)) would expand into
;; (string-append (if #f ... "")).
;; This however requires type interferance, which i don't
;; *currently* have.
(define-syntax-rule (when pred body ...)
(if pred (begin body ...) '()))
(define-syntax-rule (unless pred body ...)
(if pred '() (begin body ...)))
(define-syntax (aif stx)
(syntax-case stx ()
[(_ condition true-clause false-clause)
(with-syntax ((it (datum->syntax stx 'it)))
#'(let ((it condition))
(if it true-clause false-clause)))]))
(define-syntax (awhen stx)
(syntax-case stx ()
[(_ condition body ...)
(with-syntax ((it (datum->syntax stx 'it)))
#'(let ((it condition))
(when it body ...)))]))
#;
(define-macro (awhen pred . body)
`(let ((it ,pred))
(when it
,@body)))
(define-syntax for
(syntax-rules (in)
((for (<var> <vars> ...) in <collection> b1 body ...)
(map ((@ (ice-9 match) match-lambda) [(<var> <vars> ...) b1 body ...])
<collection>))
((for <var> in <collection> b1 body ...)
(map (lambda (<var>) b1 body ...)
<collection>))))
;; Replace let* with a version that can bind from lists.
;; Also supports SRFI-71 (extended let-syntax for multiple values)
;; @lisp
;; (let* ([a b (values 1 2)] ; @r{SRFI-71}
;; [(c d) '(3 4)] ; @r{Let-list (mine)}
;; [(a b . c) (cons* 1 2 3)] ; @r{Improper list matching (mine)}
;; [e 5]) ; @r{Regular}
;; (list e d c b a))
;; ;; => (5 4 3 2 1)
;; @end lisp
(define-syntax let*
(syntax-rules ()
;; Base case
[(_ () body ...)
(begin body ...)]
;; (let (((a b) '(1 2))) (list b a)) => (2 1)
[(_ (((k ... . (k*)) list-value) rest ...)
body ...)
(apply (lambda (k ... k*)
(let* (rest ...)
body ...))
list-value)]
;; Improper list matching
;; (let* (((a b . c) (cons* 1 2 3))) (list a c)) ; => (1 3)
[(_ (((k1 k ... . k*) imp-list) rest ...)
body ...)
(apply (lambda (k1 k ... k*)
(let* (rest ...)
body ...))
(improper->proper-list
imp-list (length (quote (k1 k ...)))))]
;; "Regular" case
[(_ ((k value) rest ...) body ...)
(let ((k value))
(let* (rest ...)
body ...))]
;; SRFI-71 let-values
[(_ ((k k* ... values) rest ...) body ...)
(call-with-values (lambda () values)
(lambda (k k* ...)
(let* (rest ...)
body ...)))]
;; Declare variable without a value (actuall #f).
;; Useful for inner mutation.
[(_ (v rest ...) body ...)
(let* ((v #f) rest ...) body ...)]
))
(define (improper->proper-list lst len)
(let* ((head tail (split-at lst len)))
(append head (list tail))))
(define-macro (print-and-return expr)
(let ((str (gensym "str"))
(result (gensym "result")))
`(let* ((,result ,expr)
(,str (format #f "~a [~a]~%" ,result (quote ,expr))))
(display ,str (current-error-port))
,result)))
(define-public (swap f)
(lambda args (apply f (reverse args))))
(define-syntax case*%
(syntax-rules (else)
[(_ _ else)
#t]
[(_ invalue (value ...))
(memv invalue (list value ...))]
#;
[(_ invalue target)
(eq? invalue target)]))
;; Like `case', but evals the case parameters
(define-syntax case*
(syntax-rules (else)
[(_ invalue (cases body ...) ...)
(cond ((case*% invalue cases)
body ...)
...)]))
;; Allow set to work on multiple values at once,
;; similar to Common Lisp's @var{setf}
;; @example
;; (set! x 10
;; y 20)
;; @end example
;; Still requires all variables to be defined beforehand.
(define-syntax set!
(syntax-rules (=)
((_ field = (op args ...) rest ...)
(set! field (op field args ...)
rest ...))
((_ field = proc rest ...)
(set! field (proc field)
rest ...))
((_ field val)
((@ (guile) set!) field val))
((_ field val rest ...)
(begin ((@ (guile) set!) field val)
(set! rest ...)))))
;; only evaluates the final form once
(define-syntax set/r!
(syntax-rules (=)
((_ args ... v = something)
(begin
(set! args ... v = something)
v))
((_ args ... final)
(let ((val final))
(set! args ... val)
val))))
(define-syntax define-many
(syntax-rules ()
[(_) (begin)]
[(_ def) (begin)]
[(_ (symbols ...) value rest ...)
(begin (define symbols value) ...
(define-many rest ...))]
[(_ def (symbols ...) value rest ...)
(begin (def symbols value) ...
(define-many def rest ...))]))
;; Attach a label to a function, allowing it to call itself
;; without actually giving it a name (can also be thought
;; of as letrec-1).
;; @example
;; ((label fact
;; (match-lambda
;; [0 1]
;; [x (* x (fact (1- x)))]))
;; 5)
;; @end example
(define-syntax label
(syntax-rules ()
[(_ self proc)
(letrec ((self proc))
proc)]))
;; This function borrowed from web-ics (calendar util)
(define* (sort* items comperator #:optional (get identity))
"A sort function more in line with how python's sorted works"
(sort items (lambda (a b)
(comperator (get a)
(get b)))))
;; Sorts the list @var{items}. @emph{May} destroy the input list in the process
(define* (sort*! items comperator #:optional (get identity))
"A sort function more in line with how python's sorted works"
(sort! items (lambda (a b)
(comperator (get a)
(get b)))))
;; Given {items, <} finds the most extreme value.
;; Returns 2 values. The extremest item in @var{items},
;; and the other items in some order.
;; Ord b => (list a) [, (b, b -> bool), (a -> b)] -> a, (list a)
(define*-public (find-extreme items optional: (< <) (access identity))
(if (null? items)
;; Vad fan retunerar man här?
(values #f '())
(fold-values
(lambda (c min other)
(if (< (access c) (access min))
;; Current stream head is smaller that previous min
(values c (cons min other))
;; Previous min is still smallest
(values min (cons c other))))
(cdr items)
;; seeds:
(car items) '())))
(define*-public (find-min list optional: (access identity))
(find-extreme list < access))
(define*-public (find-max list optional: (access identity))
(find-extreme list > access))
(define-public (filter-sorted proc list)
(take-while
proc (drop-while
(negate proc) list)))
;; (define (!= a b) (not (= a b)))
(define-public != (negate =))
(define-public (take-to lst i)
"Like @var{take}, but might lists shorter than length."
(if (> i (length lst))
lst (take lst i)))
(define-public (string-take-to str i)
(if (> i (string-length str))
str (string-take str i)))
(define-public (string-first str)
(string-ref str 0))
(define-public (string-last str)
(string-ref str (1- (string-length str))))
(define-public (as-symb s)
(if (string? s) (string->symbol s) s))
(define-public (enumerate lst)
(zip (iota (length lst))
lst))
;; Map with index
(define-syntax-rule (map-each proc lst)
(map (lambda (x i) (proc x i))
lst (iota (length lst))))
(export map-each)
;; Takes a procedure returning multiple values, and returns a function which
;; takes the same arguments as the original procedure, but only returns one of
;; the procedures. Which procedure can be sent as an additional parameter.
(define*-public (unval proc #:optional (n 0))
(lambda args
(call-with-values (lambda () (apply proc args))
(lambda args (list-ref args n)))))
(define-public (flatten lst)
(fold (lambda (subl done)
(append done ((if (list? subl) flatten list) subl)))
'() lst))
(define-syntax let-lazy
(syntax-rules ()
[(_ ((field value) ...)
body ...)
(let ((field (delay value)) ...)
(let-syntax ((field (identifier-syntax (force field))) ...)
body ...))]))
(define-public (map/dotted proc dotted-list)
(cond ((null? dotted-list) '())
((not-pair? dotted-list) (proc dotted-list))
(else
(cons (proc (car dotted-list))
(map/dotted proc (cdr dotted-list))))))
(define-syntax re-export-modules
(syntax-rules ()
((_ (mod ...) ...)
(begin
(module-use! (module-public-interface (current-module))
(resolve-interface '(mod ...)))
...))))
;; Merges two association lists, comparing with eq.
;; The cdrs in all pairs in both lists should be lists,
;; If a key is present in both then the contents of b is
;; put @emph{before} the contents in a.
;; @example
;; (assq-merge '((k 1)) '((k 2)))
;; => ((k 2 1))
;; @end example
(define-public (assq-merge a b)
(fold (lambda (entry alist)
(let* (((k . v) entry)
(o (assq-ref alist k)))
(assq-set! alist k (append v (or o '())))))
(copy-tree a) b))
(define-public (kvlist->assq kvlist)
(map (lambda (pair)
(cons (keyword->symbol (car pair)) (cdr pair)))
(group kvlist 2)))
(define*-public (assq-limit alist optional: (number 1))
(map (lambda (pair)
(take-to pair (1+ number)))
alist))
(define-public (group-by proc lst)
(let ((h (make-hash-table)))
(for value in lst
(let ((key (proc value)))
(hash-set! h key (cons value (hash-ref h key '())))))
;; NOTE changing this list to cons allows the output to work with assq-merge.
(hash-map->list list h)))
;; (group-by '(0 1 2 3 4 2 5 6) 2)
;; ⇒ ((0 1) (3 4) (5 6))
(define-public (split-by list item)
(let loop ((done '())
(current '())
(rem list))
(cond [(null? rem)
(reverse (cons (reverse current) done))]
[(eqv? item (car rem))
(loop (cons (reverse current) done)
'()
(cdr rem))]
[else
(loop done
(cons (car rem) current)
(cdr rem))])))
;; Returns the cross product between l1 and l2.
;; each element is a cons cell.
(define (cross-product% l1 l2)
(concatenate
(map (lambda (a)
(map (lambda (b) (cons a b))
l2))
l1)))
(define-public (cross-product . args)
(if (null? args)
'()
(let* ((last rest (car+cdr (reverse args))))
(reduce-right cross-product% '()
(reverse (cons (map list last) rest ))))))
;; Given an arbitary tree, do a pre-order traversal, appending all strings.
;; non-strings allso allowed, converted to strings and also appended.
(define-public (string-flatten tree)
(cond [(string? tree) tree]
[(list? tree) (string-concatenate (map string-flatten tree))]
[else (format #f "~a" tree)]))
(define-public (intersperse item list)
(let loop ((flipflop #f)
(rem list))
(if (null? rem)
'()
(if flipflop
(cons item (loop (not flipflop) rem))
(cons (car rem) (loop (not flipflop) (cdr rem)))
))))
;; @example
;; (insert-ordered 5 (iota 10))
;; ⇒ (0 1 2 3 4 5 5 6 7 8 9)
;; @end example
(define*-public (insert-ordered item collection optional: (< <))
(cond [(null? collection)
(list item)]
[(< item (car collection))
(cons item collection)]
[else
(cons (car collection)
(insert-ordered item (cdr collection) <))]))
(define-syntax ->
(syntax-rules ()
[(-> obj) obj]
[(-> obj (func args ...) rest ...)
(-> (func obj args ...) rest ...)]
[(-> obj func rest ...)
(-> (func obj) rest ...)]))
(define-syntax ->>
(syntax-rules ()
((->> obj)
obj)
((->> obj (func args ...) rest ...)
(->> (func args ... obj) rest ...))
((->> obj func rest ...)
(->> (func obj) rest ...))))
;; Non-destructive set, syntax extension from set-fields from (srfi
;; srfi-9 gnu).
(define-syntax set
(syntax-rules (=)
[(set (acc obj) value)
(set-fields
obj ((acc) value))]
[(set (acc obj) = (op rest ...))
(set-fields
obj ((acc) (op (acc obj) rest ...)))]))
(define-syntax set->
(syntax-rules (=)
[(_ obj) obj]
[(_ obj (func = (op args ...)) rest ...)
(set-> (set (func obj) (op (func obj) args ...)) rest ...)]
[(_ obj (func args ...) rest ...)
(set-> (set (func obj) args ...) rest ...)]))
(define-syntax and=>>
(syntax-rules ()
[(_ value) value]
[(_ value proc rest ...)
(and=>> (and=> value proc)
rest ...)]))
(define-public (downcase-symbol symb)
(-> symb
symbol->string
string-downcase
string->symbol))
;; @example
;; (group (iota 10) 2)
;; ⇒ ((0 1) (2 3) (4 5) (6 7) (8 9))
;; @end example
;; Requires that width|(length list)
(define-public (group list width)
(unless (null? list)
(let* ((row rest (split-at list width)))
(cons row (group rest width)))))
;; repeatedly apply @var{proc} to @var{base}
;; unitl @var{until} is satisfied.
;; (a → a), (a → bool), a → a
(define-public (iterate proc until base)
(let loop ((o base))
(if (until o)
o
(loop (proc o)))))
;; (a → values a), list ... → values a
(define-public (valued-map proc . lists)
(apply values
(apply append-map
(lambda args
(call-with-values (lambda () (apply proc args)) list))
lists)))
(define (ass%-ref-all alist key =)
(map cdr (filter (lambda (pair) (= key (car pair)))
alist)))
;; Equivalent to assoc-ref (and family), but works on association lists with
;; non-unique keys, returning all mathing records (instead of just the first).
;; @begin lisp
;; (assoc-ref-all '((a . 1) (b . 2) (a . 3)) 'a)
;; ⇒ (1 3)
;; @end
(define-public (assoc-ref-all alist key) (ass%-ref-all alist key equal?))
(define-public (assq-ref-all alist key) (ass%-ref-all alist key eq?))
(define-public (assv-ref-all alist key) (ass%-ref-all alist key eqv?))
(define-public (vector-last v)
(vector-ref v (1- (vector-length v))))
(define-public (->str any)
(with-output-to-string (lambda () (display any))))
(define-public ->string ->str)
(define-public (->quoted-string any)
(with-output-to-string (lambda () (write any))))
(define-public (path-append . strings)
(fold (lambda (s done)
(string-append
done
(if (string-null? s)
(string-append s "/")
(if (char=? #\/ (string-last done))
(if (char=? #\/ (string-first s))
(string-drop s 1) s)
(if (char=? #\/ (string-first s))
s (string-append "/" s))))))
(let ((s (car strings)))
(if (string-null? s)
"/" s))
(cdr strings)))
(define-syntax let-env
(syntax-rules ()
[(_ ((name value) ...)
body ...)
(let ((env-pairs
(map (lambda (n new-value)
(list n new-value (getenv n)))
(list (symbol->string (quote name)) ...)
(list value ...))))
(for-each (lambda (pair) (setenv (car pair) (cadr pair)))
env-pairs)
(let ((return (begin body ...)))
(for-each (lambda (pair) (setenv (car pair) (caddr pair)))
env-pairs)
return))]))
(define-public (uuidgen)
((@ (rnrs io ports) call-with-port)
((@ (ice-9 popen) open-input-pipe) "uuidgen")
(@ (ice-9 rdelim) read-line)))
|