Cross Reference: /inkscape/src/libavoid/connector.cpp

Lines Matching defs:poly
72         const Polygon& poly = _shapeRef->polygon();
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,
1155         for (std::vector<Avoid::Point>::iterator j = poly.ps.begin(); 
1156                 j != poly.ps.end(); )
1158             if (polyIsConn && (j == poly.ps.begin()))
1168             Point& p0 = (j == poly.ps.begin()) ? poly.ps.back() : *(j - 1);
1175                 //db_printf("add to poly %g %g\n", c0.x, c0.y);
1178                 j = poly.ps.insert(j, c0);
1179                 if (j != poly.ps.begin())
1188                 //db_printf("add to poly %g %g\n", c1.x, c1.y);
1191                 j = poly.ps.insert(j, c1);
1192                 if (j != poly.ps.begin())
1200             if (polyIsConn && ((j - 1) == poly.ps.begin()) && 
1244 // Works out if the segment conn[cIndex-1]--conn[cIndex] really crosses poly.
1246 // poly can be either a connector (polyIsConn = true) or a cluster
1249 CrossingsInfoPair countRealCrossings(Avoid::Polygon& poly, 
1267         splitBranchingSegments(poly, polyIsConn, conn, tolerance);
1279     size_t poly_size = poly.size();
1291         Avoid::Point& b1 = poly.ps[(j - 1 + poly_size) % poly_size];
1292         Avoid::Point& b2 = poly.ps[j];
1342                 Avoid::Point& b0 = poly.ps[(j - 2 + poly_size) % poly_size];
1389                 Avoid::Point& b0 = poly.ps[(j - 2 + poly_size) % poly_size];
1419                     // If poly is a cluster boundary, then it is a closed 
1420                     // poly-line and so it wraps arounds.
1425                     p_path.push_back(&poly.ps[index_p]);
1427                             (conn.ps[index_c] != poly.ps[index_p]))
1452                         if ( ((xPos == poly.ps[0].x) || 
1453                                 (xPos == poly.ps[poly_size - 1].x)) &&
1466                         if ( ((yPos == poly.ps[0].y) || 
1467                                 (yPos == poly.ps[poly_size - 1].y)) &&
1702                 Avoid::Point& b0 = poly.ps[(j - 2 + poly_size) % poly_size];