Lines Matching full:rtree
8045 /* The double-precision datatype used by RTree depends on the
8058 ** SELECT ... FROM <rtree> WHERE <rtree col> MATCH $zGeom(... params ...)
8084 ** SELECT ... FROM <rtree> WHERE <rtree col> MATCH $zQueryFunc(... params ...)
130768 /************** Include rtree.h in the middle of main.c **********************/
130769 /************** Begin file rtree.h *******************************************/
130783 ** RTREE library. All it does is declare the sqlite3RtreeInit() interface.
130797 /************** End of rtree.h ***********************************************/
154039 /************** Begin file rtree.c *******************************************/
154121 typedef struct Rtree Rtree;
154131 /* The rtree may have between 1 and RTREE_MAX_DIMENSIONS dimensions. */
154134 /* Size of hash table Rtree.aHash. This hash table is not expected to
154151 ** An rtree virtual-table object.
154153 struct Rtree {
154192 /* Possible values for Rtree.eCoordType: */
154259 ** An rtree cursor object.
154273 RtreeNode *aNode[RTREE_CACHE_SZ]; /* Rtree node cache */
154277 /* Return the Rtree of a RtreeCursor */
154278 #define RTREE_OF_CURSOR(X) ((Rtree*)((X)->base.pVtab))
154293 ** variable pRtree points to the Rtree structure associated with the
154331 ** An rtree structure node.
154477 static void nodeZero(Rtree *pRtree, RtreeNode *p){
154484 ** in the Rtree.aHash table.
154494 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){
154503 static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){
154514 static void nodeHashDelete(Rtree *pRtree, RtreeNode *pNode){
154530 static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){
154548 Rtree *pRtree, /* R-tree structure */
154636 Rtree *pRtree, /* The overall R-Tree */
154653 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){
154669 Rtree *pRtree, /* The overall R-Tree */
154692 static int nodeWrite(Rtree *pRtree, RtreeNode *pNode){
154717 static int nodeRelease(Rtree *pRtree, RtreeNode *pNode){
154745 Rtree *pRtree, /* The overall R-Tree */
154757 Rtree *pRtree, /* The overall R-Tree */
154771 Rtree *pRtree, /* The overall R-Tree */
154796 ** Rtree virtual table module xCreate method.
154809 ** Rtree virtual table module xConnect method.
154824 static void rtreeReference(Rtree *pRtree){
154832 static void rtreeRelease(Rtree *pRtree){
154849 ** Rtree virtual table module xDisconnect method.
154852 rtreeRelease((Rtree *)pVtab);
154857 ** Rtree virtual table module xDestroy method.
154860 Rtree *pRtree = (Rtree *)pVtab;
154884 ** Rtree virtual table module xOpen method.
154921 ** Rtree virtual table module xClose method.
154924 Rtree *pRtree = (Rtree *)(cur->pVtab);
154935 ** Rtree virtual table module xEof method.
154946 ** Convert raw bits from the on-disk RTree record into a coordinate value.
154985 ** Check the RTree node or entry given by pCellData and p against the MATCH
154990 int eInt, /* True if RTree holding integer coordinates */
155032 ** Check the internal RTree node given by pCellData against constraint p.
155038 int eInt, /* True if RTree holds integer coordinates */
155071 ** Check the leaf RTree cell given by pCellData against constraint p.
155082 int eInt, /* True if RTree holds integer coordinates */
155107 Rtree *pRtree,
155128 static int nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex){
155357 Rtree *pRtree = RTREE_OF_CURSOR(pCur);
155423 ** Rtree virtual table module xNext method.
155437 ** Rtree virtual table module xRowid method.
155451 ** Rtree virtual table module xColumn method.
155454 Rtree *pRtree = (Rtree *)cur->pVtab;
155489 Rtree *pRtree, /* RTree to search */
155558 ** Rtree virtual table module xFilter method.
155565 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab;
155675 ** Rtree virtual table module xBestIndex method. There are three
155709 Rtree *pRtree = (Rtree*)tab;
155793 static RtreeDValue cellArea(Rtree *pRtree, RtreeCell *p){
155806 static RtreeDValue cellMargin(Rtree *pRtree, RtreeCell *p){
155818 static void cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){
155837 static int cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){
155855 static RtreeDValue cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell){
155865 Rtree *pRtree,
155897 Rtree *pRtree, /* Rtree table */
155898 RtreeCell *pCell, /* Cell to insert into rtree */
155957 Rtree *pRtree, /* Rtree table */
155983 ** Write mapping (iRowid->iNode) to the <rtree>_rowid table.
155985 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){
155993 ** Write mapping (iNode->iPar) to the <rtree>_parent table.
155995 static int parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar){
156002 static int rtreeInsertCell(Rtree *, RtreeNode *, RtreeCell *, int);
156089 Rtree *pRtree,
156148 Rtree *pRtree,
156246 Rtree *pRtree,
156251 int (*xSetMapping)(Rtree *, sqlite3_int64, sqlite3_int64);
156265 Rtree *pRtree,
156411 static int fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf){
156441 static int deleteCell(Rtree *, RtreeNode *, int, int);
156443 static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){
156481 ** the Rtree.pDeleted list. Its contents will be re-inserted later on.
156492 static int fixBoundingBox(Rtree *pRtree, RtreeNode *pNode){
156519 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){
156551 Rtree *pRtree,
156656 Rtree *pRtree,
156690 static int reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode){
156719 static int newRowid(Rtree *pRtree, i64 *piRowid){
156732 static int rtreeDeleteRowid(Rtree *pRtree, sqlite3_int64 iDelete){
156736 RtreeNode *pRoot; /* Root node of rtree structure */
156739 /* Obtain a reference to the root node to initialize Rtree.iDepth */
156762 /* Delete the corresponding entry in the <rtree>_rowid table. */
156844 ** The xUpdate method for rtree module virtual tables.
156852 Rtree *pRtree = (Rtree *)pVtab;
156878 ** NB: nData can only be less than nDim*2+3 if the rtree is mis-declared
156880 ** Example: CREATE VIRTUAL TABLE bad USING rtree(x,y,CHECK(y>5));
156975 ** The xRename method for rtree module virtual tables.
156978 Rtree *pRtree = (Rtree *)pVtab;
157000 static int rtreeQueryStat1(sqlite3 *db, Rtree *pRtree){
157059 Rtree *pRtree,
157156 ** determine the node-size used by the rtree table being created or connected
157160 ** If this function is being called as part of an xConnect(), then the rtree
157171 Rtree *pRtree, /* Rtree handle */
157222 Rtree *pRtree;
157229 "Wrong number of columns for an rtree table", /* 1 */
157230 "Too few columns for an rtree table", /* 2 */
157231 "Too many columns for an rtree table" /* 3 */
157245 pRtree = (Rtree *)sqlite3_malloc(sizeof(Rtree)+nDb+nName+2);
157249 memset(pRtree, 0, sizeof(Rtree)+nDb+nName+2);
157309 ** to the rtree (between 1 and 5, inclusive) and (2) a blob of data containing
157323 Rtree tree;
157328 memset(&tree, 0, sizeof(Rtree));
157388 ** virtual table module "rtree" and the debugging/analysis scalar
157405 rc = sqlite3_create_module_v2(db, "rtree", &rtreeModule, c, 0);
157553 /************** End of rtree.c ***********************************************/
