Home
last modified time | relevance | path

Searched refs:node (Results 1 – 24 of 24) sorted by relevance

/sqlite-3.40.0/ext/rtree/
H A Drtree_util.tcl60 set node [db one $sql]
62 set nCell [llength $node]
67 lset node $ii $jj $newval
70 set node
112 set node [rtree_node $db $zTab $iNode]
129 foreach cell $node {
144 foreach cell $node {
155 set f [lindex $node 0 $ii]
156 foreach cell $node {
178 set node [rtree_node $db $zTab $iNode 1]
[all …]
H A Drtreedoc3.test28 # This command assumes that the argument is a node blob for a 2 dimensional
29 # i32 r-tree table. It decodes and returns a list of cells from the node
34 # For internal (non-leaf) nodes, the rowid is replaced by the child 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".
101 # the root node the only entry in a priority queue sorted by rScore.
165 # node (a subtree), then the next child of that node is passed to the
209 # EVIDENCE-OF: R-07194-63805 If the node has more children then it is
H A Drtreedoc.test1279 # aData must be a node blob. This command returns true if the node contains
1344 # each R*Tree node.
1346 # The following creates a 6 node r-tree structure.
1360 # in the %_parent shadow table that identifies the parent node.
1362 # In this case nodes 2-6 are the children of node 1.
1369 # to the node that contains that entry.
1505 } {{Dimension 0 of cell 3 on node 3 is corrupt}}
1509 # the cell is bounded by the parent cell on the parent node.
1522 } {{Dimension 1 of cell 3 on node 3 is corrupt relative to parent}}
1527 # to the correct node.
[all …]
H A Drtreecheck.test79 } {{Dimension 0 of cell 0 on node 1 is corrupt
80 Dimension 1 of cell 3 on node 1 is corrupt}}
H A DrtreeA.test96 # (i.e. the root node is missing), or has been removed from the database
154 # Set the "depth" of the tree stored on the root node incorrectly. Test
H A Drtree.c3865 RtreeNode node; in rtreenode() local
3873 memset(&node, 0, sizeof(RtreeNode)); in rtreenode()
3879 node.zData = (u8 *)sqlite3_value_blob(apArg[1]); in rtreenode()
3880 if( node.zData==0 ) return; in rtreenode()
3883 if( nData<NCELL(&node)*tree.nBytesPerCell ) return; in rtreenode()
3886 for(ii=0; ii<NCELL(&node); ii++){ in rtreenode()
3890 nodeGetCell(&tree, &node, ii, &cell); in rtreenode()
/sqlite-3.40.0/test/
H A Dtkt3442.test31 node INTEGER
43 SELECT node FROM listhash WHERE id='5000' LIMIT 1;
46 SELECT node FROM listhash WHERE id="5000" LIMIT 1;
53 SELECT node FROM listhash WHERE id=5000 LIMIT 1;
58 SELECT node FROM listhash WHERE id=[5000] LIMIT 1;
H A Dfkey2.test287 CREATE TABLE node(
372 fkey2-2-test 63 0 "DELETE FROM node"
450 node PRIMARY KEY,
471 DELETE FROM t1 WHERE node = 1;
472 SELECT node FROM t1;
477 DELETE FROM t2 WHERE node = 1;
478 SELECT node FROM t2;
486 DELETE FROM t1 WHERE node = 1;
487 SELECT node FROM t1;
492 DELETE FROM t2 WHERE node = 1;
[all …]
H A Dwithout_rowid3.test287 CREATE TABLE node(
378 } {1 {UNIQUE constraint failed: node.nodeid}}
450 node PRIMARY KEY,
471 DELETE FROM t1 WHERE node = 1;
472 SELECT node FROM t1;
477 DELETE FROM t2 WHERE node = 1;
478 SELECT node FROM t2;
486 DELETE FROM t1 WHERE node = 1;
487 SELECT node FROM t1;
492 DELETE FROM t2 WHERE node = 1;
[all …]
H A Dfts3corrupt.test23 # extends past the end of the node on which it resides is correctly identified
50 # length field of a term on a leaf node indicates that the term extends past
51 # the end of the node on which it resides. There are two cases:
53 # 1. The first term on the node.
54 # 2. The second or subsequent term on the node (prefix compressed term).
H A Dfts3expr3.test119 set node "{[balanced_and_tree $nEntry]}"
120 regsub -all AND $node OR node
121 regsub -all xxx $tree $node tree
H A Din2.test52 # of payload. Moving this cell from a leaf node to a internal node
H A DtriggerC.test1003 CREATE TABLE node(
1005 pid int not null default 0 references node,
1010 CREATE TRIGGER node_delete_referencing AFTER DELETE ON "node"
1012 DELETE FROM "node" WHERE pid = old."id";
1016 INSERT INTO node(id, pid, key) VALUES(9, 0, 'test');
1017 INSERT INTO node(id, pid, key) VALUES(90, 9, 'test1');
1018 INSERT INTO node(id, pid, key) VALUES(900, 90, 'test2');
1019 DELETE FROM node WHERE id=9;
1020 SELECT * FROM node;
H A Dfts3cov.test58 # When querying the full-text index, if an expected internal node block is
171 # assumes that the content of each internal node will be less than
172 # $nodesize bytes, where $nodesize is the advisory node size. If this turns
176 # full-text table with a very small node-size.
H A Dfuzz-oss1.test55 …node" (id INTEGER NOT NULL PRIMARY KEY AUTOINCREMENT,t_name TEXT NOT NULL DEFAULT '' CHECK (t_name…
114 CREATE UNIQUE INDEX uidx_node_parent_id_name ON node(t_name,rd_node_id);
115 CREATE UNIQUE INDEX uidx_node_fullname ON node(t_fullname);
127 CREATE VIEW v_node AS SELECT * from node;
128 CREATE VIEW v_node_displayname AS SELECT *, t_fullname AS t_displayname from node;
131 …ers_uuid BEFORE DELETE ON node FOR EACH ROW BEGIN DELETE FROM parameters WHERE parameters.t_uu…
132 …node BEGIN UPDATE node SET t_fullname=CASE WHEN new.rd_node_id IS NULL OR new.rd_node_id='' OR new…
133 …node BEGIN UPDATE node SET t_fullname=CASE WHEN new.rd_node_id IS NULL OR new.rd_node_id='' OR new…
177 …_id_id BEFORE INSERT ON node FOR EACH ROW BEGIN SELECT RAISE(ABORT, 'Impossible d''ajouter un ob…
179 …id_id BEFORE UPDATE ON node FOR EACH ROW BEGIN SELECT RAISE(ABORT, 'Impossible de modifier un …
[all …]
H A Dfts3corrupt3.test45 # Interior node with the prefix or suffix count of an entry set to a
H A Dfts3rnd.test69 # The procedure above is run 5 times, using advisory fts3 node sizes of 50,
72 # After the test using an advisory node-size of 50, an OOM test is run using
H A Din4.test401 CREATE TABLE node(node_id INTEGER PRIMARY KEY);
412 ('node',NULL,'10000000');
H A Dfts2n.test192 # tree is 2 levels high, the code will find the leaf-node extent
H A DcorruptN.test253 -- node are interior nodes.
H A Dio.test101 # the root-node, which is close to empty, and two leaf pages, both of
H A De_fts3.test672 # 2) A badly formatted b-tree segment node.
/sqlite-3.40.0/ext/fts5/test/
H A Dfts5corrupt2.test48 # * unless the deleted block was a b-tree node, a query for "t1 MATCH 'x*'"
74 # Node is a leaf node, not a b-tree node.
H A Dfts5fault1.test114 # at the default 1000 bytes. This means that reading a node may require