Lines Matching refs:point
43 ConnEnd::ConnEnd(const Point& point)
44 : _point(point),
51 ConnEnd::ConnEnd(const Point& point, const ConnDirFlags visDirs)
52 : _point(point),
68 const Point ConnEnd::point(void) const
86 Point point;
91 point.vn = kUnassignedVertexNumber;
94 point.x = x_min + _insideOffset;
95 point.vn = 6;
99 point.x = x_max - _insideOffset;
100 point.vn = 4;
104 point.x = x_min + (_xPosition * (x_max - x_min));
109 point.y = y_max - _insideOffset;
110 point.vn = 5;
114 point.y = y_min + _insideOffset;
115 point.vn = 7;
119 point.y = y_min + (_yPosition * (y_max - y_min));
120 point.vn = kUnassignedVertexNumber;
123 return point;
218 _srcVert = new VertInf(_router, VertID(_id, isShape, 1), src.point());
220 _dstVert = new VertInf(_router, VertID(_id, isShape, 2), dst.point());
276 const Point& point = connEnd.point();
278 // type,point.id,point.vn,point.x,point.y);
296 _srcVert->Reset(VertID(_id, isShape, type), point);
300 _srcVert = new VertInf(_router, VertID(_id, isShape, type), point);
311 _dstVert->Reset(VertID(_id, isShape, type), point);
315 _dstVert = new VertInf(_router, VertID(_id, isShape, type), point);
385 Point& point = vInf->point;
388 if (euclideanDist(point, *pointSuggestion) > 0.5)
394 common_updateEndPoint(type, point);
396 // Give this visibility just to the point it is over.
612 // Validates a bend point on a path to check it does not form a zigzag corner.
632 Point& a = aInf->point;
633 Point& b = bInf->point;
634 Point& c = cInf->point;
635 Point& d = dInf->point;
636 Point& e = eInf->point;
658 // The three consecutive point on the path are in a line.
660 // skips this bend point.
712 //COLA_ASSERT(_srcVert->point != _dstVert->point);
731 db_printf(": %g, %g\n", _srcVert->point.x, _srcVert->point.y);
733 db_printf(": %g, %g\n", tar->point.x, tar->point.y);
742 if (_srcVert->point == currRoute.ps[0])
869 path[j] = i->point;
882 if (i->pathNext && (i->pathNext->point == i->point))
892 path[0] = _srcVert->point;
893 // Use topbit to differentiate between start and end point of connector.
1000 if ((*curr)->point == inner.first)
1004 if ((*curr)->point == outer.first)
1055 // Returns a vertex number representing a point on the line between
1062 // The split point is a shape corner, so doesn't need its
1068 // The point next to this has the correct nudging direction,
1074 // The point next to this has the correct nudging direction,
1150 // Skip the first point.
1160 // Skip the first point.
1171 // Check the first point of the first segment.
1185 // And the second point of every segment.
1199 // Check the first point of the first segment.
1209 // And the second point of every segment.
1337 // since the common point is the first point of the
1415 // each end if the connector does not end at a common point.
1451 // or end point of both connectors.
1465 // or end point of both connectors.
1695 // The connectors cross or touch at this point.
1696 //db_printf("Cross or touch at point... \n");
1709 // The connectors cross at this point.