-
Notifications
You must be signed in to change notification settings - Fork 15
/
autoloaded.sj
245 lines (168 loc) · 7.14 KB
/
autoloaded.sj
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
## This code is autoloaded when trigger symbols are encountered when reading input.
## See src/autoload.jl for autoloading code and list of symbols that trigger it.
## These protected symbols must be entered in src/protected_symbols. So, three places.
## Symbols listed in src/protected_symbols are not returned by UserSyms().
## Some of these could easily be written in Julia. But, it is a good idea for Symata to eat its own dogfood.
### Through
Unprotect(Through)
Through(h_(a__)(args__),h_) := h(Apply(Sequence,Map( ηηη -> Apply(ηηη,[args]), [a])))
Through(h_(a__)(args__)) := h(Apply(Sequence,Map( ηηη -> Apply(ηηη,[args]), [a])))
Protect(Through)
### Operate
Unprotect(Operate)
Operate(p_, f_(x__)) := p(f)(x)
Protect(Operate)
### ExpToTrig
Unprotect(ExpToTrig)
ExpToTrig(ex_) := ReplaceRepeated(ex, E^(x_) => Cosh(x) + Sinh(x))
Protect(ExpToTrig)
### ExpandCos, ExpandSin, ExpandSinCos
Unprotect(ExpandSinRule, ExpandCosRule, ExpandCos, ExpandSin, ExpandSinCos)
ExpandSinRule := Sin(a_ + b__) .> Cos(Plus(b))*Sin(a) + Cos(a)*Sin(Plus(b))
ExpandCosRule := Cos(a_ + b__) .> Cos(a)*Cos(Plus(b)) - Sin(a)*Sin(Plus(b))
ExpandCos(ex_) := ReplaceRepeated(ex, ExpandCosRule)
ExpandSin(ex_) := ReplaceRepeated(ex, ExpandSinRule)
ExpandSinCos(ex_) := ex .// [ExpandSinRule, ExpandCosRule]
Protect(ExpandSinRule, ExpandCosRule, ExpandCos, ExpandSin, ExpandSinCos)
### Array
Unprotect(Array)
Array(f_, n_Integer) := Map(f,Range(n))
Array(f_, n_Integer, r_Integer) := Map(f,Range(r,n+r-1))
Array(f_, lims_List) := Module([vars = Array(x -> Unique(), Length(lims))],
(Null,
Table(Evaluate(Apply(f,vars)), Evaluate(Splat(Transpose([vars,lims]))))))
Array(f_, n_Integer, [a_,b_]) := Map(f, Range(a,b,(b-a)/n))
## TODO: reimplement these as above.
Array(f_, [n1_Integer, n2_Integer], [r1_Integer, r2_Integer] ) := Module([i ], (Null, Table(f(i,j), [i,r1,n1+r1-1], [j,r2,n2+r2-1])))
Array(f_, [n1_Integer, n2_Integer, n3_Integer], [r1_Integer, r2_Integer, r3_Integer] ) :=
Module([i ], (Null, Table(f(i,j,k), [i,r1,n1+r1-1], [j,r2,n2+r2-1], [k,r3,n3+r3-1])))
Array(f_, [n1_Integer, n2_Integer], [[a1_,b1_], [a2_,b2_] ] ) := Module([i ], (Null, Table(f(i,j), [i, Range(a1,b1,(b1-a1)/n1)], [j, Range(a2,b2,(b2-a2)/n2)])))
Protect(Array)
### Subdivide
@sjdoc Subdivide """
Subdivide(n)
is equivalent to `Range(0,n)/n`.
Subdivide(xmax, n)
is equivalent to `xmax*Range(0,n)/n`
Subdivide(xmin, xmax, n)
is equivalent to `xmin + (xmax-xmin)*Range(0,n)/n`.
"""
Unprotect(Subdivide)
Subdivide(n_) := Range(0,n)/n
Subdivide(xmax_, n_) := xmax*Range(0,n)/n
Subdivide(xmin_, xmax_, n_) := xmin + (xmax-xmin)*Range(0,n)/n
Protect(Subdivide)
### TakeDrop
## Note: this is wrong for many `seq's`
Unprotect(TakeDrop)
TakeDrop(x_, seq_) := [Take(x,seq), Drop(x,seq)]
TakeDrop(x_, seq1_, seq2_) := [Take(x,seq1,seq2), Drop(x,seq1,seq2)]
Protect(TakeDrop)
### ArrayDepth
Unprotect(ArrayDepth)
ArrayDepth(x_) := Length(Dimensions(x))
Protect(ArrayDepth)
### TensorRank
Unprotect(TensorRank)
TensorRank(x_) := Length(Dimensions(x))
Protect(TensorRank)
### Divide
Unprotect(Divide)
Divide(x_, y_) := x/y
Protect(Divide)
## ListCorrelate and ListConvolve are ok here for symbolic elements. For numeric, they are very slow.
## These are mostly for demonstration.
### ListCorrelate
Unprotect(ListCorrelate)
ListCorrelate(ker_List, list_List) := Module([pl,zzz],
(
pl = Partition(list, Length(ker), 1),
Map( Function(zzz, Dot(ker,zzz)), pl)))
Protect(ListCorrelate)
### ListConvolve
Unprotect(ListConvolve)
ListConvolve(ker_List, list_List) := Module([pl,zzz,rker],
(
pl = Partition(list, Length(ker), 1),
rker = Reverse(ker),
Map( Function(zzz, Dot(rker,zzz)), pl)))
Protect(ListConvolve)
### Accumulate
Unprotect(Accumulate)
Accumulate(list_) := Rest(FoldList(Plus,0,list))
Protect(Accumulate)
### NestWhile
Unprotect(NestWhile)
NestWhile(f_,ex_,test_) := Module([res=f(ex)], (Null, While( test(res), res = f(res)), res))
Protect(NestWhile)
### NestWhileList
Unprotect(NestWhileList)
NestWhileList(f_,ex_,test_) := Module([res=f(ex), list], (list=[ex,res], While( test(res),( res = f(res), Push!(list,res)) ), list))
Protect(NestWhileList)
### NextPrime
Unprotect(NextPrime)
NextPrime(x_Integer) := NestWhile( zz -> zz + 1 , x, yy -> Not(PrimeQ(yy)))
Protect(NextPrime)
### FixedPoint
Unprotect(FixedPoint)
FixedPoint(f_,ex_) := Module([res = f(ex), res1],
(While(
res !== res1,
(res1 = res,
res = f(res1))) , res))
FixedPoint(f_,ex_, max_) := Module([res = f(ex), res1, n = 0],
(While(
res !== res1,
(
n += 1,
If(n>max,Break()),
res1 = res,
res = f(res1))) , res))
FixedPoint(f_,ex_, Rule(SameTest, test_)) := FixedPoint(f,ex,Infinity,Rule(SameTest, test_))
FixedPoint(f_,ex_, max_, Rule(SameTest, test_)) := Module([res = f(ex), res1, n = 0],
(While(
! test(res,res1),
(
n += 1,
If(n>max,Break()),
res1 = res,
res = f(res1))) , res))
Protect(FixedPoint)
### FlattenAt
Unprotect(FlattenAt)
@sjdoc FlattenAt """
FlattenAt(list,n)
flattens a sublist at position `n` in `list`.
FlattenAt(list,[i,j,..]).
flatten part at position `[i,j,...]`.
FlattenAt(list,[[i,j,..],[k,l,...]])
flatten parts at multiple positions.
FlattenAt(positions)
returns an operator that flattens at `positions`.
"""
FlattenAt(list_, [pos__Integer]) := ReplacePart(list, [pos] => Splat(Flatten(list[pos])))
FlattenAt(list_, pos_Integer) := ReplacePart(list, pos => Splat(Flatten(list[pos])))
FlattenAt(list_, [posns__List]) := ReplacePart(list, Map(Function(p, p => Splat(Flatten(list[Splat(p)]))), [posns]))
@curry_second FlattenAt
Protect(FlattenAt)
### MapAt
@sjdoc MapAt """
MapAt(f,expr,n)
apply `f` to the part at position `n` in `expr`.
MapAt(f,expr,[i,j,..]).
apply `f` to the part at position `[i,j,...]`.
MapAt(f,expr,[[i,j,..],[k,l,...]])
apply `f` to parts at multiple positions.
MapAt(f,positions)
returns an operator that applies `f` at `positions`.
"""
Unprotect(MapAt)
MapAt(f_, list_, [pos__Integer]) := ReplacePart(list, [pos] => f(list[pos]))
MapAt(f_, list_, pos_Integer) := ReplacePart(list, pos => f(list[pos]))
MapAt(f_, list_, [posns__List]) := ReplacePart(list, Map(Function(p, p => f(list[Splat(p)])), [posns]))
Protect(MapAt)
@curry_split MapAt
### Normal
Unprotect(Normal)
Normal(ex_) := ReplaceAll(ex, Order(x__) => Sequence())
Protect(Normal)