Home
last modified time | relevance | path

Searched refs:leaf (Results 1 – 25 of 33) sorted by relevance

12

/sqlite-3.40.0/test/
H A Dstat.test80 } {t1 / 2 leaf 2 10 998 5}
86 } {i1 / 3 leaf 2 10 1000 5}
92 } {sqlite_schema / 1 leaf 2 77 831 40}
199 i5 / 20 leaf 0 0 1016 0 \
200 t5 / 19 leaf 0 0 1016 0 \
253 x1 / 2 leaf 1 4 1008 4 1024 1024
259 x1 / 2 leaf 1 4 1008 4 1024 1024
266 x1 / 2 leaf 1 4 1008 4 1024 1024
273 x1 / 2 leaf 1 4 1008 4 1024 1024
286 x1 / 2 leaf 1 4 1008 4 1024 1024
[all …]
H A DcorruptF.test29 # consists of page 2 (the root page) and pages 5 and 6 (leaf pages).
61 # list. Page 3 is the free list trunk and page 4 is a leaf.
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
127 # is page 5, which is also the right-most leaf page in table t1.
H A Dtkt3918.test33 # first free-list trunk page contains only a single leaf.
34 # The leaf page is also the last page in the database. The
46 # page. This will remove the single leaf from the first page in
H A DcorruptI.test144 # * Database root table has a single leaf page.
147 # The db is then corrupted by adding the root table leaf page as a free-list
148 # leaf page (so that it is referenced twice).
151 # trunk. This means that the root table leaf page is made into the new
177 # The last page of the db is now the only leaf of the sqlite_master table.
H A Dfkey2.test291 CREATE TABLE leaf(
305 fkey2-2-test 8 1 "INSERT INTO leaf VALUES('a', 2)"
310 fkey2-2-test 13 0 "SELECT * FROM leaf" {a 2}
317 fkey2-2-test 19 0 "SELECT * FROM leaf" {a 2}
320 fkey2-2-test 21 0 "INSERT INTO leaf VALUES('b', 1)"
326 fkey2-2-test 27 0 "SELECT * FROM leaf" {a 2 b 1}
329 fkey2-2-test 29 0 "INSERT INTO leaf VALUES('c', 1)"
337 fkey2-2-test 37 0 "SELECT * FROM leaf" {a 2}
340 fkey2-2-test 39 1 "INSERT INTO leaf VALUES('d', 3)"
342 fkey2-2-test 41 1 "INSERT INTO leaf VALUES('e', 3)"
[all …]
H A Dwithout_rowid3.test291 CREATE TABLE leaf(
305 without_rowid3-2-test 8 1 "INSERT INTO leaf VALUES('a', 2)"
310 without_rowid3-2-test 13 0 "SELECT * FROM leaf" {a 2}
317 without_rowid3-2-test 19 0 "SELECT * FROM leaf" {a 2}
320 without_rowid3-2-test 21 0 "INSERT INTO leaf VALUES('b', 1)"
326 without_rowid3-2-test 27 0 "SELECT * FROM leaf" {a 2 b 1}
329 without_rowid3-2-test 29 0 "INSERT INTO leaf VALUES('c', 1)"
337 without_rowid3-2-test 37 0 "SELECT * FROM leaf" {a 2}
340 without_rowid3-2-test 39 1 "INSERT INTO leaf VALUES('d', 3)"
342 without_rowid3-2-test 41 1 "INSERT INTO leaf VALUES('e', 3)"
[all …]
H A Dio.test91 # Insert another 240 byte record. This causes two leaf pages
93 # are written to the db file - the two leaf pages, the root
101 # the root-node, which is close to empty, and two leaf pages, both of
113 # This insert should use the quick-balance trick to add a third leaf
116 # the new leaf page.
H A Dcorrupt2.test391 # Set the page-flags of one of the leaf pages of the index B-Tree to
392 # 0x0D (interpreted by SQLite as "leaf page of a table B-Tree").
409 # Mess up the page-header of one of the leaf pages of the index B-Tree.
430 # Set the page-flags of one of the leaf pages of the table B-Tree to
431 # 0x0A (interpreted by SQLite as "leaf page of an index B-Tree").
H A DcorruptH.test55 # a leaf page.
116 # used it as an index leaf. Normally, BtreeMovetoUnpacked() detects
H A Dincrvacuum2.test155 # 2. The leaf page transformed into a trunk page to replace the recycled
157 # 3. The trunk page that contained a pointer to the leaf page used
H A Din2.test52 # of payload. Moving this cell from a leaf node to a internal node
H A DcorruptA.test77 hexio_write test.db 23 21 ;# min leaf payload fraction
H A Dcorrupt4.test64 # leaf.
H A Dfts3fault.test60 # matches terms that reside on a large range of leaf nodes.
H A Dfts2n.test192 # tree is 2 levels high, the code will find the leaf-node extent
H A Dfts3corrupt.test50 # length field of a term on a leaf node indicates that the term extends past
/sqlite-3.40.0/ext/repair/test/
H A Dcheckfreelist01.test65 } {{leaf page 10092 is out of range (child 3 of trunk page 4860)}}
74 } {{leaf page 0 is out of range (child 3 of trunk page 4860)}}
83 } {{leaf page 0 is out of range (child 247 of trunk page 5)}}
92 } {{leaf count out of range (249) on trunk page 5}}
/sqlite-3.40.0/ext/fts5/test/
H A Dfts5corrupt2.test74 # Node is a leaf node, not a b-tree node.
91 # Run N-1 tests, where N is the number of bytes in the rightmost leaf page
97 # final leaf to some sizes may create a valid leaf page.
128 # Test that corruption in leaf page headers is detected by queries that use
/sqlite-3.40.0/src/
H A Dbtree.c1203 assert( pPage->leaf==0 || pPage->leaf==1 ); in btreeParseCellPtr()
1284 assert( pPage->leaf==0 || pPage->leaf==1 ); in btreeParseCellPtrIndex()
1925 if( pPage->leaf ){ in decodeFlags()
3690 if( !pPage->leaf ){ in setChildPtrmaps()
6106 if( pPage->leaf ){ in btreeNext()
6125 if( pPage->leaf ){ in sqlite3BtreeNext()
6175 if( !pPage->leaf ){ in btreePrevious()
9474 if( !pPage->leaf in sqlite3BtreeDelete()
9495 if( !pPage->leaf ){ in sqlite3BtreeDelete()
9528 if( !pPage->leaf ){ in sqlite3BtreeDelete()
[all …]
H A DbtreeInt.h280 u8 leaf; /* True if a leaf page */ member
/sqlite-3.40.0/ext/rtree/
H A Drtreedoc3.test34 # For internal (non-leaf) nodes, the rowid is replaced by the child node
168 # If it had been a leaf, the row should have been returned, instead of
221 # The extracted entry must be a leaf (otherwise, xQueryCallback would
225 # EVIDENCE-OF: R-13214-54017 If that entry is a leaf (meaning that it is
H A Drtreedoc.test1258 # For internal (non-leaf) nodes, the rowid is replaced by the child node
1525 # EVIDENCE-OF: R-02505-03621 for leaf nodes, that there is an entry in
1538 # EVIDENCE-OF: R-50927-02218 for cells on non-leaf nodes, that there is
1560 # in the %_rowid table as there are leaf cells in the r-tree structure,
1561 # and that there is a leaf cell that corresponds to each entry in the
1571 # in the %_parent table as there are non-leaf cells in the r-tree
1572 # structure, and that there is a non-leaf cell that corresponds to each
H A DrtreeE.test67 # The Qcircle geometry function gives a lower score to larger leaf-nodes.
/sqlite-3.40.0/doc/
H A Dpager-invariants.txt13 (b) The page was a freelist leaf page at the start of the transaction.
47 all queries. Note in particular the content of freelist leaf
/sqlite-3.40.0/tool/
H A Dspaceanal.tcl221 leaf_entries int, -- Number of leaf entries
228 leaf_pages int, -- Number of leaf pages used

12