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 ...)
130786 /************** Include rtree.h in the middle of main.c **********************/
130787 /************** Begin file rtree.h *******************************************/
130801 ** RTREE library. All it does is declare the sqlite3RtreeInit() interface.
130815 /************** End of rtree.h ***********************************************/
154069 /************** Begin file rtree.c *******************************************/
154151 typedef struct Rtree Rtree;
154161 /* The rtree may have between 1 and RTREE_MAX_DIMENSIONS dimensions. */
154164 /* Size of hash table Rtree.aHash. This hash table is not expected to
154181 ** An rtree virtual-table object.
154183 struct Rtree {
154222 /* Possible values for Rtree.eCoordType: */
154289 ** An rtree cursor object.
154303 RtreeNode *aNode[RTREE_CACHE_SZ]; /* Rtree node cache */
154307 /* Return the Rtree of a RtreeCursor */
154308 #define RTREE_OF_CURSOR(X) ((Rtree*)((X)->base.pVtab))
154323 ** variable pRtree points to the Rtree structure associated with the
154361 ** An rtree structure node.
154507 static void nodeZero(Rtree *pRtree, RtreeNode *p){
154514 ** in the Rtree.aHash table.
154524 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){
154533 static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){
154544 static void nodeHashDelete(Rtree *pRtree, RtreeNode *pNode){
154560 static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){
154578 Rtree *pRtree, /* R-tree structure */
154666 Rtree *pRtree, /* The overall R-Tree */
154683 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){
154699 Rtree *pRtree, /* The overall R-Tree */
154722 static int nodeWrite(Rtree *pRtree, RtreeNode *pNode){
154747 static int nodeRelease(Rtree *pRtree, RtreeNode *pNode){
154775 Rtree *pRtree, /* The overall R-Tree */
154787 Rtree *pRtree, /* The overall R-Tree */
154801 Rtree *pRtree, /* The overall R-Tree */
154826 ** Rtree virtual table module xCreate method.
154839 ** Rtree virtual table module xConnect method.
154854 static void rtreeReference(Rtree *pRtree){
154862 static void rtreeRelease(Rtree *pRtree){
154879 ** Rtree virtual table module xDisconnect method.
154882 rtreeRelease((Rtree *)pVtab);
154887 ** Rtree virtual table module xDestroy method.
154890 Rtree *pRtree = (Rtree *)pVtab;
154914 ** Rtree virtual table module xOpen method.
154951 ** Rtree virtual table module xClose method.
154954 Rtree *pRtree = (Rtree *)(cur->pVtab);
154965 ** Rtree virtual table module xEof method.
154976 ** Convert raw bits from the on-disk RTree record into a coordinate value.
155015 ** Check the RTree node or entry given by pCellData and p against the MATCH
155020 int eInt, /* True if RTree holding integer coordinates */
155062 ** Check the internal RTree node given by pCellData against constraint p.
155068 int eInt, /* True if RTree holds integer coordinates */
155101 ** Check the leaf RTree cell given by pCellData against constraint p.
155112 int eInt, /* True if RTree holds integer coordinates */
155137 Rtree *pRtree,
155158 static int nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex){
155387 Rtree *pRtree = RTREE_OF_CURSOR(pCur);
155453 ** Rtree virtual table module xNext method.
155467 ** Rtree virtual table module xRowid method.
155481 ** Rtree virtual table module xColumn method.
155484 Rtree *pRtree = (Rtree *)cur->pVtab;
155519 Rtree *pRtree, /* RTree to search */
155588 ** Rtree virtual table module xFilter method.
155595 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab;
155705 ** Rtree virtual table module xBestIndex method. There are three
155739 Rtree *pRtree = (Rtree*)tab;
155823 static RtreeDValue cellArea(Rtree *pRtree, RtreeCell *p){
155836 static RtreeDValue cellMargin(Rtree *pRtree, RtreeCell *p){
155848 static void cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){
155867 static int cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){
155885 static RtreeDValue cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell){
155895 Rtree *pRtree,
155927 Rtree *pRtree, /* Rtree table */
155928 RtreeCell *pCell, /* Cell to insert into rtree */
155987 Rtree *pRtree, /* Rtree table */
156013 ** Write mapping (iRowid->iNode) to the <rtree>_rowid table.
156015 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){
156023 ** Write mapping (iNode->iPar) to the <rtree>_parent table.
156025 static int parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar){
156032 static int rtreeInsertCell(Rtree *, RtreeNode *, RtreeCell *, int);
156119 Rtree *pRtree,
156178 Rtree *pRtree,
156276 Rtree *pRtree,
156281 int (*xSetMapping)(Rtree *, sqlite3_int64, sqlite3_int64);
156295 Rtree *pRtree,
156441 static int fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf){
156471 static int deleteCell(Rtree *, RtreeNode *, int, int);
156473 static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){
156511 ** the Rtree.pDeleted list. Its contents will be re-inserted later on.
156522 static int fixBoundingBox(Rtree *pRtree, RtreeNode *pNode){
156549 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){
156581 Rtree *pRtree,
156686 Rtree *pRtree,
156720 static int reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode){
156749 static int newRowid(Rtree *pRtree, i64 *piRowid){
156762 static int rtreeDeleteRowid(Rtree *pRtree, sqlite3_int64 iDelete){
156766 RtreeNode *pRoot; /* Root node of rtree structure */
156769 /* Obtain a reference to the root node to initialize Rtree.iDepth */
156792 /* Delete the corresponding entry in the <rtree>_rowid table. */
156874 ** The xUpdate method for rtree module virtual tables.
156882 Rtree *pRtree = (Rtree *)pVtab;
156908 ** NB: nData can only be less than nDim*2+3 if the rtree is mis-declared
156910 ** Example: CREATE VIRTUAL TABLE bad USING rtree(x,y,CHECK(y>5));
157005 ** The xRename method for rtree module virtual tables.
157008 Rtree *pRtree = (Rtree *)pVtab;
157030 static int rtreeQueryStat1(sqlite3 *db, Rtree *pRtree){
157089 Rtree *pRtree,
157186 ** determine the node-size used by the rtree table being created or connected
157190 ** If this function is being called as part of an xConnect(), then the rtree
157201 Rtree *pRtree, /* Rtree handle */
157252 Rtree *pRtree;
157259 "Wrong number of columns for an rtree table", /* 1 */
157260 "Too few columns for an rtree table", /* 2 */
157261 "Too many columns for an rtree table" /* 3 */
157275 pRtree = (Rtree *)sqlite3_malloc(sizeof(Rtree)+nDb+nName+2);
157279 memset(pRtree, 0, sizeof(Rtree)+nDb+nName+2);
157339 ** to the rtree (between 1 and 5, inclusive) and (2) a blob of data containing
157353 Rtree tree;
157358 memset(&tree, 0, sizeof(Rtree));
157418 ** virtual table module "rtree" and the debugging/analysis scalar
157435 rc = sqlite3_create_module_v2(db, "rtree", &rtreeModule, c, 0);
157583 /************** End of rtree.c ***********************************************/
