Searched defs:route (Results 1 - 4 of 4) sorted by relevance

/inkscape/src/libcola/
H A Dstraightener.h36 Route* route; member in struct:straightener::Edge
40 Edge(unsigned id, unsigned start, unsigned end, Route* route) argument
41 : id(id), openInd(0), startNode(start), endNode(end), route(route)
43 route->boundingBox(xmin,ymin,xmax,ymax);
46 delete route;
49 delete route;
50 route=r;
51 route->boundingBox(xmin,ymin,xmax,ymax);
68 for(unsigned i=1;i<route
[all...]
/inkscape/src/libavoid/
H A Dconnector.cpp460 const PolyLine& ConnRef::route(void) const function in class:Avoid::ConnRef
472 void ConnRef::set_route(const PolyLine& route) argument
474 if (&_display_route == &route)
476 db_printf("Error:\tTrying to update libavoid route with itself.\n");
479 _display_route.ps = route.ps;
489 // No displayRoute is set. Simplify the current route to get it.
723 const PolyLine& currRoute = route();
906 db_printf("Output route:\n");
1261 // routing where connectors could otherwise route cheaply through
H A Dorthogonal.cpp1270 // visibility graph point here too (since paths won't route
1937 Avoid::Polygon& route = conn->displayRoute(); local
1939 splitBranchingSegments(route2, true, route);
1966 Avoid::Polygon& route = conn->displayRoute(); local
1970 for (size_t i = 1; i < route.size(); ++i)
1972 const bool finalSegment = ((i + 1) == route.size());
1973 crossings += countRealCrossings(route2, true, route, i,
H A Drouter.cpp473 // Feedback. Without this the blocked edges still route
1063 // may have a better route, only invalid connectors.
1747 PolyLine route = connRef->route(); local
1748 if (!route.empty())
1751 route.ps[0].x, route.ps[0].y);
1752 for (size_t i = 1; i < route.size(); ++i)
1754 fprintf(fp, "L %g,%g ", route.ps[i].x, route
1780 PolyLine route = connRef->displayRoute().curvedPolyline(8); local
1825 PolyLine route = connRef->displayRoute(); local
[all...]

Completed in 32 milliseconds