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
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
|
implement TclLib;
include "sys.m";
sys: Sys;
include "draw.m";
include "tk.m";
include "bufio.m";
bufmod : Bufio;
Iobuf : import bufmod;
include "string.m";
str : String;
include "tcl.m";
include "tcllib.m";
include "utils.m";
utils : Tcl_Utils;
error : int;
DEF,DEC,INT : con iota;
valid_commands:= array[] of {
"concat" ,
"join" ,
"lindex" ,
"linsert" ,
"list" ,
"llength" ,
"lrange" ,
"lreplace" ,
"lsearch" ,
"lsort" ,
"split"
};
about() : array of string {
return valid_commands;
}
exec(tcl : ref Tcl_Core->TclData,argv : array of string) : (int,string) {
if (tcl.context==nil);
str = load String String->PATH;
sys = load Sys Sys->PATH;
utils = load Tcl_Utils Tcl_Utils->PATH;
if (str==nil || utils==nil)
return (1,"Can't load modules\n");
case argv[0] {
"concat" =>
return (error,do_concat(argv,0));
"join" =>
return (error,do_join(argv));
"lindex" =>
return (error,do_lindex(argv));
"linsert" =>
return (error,do_linsert(argv));
"list" =>
return (error,do_concat(argv,1));
"llength" =>
return (error,do_llength(argv));
"lrange" =>
return (error,do_lrange(argv));
"lreplace" =>
return (error,do_lreplace(argv));
"lsearch" =>
return (error,do_lsearch(argv));
"lsort" =>
return (error,do_lsort(argv));
"split" =>
return (error,do_split(argv));
}
return (1,nil);
}
spaces(s : string) : int{
if (s==nil) return 1;
for(i:=0;i<len s;i++)
if (s[i]==' ' || s[i]=='\t') return 1;
return 0;
}
sort(a: array of string, key: int): array of string {
m: int;
n := len a;
for(m = n; m > 1; ) {
if(m < 5)
m = 1;
else
m = (5*m-1)/11;
for(i := n-m-1; i >= 0; i--) {
tmp := a[i];
for(j := i+m; j <= n-1 && greater(tmp, a[j], key); j += m)
a[j-m] = a[j];
a[j-m] = tmp;
}
}
return a;
}
greater(x, y: string, sortkey: int): int {
case (sortkey) {
DEF => return(x > y);
DEC => return(x < y);
INT => return(int x > int y);
}
return 0;
}
# from here on are the commands in alphabetical order...
# turns an array into a string with spaces between the elements.
# in braces is non-zero, the elements will be enclosed in braces.
do_concat(argv : array of string, braces : int) : string {
retval :string;
retval=nil;
for(i:=1;i<len argv;i++){
flag:=0;
if (spaces(argv[i])) flag=1;
if (braces && flag) retval[len retval]='{';
retval += argv[i];
if (braces && flag) retval[len retval]='}';
retval[len retval]=' ';
}
if (retval!=nil)
retval=retval[0:len retval-1];
return retval;
}
do_join(argv : array of string) : string {
retval : string;
if (len argv ==1 || len argv >3)
return notify(1,"join list ?joinString?");
if (len argv == 2)
return argv[1];
if (argv[1]==nil) return nil;
arr := utils->break_it(argv[1]);
for (i:=0;i<len arr;i++){
retval+=arr[i];
if (i!=len arr -1)
retval+=argv[2];
}
return retval;
}
do_lindex(argv : array of string) : string {
if (len argv != 3)
return notify(1,"lindex list index");
(num,rest):=str->toint(argv[2],10);
if (rest!=nil)
return notify(2,argv[2]);
arr:=utils->break_it(argv[1]);
if (num>=len arr)
return nil;
return arr[num];
}
do_linsert(argv : array of string) : string {
if (len argv < 4){
return notify(1,
"linsert list index element ?element ...?");
}
(num,rest):=str->toint(argv[2],10);
if (rest!=nil)
return notify(2,argv[2]);
arr:=utils->break_it(argv[1]);
narr := array[len arr + len argv - 2] of string;
narr[0]="do_concat";
if (num==0){
narr[1:]=argv[3:];
narr[len argv -2:]=arr[0:];
}else if (num>= len arr){
narr[1:]=arr[0:];
narr[len arr+1:]=argv[3:];
}else{
narr[1:]=arr[0:num];
narr[num+1:]=argv[3:];
narr[num+len argv -2:]=arr[num:];
}
return do_concat(narr,1);
}
do_llength(argv : array of string) : string {
if (len argv !=2){
return notify(1,"llength list");
}
arr:=utils->break_it(argv[1]);
return string len arr;
}
do_lrange(argv :array of string) : string {
beg,end : int;
rest : string;
if (len argv != 4)
return notify(1,"lrange list first last");
(beg,rest)=str->toint(argv[2],10);
if (rest!=nil)
return notify(2,argv[2]);
(end,rest)=str->toint(argv[3],10);
if (rest!=nil)
return notify(2,argv[3]);
if (beg <0) beg=0;
if (end < 0) return nil;
if (beg > end) return nil;
arr:=utils->break_it(argv[1]);
if (beg>len arr) return nil;
narr:=array[end-beg+2] of string;
narr[0]="do_concat";
narr[1:]=arr[beg:end+1];
return do_concat(narr,1);
}
do_lreplace(argv : array of string) : string {
beg,end : int;
rest : string;
if (len argv < 3)
return notify(1,"lreplace list "+
"first last ?element element ...?");
arr:=utils->break_it(argv[1]);
(beg,rest)=str->toint(argv[2],10);
if (rest!=nil)
return notify(2,argv[2]);
(end,rest)=str->toint(argv[3],10);
if (rest!=nil)
return notify(2,argv[3]);
if (beg <0) beg=0;
if (end < 0) return nil;
if (beg > end)
return notify(0,
"first index must not be greater than second");
if (beg>len arr)
return notify(1,
"list doesn't contain element "+string beg);
narr:=array[len arr-(end-beg+1)+len argv - 3] of string;
narr[1:]=arr[0:beg];
narr[beg+1:]=argv[4:];
narr[beg+1+len argv-4:]=arr[end+1:];
narr[0]="do_concat";
return do_concat(narr,1);
}
do_lsearch(argv : array of string) : string {
if (len argv!=3)
return notify(1,"lsearch ?mode? list pattern");
arr:=utils->break_it(argv[1]);
for(i:=0;i<len arr;i++)
if (arr[i]==argv[2])
return string i;
return "-1";
}
do_lsort(argv : array of string) : string {
lis : array of string;
key : int;
key=DEF;
if (len argv == 1)
return notify(1,"lsort ?-ascii? ?-integer? ?-real?"+
" ?-increasing? ?-decreasing?"+
" ?-command string? list");
for(i:=1;i<len argv;i++)
if (argv[i][0]=='-')
case argv[i]{
"-decreasing" =>
key = DEC;
* =>
if (len argv != i+1)
return notify(0,sys->sprint(
"bad switch \"%s\": must be"+
" -ascii, -integer, -real, "+
"-increasing -decreasing, or"+
" -command" ,argv[i]));
}
lis=utils->break_it(argv[len argv-1]);
arr:=sort(lis,key);
narr:= array[len arr+1] of string;
narr[0]="list";
narr[1:]=arr[0:];
return do_concat(narr,1);
}
do_split(argv : array of string) : string {
arr := array[20] of string;
narr : array of string;
if (len argv ==1 || len argv>3)
return notify(1,"split string ?splitChars?");
if (len argv == 2)
return argv[1];
s:=argv[1];
if (s==nil) return nil;
if (argv[2]==nil){
arr=array[len s+1] of string;
for(i:=0;i<len s;i++)
arr[i+1][len arr[i+1]]=s[i];
arr[0]="do_concat";
return do_concat(arr,1);
}
i:=1;
while(s!=nil){
(piece,rest):=str->splitl(s,argv[2]);
arr[i]=piece;
if (len rest>1)
s=rest[1:];
if (len rest==1)
s=nil;
i++;
if (i==len arr){
narr=array[i+10] of string;
narr[0:]=arr[0:];
arr=array[i+10] of string;
arr=narr;
}
}
narr = array[i] of string;
arr[0]="do_concat";
narr = arr[0:i+1];
return do_concat(narr,1);
}
notify(num : int,s : string) : string {
error=1;
case num{
1 =>
return sys->sprint(
"wrong # args: should be \"%s\"",s);
2 =>
return sys->sprint(
"expected integer but got \"%s\"",s);
* =>
return s;
}
}
|