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
|
;;; stream.el --- Implementation of streams -*- lexical-binding: t -*-
;; Copyright (C) 2015 Free Software Foundation, Inc.
;; Author: Nicolas Petton <nicolas@petton.fr>
;; Keywords: stream, laziness, sequences
;; Version: 1.0
;; Package: stream
;; Maintainer: emacs-devel@gnu.org
;; This file is part of GNU Emacs.
;; GNU Emacs is free software: you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation, either version 3 of the License, or
;; (at your option) any later version.
;; GNU Emacs 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 General Public License for more details.
;; You should have received a copy of the GNU General Public License
;; along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
;;; Commentary:
;; This library provides an implementation of streams. Streams are
;; implemented as delayed evaluation of cons cells.
;;
;; Functions defined in `seq.el' can also take a stream as input.
;;
;; streams could be created from any sequential input data:
;; - sequences, making operation on them lazy
;; - a set of 2 forms (first and rest), making it easy to represent infinite sequences
;; - buffers (by character)
;; - buffers (by line)
;; - buffers (by page)
;; - IO streams
;; - orgmode table cells
;; - ...
;;
;; All functions are prefixed with "stream-".
;; All functions are tested in test/automated/stream-tests.el
;;
;; Here is an example implementation of the Fibonacci numbers
;; implemented as in infinite stream:
;;
;; (defun fib (a b)
;; (stream-cons a (fib b (+ a b))))
;; (fib 0 1)
;;; Code:
(eval-when-compile (require 'cl-lib))
(require 'seq)
(eval-and-compile
(defconst stream--identifier '--stream--
"Symbol internally used to identify streams."))
(defmacro stream--delay (&rest body)
"Delay the evaluation of BODY."
(declare (debug t))
(let ((forced (make-symbol "forced"))
(val (make-symbol "val")))
`(let (,forced ,val)
(lambda ()
(unless ,forced
(setf ,val (progn ,@body))
(setf ,forced t))
,val))))
(defun stream--force (delayed)
"Force the evaluation of DELAYED."
(funcall delayed))
(defmacro stream-make (&rest body)
"Return a stream built from BODY.
BODY must return nil or a cons cell, which cdr is itself a
stream."
(declare (debug t))
`(list ',stream--identifier (stream--delay ,@body)))
(defmacro stream-cons (first rest)
"Return a stream built from the cons of FIRST and REST.
FIRST and REST are forms and REST must return a stream."
(declare (debug t))
`(stream-make (cons ,first ,rest)))
;;; Convenient functions for creating streams
(cl-defgeneric stream (src)
"Return a new stream from SRC.")
(cl-defmethod stream ((seq sequence))
"Return a stream built from the sequence SEQ.
SEQ can be a list, vector or string."
(if (seq-empty-p seq)
(stream-empty)
(stream-cons
(seq-elt seq 0)
(stream (seq-subseq seq 1)))))
(cl-defmethod stream ((list list))
"Return a stream built from the list LIST."
(if (null list)
(stream-empty)
(stream-cons
(car list)
(stream (cdr list)))))
(cl-defmethod stream ((buffer buffer) &optional pos)
"Return a stream of the characters of the buffer BUFFER.
BUFFER-OR-NAME may be a buffer or a string (buffer name).
The sequence starts at POS if non-nil, 1 otherwise."
(with-current-buffer buffer
(unless pos (setq pos (point-min)))
(if (>= pos (point-max))
(stream-empty))
(stream-cons
(with-current-buffer buffer
(save-excursion
(save-restriction
(widen)
(goto-char pos)
(char-after (point)))))
(stream buffer (1+ pos)))))
(defun stream-range (&optional start end step)
"Return a stream of the integers from START to END, stepping by STEP.
If START is nil, it defaults to 0. If STEP is nil, it defaults to
1. START is inclusive and END is exclusive. If END is nil, the
range is infinite."
(unless start (setq start 0))
(unless step (setq step 1))
(if (equal start end)
(stream-empty)
(stream-cons
start
(stream-range (+ start step) end step))))
(defun stream-p (stream)
"Return non-nil if STREAM is a stream, nil otherwise."
(and (consp stream)
(eq (car stream) stream--identifier)))
(defun stream-empty ()
"Return an empty stream."
(list stream--identifier (stream--delay nil)))
(defun stream-empty-p (stream)
"Return non-nil is STREAM is empty, nil otherwise."
(null (stream--force (cadr stream))))
(defun stream-first (stream)
"Return the first element of STREAM."
(car (stream--force (cadr stream))))
(defun stream-rest (stream)
"Return a stream of all but the first element of STREAM."
(cdr (stream--force (cadr stream))))
(defun stream-take (stream n)
"Return a stream of the first N elements of STREAM."
(if (zerop n)
(stream-empty)
(stream-cons
(stream-first stream)
(stream-take (stream-rest stream) (1- n)))))
(defun stream-drop (stream n)
"Return a stream of STREAM without its first N elements."
(stream-make
(while (not (or (stream-empty-p stream) (zerop n)))
(setq n (1- n))
(setq stream (stream-rest stream)))
(unless (stream-empty-p stream)
(cons (stream-first stream)
(stream-rest stream)))))
(defun stream-take-while (pred stream)
"Return a stream of the successive elements for which (PRED elt) is non-nil in STREAM."
(stream-make
(when (funcall pred (stream-first stream))
(cons (stream-first stream)
(stream-take-while pred (stream-rest stream))))))
(defun stream-drop-while (pred stream)
"Return a stream from the first element for which (PRED elt) is nil in STREAM."
(stream-make
(while (not (or (stream-empty-p stream)
(funcall pred (stream-first stream))))
(setq stream (stream-rest stream)))
(unless (stream-empty-p stream)
(cons (stream-first stream)
(stream-rest stream)))))
(defun stream-map (function stream)
"Return a stream.
The elements of the produced sequence consist of the application
of FUNCTION to each element of STREAM."
(if (stream-empty-p stream)
stream
(stream-cons
(funcall function (stream-first stream))
(stream-map function (stream-rest stream)))))
(defun stream-do (function stream)
"Evaluate FUNCTION for each element of STREAM eagerly, and return nil.
`stream-do' should never be used on infinite streams."
(while (not (stream-empty-p stream))
(funcall function (stream-first stream))
(setq stream (stream-rest stream))))
(defun stream-filter (pred stream)
"Return a stream of the elements for which (PRED element) is non-nil in STREAM."
(if (stream-empty-p stream)
stream
(stream-make
(while (not (or (stream-empty-p stream)
(funcall pred (stream-first stream))))
(setq stream (stream-rest stream)))
(if (stream-empty-p stream)
nil
(cons (stream-first stream)
(stream-filter pred (stream-rest stream)))))))
(provide 'stream)
;;; stream.el ends here
|
