util.scm 2.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116
  1. ; -*- Mode: Scheme; Syntax: Scheme; Package: Scheme; -*-
  2. ; Part of Scheme 48 1.9. See file COPYING for notices and license.
  3. ; Authors: Richard Kelsey, Jonathan Rees, Mike Sperber, Robert Ransom
  4. ; This is file util.scm.
  5. ;;;; Utilities
  6. ; we import something equivalent to this from `primitives':
  7. ; (define (unspecific) (if #f #f))
  8. (define (reduce cons nil list) ;used by length, append, etc.
  9. (if (null? list)
  10. nil
  11. (cons (car list) (reduce cons nil (cdr list)))))
  12. (define (filter pred lst)
  13. (reduce (lambda (x rest)
  14. (if (pred x) (cons x rest) rest))
  15. '()
  16. lst))
  17. ; Position of an object within a list
  18. (define (pos pred)
  19. (lambda (thing l)
  20. (let loop ((i 0) (l l))
  21. (cond ((null? l) #f)
  22. ((pred thing (car l)) i)
  23. (else (loop (+ i 1) (cdr l)))))))
  24. (define posq (pos eq?))
  25. (define posv (pos eqv?))
  26. (define posqual (pos equal?))
  27. ; Is pred true of any element of l?
  28. (define (any pred l)
  29. ;; (reduce or #f l), sort of
  30. (if (null? l)
  31. #f
  32. (or (pred (car l))
  33. (any pred (cdr l)))))
  34. ; Is pred true of every element of l?
  35. (define (every pred l)
  36. ;; (reduce and #t l), sort of
  37. (if (null? l)
  38. #t
  39. (and (pred (car l)) (every pred (cdr l)))))
  40. (define (sublist l start end)
  41. (if (> start 0)
  42. (sublist (cdr l) (- start 1) (- end 1))
  43. (let recur ((l l) (end end))
  44. (if (= end 0)
  45. '()
  46. (cons (car l) (recur (cdr l) (- end 1)))))))
  47. (define (last x)
  48. (if (null? (cdr x))
  49. (car x)
  50. (last (cdr x))))
  51. (define (insert x l <)
  52. (cond ((null? l) (list x))
  53. ((< x (car l)) (cons x l))
  54. (else (cons (car l) (insert x (cdr l) <)))))
  55. (define (symbol-append . syms)
  56. (string->symbol (apply string-append
  57. (map symbol->string syms))))
  58. (define (x->boolean x)
  59. (if x #t #f))
  60. ;----------------
  61. ; Variations on a theme.
  62. ;
  63. ; FOLD is a tail-recursive version of REDUCE.
  64. (define (fold folder list accumulator)
  65. (do ((list list (cdr list))
  66. (accum accumulator (folder (car list) accum)))
  67. ((null? list)
  68. accum)))
  69. (define (fold->2 folder list acc0 acc1)
  70. (let loop ((list list) (acc0 acc0) (acc1 acc1))
  71. (if (null? list)
  72. (values acc0 acc1)
  73. (call-with-values
  74. (lambda ()
  75. (folder (car list) acc0 acc1))
  76. (lambda (acc0 acc1)
  77. (loop (cdr list) acc0 acc1))))))
  78. (define (fold->3 folder list acc0 acc1 acc2)
  79. (let loop ((list list) (acc0 acc0) (acc1 acc1) (acc2 acc2))
  80. (if (null? list)
  81. (values acc0 acc1 acc2)
  82. (call-with-values
  83. (lambda ()
  84. (folder (car list) acc0 acc1 acc2))
  85. (lambda (acc0 acc1 acc2)
  86. (loop (cdr list) acc0 acc1 acc2))))))
  87. (define-syntax receive
  88. (syntax-rules ()
  89. ((receive ?vars ?producer . ?body)
  90. (call-with-values (lambda () ?producer)
  91. (lambda ?vars . ?body)))))