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
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
|
# Commands covered: lseq
#
# This file contains a collection of tests for one or more of the Tcl
# built-in commands. Sourcing this file into Tcl runs the tests and
# generates output for errors. No output means no errors were found.
#
# Copyright © 2003 Simon Geard.
#
# See the file "license.terms" for information on usage and redistribution
# of this file, and for a DISCLAIMER OF ALL WARRANTIES.
if {"::tcltest" ni [namespace children]} {
package require tcltest 2.5
namespace import -force ::tcltest::*
}
testConstraint arithSeriesDouble 0
testConstraint arithSeriesShimmer 1
testConstraint arithSeriesShimmerOk 0
## Arg errors
test lseq-1.1 {error cases} -body {
lseq
} \
-returnCodes 1 \
-result {wrong # args: should be "lseq n ??op? n ??by? n??"}
test lseq-1.2 {step magnitude} {
lseq 10 .. 1 by -2 ;# or this could be an error - or not
} {10 8 6 4 2}
test lseq-1.3 {synergy between int and double} {
set rl [lseq 25. to 5. by -5]
set il [lseq 25 to 5 by -5]
lmap r $rl i $il { if {$r ne "" && $i ne ""} {expr {int($r) == $i}} else {list $r $i} }
} {1 1 1 1 1}
test lseq-1.4 {integer decreasing} {
lseq 10 .. 1
} {10 9 8 7 6 5 4 3 2 1}
test lseq-1.5 {integer increasing} {
lseq 1 .. 10
} {1 2 3 4 5 6 7 8 9 10}
test lseq-1.6 {integer decreasing with step} {
lseq 10 .. 1 by -2
} {10 8 6 4 2}
test lseq-1.7 {real increasing lseq} arithSeriesDouble {
lseq 5.0 to 15.
} {5.0 6.0 7.0 8.0 9.0 10.0 11.0 12.0 13.0 14.0 15.0}
test lseq-1.8 {real increasing lseq with step} arithSeriesDouble {
lseq 5.0 to 25. by 5
} {5.0 10.0 15.0 20.0 25.0}
test lseq-1.9 {real decreasing with step} arithSeriesDouble {
lseq 25. to 5. by -5
} {25.0 20.0 15.0 10.0 5.0}
# note, 10 cannot be in such a list, but allowed
test lseq-1.10 {integer lseq with step} {
lseq 1 to 10 by 2
} {1 3 5 7 9}
test lseq-1.11 {error case: increasing wrong step direction} {
lseq 1 to 10 by -2
} {}
test lseq-1.12 {decreasing lseq with step} arithSeriesDouble {
lseq 25. to -25. by -5
} { 25.0 20.0 15.0 10.0 5.0 0.0 -5.0 -10.0 -15.0 -20.0 -25.0}
test lseq-1.13 {count operation} {
-body {
lseq 5 count 5
}
-result {5 6 7 8 9}
}
test lseq-1.14 {count with step} {
-body {
lseq 5 count 5 by 2
}
-result {5 7 9 11 13}
}
test lseq-1.15 {count with decreasing step} {
-body {
lseq 5 count 5 by -2
}
-result {5 3 1 -1 -3}
}
test lseq-1.16 {large numbers} {
-body {
lseq [expr {int(1e6)}] [expr {int(2e6)}] [expr {int(1e5)}]
}
-result {1000000 1100000 1200000 1300000 1400000 1500000 1600000 1700000 1800000 1900000 2000000}
}
test lseq-1.17 {too many arguments} -body {
lseq 12 to 24 by 2 with feeling
} -returnCodes 1 -result {wrong # args: should be "lseq n ??op? n ??by? n??"}
test lseq-1.18 {too many arguments extra valid keyword} -body {
lseq 12 to 24 by 2 count
} -returnCodes 1 -result {wrong # args: should be "lseq n ??op? n ??by? n??"}
test lseq-1.19 {too many arguments extra numeric value} -body {
lseq 12 to 24 by 2 7
} -returnCodes 1 -result {wrong # args: should be "lseq n ??op? n ??by? n??"}
#
# Short-hand use cases
#
test lseq-2.2 {step magnitude} {
lseq 10 1 2 ;# this is an empty case since step has wrong sign
} {}
test lseq-2.3 {step wrong sign} arithSeriesDouble {
lseq 25. 5. 5 ;# ditto - empty list
} {}
test lseq-2.4 {integer decreasing} {
lseq 10 1
} {10 9 8 7 6 5 4 3 2 1}
test lseq-2.5 {integer increasing} {
lseq 1 10
} {1 2 3 4 5 6 7 8 9 10}
test lseq-2.6 {integer decreasing with step} {
lseq 10 1 by -2
} {10 8 6 4 2}
test lseq-2.7 {real increasing lseq} arithSeriesDouble {
lseq 5.0 15.
} {5.0 6.0 7.0 8.0 9.0 10.0 11.0 12.0 13.0 14.0 15.0}
test lseq-2.8 {real increasing lseq with step} arithSeriesDouble {
lseq 5.0 25. 5
} {5.0 10.0 15.0 20.0 25.0}
test lseq-2.9 {real decreasing with step} arithSeriesDouble {
lseq 25. 5. -5
} {25.0 20.0 15.0 10.0 5.0}
test lseq-2.10 {integer lseq with step} {
lseq 1 10 2
} {1 3 5 7 9}
test lseq-2.11 {error case: increasing wrong step direction} {
lseq 1 10 -2
} {}
test lseq-2.12 {decreasing lseq with step} arithSeriesDouble {
lseq 25. -25. -5
} { 25.0 20.0 15.0 10.0 5.0 0.0 -5.0 -10.0 -15.0 -20.0 -25.0}
test lseq-2.13 {count only operation} {
lseq 5
} {0 1 2 3 4}
test lseq-2.14 {count with step} {
lseq 5 count 5 2
} {5 7 9 11 13}
test lseq-2.15 {count with decreasing step} {
lseq 5 count 5 -2
} {5 3 1 -1 -3}
test lseq-2.16 {large numbers} {
lseq 1e6 2e6 1e5
} {1000000 1100000 1200000 1300000 1400000 1500000 1600000 1700000 1800000 1900000 2000000}
test lseq-2.17 {large numbers} arithSeriesDouble {
lseq 1e6 2e6 1e5
} {1000000.0 1100000.0 1200000.0 1300000.0 1400000.0 1500000.0 1600000.0 1700000.0 1800000.0 1900000.0 2000000.0}
test lseq-3.1 {experiement} {
set ans {}
foreach factor [lseq 2.0 10.0] {
set start 1
set end 10
for {set step 1} {$step < 1e8} {} {
set l [lseq $start to $end by $step]
if {[llength $l] != 10} {
lappend ans $factor $step [llength $l] $l
}
set step [expr {$step * $factor}]
set end [expr {$end * $factor}]
}
}
if {$ans eq {}} {
set ans OK
}
set ans
} {OK}
test lseq-3.2 {error case} -body {
lseq foo
} -returnCodes 1 -result {bad operation "foo": must be .., to, count, or by}
test lseq-3.3 {error case} -body {
lseq 10 foo
} -returnCodes 1 -result {bad operation "foo": must be .., to, count, or by}
test lseq-3.4 {error case} -body {
lseq 25 or 6
} -returnCodes 1 -result {bad operation "or": must be .., to, count, or by}
test lseq-3.5 {simple count and step arguments} {
lseq 25 by 6
} {0 6 12 18 24 30 36 42 48 54 60 66 72 78 84 90 96 102 108 114 120 126 132 138 144 150}
test lseq-3.6 {error case} -body {
lseq 1 7 or 3
} -returnCodes 1 -result {bad operation "or": must be .., to, count, or by}
test lseq-3.7 {lmap lseq} {
lmap x [lseq 5] { expr {$x * $x} }
} {0 1 4 9 16}
test lseq-3.8 {lrange lseq} {
set r [lrange [lseq 1 100] 10 20]
lindex [tcl::unsupported::representation $r] 3
} {arithseries}
test lseq-3.9 {lassign lseq} arithSeriesShimmer {
set r [lseq 15]
set r2 [lassign $r a b]
list [lindex [tcl::unsupported::representation $r] 3] $a $b \
[lindex [tcl::unsupported::representation $r2] 3]
} {arithseries 0 1 arithseries}
test lseq-3.10 {lsearch lseq must shimmer?} arithSeriesShimmer {
set r [lseq 15 0]
set a [lsearch $r 9]
list [lindex [tcl::unsupported::representation $r] 3] $a
} {list 6}
test lseq-3.11 {lreverse lseq} {
set r [lseq 15 0]
set a [lreverse $r]
join [list \
[lindex [tcl::unsupported::representation $r] 3] \
$r \
[lindex [tcl::unsupported::representation $a] 3] \
$a] \n
} {arithseries
15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0
arithseries
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15}
test lseq-3.12 {in operator} {
set r [lseq 9]
set i [expr {7 in $r}]
set j [expr {10 ni $r}]
set k [expr {-1 in $r}]
set l [expr {4 ni $r}]
list $i $j $k $l [lindex [tcl::unsupported::representation $r] 3]
} {1 1 0 0 arithseries}
test lseq-3.13 {lmap lseq shimmer} arithSeriesShimmer {
set r [lseq 15]
set rep-before [lindex [tcl::unsupported::representation $r] 3]
set m [lmap i $r { expr {$i * 7} }]
set rep-after [lindex [tcl::unsupported::representation $r] 3]
set rep-m [lindex [tcl::unsupported::representation $m] 3]
list $r ${rep-before} ${rep-after} ${rep-m} $m
} {{0 1 2 3 4 5 6 7 8 9 10 11 12 13 14} arithseries arithseries list {0 7 14 21 28 35 42 49 56 63 70 77 84 91 98}}
test lseq-3.14 {array for shimmer} arithSeriesShimmerOk {
array set testarray {a Test for This great Function}
set vars [lseq 2]
set vars-rep [lindex [tcl::unsupported::representation $vars] 3]
array for $vars testarray {
lappend keys $0
lappend vals $1
}
# Since hash order is not guaranteed, have to validate content ignoring order
set valk [lmap k $keys {expr {$k in {a for great}}}]
set valv [lmap v $vals {expr {$v in {Test This Function}}}]
set vars-after [lindex [tcl::unsupported::representation $vars] 3]
list ${vars-rep} $valk $valv ${vars-after}
} {arithseries {1 1 1} {1 1 1} arithseries}
test lseq-3.15 {join for shimmer} arithSeriesShimmer {
set r [lseq 3]
set rep-before [lindex [tcl::unsupported::representation $r] 3]
set str [join $r :]
set rep-after [lindex [tcl::unsupported::representation $r] 3]
list ${rep-before} $str ${rep-after}
} {arithseries 0:1:2 arithseries}
test lseq-3.16 {error case} -body {
lseq 16 to
} -returnCodes 1 -result {missing "to" value.}
test lseq-3.17 {error case} -body {
lseq 17 to 13 by
} -returnCodes 1 -result {missing "by" value.}
test lseq-3.18 {error case} -body {
lseq 18 count
} -returnCodes 1 -result {missing "count" value.}
test lseq-3.19 {edge case} -body {
lseq 1 count 5 by 0
} -result {}
# 1 1 1 1 1
# My thought is that this is likely a user error, since they can always use lrepeat for this.
test lseq-3.20 {edge case} -body {
lseq 1 to 1 by 0
} -result {}
# hmmm, I guess this is right, in a way, so...
test lseq-3.21 {edge case} {
lseq 1 to 1 by 1
} {1}
test lseq-3.22 {edge case} {
lseq 1 1 1
} {1}
test lseq-3.23 {edge case} {
llength [lseq 1 1 1]
} {1}
test lseq-3.24 {edge case} {
llength [lseq 1 to 1 1]
} {1}
test lseq-3.25 {edge case} {
llength [lseq 1 to 1 by 1]
} {1}
# Test lmap
# Test "in" expression operator
# Test llength
# Test lindex
# Test lrange (lrange of a [lseq] list produces another [lseq] list)
# Test start,end,step expressions
# Test lreverse
# Test lsearch
# Test array for
# Test join for shimmer.
test lseq-4.1 {end expressions} {
set start 7
lseq $start $start+11
} {7 8 9 10 11 12 13 14 15 16 17 18}
test lseq-4.2 {start expressions} {
set base [clock seconds]
set tl [lseq $base-60 $base 10]
lmap t $tl {expr {$t - $base + 60}}
} {0 10 20 30 40 50 60}
# cleanup
::tcltest::cleanupTests
return
# Local Variables:
# mode: tcl
# End:
|