1# 2# 2001 November 22 3# 4# The author disclaims copyright to this source code. In place of 5# a legal notice, here is a blessing: 6# 7# May you do good and not evil. 8# May you find forgiveness for yourself and forgive others. 9# May you share freely, never taking more than you give. 10# 11#*********************************************************************** 12# This file implements regression tests for SQLite library. The 13# focus of this script is btree database backend 14# 15# In particular, this file tests a small part of the Delete logic 16# for the BTree backend. When a row is deleted from a table, the 17# cursor is suppose to be left pointing at either the previous or 18# next entry in that table. If the cursor is left pointing at the 19# next entry, then the next Next operation is ignored. So the 20# sequence of operations (Delete, Next) should always leave the 21# cursor pointing at the first entry past the one that was deleted. 22# This test is designed to verify that behavior. 23# 24# $Id: btree3.test,v 1.2 2002/12/04 13:40:27 drh Exp $ 25 26 27set testdir [file dirname $argv0] 28source $testdir/tester.tcl 29 30if {[info commands btree_open]!=""} { 31 32# Open a test database. 33# 34file delete -force test1.bt 35file delete -force test1.bt-journal 36set b1 [btree_open test1.bt] 37btree_begin_transaction $::b1 38 39# Insert a few one records 40# 41set data {abcdefghijklmnopqrstuvwxyz0123456789} 42append data $data 43append data $data 44append data $data 45append data $data 46for {set k 2} {$k<=10} {incr k} { 47 for {set j 1} {$j<=$k} {incr j} { 48 set jkey [format %02d $j] 49 btree_clear_table $::b1 2 50 set ::c1 [btree_cursor $::b1 2 1] 51 for {set i 1} {$i<=$k} {incr i} { 52 set key [format %02d $i] 53 do_test btree3-$k.$j.1.$i { 54 btree_insert $::c1 $::key $::data 55 } {} 56 # btree_tree_dump $::b1 2 57 } 58 do_test btree3-$k.$j.2 { 59 btree_move_to $::c1 $::jkey 60 btree_key $::c1 61 } $::jkey 62 do_test btree3-$k.$j.3 { 63 btree_delete $::c1 64 } {} 65 if {$j<$k} { 66 do_test btree3-$k.$j.4 { 67 btree_next $::c1 68 btree_key $::c1 69 } [format %02d [expr $j+1]] 70 } 71 if {$j>1} { 72 do_test btree3-$k.$j.5 { 73 btree_prev $::c1 74 btree_key $::c1 75 } [format %02d [expr $j-1]] 76 } 77 btree_close_cursor $::c1 78 } 79} 80 81btree_rollback $::b1 82btree_pager_ref_dump $::b1 83btree_close $::b1 84 85} ;# end if( not mem: and has pager_open command ); 86 87finish_test 88