Lines Matching defs:pRtree
390 static void nodeZero(Rtree *pRtree, RtreeNode *p){ in nodeZero()
410 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){ in nodeHashLookup()
419 static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){ in nodeHashInsert()
430 static void nodeHashDelete(Rtree *pRtree, RtreeNode *pNode){ in nodeHashDelete()
446 static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){ in nodeNew()
465 Rtree *pRtree, /* R-tree structure */ in nodeAcquire()
553 Rtree *pRtree, in nodeOverwriteCell()
570 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){ in nodeDeleteCell()
587 Rtree *pRtree, in nodeInsertCell()
611 nodeWrite(Rtree *pRtree, RtreeNode *pNode){ in nodeWrite()
637 nodeRelease(Rtree *pRtree, RtreeNode *pNode){ in nodeRelease()
665 Rtree *pRtree, in nodeGetRowid()
677 Rtree *pRtree, in nodeGetCoord()
691 Rtree *pRtree, in nodeGetCell()
740 static void rtreeReference(Rtree *pRtree){ in rtreeReference()
748 static void rtreeRelease(Rtree *pRtree){ in rtreeRelease()
776 Rtree *pRtree = (Rtree *)pVtab; in rtreeDestroy() local
840 Rtree *pRtree = (Rtree *)(cur->pVtab); in rtreeClose() local
865 Rtree *pRtree, /* R-Tree object */ in testRtreeGeom()
892 static int testRtreeCell(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof){ in testRtreeCell()
946 static int testRtreeEntry(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof){ in testRtreeEntry()
992 Rtree *pRtree, in descendToCell()
1052 Rtree *pRtree, in nodeRowidIndex()
1072 static int nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex){ in nodeParentIndex()
1085 Rtree *pRtree = (Rtree *)(pVtabCursor->pVtab); in rtreeNext() local
1130 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; in rtreeRowid() local
1143 Rtree *pRtree = (Rtree *)cur->pVtab; in rtreeColumn() local
1170 static int findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf){ in findLeafNode()
1238 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; in rtreeFilter() local
1420 static float cellArea(Rtree *pRtree, RtreeCell *p){ in cellArea()
1433 static float cellMargin(Rtree *pRtree, RtreeCell *p){ in cellMargin()
1445 static void cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){ in cellUnion()
1464 static int cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){ in cellContains()
1482 static float cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell){ in cellGrowth()
1493 Rtree *pRtree, in cellOverlap()
1534 Rtree *pRtree, in cellOverlapEnlargement()
1556 Rtree *pRtree, /* Rtree table */ in ChooseLeaf()
1649 Rtree *pRtree, /* Rtree table */ in AdjustTree()
1677 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){ in rowidWrite()
1687 static int parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar){ in parentWrite()
1702 Rtree *pRtree, in LinearPickNext()
1720 Rtree *pRtree, in LinearPickSeeds()
1782 Rtree *pRtree, in QuadraticPickNext()
1814 Rtree *pRtree, in QuadraticPickSeeds()
1930 Rtree *pRtree, in SortByDimension()
1990 Rtree *pRtree, in splitNodeStartree()
2092 Rtree *pRtree, in splitNodeGuttman()
2144 Rtree *pRtree, in updateMapping()
2163 Rtree *pRtree, in SplitNode()
2308 static int fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf){ in fixLeafParent()
2340 static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){ in removeNode()
2389 static int fixBoundingBox(Rtree *pRtree, RtreeNode *pNode){ in fixBoundingBox()
2416 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){ in deleteCell()
2448 Rtree *pRtree, in Reinsert()
2551 Rtree *pRtree, in rtreeInsertCell()
2589 static int reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode){ in reinsertNodeContent()
2618 static int newRowid(Rtree *pRtree, i64 *piRowid){ in newRowid()
2637 Rtree *pRtree = (Rtree *)pVtab; in rtreeUpdate() local
2797 Rtree *pRtree = (Rtree *)pVtab; in rtreeRename() local
2838 Rtree *pRtree, in rtreeSqlInit()
2948 Rtree *pRtree, /* Rtree handle */ in getNodeSize()
2993 Rtree *pRtree; in rtreeInit() local