Lines Matching refs:conn
968 int PtOrder::positionFor(const ConnRef *conn, const size_t dim) const
974 if ((*curr)->conn == conn)
1143 Avoid::Polygon& conn, const double tolerance)
1145 for (std::vector<Avoid::Point>::iterator i = conn.ps.begin();
1146 i != conn.ps.end(); ++i)
1148 if (i == conn.ps.begin())
1172 if (((i - 1) == conn.ps.begin()) &&
1203 //db_printf("add to conn %g %g\n", p0.x, p0.y);
1206 i = conn.ps.insert(i, p0);
1212 //db_printf("add to conn %g %g\n", p1.x, p1.y);
1215 i = conn.ps.insert(i, p1);
1244 // Works out if the segment conn[cIndex-1]--conn[cIndex] really crosses poly.
1250 bool polyIsConn, Avoid::Polygon& conn, size_t cIndex,
1258 size_t conn_pn = conn.size();
1267 splitBranchingSegments(poly, polyIsConn, conn, tolerance);
1269 cIndex += (conn.size() - conn_pn);
1272 COLA_ASSERT(cIndex < conn.size());
1284 Avoid::Point& a1 = conn.ps[cIndex - 1];
1285 Avoid::Point& a2 = conn.ps[cIndex];
1390 Avoid::Point& a0 = conn.ps[cIndex - 2];
1424 c_path.push_back(&conn.ps[index_c]);
1427 (conn.ps[index_c] != poly.ps[index_p]))
1454 ((xPos == conn.ps[0].x) ||
1455 (xPos == conn.ps[cIndex].x)) )
1468 ((yPos == conn.ps[0].y) ||
1469 (yPos == conn.ps[cIndex].y)) )
1703 Avoid::Point& a0 = conn.ps[cIndex - 2];