Searched refs:SweepTree (Results 1 - 10 of 10) sorted by relevance

/inkscape/src/livarot/
H A Dsweep-event.h8 class SweepTree;
15 SweepTree *sweep[2]; ///< Sweep element associated with the left and right edge of the intersection.
26 void MakeNew (SweepTree * iLeft, SweepTree * iRight, Geom::Point const &iPt,
H A Dsweep-tree-list.h9 class SweepTree;
19 SweepTree *trees; ///< The array of nodes.
20 SweepTree *racine; ///< Root of the tree.
25 SweepTree *add(Shape *iSrc, int iBord, int iWeight, int iStartPoint, Shape *iDst);
H A Dsweep-event-queue.h9 class SweepTree;
27 bool peek(SweepTree * &iLeft, SweepTree * &iRight, Geom::Point &oPt, double &itl, double &itr);
29 bool extract(SweepTree * &iLeft, SweepTree * &iRight, Geom::Point &oPt, double &itl, double &itr);
31 SweepEvent *add(SweepTree *iLeft, SweepTree *iRight, Geom::Point &iPt, double itl, double itr);
H A Dsweep-tree.h17 class SweepTree:public AVLTree class in inherits:AVLTree
29 SweepTree();
30 virtual ~SweepTree();
45 int Find(Geom::Point const &iPt, SweepTree *newOne, SweepTree *&insertL,
46 SweepTree *&insertR, bool sweepSens = true);
47 int Find(Geom::Point const &iPt, SweepTree *&insertL, SweepTree *&insertR);
60 SweepTree *insNode, int fromPt, bool rebalance = true, bool sweepSens = true);
67 void Relocate(SweepTree *t
[all...]
H A Dsweep-tree-list.cpp9 trees((SweepTree *) g_malloc(s * sizeof(SweepTree))),
13 * SweepTree::~SweepTree is called.
25 SweepTree *SweepTreeList::add(Shape *iSrc, int iBord, int iWeight, int iStartPoint, Shape */*iDst*/)
H A Dsweep-tree.cpp16 SweepTree::SweepTree() function in class:SweepTree
26 SweepTree::~SweepTree()
32 SweepTree::MakeNew(Shape *iSrc, int iBord, int iWeight, int iStartPoint)
39 SweepTree::ConvertTo(Shape *iSrc, int iBord, int iWeight, int iStartPoint)
61 void SweepTree::MakeDelete()
79 SweepTree::Find(Geom::Point const &px, SweepTree *newOne, SweepTree *
[all...]
H A Dsweep-event.cpp22 SweepEvent *SweepEventQueue::add(SweepTree *iLeft, SweepTree *iRight, Geom::Point &px, double itl, double itr)
31 SweepTree *t[2] = { iLeft, iRight };
65 bool SweepEventQueue::peek(SweepTree * &iLeft, SweepTree * &iRight, Geom::Point &px, double &itl, double &itr)
82 bool SweepEventQueue::extract(SweepTree * &iLeft, SweepTree * &iRight, Geom::Point &px, double &itl, double &itr)
238 void SweepEvent::MakeNew(SweepTree *iLeft, SweepTree *iRight, Geom::Point const &px, double itl, double itr)
H A DShapeRaster.cpp179 SweepTree *node = swrData[cb].misc;
192 SweepTree* insertionNode = NULL;
197 SweepTree* node = swrData[rmNo].misc;
208 SweepTree* node = sTree->add(this, dnNo, 1, nPt, this);
220 SweepTree* node = sTree->add(this, upNo, 1, nPt, this);
239 SweepTree *node = sTree->add(this, cb, 1, nPt, this);
264 SweepTree* curS = static_cast<SweepTree*>(sTree->racine->Leftmost());
268 curS = static_cast<SweepTree*>(curS->elem[RIGHT]);
631 SweepTree* nod
[all...]
H A DShapeSweep.cpp214 SweepTree *intersL = NULL;
215 SweepTree *intersR = NULL;
383 if (upNo >= 0 && (SweepTree *) ptSh->swsData[upNo].misc == NULL)
402 SweepTree *node =
403 (SweepTree *) ptSh->swsData[cb].misc;
421 SweepTree * >(node->elem[LEFT]))->bord;
424 SweepTree * >(node->elem[LEFT]))->src;
430 SweepTree * >(node->elem[RIGHT]))->bord;
433 SweepTree * >(node->elem[RIGHT]))->src;
439 SweepTree *onLef
[all...]
H A DShape.h24 class SweepTree;
384 friend class SweepTree;
401 void *misc; // pointer to the SweepTree* in the sweepline
425 SweepTree *misc; // pointer to the associated SweepTree* in the sweepline
481 void TesteIntersection(SweepTree *t, Side s, bool onlyDiff); // test if there is an intersection
482 bool TesteIntersection(SweepTree *iL, SweepTree *iR, Geom::Point &atx, double &atL, double &atR, bool onlyDiff);

Completed in 96 milliseconds