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

Lines Matching defs:segments
58         // For shiftable segments.
73         // For fixed segments.
152         // This counts segments that are colliear and share an endpoint as
291     // Mark all connector segments above in the scanline as being able
306     // Mark all connector segments below in the scanline as being able
798     // There may be multiple segments added to the graph if the beginning
810         // Generate segments and set end iterator to the first point
1066 // Given a router instance and a set of possible horizontal segments, and a
1069 static void intersectSegments(Router *router, SegmentList& segments,
1074     for (SegmentList::iterator it = segments.begin(); it != segments.end(); )
1090             it = segments.erase(it);
1119                 it = segments.erase(it);
1146     // Split breakPoints set into visibility segments.
1154 // the segments list.
1158         SegmentListWrapper& segments, Event *e, unsigned int pass)
1200             // segments are at the top or bottom of the shape.  Decide here.
1205                 // Insert possible visibility segments.
1214                     segments.insert(LineSegment(minLimit, minShape, lineY,
1217                 segments.insert(LineSegment(minShape, maxShape, lineY,
1221                     segments.insert(LineSegment(maxShape, maxLimit, lineY,
1229                     segments.insert(LineSegment(minLimit, minLimitMax, lineY,
1234                     segments.insert(LineSegment(maxLimitMin, maxLimit, lineY,
1253                 line1 = segments.insert(LineSegment(minLimit, cp.x, e->pos,
1258                 line2 = segments.insert(LineSegment(cp.x, maxLimit, e->pos,
1264                 segments.insert(LineSegment(cp.x, e->pos, centreVert));
1320 // the segments list.
1324         SegmentListWrapper& segments, Event *e, unsigned int pass)
1366             // segments are at the left or right of the shape.  Decide here.
1372                 segments.insert(vertSeg);
1380                     segments.insert(vertSeg);
1386                     segments.insert(vertSeg);
1403                 segments.insert(LineSegment(minLimit, cp.y, e->pos));
1407                 segments.insert(LineSegment(cp.y, maxLimit, e->pos));
1477     SegmentListWrapper segments;
1493                     processEventVert(router, scanline, segments,
1511         processEventVert(router, scanline, segments, events[i], pass);
1519     segments.list().sort();
1567             // Process the merged line segments.
1572                 intersectSegments(router, segments.list(), *curr);
1600     for (SegmentList::iterator it = segments.list().begin();
1601             it != segments.list().end(); )
1610         it = segments.list().erase(it);
1631                               ShiftSegmentList& /*segments*/, Event *e, size_t dim,
1725         // Determine all line segments that we are interested in shifting.
1745                     // shifted.  We call them fixed segments.  Note: this
1769                     // to the span of the adjoining segments to this one.
1784                     // isCBend: Both adjoining segments are in the same
1804         // There are no segments, so we can just return now.
1808     // Do a sweep and shift these segments.
2044             // differs for the two segments.
2064                 // these segments is not important since we do not constrain
2087 // up any constraints between such segments when doing the nudging.
2135         // Then, find the segments that overlap this one.
2156                 // Consider segments from the beginning, since we mave have
2157                 // since passed segments that overlap with the new set.
2178         // Process these segments.
2212                 // Fixed segments shouldn't get moved.
2230             // Constrain position in relation to previously seen segments,
2243                     // constrain the two segments to be separated.
2245                     // segments are fixed in place.