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

Lines Matching refs:segment
603 // A set of points to break the line segment,
683     void mergeVertInfs(const LineSegment& segment)
685         begin = std::min(begin, segment.begin);
686         finish = std::max(finish, segment.finish);
687         vertInfs.insert(segment.vertInfs.begin(), segment.vertInfs.end());
785     // Add visibility edge(s) for this segment.  There may be multiple if
795     // Add visibility edge(s) for this segment up until an intersection.
796     // Then, move the segment beginning to the intersection point, so we
797     // later only consider the remainder of the segment.
799     // endpoint of the segment is shared by multiple connector endpoints.
823         // Adjust segment to remove processed portion.
1021         LineSegment *insert(LineSegment segment)
1027                 if (curr->overlaps(segment))
1031                         // This is not the first segment that overlaps,
1033                         // segment.
1040                         // This is the first overlapping segment, so just
1041                         // merge the new segment with this one.
1042                         curr->mergeVertInfs(segment);
1051                 _list.push_back(segment);
1067 // possible vertical visibility segment, compute and add edges to the
1083             // Add horizontal visibility segment.
1089             // We've now swept past this horizontal segment, so delete.
1095             // We've yet to reach this segment in the sweep, so ignore.
1110                 // Add horizontal visibility segment.
1118                 // And we've now finished with the segment, so delete.
1130                 // Add horizontal visibility segment.
1263                 // Add a point segment for the centre point.
1623 // line segment in a connector's channel of visibility.
1711         // do this adjustment if the routes have no segment penalty.
1726         // We don't consider the first or last segment of a path.
1731                 // It's a segment in the dimension we are processing,
1744                     // The first and last segment of a connector can't be
1752                 // The segment probably has space to be shifted.
1786                     // the maxLim or minLim to the segment position.
1913     // Do segment splitting.
2031             // fixed segment, that is, order so the fixed segment doesn't
2097         ShiftSegment segment = origList.front();
2105             bool lessThan = comparison(segment, *curr, &comparable);
2116         resultList.insert(curr, segment);
2133         // Take a reference segment
2171             // immovable segment.
2196             // Create a solver variable for the position of this segment.
2241                     // If there is a previous segment to the left that
2258                 // If this segment sees a channel boundary to its left,
2268                 // If this segment sees a channel boundary to its right,