sqlite source (unix build) added to libraries

1 files changed, 101 insertions, 0 deletions

diff --git a/libraries/sqlite/unix/sqlite-3.5.1/test/btree4.test b/libraries/sqlite/unix/sqlite-3.5.1/test/btree4.test
new file mode 100644
index 0000000..8a08af3
--- /dev/null
+++ b/libraries/sqlite/unix/sqlite-3.5.1/test/btree4.test
@@ -0,0 +1,101 @@
+# 2002 December 03
+#
+# The author disclaims copyright to this source code.  In place of
+# a legal notice, here is a blessing:
+#
+#    May you do good and not evil.
+#    May you find forgiveness for yourself and forgive others.
+#    May you share freely, never taking more than you give.
+#
+#***********************************************************************
+# This file implements regression tests for SQLite library.  The
+# focus of this script is btree database backend
+#
+# This file focuses on testing the sqliteBtreeNext() and 
+# sqliteBtreePrevious() procedures and making sure they are able
+# to step through an entire table from either direction.
+#
+# $Id: btree4.test,v 1.2 2004/05/09 20:40:12 drh Exp $
+
+
+set testdir [file dirname $argv0]
+source $testdir/tester.tcl
+
+if {[info commands btree_open]!=""} {
+
+# Open a test database.
+#
+file delete -force test1.bt
+file delete -force test1.bt-journal
+set b1 [btree_open test1.bt 2000 0]
+btree_begin_transaction $b1
+do_test btree4-0.1 {
+  btree_create_table $b1 0
+} 2
+
+set data {abcdefghijklmnopqrstuvwxyz0123456789}
+append data $data
+append data $data
+append data $data
+append data $data
+
+foreach N {10 100 1000} {
+  btree_clear_table $::b1 2
+  set ::c1 [btree_cursor $::b1 2 1]
+  do_test btree4-$N.1 {
+    for {set i 1} {$i<=$N} {incr i} {
+      btree_insert $::c1 [format k-%05d $i] $::data-$i
+    }
+    btree_first $::c1
+    btree_key $::c1
+  } {k-00001}
+  do_test btree4-$N.2 {
+    btree_data $::c1
+  } $::data-1
+  for {set i 2} {$i<=$N} {incr i} {
+    do_test btree-$N.3.$i.1 {
+      btree_next $::c1
+    } 0
+    do_test btree-$N.3.$i.2 {
+      btree_key $::c1
+    } [format k-%05d $i]
+    do_test btree-$N.3.$i.3 {
+      btree_data $::c1
+    } $::data-$i
+  }
+  do_test btree4-$N.4 {
+    btree_next $::c1
+  } 1
+  do_test btree4-$N.5 {
+    btree_last $::c1
+  } 0
+  do_test btree4-$N.6 {
+    btree_key $::c1
+  } [format k-%05d $N]
+  do_test btree4-$N.7 {
+    btree_data $::c1
+  } $::data-$N
+  for {set i [expr {$N-1}]} {$i>=1} {incr i -1} {
+    do_test btree4-$N.8.$i.1 {
+      btree_prev $::c1
+    } 0
+    do_test btree4-$N.8.$i.2 {
+      btree_key $::c1
+    } [format k-%05d $i]
+    do_test btree4-$N.8.$i.3 {
+      btree_data $::c1
+    } $::data-$i
+  }
+  do_test btree4-$N.9 {
+    btree_prev $::c1
+  } 1
+  btree_close_cursor $::c1
+}
+
+btree_rollback $::b1    
+btree_pager_ref_dump $::b1
+btree_close $::b1
+
+} ;# end if( not mem: and has pager_open command );
+
+finish_test