forked from Shen-Language/shen-sbcl
-
Notifications
You must be signed in to change notification settings - Fork 0
/
overwrite.lsp
116 lines (97 loc) · 3.74 KB
/
overwrite.lsp
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
"Copyright (c) 2010-2015, Mark Tarver
All rights reserved.
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. The name of Mark Tarver may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY Mark Tarver ''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 Mark Tarver 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."
(DEFUN shen.pvar? (X)
(IF (AND (ARRAYP X) (NOT (STRINGP X)) (EQ (SVREF X 0) 'shen.pvar))
'true
'false))
(DEFUN shen.lazyderef (X ProcessN)
(IF (AND (ARRAYP X) (NOT (STRINGP X)) (EQ (SVREF X 0) 'shen.pvar))
(LET ((Value (shen.valvector X ProcessN)))
(IF (EQ Value 'shen.-null-)
X
(shen.lazyderef Value ProcessN)))
X))
(DEFUN shen.valvector (Var ProcessN)
(SVREF (SVREF shen.*prologvectors* ProcessN) (SVREF Var 1)))
(DEFUN shen.unbindv (Var N)
(LET ((Vector (SVREF shen.*prologvectors* N)))
(SETF (SVREF Vector (SVREF Var 1)) 'shen.-null-)))
(DEFUN shen.bindv (Var Val N)
(LET ((Vector (SVREF shen.*prologvectors* N)))
(SETF (SVREF Vector (SVREF Var 1)) Val)))
(DEFUN shen.copy-vector-stage-1 (Count Vector BigVector Max)
(IF (= Max Count)
BigVector
(shen.copy-vector-stage-1
(1+ Count)
Vector
(address-> BigVector Count (<-address Vector Count))
Max)))
(DEFUN shen.copy-vector-stage-2 (Count Max Fill BigVector)
(IF (= Max Count)
BigVector
(shen.copy-vector-stage-2
(1+ Count)
Max
Fill
(address-> BigVector Count Fill))))
(DEFUN shen.newpv (N)
(LET ((Count+1 (1+ (THE INTEGER (SVREF shen.*varcounter* N))))
(Vector (SVREF shen.*prologvectors* N)))
(SETF (SVREF shen.*varcounter* N) Count+1)
(IF (= (THE INTEGER Count+1) (THE INTEGER (limit Vector)))
(shen.resizeprocessvector N Count+1)
'skip)
(shen.mk-pvar Count+1)))
(DEFUN vector-> (Vector N X)
(IF (ZEROP N)
(ERROR "cannot access 0th element of a vector~%")
(address-> Vector N X)))
(DEFUN <-vector (Vector N)
(IF (ZEROP N)
(ERROR "cannot access 0th element of a vector~%")
(let VectorElement (SVREF Vector N)
(IF (EQ VectorElement (fail))
(ERROR "vector element not found~%")
VectorElement))))
(DEFUN variable? (X)
(IF (AND (SYMBOLP X) (NOT (NULL X)) (UPPER-CASE-P (CHAR (SYMBOL-NAME X) 0)))
'true
'false))
(DEFUN shen.+string? (X)
(IF (AND (STRINGP X) (NOT (STRING-EQUAL X "")))
'true
'false))
(DEFUN thaw (F)
(FUNCALL F))
(DEFUN read-char-code (S)
(LET ((C (READ-CHAR S NIL -1)))
(IF (EQ C -1)
-1
(CHAR-INT C))))
(DEFUN pr (X S)
(WRITE-STRING X S)
(WHEN (OR (EQ S *stoutput*) (EQ S *stinput*))
(FORCE-OUTPUT S))
X)
(DEFUN exit (Code)
(ALIEN-FUNCALL (EXTERN-ALIEN "exit" (FUNCTION VOID INT)) Code))