Home
last modified time | relevance | path

Searched refs:CILIter (Results 1 – 4 of 4) sorted by relevance

/dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/3rdparty/2geom/src/2geom/
H A Dintersection-graph.cpp306 typedef IntersectionList::const_iterator CILIter; in intersectionPoints() typedef
308 for (CILIter j = _components[0][i].xlist.begin(); j != _components[0][i].xlist.end(); ++j) { in intersectionPoints()
322 for (CILIter k = li->xlist.begin(); k != li->xlist.end(); ++k) { in fragments()
323 CILIter n = cyclic_next(k, li->xlist); in fragments()
472 typedef PathIntersectionGraph::IntersectionList::const_iterator CILIter; in operator <<() typedef
478 for (CILIter j = xl.begin(); j != xl.end(); ++j) { in operator <<()
/dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/3rdparty/2geom/include/2geom/
H A Dintersection-graph.h119 typedef IntersectionList::const_iterator CILIter; typedef
/dports/math/lib2geom/lib2geom-1.1/include/2geom/
H A Dintersection-graph.h119 typedef IntersectionList::const_iterator CILIter; typedef
/dports/math/lib2geom/lib2geom-1.1/src/2geom/
H A Dintersection-graph.cpp321 for (CILIter k = li->xlist.begin(); k != li->xlist.end(); ++k) { in fragments()
322 CILIter n = cyclic_next(k, li->xlist); in fragments()