Lines Matching refs:set

18 set testdir [file dirname $argv0]
38 set ::b [btree_open test2.bt]
52 set ::c2 [btree_cursor $::b 2 1]
96 for {set i 2} {$i<=6} {incr i} {
97 catch {btree_close_cursor [set ::c$i]}
99 set ::c$i [btree_cursor $::b $i 1]
103 set format %0${L}d
104 for {set i 1} {$i<=$N} {incr i} {
105 set key [format $format $i]
106 set data $key
115 set key [format %0${L}d $keynum]
116 set r $key
117 set i 1
129 set ck [btree_integrity_check $::b 2 3 4 5 6]
138 set N [btree_data $::c2]
140 set L [btree_data $::c2]
141 set LM1 [expr {$L-1}]
142 for {set i 1} {$i<=$N} {incr i} {
143 set key [btree_key $::c3]
144 if {[scan $key %d k]<1} {set k 0}
146 set key [btree_key $::c4]
147 if {[scan $key %d k]<1} {set k 0}
155 set data [btree_data $::c4]
158 set data [btree_data $::c3]
161 set skey [string range $key 0 $LM1]
163 set keylen [btree_data $::c5]
165 set keylen $L
175 set datalen [btree_data $::c6]
177 set datalen $L
196 set chngcnt 0
199 set N [btree_data $::c2]
201 set L [btree_data $::c2]
202 set LM1 [expr {$L-1}]
203 set total [expr {int($N*$n)}]
204 set format %0${L}d
205 for {set i 0} {$i<$total} {incr i} {
206 set k [expr {int(rand()*$N)+1}]
207 set insert [expr {rand()<=$I}]
208 set longkey [expr {rand()<=$K}]
209 set longdata [expr {rand()<=$D}]
214 set x [expr {rand()}]
215 set keylen [expr {int($x*$x*$x*$x*3000)+10}]
217 set keylen $L
219 set key [make_payload $k $L $keylen]
221 set x [expr {rand()}]
222 set datalen [expr {int($x*$x*$x*$x*3000)+10}]
224 set datalen $L
226 set data [make_payload $k $L $datalen]
227 set basekey [format $format $k]
228 if {[set c [btree_move_to $::c3 $basekey]]==0} {
236 if {[set c [btree_move_to $::c4 $basekey]]==0} {
244 if {[scan [btree_key $::c4] %d kx]<1} {set kx -1}
263 # set ck [btree_integrity_check $::b 2 3 4 5 6]
275 set testno 2
283 set hash [md5file test2.bt]
285 set ::c2 [btree_cursor $::b 2 1]
286 set ::c3 [btree_cursor $::b 3 1]
287 set ::c4 [btree_cursor $::b 4 1]
288 set ::c5 [btree_cursor $::b 5 1]
289 set ::c6 [btree_cursor $::b 6 1]
305 set ::c2 [btree_cursor $::b 2 1]
306 set ::c3 [btree_cursor $::b 3 1]
307 set ::c4 [btree_cursor $::b 4 1]
308 set ::c5 [btree_cursor $::b 5 1]
309 set ::c6 [btree_cursor $::b 6 1]
334 set num2 1
344 set testid btree2-$testno.8.$num2
345 set hash [md5file test2.bt]
347 set ::b [btree_open test2.bt]
348 set ::c2 [btree_cursor $::b 2 1]
349 set ::c3 [btree_cursor $::b 3 1]
350 set ::c4 [btree_cursor $::b 4 1]
351 set ::c5 [btree_cursor $::b 5 1]
352 set ::c6 [btree_cursor $::b 6 1]
355 set cnt 6
356 for {set i 2} {$i<=6} {incr i} {
357 if {[lindex [btree_cursor_dump [set ::c$i]] 0]!=$i} {incr cnt}
381 set ::c2 [btree_cursor $::b 2 1]
382 set ::c3 [btree_cursor $::b 3 1]
383 set ::c4 [btree_cursor $::b 4 1]
384 set ::c5 [btree_cursor $::b 5 1]
385 set ::c6 [btree_cursor $::b 6 1]
396 set hash [md5file test2.bt]
407 set ::b [btree_open test2.bt]
408 set ::c2 [btree_cursor $::b 2 1]
409 set ::c3 [btree_cursor $::b 3 1]
410 set ::c4 [btree_cursor $::b 4 1]
411 set ::c5 [btree_cursor $::b 5 1]
412 set ::c6 [btree_cursor $::b 6 1]
429 set ::b [btree_open test2.bt]