Searched refs:SweepTreeList (Results 1 - 7 of 7) sorted by relevance
| /inkscape/src/livarot/ |
| H A D | sweep-tree-list.h | 2 * @brief SweepTreeList definition
15 class SweepTreeList { class
22 SweepTreeList(int s);
23 virtual ~SweepTreeList();
|
| H A D | sweep-tree-list.cpp | 6 SweepTreeList::SweepTreeList(int s) : function in class:SweepTreeList
18 SweepTreeList::~SweepTreeList()
25 SweepTree *SweepTreeList::add(Shape *iSrc, int iBord, int iWeight, int iStartPoint, Shape */*iDst*/)
|
| H A D | sweep-tree.h | 10 class SweepTreeList;
56 int Remove(SweepTreeList &list, SweepEventQueue &queue, bool rebalance = true);
57 int Insert(SweepTreeList &list, SweepEventQueue &queue, Shape *iDst,
59 int InsertAt(SweepTreeList &list, SweepEventQueue &queue, Shape *iDst,
63 void SwapWithRight(SweepTreeList &list, SweepEventQueue &queue);
|
| H A D | sweep-tree.cpp | 251 SweepTree::Remove(SweepTreeList &list, SweepEventQueue &queue,
274 SweepTree::Insert(SweepTreeList &list, SweepEventQueue &queue,
315 SweepTree::InsertAt(SweepTreeList &list, SweepEventQueue &queue,
493 SweepTree::SwapWithRight(SweepTreeList &/*list*/, SweepEventQueue &/*queue*/)
|
| H A D | Shape.h | 25 class SweepTreeList;
337 SweepTreeList *sTree;
|
| H A D | ShapeSweep.cpp | 183 sTree = new SweepTreeList(a->numberOfEdges());
860 sTree = new SweepTreeList(a->numberOfEdges() + b->numberOfEdges());
|
| H A D | ShapeRaster.cpp | 38 sTree = new SweepTreeList(numberOfEdges());
|
Completed in 24 milliseconds