Home
last modified time | relevance | path

Searched refs:cell (Results 1 – 25 of 29) sorted by relevance

12

/sqlite-3.40.0/ext/rtree/
H A Drtree_util.tcl129 foreach cell $node {
130 set shouldbe [rtree_node_check $db $zTab [lindex $cell 0] $d]
131 if {$cell ne $shouldbe} {
132 puts "Node $iNode: Cell is: {$cell}, should be {$shouldbe}"
144 foreach cell $node {
145 set rowid [lindex $cell 0]
156 foreach cell $node {
157 set f2 [lindex $cell $ii]
181 foreach cell $node {
182 set i [lindex $cell 0]
H A Dviewrtree.tcl107 foreach cell [lrange $data 1 end] {
108 foreach {rowid x1 x2 y1 y2} $cell break
142 foreach cell $data {
143 foreach {rowid x1 x2 y1 y2} $cell break
160 set cell [lindex $data $iCell]
165 if {$cell eq ""} {
167 foreach cell $data {
168 foreach {rowid x1 x2 y1 y2} $cell break
177 foreach {rowid x1 x2 y1 y2} $cell break
H A Drtree.c2158 RtreeCell cell; in cellGrowth() local
2216 RtreeCell cell; in ChooseLeaf() local
2238 iBest = cell.iRowid; in ChooseLeaf()
2267 RtreeCell cell; in AdjustTree() local
2821 RtreeCell cell; in fixBoundingBox() local
3017 RtreeCell cell; in reinsertNodeContent() local
3238 memset(&cell, 0, sizeof(cell)); in rtreeUpdate()
3270 if( cell.aCoord[ii].f>cell.aCoord[ii+1].f ){ in rtreeUpdate()
3281 if( cell.aCoord[ii].i>cell.aCoord[ii+1].i ){ in rtreeUpdate()
3332 *pRowid = cell.iRowid; in rtreeUpdate()
[all …]
H A Drtreedoc3.test30 # as a list. Each cell is itself a list of the following form:
47 set cell [string range $aData $iOff [expr $iOff+$nBytePerCell-1]]
48 binary scan $cell WIIII rowid x1 x2 y1 y2
138 proc pq_new_entry {rScore iLevel cell} {
145 lappend kv aCoord [lrange $cell 1 end]
149 lappend kv iRowid [lindex $cell 0]
151 lappend kv iChild [lindex $cell 0]
171 array set P $parent ;# "Parent" - as in parent of expected cell
H A Drtreedoc.test1284 foreach cell $L {
1285 set r [lindex $cell 0]
1379 foreach cell $L {
1494 set cell [
1497 set cell [list [lindex $cell 0] \
1498 [lindex $cell 2] [lindex $cell 1] \
1499 [lindex $cell 3] [lindex $cell 4] \
1509 # the cell is bounded by the parent cell on the parent node.
1513 set cell [
1516 lset cell 3 450
[all …]
H A Dgeopoly.c1588 RtreeCell cell; /* New cell to insert if nData>1 */ in geopolyUpdate() local
1608 cell.iRowid = newRowid; in geopolyUpdate()
1616 geopolyBBox(0, aData[2], cell.aCoord, &rc); in geopolyUpdate()
1630 sqlite3_bind_int64(pRtree->pReadRowid, 1, cell.iRowid); in geopolyUpdate()
1635 rc = rtreeDeleteRowid(pRtree, cell.iRowid); in geopolyUpdate()
1659 rc = rtreeNewRowid(pRtree, &cell.iRowid); in geopolyUpdate()
1661 *pRowid = cell.iRowid; in geopolyUpdate()
1663 rc = ChooseLeaf(pRtree, &cell, 0, &pLeaf); in geopolyUpdate()
1668 rc = rtreeInsertCell(pRtree, pLeaf, &cell, 0); in geopolyUpdate()
1681 sqlite3_bind_int64(pUp, 1, cell.iRowid); in geopolyUpdate()
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 Drtree1.test374 # Test that the function to determine if a leaf cell is part of the
/sqlite-3.40.0/test/
H A Dcorrupt7.test15 # on corrupt cell offsets in a btree page.
65 # Deliberately corrupt some of the cell offsets in the btree page
73 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}}
96 # # Locate the 3rd cell in the index.
102 # # stored in the index cell. At one point this was causing sqlite to
H A DcorruptD.test43 # (implicitly defines the offset to the final element in the cell offset
46 # 4. The page header field containing the offset to the start of the cell
49 # 5. The contents of the cell offset array.
51 # 6. The first few bytes of each cell determine the size of the cell
53 # the cell.
140 # in the cell offset array.
H A Dcorrupt.test197 # The following DELETE statement attempts to delete a cell stored on the
198 # root page of index i1. After this cell is deleted it must be replaced
199 # by a cell retrieved from the child page (a leaf) of the deleted cell.
201 # child page of the deleted cell is from a table (intkey) b-tree, not an
240 # 16 bytes (including the 2 byte cell-offset array entry). So the page
246 # Free the cell stored right at the end of the page (at offset pgsz-14).
276 # cell-offset array points to the data for the SQL blob associated with
279 # page cell.
282 # real cell. But, by the time it is overwritten, btreeInitPage() has already
289 # no longer looks like a real cell). At one point the code assumed that
H A Ddbdata.test37 SELECT pgno, cell, field, quote(value) FROM sqlite_dbdata WHERE pgno=2;
49 SELECT pgno, cell, field, quote(value) FROM sqlite_dbdata;
68 SELECT value FROM sqlite_dbdata WHERE pgno=2 AND cell=2 AND field=1;
77 SELECT quote(value) FROM sqlite_dbdata WHERE pgno=2 AND cell=0 AND field=1;
H A DcorruptC.test106 # replacing a re-existing row, try to overwrite the cell directly rather than
107 # deallocate and reallocate the cell" on 2016-12-09, this test case no longer
131 # test that a corrupt free cell size is handled (seed 13329)
143 # test that a corrupt free cell size is handled (seed 169571)
155 # test that a corrupt free cell size is handled (seed 169571)
168 On tree page 4 cell 19: Extends off end of page} {database disk image is malformed}}}
171 # Corruption detected in cell 710 on page 4
175 # test that a corrupt free cell size is handled (seed 169595)
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 Din2.test51 # The string of zero-length is stored in a b-tree cell with 3 bytes
52 # of payload. Moving this cell from a leaf node to a internal node
H A DcorruptB.test67 # Set the left-child of a cell in a B-Tree rootpage to refer to the
114 # Set the left-child pointer of a cell of the right-child of the root page to
142 # Set the left-child pointer of a cell of the right-child of the root page to
H A DcorruptI.test193 # Set the payload size of a cell to just less than 2^32 bytes (not
194 # possible in an uncorrupted db). Then try to delete the cell. At one
H A DcorruptJ.test43 # for the very first cell points back to the root. Then try to DROP the
H A Dfts3ac.test412 cell 713-539-4760');
593 713-668-3712...... my cell # is 281-381-7332
714 or cell phone at any time. My cell phone number is 713/705-4829.
1001 …[email protected]', '[email protected]', 'Re:', 'I saw you called on the cell this a.m. Sorry I …
H A Dfts2c.test412 cell 713-539-4760');
593 713-668-3712...... my cell # is 281-381-7332
714 or cell phone at any time. My cell phone number is 713/705-4829.
1001 …[email protected]', '[email protected]', 'Re:', 'I saw you called on the cell this a.m. Sorry I …
H A Dfts1c.test412 cell 713-539-4760');
593 713-668-3712...... my cell # is 281-381-7332
714 or cell phone at any time. My cell phone number is 713/705-4829.
1001 …[email protected]', '[email protected]', 'Re:', 'I saw you called on the cell this a.m. Sorry I …
H A Ddbfuzz001.test186 # The DELETE query below deletes the very last cell from page 8.
H A Dwithout_rowid1.test369 # unintialized memory cell. Which was not actually causing a
H A Dcorrupt2.test251 On tree page 2 cell 0: 2nd reference to page 10
/sqlite-3.40.0/tool/
H A Dspaceanal.tcl786 table or index. Metadata includes the btree page header, the cell pointer

12