-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlazy.el
111 lines (86 loc) · 2.38 KB
/
lazy.el
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
;;; lazy.el --- lazy lists from LOL -*- lexical-binding: t -*-
;; Author: Land of Lisp
;; Keywords: lisp
;;; Commentary:
;; THIS IS NOT MY CODE
;;; Code:
(require 'cl-lib)
;; this is really heavy, and probably needlessly so.
(defmacro lazy (&rest body)
`(list :lazy (lambda () (progn ,@body))))
(defun force (lazy-value)
(pcase lazy-value
(`(:lazy ,body)
(funcall body))
(_
lazy-value)))
(defmacro lazy-cons (a d)
`(lazy (cons ,a ,d)))
(defun force-cons (x)
(let ((cons (force x)))
(setcar x (car cons))
(setcdr x (cdr cons)))
x)
(defun lazy-car (x)
(car (force-cons x)))
(defun lazy-cdr (x)
(cdr (force-cons x)))
(setq lazy-integers
(cl-labels ((f (n)
(lazy-cons n (f (1+ n)))))
(f 1)))
(defun lazy-nil ()
(lazy nil))
(defun lazy-null (x)
(not (force x)))
(defun make-lazy (lst)
(lazy (when lst
(cons (car lst)
(make-lazy (cdr lst))))))
(defun take (n lst)
(unless (or (zerop n)
(lazy-null lst))
(cons (lazy-car lst)
(take (1- n)
(lazy-cdr lst)))))
(defun take-all (lst)
(unless (lazy-null lst)
(cons (lazy-car lst)
(take-all (lazy-cdr lst)))))
(defun lazy-mapcar (fun lst)
(lazy (unless (lazy-null lst)
(cons (funcall fun (lazy-car lst))
(lazy-mapcar fun (lazy-cdr lst))))))
(defun lazy-mapcan (fun lst)
(cl-labels ((f (lst-cur)
(if (lazy-null lst-cur)
(force (lazy-mapcan fun (lazy-cdr lst)))
(cons (lazy-car lst-cur)
(lazy (f (lazy-cdr lst-cur)))))))
(lazy (unless (lazy-null lst)
(f (funcall fun (lazy-car lst)))))))
(defun lazy-find-if (fun lst)
(unless (lazy-null lst)
(let ((x (lazy-car lst)))
(if (funcall fun x)
x
(lazy-find-if fun (lazy-cdr lst))))))
(defun lazy-nth (n lst)
(if (zerop n)
(lazy-car lst)
(lazy-nth (1- n)
(lazy-cdr lst))))
(defun lazy-remove-if (fun lst)
(unless (lazy-null lst)
(let ((x (lazy-car lst)))
(if (funcall fun x)
(lazy-remove-if fun (lazy-cdr lst))
(lazy-cons x (lazy-remove-if fun (lazy-cdr lst)))))))
(defvar lazy-odd-integers (lazy-remove-if #'evenp lazy-integers))
(defvar lazy-fibinacci
(cl-labels ((f (n n-1)
(lazy-cons n (f (+ n n-1) n))))
(f 1 0)))
(provide 'lazy)
;;; lazy.el ends here
;;