Searched refs:pointOrders (Results 1 - 3 of 3) sorted by relevance

/inkscape/src/libavoid/
H A Dconnector.cpp1252 PointSet *crossingPoints, PtOrderMap *pointOrders,
1545 if (pointOrders)
1567 bool orderSwapped = (*pointOrders)[an].addPoints(
1578 if (pointOrders)
1620 bool orderSwapped = (*pointOrders)[an].addPoints(
1632 orderSwapped = (*pointOrders)[ap].addPoints(
1719 if (pointOrders)
1732 (*pointOrders)[b1].addPoints(0,
1736 (*pointOrders)[b1].addPoints(1,
1767 //(*pointOrders)[b
1249 countRealCrossings(Avoid::Polygon& poly, bool polyIsConn, Avoid::Polygon& conn, size_t cIndex, bool checkForBranchingSegments, const bool finalSegment, PointSet *crossingPoints, PtOrderMap *pointOrders, ConnRef *polyConnRef, ConnRef *connConnRef) argument
[all...]
H A Dconnector.h399 PointSet *crossingPoints = NULL, PtOrderMap *pointOrders = NULL,
H A Dorthogonal.cpp1906 PtOrderMap& pointOrders)
1975 &pointOrders, conn2, conn).first;
1985 PtOrderMap::iterator finish = pointOrders.end();
1986 for (PtOrderMap::iterator it = pointOrders.begin(); it != finish; ++it)
2127 PtOrderMap& pointOrders, ShiftSegmentList& segmentList)
2165 CmpLineOrder lineSortComp(pointOrders, dimension);
2332 PtOrderMap pointOrders; local
2333 buildOrthogonalNudgingOrderInfo(router, pointOrders);
2341 nudgeOrthogonalRoutes(router, dimension, pointOrders, segLists);
1905 buildOrthogonalNudgingOrderInfo(Router *router, PtOrderMap& pointOrders) argument
2126 nudgeOrthogonalRoutes(Router *router, size_t dimension, PtOrderMap& pointOrders, ShiftSegmentList& segmentList) argument

Completed in 37 milliseconds