Searched defs:poly (Results 1 - 8 of 8) sorted by relevance
/inkscape/src/libavoid/ |
H A D | viscluster.cpp | 70 void ClusterRef::setNewPoly(Polygon& poly) argument 72 _poly = ReferencingPolygon(poly, _router);
|
H A D | shape.cpp | 105 void ShapeRef::setNewPoly(const Polygon& poly) argument 108 COLA_ASSERT(_poly.size() == poly.size()); 117 curr->Reset(poly.ps[pt_i]); 124 _poly = poly;
|
H A D | geomtypes.cpp | 101 ReferencingPolygon::ReferencingPolygon(const Polygon& poly, const Router *router) argument 103 _id(poly._id), 104 ps(poly.size()) 107 for (size_t i = 0; i < poly.size(); ++i) 113 if ((*sh)->id() == poly.ps[i].id) 115 const Polygon& poly = (*sh)->polygon(); local 116 polyPtr = &poly; 121 ps[i] = std::make_pair(polyPtr, poly.ps[i].vn); 160 const Polygon& poly = *(ps[index].first); 162 COLA_ASSERT(poly_index < poly [all...] |
H A D | geometry.cpp | 272 double totalLength(const Polygon& poly) argument 275 for (size_t i = 1; i < poly.size(); ++i) 277 l += dist(poly.ps[i-1], poly.ps[i]); 302 bool inPoly(const Polygon& poly, const Point& q, bool countBorder) argument 304 size_t n = poly.size(); 305 const std::vector<Point>& P = poly.ps; 340 Polygon poly = argpoly; local 341 std::vector<Point>& P = poly.ps; 342 size_t n = poly [all...] |
H A D | connector.cpp | 72 const Polygon& poly = _shapeRef->polygon(); local 78 for (size_t i = 0; i < poly.size(); ++i) 80 x_min = std::min(x_min, poly.ps[i].x); 81 x_max = std::max(x_max, poly.ps[i].x); 82 y_min = std::min(y_min, poly.ps[i].y); 83 y_max = std::max(y_max, poly.ps[i].y); 1142 void splitBranchingSegments(Avoid::Polygon& poly, bool polyIsConn, argument 1155 for (std::vector<Avoid::Point>::iterator j = poly.ps.begin(); 1156 j != poly.ps.end(); ) 1158 if (polyIsConn && (j == poly 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 D | router.cpp | 579 ReferencingPolygon& poly = cluster->polygon(); local 581 adjustClustersWithAdd(poly, pid); 847 void Router::newBlockingShape(const Polygon& poly, int pid) argument 869 inPoly(poly, e1, countBorder) : false; 871 inPoly(poly, e2, countBorder) : false; 880 for (size_t pt_i = 0; pt_i < poly.size(); ++pt_i) 882 size_t pt_n = (pt_i == (poly.size() - 1)) ? 0 : pt_i + 1; 883 const Point& pi = poly.ps[pt_i]; 884 const Point& pn = poly.ps[pt_n]; 1000 void Router::adjustClustersWithAdd(const PolygonInterface& poly, argument 1024 adjustContainsWithAdd(const Polygon& poly, const int p_shape) argument [all...] |
/inkscape/src/2geom/numeric/ |
H A D | fitting-model.h | 190 void instance(Poly & poly, ConstVectorView const& raw_data) const argument 192 poly.clear(); 193 poly.resize(size()); 196 poly[i] = raw_data[i];
|
/inkscape/src/ |
H A D | conn-avoid-ref.cpp | 114 Avoid::Polygon poly = avoid_item_poly(item); local 115 if (poly.size() > 0) { 125 shapeRef = new Avoid::ShapeRef(router, poly, itemID); 294 Avoid::Polygon poly; local 315 poly.ps.push_back(avoid_pt); 330 return poly; 363 Avoid::Polygon poly = avoid_item_poly(moved_item); local 364 if (!poly.empty()) { 365 router->moveShape(shapeRef, poly);
|
Completed in 42 milliseconds