aboutsummaryrefslogtreecommitdiffstats
path: root/lib/scheme/base/60-list.csc
blob: 5dfda9f1efb67da4b62c582beeb45622cdf15726 (plain) (blame)
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
(export
  append
  caar
  cadr
  car
  cdar
  cddr
  cdr
  cons
  for-each
  length
  list
  list-copy
  list-ref
  list-set!
  list-tail
  list?
  make-list
  map
  null?
  pair?
  reverse
  set-car!
  set-cdr!)
(import (only (csc builtins)
          call-builtin))
(begin


  (define-record-type <pair>
    (cons x y)
    pair?
    (x car set-car!)
    (y cdr set-cdr!))


  (define (caar pair)
    (car (car pair)))


  (define (cadr pair)
    (car (cdr pair)))


  (define (cdar pair)
    (cdr (car pair)))


  (define (cddr pair)
    (cdr (cdr pair)))


  (define (null? obj)
    (call-builtin eq? obj '()))


  (define (list? obj)
    (cond
      ((null? obj) #t)
      ((not (pair? obj)) #f)
      (else
        (let loop ((tortoise obj)
                   (hare (cdr obj)))
          (cond
            ((null? hare) #t)
            ((not (pair? hare)) #f)
            ((null? (cdr hare)) #t)
            ((not (pair? (cdr hare))) #f)
            ((eq? tortoise hare) #f)  ; cycle detected
            (else
              (loop (cdr tortoise)
                    (cddr hare))))))))


  (define make-list
    (case-lambda
      ((k)
        (make-list k #f))
      ((k fill)
        (let loop ((k k)
                   (acc '()))
          (if (zero? k)
            acc
            (loop (- k 1) (cons fill acc)))))))


  (define (list . args)
    args)


  (define (length l)
    (let loop ((l l)
               (n 0))
      (if (null? l)
        n
        (loop (cdr l) (+ 1 n)))))


  (define (append2 l1 l2)
    (let loop ((l1 l1))
      (if (null? l1)
        l2
        (cons (car l1) (loop (cdr l1))))))


  (define (append . ls)
    (let loop ((ls ls))
      (cond
        ((null? ls) '())
        ((null? (cdr ls))
          (car ls))
        (else
          (append2 (car ls)
                   (loop (cdr ls)))))))


  (define (reverse l)
    (let loop ((l l)
               (acc '()))
      (if (null? l)
        acc
        (loop (cdr l) (cons (car l) acc)))))


  (define (list-tail l k)
    (if (zero? k)
      l
      (list-tail (cdr l) (- k 1))))


  (define (list-ref l k)
    (car (list-tail l k)))


  (define (list-set! l k obj)
    (let loop ((l l)
               (k k))
      (if (zero? k)
        (set-car! l obj)
        (loop (cdr l) (- k 1)))))


  (define (list-copy obj)
    (if (pair? l)
      (cons (car l) (list-copy (cdr l)))
      l))


  (define (map1 proc l)
    (if (null? l)
      '()
      (cons (proc (car l))
            (map1 proc (cdr l)))))


  (define (map proc list1 . lists)
    (define lists* (cons list1 lists))
    (if (let loop ((l lists*))
          (cond
            ((null? l) #f)
            ((null? (car l)) #t)
            (else (loop (cdr l)))))
      '()
      (cons (apply proc (map1 car lists*))
            (map proc (map1 cdr lists*)))))


  (define (for-each proc list1 . lists)
    (define lists* (cons list1 lists))
    (if (let loop ((l lists*))
          (cond
            ((null? l) #f)
            ((null? (car l)) #t)
            (else (loop (cdr l)))))
      #f
      (begin
        (apply proc (map car lists*))
        (for-each proc (map cdr lists*))))))