Searched defs:router (Results 1 - 13 of 13) sorted by relevance

/inkscape/src/libavoid/
H A Dviscluster.cpp27 #include "libavoid/router.h"
34 ClusterRef::ClusterRef(Router *router, unsigned int id, Polygon& ply) argument
35 : _router(router)
36 , _poly(ply, router)
39 _id = router->assignId(id);
88 Router *ClusterRef::router(void) function in class:Avoid::ClusterRef
H A Dshape.cpp29 #include "libavoid/router.h"
37 ShapeRef::ShapeRef(Router *router, Polygon& ply, const unsigned int id) argument
38 : _router(router)
45 _id = router->assignId(id);
202 Router *ShapeRef::router(void) const function in class:Avoid::ShapeRef
H A Dgeomtypes.cpp32 #include "libavoid/router.h"
101 ReferencingPolygon::ReferencingPolygon(const Polygon& poly, const Router *router) argument
106 COLA_ASSERT(router != NULL);
110 for (ShapeRefList::const_iterator sh = router->shapeRefs.begin();
111 sh != router->shapeRefs.end(); ++sh)
H A Dvertices.cpp33 #include "libavoid/router.h"
151 VertInf::VertInf(Router *router, const VertID& vid, const Point& vpoint, argument
153 : _router(router),
250 Router *router = src->_router; local
251 COLA_ASSERT(router == dst->_router);
253 ContainsMap& contains = router->contains;
265 VertInf *endVert = router->vertices.end();
266 for (VertInf *k = router->vertices.shapesBegin(); k != endVert;
H A Dgraph.cpp34 #include "libavoid/router.h"
551 Router *router = i->_router; local
568 if (!(edge->_added) && !(router->InvisibilityGrph))
H A Dmakepath.cpp37 #include "libavoid/router.h"
169 Router *router = inf2->_router; local
172 const double angle_penalty = router->routingPenalty(anglePenalty);
173 const double segmt_penalty = router->routingPenalty(segmentPenalty);
211 if (!router->_inCrossingPenaltyReroutingStage)
218 router->routingPenalty(clusterCrossingPenalty);
220 if (router->ClusteredRouting && !router->clusterRefs.empty() &&
229 for (ClusterRefList::const_iterator cl = router->clusterRefs.begin();
230 cl != router
416 Router *router = lineRef->router(); local
750 Router *router = lineRef->router(); local
[all...]
H A Dvisibility.cpp45 #include "libavoid/router.h"
57 Router *router = shape->router(); local
59 if ( !(router->InvisibilityGrph) )
68 VertInf *pointsBegin = router->vertices.connsBegin();
88 VertInf *pointsEnd = router->vertices.end();
104 Router *router = shape->router(); local
106 if ( !(router->InvisibilityGrph) )
125 Router *router local
385 Router *router = point.vInf->_router; local
476 Router *router = vert->_router; local
[all...]
H A Dconnector.cpp36 #include "libavoid/router.h"
171 ConnRef::ConnRef(Router *router, const unsigned int id) argument
172 : _router(router),
173 _type(router->validConnType()),
189 _id = router->assignId(id);
196 ConnRef::ConnRef(Router *router, const ConnEnd& src, const ConnEnd& dst, argument
198 : _router(router),
199 _type(router->validConnType()),
214 _id = router->assignId(id);
587 Router *ConnRef::router(voi function in class:Avoid::ConnRef
[all...]
H A Dorthogonal.cpp33 #include "libavoid/router.h"
707 VertInf *commitPositionX(Router *router, double posX)
721 found = new VertInf(router, dummyOrthogID, Point(posX, pos));
727 void commitBegin(Router *router, VertInf *vert = NULL)
738 VertInf(router, dummyOrthogID, Point(begin, pos)));
743 void commitFinish(Router *router, VertInf *vert = NULL)
754 VertInf(router, dummyOrthogID, Point(finish, pos)));
760 VertSet::iterator addSegmentsUpTo(Router */*router*/, double finishPos)
787 void addEdgeHorizontal(Router *router) argument
789 commitBegin(router);
619 COLA_ASSERT(begin < finish); if (bvi) { vertInfs.insert(bvi); } if (fvi) { vertInfs.insert(fvi); } } LineSegment(const double& bf, const double& p, VertInf *bfvi = NULL) : begin(bf), finish(bf), pos(p), shapeSide(false) { if (bfvi) { vertInfs.insert(bfvi); } } bool operator<(const LineSegment& rhs) const { if (begin != rhs.begin) { return begin < rhs.begin; } if (pos != rhs.pos) { return pos < rhs.pos; } if (finish != rhs.finish) { return finish < rhs.finish; } COLA_ASSERT(shapeSide == rhs.shapeSide); return false; } bool overlaps(const LineSegment& rhs) const { if ((begin == rhs.begin) && (pos == rhs.pos) && (finish == rhs.finish)) { return true; } if (pos == rhs.pos) { if (((begin >= rhs.begin) && (begin <= rhs.finish)) || ((rhs.begin >= begin) && (rhs.begin <= finish)) ) { return true; } } return false; } void mergeVertInfs(const LineSegment& segment) { begin = std::min(begin, segment.begin); finish = std::max(finish, segment.finish); vertInfs.insert(segment.vertInfs.begin(), segment.vertInfs.end()); } VertInf *beginVertInf(void) const { if (vertInfs.empty()) { return NULL; } return *vertInfs.begin(); } VertInf *finishVertInf(void) const { if (vertInfs.empty()) { return NULL; } return *vertInfs.rbegin(); } VertInf *commitPositionX(Router *router, double posX) { VertInf *found = NULL; for (VertSet::iterator v = vertInfs.begin(); v != vertInfs.end(); ++v) { if ((*v)->point.x == posX) { found = *v; break; } } if (!found) { found = new VertInf(router, dummyOrthogID, Point(posX, pos)); vertInfs.insert(found); } return found; } void commitBegin(Router *router, VertInf *vert = NULL) { if (vert) { vertInfs.insert(vert); } if (vertInfs.empty() || ((*vertInfs.begin())->point.x != begin)) { vertInfs.insert(new VertInf(router, dummyOrthogID, Point(begin, pos))); } } void commitFinish(Router *router, VertInf *vert = NULL) { if (vert) { vertInfs.insert(vert); } if (vertInfs.empty() || ((*vertInfs.rbegin())->point.x != finish)) { vertInfs.insert(new VertInf(router, dummyOrthogID, Point(finish, pos))); } } VertSet::iterator addSegmentsUpTo(Router * , double finishPos) { VertSet::iterator firstIntersectionPt = vertInfs.end(); for (VertSet::iterator vert = vertInfs.begin(); vert != vertInfs.end(); ++vert) { if ((*vert)->point.x > finishPos) argument
800 addEdgeHorizontalTillIntersection(Router *router, LineSegment& vertLine) argument
831 insertBreakpointsBegin(Router *router, LineSegment& vertLine) argument
856 insertBreakpointsFinish(Router *router, LineSegment& vertLine) argument
879 generateVisibilityEdgesFromBreakpointSet(Router *router, size_t dim) argument
1069 intersectSegments(Router *router, SegmentList& segments, LineSegment& vertLine) argument
1157 processEventVert(Router *router, NodeSet& scanline, SegmentListWrapper& segments, Event *e, unsigned int pass) argument
1442 generateStaticOrthogonalVisGraph(Router *router) argument
1705 buildOrthogonalChannelInfo(Router *router, const size_t dim, ShiftSegmentList& segmentList) argument
1890 simplifyOrthogonalRoutes(Router *router) argument
1905 buildOrthogonalNudgingOrderInfo(Router *router, PtOrderMap& pointOrders) argument
2126 nudgeOrthogonalRoutes(Router *router, size_t dimension, PtOrderMap& pointOrders, ShiftSegmentList& segmentList) argument
2323 improveOrthogonalRoutes(Router *router) argument
[all...]
/inkscape/src/
H A Ddocument.h123 // Instance of the connector router
124 Avoid::Router *router; member in class:SPDocument
H A Dsp-conn-end-pair.cpp26 #include "libavoid/router.h"
67 // If the document is being destroyed then the router instance
69 const bool routerInstanceExists = (_path->document->router != NULL);
112 Avoid::Router *router = _path->document->router; local
114 _connRef = new Avoid::ConnRef(router, itemID);
384 _connRef->router()->processTransaction();
H A Dconn-avoid-ref.cpp28 #include "libavoid/router.h"
64 // If the document is being destroyed then the router instance
66 const bool routerInstanceExists = (item->document->router != NULL);
110 Router *router = item->document->router; local
125 shapeRef = new Avoid::ShapeRef(router, poly, itemID);
127 router->addShape(shapeRef);
148 item->document->router->attachedShapes(shapes, shapeId, type);
172 item->document->router->attachedConns(conns, shapeId, type);
362 Router *router local
[all...]
/inkscape/src/ui/tools/
H A Dconnector-tool.cpp102 #include "libavoid/router.h"
805 Avoid::Router *router = desktop->getDocument()->router; local
806 this->newConnRef = new Avoid::ConnRef(router);
817 this->newConnRef->router()->processTransaction();

Completed in 103 milliseconds