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
|
############################################################################
#
# File: weaving.icn
#
# Subject: Procedures to implement weaving expressions
#
# Author: Ralph E. Griswold
#
# Date: October 22, 1999
#
############################################################################
#
# This file is in the public domain.
#
############################################################################
#
# These procedures implement the weaving expressions supported by Painter
# and described in the PDF document "Advanced Weaving" that accompanies
# that application.
#
############################################################################
#
# Links: strings
#
############################################################################
$define Domain "12345678"
$define DomainForward "1234567812345678"
$define DomainBackward "8765432187654321"
procedure Between(p1, p2)
DomainForward ? {
tab(upto(p1[-1]) + 1)
return tab(upto(p2[1]))
}
end
procedure Block(p1, p2) #: weaving block
local i, s, p3, counts
if *p1 < *p2 then p1 := Extend(p1, *p2) | fail
else if *p2 < *p1 then p2 := Extend(p2, *p1) | fail
counts := []
p2 ? {
while s := tab(upto('{')) do {
every put(counts, !s)
move(1)
put(counts, tab(upto('}')))
move(1)
}
every put(counts, !tab(0))
}
p3 := ""
every i := 1 to *p1 do
p3 ||:= repl(p1[i], counts[i])
return p3
end
procedure DownRun(c1, c2) #: weaving downrun
DomainBackward ? {
tab(upto(c1))
return tab(upto(c2) + 1)
}
end
# CYCLES WRONG
procedure DownUp(p1, p2, cycles) #: weaving downup
local i, p3
/cycles := 0
if *p1 < *p2 then p1 := Extend(p1, *p2) | fail
else if *p2 < *p1 then p2 := Extend(p2, *p1) | fail
p3 := p1[1]
if cycles > 0 then {
DomainForward ? {
tab(upto(p1[-1]) + 1)
p3 ||:= repl(move(8), cycles)
}
}
every i := 1 to *p1 do {
p3 ||:= DownRun(p1[i], p2[i])[2:0]
p3 ||:= UpRun(p2[i], p1[i + 1])[2:0] # might fail
}
return p3
end
procedure Downto(p1, p2, cycles) #: weaving downto
local p3
p3 := p1
/cycles := 0
if cycles > 0 then {
DomainBackward ? {
tab(upto(p1[-1]) + 1)
p3 ||:= repl(move(8), cycles)
}
}
DomainBackward ? {
tab(upto(p1[-1]) + 1)
return p3 || tab(upto(p2[1])) || p2
}
end
procedure Extend(p, i) #: weaving extension
if *p = 0 then fail
i := integer(i)
return case i of {
*p > i : left(p, i)
*p < i : left(repl(p, (i / *p) + 1), i)
default : p
}
end
procedure Interleave(p1, p2) #: weaving interleave
local i, p3
if *p1 < *p2 then p1 := Extend(p1, *p2) | fail
else if *p2 < *p1 then p2 := Extend(p2, *p1) | fail
p3 := ""
every i := 1 to *p1 do
p3 ||:= p1[i] || p2[i]
return p3
end
procedure Palindrome(p) #: weaving palindrome
if *p = 1 then return p
else return p || reverse(p[2:-1])
end
procedure Pbox(p1, p2) #: weaving pbox
local p3, i
if *p2 ~= *p1 then p2 := Extend(p2, *p1) | fail
p3 := ""
every i := !p1 do
p3 ||:= p1[p2[i]]
return p3
end
procedure Permute(p1, p2) #: weaving permutation
local p3, chunk, i, j
j := *p1 % *p2
if j ~= 0 then p1 := Extend(p1, *p1 + *p2 - j) | fail
p3 := ""
p1 ? {
while chunk := move(*p2) do
every i := !p2 do
p3 ||:= chunk[i]
}
return p3
end
procedure Run(p, count)
DomainForward ? {
tab(upto(p[-1]) + 1)
return repl(move(*Domain), count)
}
end
procedure Template(p1, p2) #: weaving Template
local p3, dlist, i, j, k
dlist := []
every i := 1 to *p1 do
put(dlist, p1[i] - p1[1])
p3 := ""
every j := 1 to *dlist do
every i := 1 to *p2 do {
k := p2[i] + dlist[j]
if k > 8 then k -:= 8
p3 ||:= k
}
return p3
end
# CYCLES WRONG
procedure UpDown(p1, p2, cycles) #: weaving updown
local p3, i
/cycles := 0
if *p1 < *p2 then p1 := Extend(p1, *p2) | fail
else if *p2 < *p1 then p2 := Extend(p2, *p1) | fail
p3 := p1[1]
if cycles > 0 then {
DomainForward ? {
tab(upto(p1[-1]) + 1)
p3 ||:= repl(move(8), cycles)
}
}
every i := 1 to *p1 do {
p3 ||:= UpRun(p1[i], p2[i])[2:0]
p3 ||:= DownRun(p2[i], p1[i + 1])[2:0] # might fail
}
return p3
end
procedure UpRun(c1, c2) #: weaving uprun
DomainForward ? {
tab(upto(c1))
return tab(upto(c2) + 1)
}
end
procedure Upto(p1, p2, cycles) #: weaving upto
local p3
/cycles := 0
p3 := p1
return p1 || Run(p1, cycles) || Between(p1, p2) || p2
end
|
