/
lazy.scm
297 lines (269 loc) · 11.5 KB
/
lazy.scm
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
;;;
;;; gauche.lazy - Lazy sequences
;;;
;;; Copyright (c) 2011-2024 Shiro Kawai <shiro@acm.org>
;;;
;;; Redistribution and use in source and binary forms, with or without
;;; modification, are permitted provided that the following conditions
;;; are met:
;;;
;;; 1. Redistributions of source code must retain the above copyright
;;; notice, this list of conditions and the following disclaimer.
;;;
;;; 2. Redistributions in binary form must reproduce the above copyright
;;; notice, this list of conditions and the following disclaimer in the
;;; documentation and/or other materials provided with the distribution.
;;;
;;; 3. Neither the name of the authors nor the names of its contributors
;;; may be used to endorse or promote products derived from this
;;; software without specific prior written permission.
;;;
;;; THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
;;; "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
;;; LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
;;; A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
;;; OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
;;; SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
;;; TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
;;; PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
;;; LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
;;; NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
;;; SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
;;;
;; The primivites generator->lseq, lrange and lcons are supported in
;; the core. See src/liblazy.scm.
;; The tests of this module is in ext/gauche, for this depends on
;; gauche.generator, which depends on modules built in ext/gauche.
(define-module gauche.lazy
(use scheme.list)
(use gauche.record)
(use gauche.generator)
(export x->lseq coroutine->lseq lunfold literate
lmap lmap-accum lappend lappend-map lconcatenate
linterweave lfilter lfilter-map lstate-filter
ltake ltake-while lrxmatch lslices
lseq->list
generator->lseq/position port->char-lseq/position lseq-position
<sequence-position> sequence-position?
sequence-position-source sequence-position-line
sequence-position-column sequence-position-item-count
cpp-line-adjuster cc1-line-adjuster))
(select-module gauche.lazy)
;; Universal coercer.
;; This does not force OBJ if it is alreay an lseq.
;; NB: Putting specialized paths for vectors and strings may be a good idea
;; for performance. We'll see.
(define (x->lseq obj)
(cond [(null? obj) '()]
[(eq? (class-of obj) <pair>) obj]
[else
(let1 g (x->generator obj)
(if (applicable? g)
(generator->lseq g)
(error "cannot coerce the argument to a lazy sequence" obj)))]))
(define (coroutine->lseq proc)
(generator->lseq (generate proc)))
(define (lunfold p f g seed :optional (tail #f))
($ generator->lseq
$ gunfold p f g seed (if tail (^s (list->generator (tail s))) #f)))
(define (literate f seed)
(generator->lseq seed (giterate1 f seed)))
(define lmap
(case-lambda
[(proc arg)
(let1 arg (x->lseq arg)
(generator->lseq (^[](if (null? arg) (eof-object) (proc (pop! arg))))))]
[(proc arg . more)
(let1 args (map x->lseq (cons arg more))
(define (g)
(if args
(receive (cars cdrs)
((with-module gauche.internal %zip-nary-args) args)
(set! args cdrs)
(if cars
(apply proc cars)
(eof-object)))
(eof-object)))
(generator->lseq g))]))
(define lappend
(case-lambda
[() '()]
[(arg) (x->lseq arg)]
[args
(generator->lseq
(rec (gen)
(cond [(null? args) (eof-object)]
[(null? (car args)) (pop! args) (gen)]
[else (pop! (car args))])))]))
;; Like (apply lappend seqs), but SEQS itself can be a (possibly infinite)
;; lazy seq.
(define (lconcatenate lseqs)
(define cur #f)
(if (null? lseqs)
'()
(generator->lseq
(rec (gen)
(cond [cur (let1 elt (cur)
(if (eof-object? elt)
(begin (set! cur #f) (gen))
elt))]
[(null? lseqs) (eof-object)]
[else (set! cur (x->generator (pop! lseqs))) (gen)])))))
;; Could be (lconcatenate (lmap proc args ...)), but this one doesn't
;; call proc on next item until the previous result is about to exhaust.
(define (lappend-map proc arg . args)
(generator->lseq (gflatten (apply gmap proc arg args))))
;; (linterweave '(1 2 3 ...) '(a b c ...)) => (1 a 2 b 3 c ...)
;; Continues until all elements are exhausted.
(define (linterweave . seqs)
(define (get-cars!)
(let loop ([ss seqs] [rcars '()] [rcdrs '()])
(cond [(null? ss) (set! seqs (reverse rcdrs)) (reverse rcars)]
[(null? (car ss)) (eof-object)]
[else
(loop (cdr ss) (cons (caar ss) rcars) (cons (cdar ss) rcdrs))])))
(if (null? seqs)
'()
(let1 cars (get-cars!)
(if (eof-object? cars)
'()
(generator->lseq
(rec (gen)
(if (null? cars)
(begin
(set! cars (get-cars!))
(if (eof-object? cars)
cars
(gen)))
(pop! cars))))))))
;; NB: Should we define all l* variations corresponds to g* variations?
(define (lmap-accum fn seed seq . args)
(generator->lseq (apply gmap-accum fn seed seq args)))
(define (lfilter fn seq) (generator->lseq (gfilter fn seq)))
(define (lfilter-map fn seq . args)
(generator->lseq (apply gfilter-map fn seq args)))
(define (lstate-filter fn seed seq)
(generator->lseq (gstate-filter fn seed seq)))
(define (ltake seq n :optional (fill? #f) (padding #f))
(generator->lseq (gtake seq n fill? padding)))
;; ldrop is unnecessary
(define (ltake-while pred seq)
(generator->lseq (gtake-while pred seq)))
;; ldrop-while is uncessary
(define (lrxmatch rx seq)
(generator->lseq (grxmatch rx seq)))
(define (lslices seq k :optional (fill? #f) (padding #f))
(generator->lseq (gslices seq k fill? padding)))
;; Realize all elements
;; Use length+ to allow improper or circular lists.
(define (lseq->list s) (length+ s) s)
;; EXPERIMENTAL
;; Lseq with 'position' attached in pair attributes
(define-record-type <sequence-position>
;; this constructor is only for internal use
(%make-sequence-position source line column item-count)
sequence-position?
(source sequence-position-source)
(line sequence-position-line)
(column sequence-position-column)
(item-count sequence-position-item-count))
(define-method write-object ((obj <sequence-position>) port)
(format port "#<sequence-position ~s:~a:~a(~a)>"
(sequence-position-source obj)
(sequence-position-line obj)
(sequence-position-column obj)
(sequence-position-item-count obj)))
;; line-adjusters is a list of (<char> . <proc>). If a char at the beginning
;; of a line matches <char>, <proc> is called with the char-gen, current
;; source-name, and line-count. It should return three values:
;; a new source-name, line-count, and a list of prefetched
;; characters to be included in the input. (The last value is needed if
;; the adjuster needs to read ahead to determine if it should consume them).
(define (generator->lseq/position char-gen :key (source-name #f)
(start-line 1)
(start-column 1)
(start-item-count 0)
(line-adjusters '()))
;; The tracker treemap keeps
;; integer-char-pos -> (source-name . line-number)
;; for characters at the beginning of line. It is pointed from the cdr
;; of the input-char-position pair attribute.
(define tracker (make-tree-map))
(define bol (= start-column 1)) ;#t if beginning of line
;; line count starts from 1. but if we're starting at the beginning of
;; line, line count is immediately incremented, so we offset it.
(define line-count (if bol (- start-line 1) start-line))
(define char-count 0)
(define prefetched '()) ;prefeched chars by an adjuster
;; A simple case, with no line adjusters
(define (gen-simple)
(glet1 ch (char-gen)
(gen-common ch)))
;; With line adjusters
(define (gen-adjusters)
(glet1 ch (if (null? prefetched)
(char-gen)
(pop! prefetched))
(if-let1 adjuster (and bol (assv-ref line-adjusters ch))
(begin
(set!-values (source-name line-count prefetched)
(adjuster char-gen source-name line-count))
(if (null? prefetched)
(begin
(dec! line-count) ;will be +1 in next iteration
(gen-adjusters)) ;line is fully consumed
(gen-common ch)))
(gen-common ch))))
(define (gen-common ch)
(let ([pos char-count])
(inc! char-count)
(when bol
(inc! line-count)
(tree-map-put! tracker pos (cons source-name line-count)))
(set! bol (eqv? ch #\newline))
(values ch `((input-position . (,pos . ,tracker))))))
(tree-map-put! tracker
(+ (- start-item-count start-column) 1)
(cons source-name start-line))
(if (null? line-adjusters)
(generator->lseq gen-simple)
(generator->lseq gen-adjusters)))
;; Pre-defined line adjusters
;; #line <number> [<filename>]
(define (cpp-line-adjuster char-gen source-name line-count)
(let1 chars ($ generator->list
$ gtake-while (^c (not (eqv? c #\newline))) char-gen)
(rxmatch-case (list->string chars)
[#/^\s*line\s+(\d+)(?:\s+\"?([^\"\s]+)\"?)?/ (_ n fn)
(values (or fn source-name) (string->number n) '())]
[else (values source-name line-count (append chars '(#\newline)))])))
;; # <number> [<filename>]
(define (cc1-line-adjuster char-gen source-name line-count)
(let1 chars ($ generator->list
$ gtake-while (^c (not (eqv? c #\newline))) char-gen)
(rxmatch-case (list->string chars)
[#/^\s*(\d+)(?:\s+\"?([^\"\s]+)\"?)?/ (_ n fn)
(values (or fn source-name) (string->number n) '())]
[else (values source-name line-count (append chars '(#\newline)))])))
;; Actually 's' doesn't need to be a lseq. Better name?
(define (lseq-position s)
(and (pair? s)
(and-let1 p (pair-attribute-get s 'input-position #f)
(let ([pos (car p)]
[mapper (cdr p)])
(receive (bol-pos name&line) (tree-map-floor mapper pos)
(and bol-pos
(%make-sequence-position (car name&line)
(cdr name&line)
(+ 1 (- pos bol-pos))
pos)))))))
(define (port->char-lseq/position :optional (port (current-input-port))
:key (source-name #f)
(start-line 1)
(start-column 1)
(start-item-count 0)
(line-adjusters '())
:rest keys)
(let1 name (or source-name (port-name port))
(apply generator->lseq/position (cut read-char port)
:source-name name (delete-keyword :source-name keys))))