forked from fricas/fricas
-
Notifications
You must be signed in to change notification settings - Fork 0
/
symbol.spad
289 lines (254 loc) · 10.9 KB
/
symbol.spad
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
)abbrev domain SYMBOL Symbol
++ Author: Stephen Watt
++ Date Created: 1986
++ Description:
++ Basic and scripted symbols.
++ Keywords: symbol.
Symbol() : Exports == Implementation where
L ==> List OutputForm
Scripts ==> Record(sub : L, sup : L, presup : L, presub : L, args : L)
Exports ==> Join(OrderedSet, ConvertibleTo InputForm, OpenMath,
Hashable, ConvertibleTo(Symbol),
ConvertibleTo Pattern Integer, ConvertibleTo Pattern Float,
PatternMatchable Integer, PatternMatchable Float) with
new : () -> %
++ new() returns a new symbol whose name starts with %.
new : % -> %
++ new(s) returns a new symbol whose name starts with %s.
resetNew : () -> Void
++ resetNew() resets the internals counters that new() and
++ new(s) use to return distinct symbols every time.
coerce : String -> %
++ coerce(s) converts the string s to a symbol.
name : % -> %
++ name(s) returns s without its scripts.
scripted? : % -> Boolean
++ scripted?(s) is true if s has been given any scripts.
scripts : % -> Scripts
++ scripts(s) returns all the scripts of s.
script : (%, List L) -> %
++ script(s, [a, b, c, d, e]) returns s with subscripts a,
++ superscripts b, pre-superscripts c, pre-subscripts d,
++ and argument-scripts e. Omitted components are taken to be empty.
++ For example, \spad{script(s, [a, b, c])} is equivalent to
++ \spad{script(s, [a, b, c, [], []])}.
script : (%, Scripts) -> %
++ script(s, [a, b, c, d, e]) returns s with subscripts a,
++ superscripts b, pre-superscripts c, pre-subscripts d,
++ and argument-scripts e.
subscript : (%, L) -> %
++ subscript(s, [a1, ..., an]) returns s
++ subscripted by \spad{[a1, ..., an]}.
superscript : (%, L) -> %
++ superscript(s, [a1, ..., an]) returns s
++ superscripted by \spad{[a1, ..., an]}.
argscript : (%, L) -> %
++ argscript(s, [a1, ..., an]) returns s
++ arg-scripted by \spad{[a1, ..., an]}.
elt : (%, L) -> %
++ elt(s, [a1, ..., an]) or s([a1, ..., an]) returns s subscripted by \spad{[a1, ..., an]}.
string : % -> String
++ string(s) converts the symbol s to a string.
++ Error: if the symbol is subscripted.
sample : constant -> %
++ sample() returns a sample of %
Implementation ==> add
import from Character
import from List(OutputForm)
import from List(%)
count : Integer := 0
xcount : AssociationList(%, Integer) := empty()
istrings : PrimitiveArray(String) :=
construct ["0","1","2","3","4","5","6","7","8","9"]
-- the following 3 strings shall be of empty intersection
nums:String := "0123456789"
ALPHAS:String := "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alphas:String := "abcdefghijklmnopqrstuvwxyz"
writeOMSym(dev : OpenMathDevice, x : %) : Void ==
scripted? x =>
error "Cannot convert a scripted symbol to OpenMath"
OMputVariable(dev, x pretend Symbol)
OMwrite(dev : OpenMathDevice, x : %, wholeObj : Boolean) : Void ==
if wholeObj then
OMputObject(dev)
writeOMSym(dev, x)
if wholeObj then
OMputEndObject(dev)
hd:String := "*"
lhd := #hd
ord0 := ord char("0")$Character
pcnt ==> 4
istring : Integer -> String
syprefix : Scripts -> String
syscripts : Scripts -> L
convert(s : %) : InputForm ==
n: InputForm := (name s) pretend InputForm
not scripted? s => n
ls := scripts s
A: List InputForm := [convert(e)@InputForm for e in ls.sub]
B: List InputForm := [convert(e)@InputForm for e in ls.sup]
C: List InputForm := [convert(e)@InputForm for e in ls.presup]
D: List InputForm := [convert(e)@InputForm for e in ls.presub]
E: List InputForm := [convert(e)@InputForm for e in ls.args]
a: InputForm := convert('script)$InputForm
b: InputForm := convert('construct)$InputForm
FF: List List InputForm := [cons(b, e) for e in [A, B, C, D, E]]
G: List InputForm := [convert(F)$InputForm for F in FF]
d: InputForm := convert(cons(b, G))$InputForm
convert([a, n, d])$InputForm
convert(s : %) : Symbol == s pretend Symbol
coerce(s : String) : % == VALUES(INTERN(s)$Lisp)$Lisp
x = y == EQUAL(x, y)$Lisp
hashUpdate!(hs, s) == update!(hs, SXHASH(s)$Lisp)$HashState
x < y ==
scripted?(x) =>
scripted?(y) => lt_sexp(x, y)$Lisp
true
scripted?(y) => false
lt_sexp(x, y)$Lisp
coerce(x : %) : OutputForm ==
not(scripted? x) => outputForm(x pretend Symbol)
ss : Scripts := scripts x
rsl : List(L) := [ss.presub, ss.presup, ss.sup, ss.sub]
sl : L := []
for si in rsl repeat
empty?(sl) and empty?(si) => iterate
se :=
#si = 1 => first(si)
commaSeparate(si)
sl := cons(se, sl)
x0 := scripts(outputForm(name(x) pretend Symbol), sl)
a := ss.args
empty?(a) => x0
prefix(x0, a)
subscript(sy, lx) == script(sy, [lx, [], [], [], []])
elt(sy, lx) == subscript(sy, lx)
superscript(sy, lx) == script(sy, [[], lx, [], [], []])
argscript(sy, lx) == script(sy, [[], [], [], [], lx])
patternMatch(x : %, p : Pattern Integer, l : PatternMatchResult(Integer, %))==
(patternMatch(x pretend Symbol, p, l pretend
PatternMatchResult(Integer, Symbol))$PatternMatchSymbol(Integer))
pretend PatternMatchResult(Integer, %)
patternMatch(x : %, p : Pattern Float, l : PatternMatchResult(Float, %)) ==
(patternMatch(x pretend Symbol, p, l pretend
PatternMatchResult(Float, Symbol))$PatternMatchSymbol(Float))
pretend PatternMatchResult(Float, %)
convert(x : %) : Pattern(Float) ==
coerce(x pretend Symbol)$Pattern(Float)
convert(x : %) : Pattern(Integer) ==
coerce(x pretend Symbol)$Pattern(Integer)
syprefix sc ==
ns : List Integer := [#sc.sub, #sc.sup, #sc.presup, #sc.presub]
concat concat(concat(hd, istring(#sc.args)),
[istring n for n in ns])
syscripts sc ==
all := sc.presub
all := concat(sc.presup, all)
all := concat(sc.sup, all)
all := concat(sc.sub, all)
concat(all, sc.args)
script(sy : %, ls : List L) ==
sc : Scripts := [[], [], [], [], []]
if not(empty?(ls)) then (sc.sub := first(ls); ls := rest(ls))
if not(empty?(ls)) then (sc.sup := first(ls); ls := rest(ls))
if not(empty?(ls)) then (sc.presup := first(ls); ls := rest(ls))
if not(empty?(ls)) then (sc.presub := first(ls); ls := rest(ls))
if not(empty?(ls)) then (sc.args := first(ls); ls := rest(ls))
script(sy, sc)
script(sy : %, sc : Scripts) ==
scripted? sy => error "Cannot add scripts to a scripted symbol"
(concat(concat(syprefix sc, string name sy)::%::OutputForm,
syscripts sc)) pretend %
string e ==
not scripted? e => PNAME(e)$Lisp
error "Cannot form string from non-atomic symbols."
anyRadix(n : Integer, s : String) : String ==
ns:String := ""
repeat
qr := divide(n, #s)
n := qr.quotient
ns := concat(s.(qr.remainder+minIndex s), ns)
if zero?(n) then return ns
new() ==
sym := anyRadix(count::Integer, ALPHAS)
count := count + 1
concat("%",sym)::%
new x ==
n : Integer :=
(u := search(x, xcount)) case "failed" => 0
inc(u@Integer)
xcount(x) := n
xx :=
not scripted? x => string x
string name x
xx := concat("%",xx)
xx :=
(position(xx.maxIndex(xx), nums)>=minIndex(nums)) =>
concat(xx, anyRadix(n, alphas))
concat(xx, anyRadix(n, nums))
not scripted? x => xx::%
script(xx::%, scripts x)
resetNew() ==
count := 0
for k in keys xcount repeat remove!(k, xcount)
void
scripted? sy ==
not ATOM(sy)$Lisp
of_list(x : %) : L == x pretend L
name sy ==
not scripted? sy => sy
str := string(first(of_list(sy)) pretend %)
si := lhd + pcnt + 2
str(si..#str)::%
scripts sy ==
not scripted? sy => [[], [], [], [], []]
nscripts : List NonNegativeInteger := [0, 0, 0, 0, 0]
lscripts : List L := [[], [], [], [], []]
str := string(first(of_list(sy)) pretend %)
m := minIndex nscripts
for i in m.. for j in (lhd + 1)..(lhd + pcnt + 1) repeat
nscripts.i := (ord(str.j) - ord0)::NonNegativeInteger
-- Put the number of function scripts at the end.
nscripts := concat(rest nscripts, first nscripts)
allscripts := rest(of_list(sy))
m := minIndex lscripts
for i in m.. for n in nscripts repeat
#allscripts < n => error "Improper script count in symbol"
lscripts.i := first(allscripts, n)
allscripts := rest(allscripts, n)
[lscripts.m, lscripts.(m+1), lscripts.(m+2),
lscripts.(m+3), lscripts.(m+4)]
istring n ==
n > 9 => error "Can have at most 9 scripts of each kind"
istrings.(n + minIndex istrings)
sample() == "aSymbol"::%
--Copyright (c) 1991-2002, The Numerical ALgorithms Group Ltd.
--All rights reserved.
--
--Redistribution and use in source and binary forms, with or without
--modification, are permitted provided that the following conditions are
--met:
--
-- - Redistributions of source code must retain the above copyright
-- notice, this list of conditions and the following disclaimer.
--
-- - 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.
--
-- - Neither the name of The Numerical ALgorithms Group Ltd. 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.