Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 25 of 79) sorted by relevance

1234

/sqlite-3.40.0/test/
H A Dmalloctraceviewer.tcl45 set id [lindex [$::O(tree) selection] 0]
107 set left [$O(tree) item $iLeft -text]
108 set right [$O(tree) item $iRight -text]
112 set left [lindex [$O(tree) item $iLeft -values] 0]
135 set T $O(tree)
151 $::O(tree) delete [$::O(tree) children {}]
185 set O(tree) [scrollable ::ttk::treeview .pan.tree]
199 $O(tree) configure -columns {calls bytes}
203 $O(tree) column #0 -width 150
204 $O(tree) column calls -width 100
[all …]
H A Dfts3expr2.test35 # 2. The expression tree is converted to the text of an equivalent
39 # tree.
44 # expression tree by varying the following boolean properties:
98 # Given an expression tree, generate a corresponding expression.
100 proc tree_to_expr {tree all_brackets implicit_and} {
106 set op [lindex $tree 0]
109 set phrase [lindex $tree 1]
124 set lhs [lindex $tree 1]
125 set rhs [lindex $tree 2]
147 proc do_exprparse_test {name expr tree} {
[all …]
H A Dwith1.test322 CREATE TABLE tree(i, p);
323 INSERT INTO tree VALUES(1, NULL);
324 INSERT INTO tree VALUES(2, 1);
325 INSERT INTO tree VALUES(3, 1);
326 INSERT INTO tree VALUES(4, 2);
327 INSERT INTO tree VALUES(5, 4);
343 SELECT i FROM tree, t WHERE p = id
370 SELECT i FROM tree, t WHERE p = id
492 DROP TABLE IF EXISTS tree;
497 db eval { DELETE FROM tree }
[all …]
H A Din2.test11 # This file tests a special case in the b-tree code that can be
41 # Each iteration of this loop builds a slightly different b-tree to
43 # of the b-tree are (in sorted order):
51 # The string of zero-length is stored in a b-tree cell with 3 bytes
53 # during b-tree balancing was causing an assertion failure.
H A Dfunc6.test15 # within b-tree pages. Such placement is at the implementations discretion,
133 # Test offsets within table b-tree t1.
143 # Test offsets within index b-tree t1a.
148 # Test offsets within table b-tree t1 with a temp b-tree ORDER BY.
H A Dfts3expr3.test118 set tree [balanced_exprtree_structure $nEntry]
121 regsub -all xxx $tree $node tree
122 return $tree
H A Dcorrupt3.test85 On tree page 2 cell 0: 2nd reference to page 3}}}
103 On tree page 2 cell 0: invalid page number 4
118 On tree page 2 cell 0: overflow list length is 0 but should be 1
H A Dshell8.test31 # First delete the current tree, if one exists.
34 # Recreate the root of the new tree.
37 # Add each file to the new tree.
H A Dindexfault.test171 # file (and written into the temporary b-tree), sqlite3_release_memory()
173 # b-tree to be flushed to disk. So that before its contents can be
270 # file (and written into the temporary b-tree), sqlite3_release_memory() is
271 # called to free as much memory as possible. This causes the temp b-tree to be
H A Dfts2n.test150 # Test with a segment which will have multiple levels in the tree.
192 # tree is 2 levels high, the code will find the leaf-node extent
194 # separate interior branches down the tree. Both should be tested.
H A Dcorrupt7.test73 On tree page 2 cell 15: Offset 65457 out of range 945..1020}}
80 On tree page 2 cell 15: Offset 1201 out of range 945..1020}}
H A Dfts3prefix.test73 SELECT sum( 1 << (16*(level%1024)) ) AS total, (level/1024) AS tree
74 FROM ${tbl}_segdir GROUP BY tree
76 lappend list [list $total $tree]
80 error "inconsistent tree structures: $list"
H A Dbtree01.test12 # This file contains test cases for b-tree logic.
19 # The refactoring on the b-tree balance() routine in check-in
/sqlite-3.40.0/ext/rtree/
H A DREADME3 table type that allows users to create, query and manipulate r-tree[1]
5 and query r-tree structures using ordinary SQL statements.
23 All r-tree virtual tables have an odd number of columns between
24 3 and 11. Unlike regular SQLite tables, r-tree tables are strongly
30 less than or equal to the second. R-tree tables may be
40 Constructing a virtual r-tree table <name> creates the following three
48 corrupt the r-tree structure. To delete an r-tree from a database,
53 Dropping the main r-tree table automatically drops the automatically
59 stored in an r-tree table. Please note the following:
91 is the key advantage to using r-tree tables instead of creating
[all …]
H A Drtree8.test23 # an r-tree table while there exist open cursors on it.
73 # table, causing a collision in the hash-table used to store r-tree
98 # corruption cases. In this case things are not corrupted at the b-tree
100 # r-tree table are inconsistent.
139 # Test that trying to use the MATCH operator with the r-tree module does
159 # Delete half of a lopsided tree.
H A Drtree1.test12 # The focus of this file is testing the r-tree extension.
24 # rtree-1.*: Creating/destroying r-tree tables.
28 # rtree-3.*: Linear scans of r-tree data.
32 # rtree-7.*: Test renaming an r-tree table.
33 # rtree-8.*: Test constrained scans of r-tree data.
38 # r-tree table, it is converted to an integer before being
43 # writes to an r-tree table.
135 # r-tree tables.
154 # Test that it is possible to create an r-tree table with ridiculous
168 # Force the r-tree constructor to fail.
[all …]
H A Drtreedoc3.test12 # The focus of this file is testing the r-tree extension.
29 # i32 r-tree table. It decodes and returns a list of cells from the node
57 # the root node of an r-tree, this value is the height of the tree.
64 # Return a blob containing node iNode of r-tree "rt".
H A Drtreedoc2.test12 # The focus of this file is testing the r-tree extension.
112 # coordinates in each r-tree entry, and is always the same for any given
147 # SQLITE_OK, then the r-tree query will abort with an error.
302 # depth-first search of the r-tree.
H A DrtreeA.test11 # This file contains tests for the r-tree module. Specifically, it tests
12 # that corrupt or inconsistent databases do not cause crashes in the r-tree
154 # Set the "depth" of the tree stored on the root node incorrectly. Test
H A Drtree9.test11 # This file contains tests for the r-tree module. Specifically, it tests
12 # that custom r-tree queries (geometry callbacks) work.
H A Drtreedoc.test12 # The focus of this file is testing the r-tree extension.
78 # Attempt to create r-tree tables with 6 and 7 dimensions.
93 # Attempt to create r-tree tables with no columns, a single column, or
123 # non-integer value into this column, the r-tree module silently
235 # such a column, the r-tree module silently converts it to the required
702 # algorithm that any write might radically restructure the tree, and in
965 # (2018-06-04), r-tree tables can have auxiliary columns that store
1145 # Function invoked only once because r-tree filtering happened first.
1154 # Function invoked 14 times because no r-tree filtering. Inefficient.
1346 # The following creates a 6 node r-tree structure.
[all …]
H A DrtreeE.test11 # This file contains tests for the r-tree module. Specifically, it tests
12 # that new-style custom r-tree queries (geometry callbacks) work.
/sqlite-3.40.0/tool/
H A Dmkshellc.tcl17 ** SQLite source tree at tool/mkshellc.tcl. That script combines source
23 ** lines that specify other files in the canonical source tree that are
/sqlite-3.40.0/
H A DREADME.md21 in the root of the tree. Always use the official name, not the
50 If you do want to use Fossil to check out the source tree,
77 script found at the root of the source tree. Then run "make".
81 tar xzf sqlite.tar.gz ;# Unpack the source tree into "sqlite"
93 "Makefile.linux-gcc" in the top directory of the source tree that you
309 The `manifest` file at the root directory of the source tree
312 The name of the version of the entire source tree is just the
318 you can be confident that your source tree is authentic and unadulterated.
/sqlite-3.40.0/ext/wasm/
H A DREADME.md47 from the top of the sqlite3 build tree:
90 * Remote: Install the SQLite source tree. CD to ext/wasm

1234