Lines Matching refs:page

28 # Create a 6 page database containing a single table - t1. Table t1 
29 # consists of page 2 (the root page) and pages 5 and 6 (leaf pages). 
40     CREATE TABLE t1(x);         /* root page = 2 */
41     CREATE TABLE t2(x);         /* root page = 3 */
42     CREATE TABLE t3(x);         /* root page = 4 */
61 # list. Page 3 is the free list trunk and page 4 is a leaf.
67 # Change the free-list entry to page 6 and reopen the db file.
74 # is page 6, which is also the right-most leaf page in table t1.
90 # When the t1 cursor reaches page 6 (which is both the right-most leaf of
93 # for each row visited, another row is inserted into page 6 - it being the
94 # root page of t4. Eventually, page 6 becomes full and the height of the
96 # this unexpectedly reduces the number of keys on page 6 in the middle of
120 # Change the free-list entry to page 5 and reopen the db file.
127 # is page 5, which is also the right-most leaf page in table t1.