Home
last modified time | relevance | path

Searched refs:Tree (Results 1 – 12 of 12) sorted by relevance

/sqlite-3.40.0/ext/rtree/
H A Drtreedoc.test55 # EVIDENCE-OF: R-19353-19546 A 2-dimensional R*Tree has 5 columns.
59 # EVIDENCE-OF: R-13615-19528 A 3-dimensional R*Tree has 7 columns.
65 # EVIDENCE-OF: R-53479-41922 A 4-dimensional R*Tree has 9 columns.
290 # application chooses for the R*Tree index and <column-names> is a
310 # two-dimensional R*Tree index for use in spatial queries: CREATE
447 # commands work on an R*Tree index just like on regular tables.
570 # even if the R*Tree contains many entries.
637 # R*Tree using 32-bit floating point values.
731 # possible to modify the R-Tree in the middle of a query of the R-Tree.
1320 # name of the R*Tree.
[all …]
H A Drtreedoc2.test83 # MATCH operator is any column in the R*Tree virtual table, then the
113 # R*Tree.
116 # 1-dimensional R*Tree, 4 for a 2-dimensional R*Tree, 6 for a
117 # 3-dimensional R*Tree, and so forth.
H A Drtreedoc3.test100 # EVIDENCE-OF: R-54708-13595 An R*Tree query is initialized by making
226 # an actual R*Tree entry and not a subtree) then that entry is returned
/sqlite-3.40.0/test/
H A DcorruptB.test15 # on loops in the B-Tree structure. A loop is formed in a B-Tree structure
19 # Also test that an SQLITE_CORRUPT error is returned if a B-Tree page
55 # Set the right-child of a B-Tree rootpage to refer to the root-page itself.
67 # Set the left-child of a cell in a B-Tree rootpage to refer to the
81 # Now grow the table B-Tree so that it is more than 2 levels high.
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 Ddelete.test322 # where an index B-Tree is being scanned, the rowid column being read
324 # the index B-Tree. At one point this (obscure) scenario was causing
H A Dautoindex2.test225 # implementing the ORDER BY clause using a B-Tree.
H A Dmalloc.test631 # The database set up by -sqlprep script contains a single table B-Tree
634 # table B-Tree. By using a new connection, the outcome of a malloc()
635 # failure while seeking to the right-hand side of the B-Tree to insert
H A Dshared.test959 # Internally, locks are acquired on shared B-Tree structures in the order
999 # Test that nothing horrible happens if a connection to a shared B-Tree
/sqlite-3.40.0/ext/lsm1/
H A DlsmInt.h98 typedef struct Tree Tree; typedef
626 int lsmTreeNew(lsm_env *, int (*)(void *, int, void *, int), Tree **ppTree);
627 void lsmTreeRelease(lsm_env *, Tree *);
H A Dlsm_tree.c415 void assert_tree_looks_ok(int rc, Tree *pTree){ in assert_tree_looks_ok()
/sqlite-3.40.0/
H A DREADME.md144 Full-text search engine is in **ext/fts3**. The R-Tree engine is in
271 * **btree.c** - This file contains the implementation of the B-Tree