Lines Matching refs:Rtree
124379 typedef struct Rtree Rtree;
124391 /* Size of hash table Rtree.aHash. This hash table is not expected to
124400 struct Rtree {
124484 ** to the Rtree structure associated with the RtreeCoord.
124647 static void nodeZero(Rtree *pRtree, RtreeNode *p){
124654 ** in the Rtree.aHash table.
124667 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){
124676 static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){
124687 static void nodeHashDelete(Rtree *pRtree, RtreeNode *pNode){
124703 static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){
124722 Rtree *pRtree, /* R-tree structure */
124810 Rtree *pRtree,
124827 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){
124844 Rtree *pRtree,
124868 nodeWrite(Rtree *pRtree, RtreeNode *pNode){
124894 nodeRelease(Rtree *pRtree, RtreeNode *pNode){
124922 Rtree *pRtree,
124934 Rtree *pRtree,
124948 Rtree *pRtree,
124969 ** Rtree virtual table module xCreate method.
124982 ** Rtree virtual table module xConnect method.
124997 static void rtreeReference(Rtree *pRtree){
125005 static void rtreeRelease(Rtree *pRtree){
125022 ** Rtree virtual table module xDisconnect method.
125025 rtreeRelease((Rtree *)pVtab);
125030 ** Rtree virtual table module xDestroy method.
125033 Rtree *pRtree = (Rtree *)pVtab;
125057 ** Rtree virtual table module xOpen method.
125094 ** Rtree virtual table module xClose method.
125097 Rtree *pRtree = (Rtree *)(cur->pVtab);
125107 ** Rtree virtual table module xEof method.
125122 Rtree *pRtree, /* R-Tree object */
125149 static int testRtreeCell(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof){
125203 static int testRtreeEntry(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof){
125249 Rtree *pRtree,
125309 Rtree *pRtree,
125329 static int nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex){
125339 ** Rtree virtual table module xNext method.
125342 Rtree *pRtree = (Rtree *)(pVtabCursor->pVtab);
125384 ** Rtree virtual table module xRowid method.
125387 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab;
125397 ** Rtree virtual table module xColumn method.
125400 Rtree *pRtree = (Rtree *)cur->pVtab;
125427 static int findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf){
125488 ** Rtree virtual table module xFilter method.
125495 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab;
125578 ** Rtree virtual table module xBestIndex method. There are three
125677 static float cellArea(Rtree *pRtree, RtreeCell *p){
125690 static float cellMargin(Rtree *pRtree, RtreeCell *p){
125702 static void cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){
125721 static int cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){
125739 static float cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell){
125750 Rtree *pRtree,
125791 Rtree *pRtree,
125813 Rtree *pRtree, /* Rtree table */
125906 Rtree *pRtree, /* Rtree table */
125934 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){
125944 static int parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar){
125951 static int rtreeInsertCell(Rtree *, RtreeNode *, RtreeCell *, int);
125959 Rtree *pRtree,
125977 Rtree *pRtree,
126039 Rtree *pRtree,
126071 Rtree *pRtree,
126187 Rtree *pRtree,
126247 Rtree *pRtree,
126349 Rtree *pRtree,
126401 Rtree *pRtree,
126406 int (*xSetMapping)(Rtree *, sqlite3_int64, sqlite3_int64);
126420 Rtree *pRtree,
126565 static int fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf){
126595 static int deleteCell(Rtree *, RtreeNode *, int, int);
126597 static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){
126635 ** the Rtree.pDeleted list. Its contents will be re-inserted later on.
126646 static int fixBoundingBox(Rtree *pRtree, RtreeNode *pNode){
126673 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){
126705 Rtree *pRtree,
126808 Rtree *pRtree,
126846 static int reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode){
126875 static int newRowid(Rtree *pRtree, i64 *piRowid){
126894 Rtree *pRtree = (Rtree *)pVtab;
126911 /* Obtain a reference to the root node to initialise Rtree.iDepth */
127054 Rtree *pRtree = (Rtree *)pVtab;
127095 Rtree *pRtree,
127205 Rtree *pRtree, /* Rtree handle */
127250 Rtree *pRtree;
127271 pRtree = (Rtree *)sqlite3_malloc(sizeof(Rtree)+nDb+nName+2);
127275 memset(pRtree, 0, sizeof(Rtree)+nDb+nName+2);
127347 Rtree tree;
127352 memset(&tree, 0, sizeof(Rtree));