Lines Matching refs:begin
231 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
232 NodeList::iterator sp_start = (*i)->begin(), sp_end = (*i)->end();
248 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
249 for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
252 for (NodeList::iterator k = (*i)->begin(); k != (*i)->end(); ++k) {
268 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
269 for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
323 for (SubpathList::iterator subp = _subpaths.begin(); subp != _subpaths.end(); ++subp) {
327 for (NodeList::iterator first = (*subp)->begin(); first != (*subp)->end(); ++first) {
342 for (std::vector<double>::iterator it = rs.begin(); it != rs.end(); ++it) {
367 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
368 for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
410 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
413 for (NodeList::iterator j = sp->begin(); j != sp->end(); ++j) {
425 NodeList::iterator sel_beg = sp->begin(), sel_end;
485 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
488 for (NodeList::iterator j = sp->begin(); j != sp->end(); ++j) {
503 NodeList::iterator sel_beg = sp->begin(), sel_end;
543 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
545 NodeList::iterator cur = sp->begin(), end = sp->end();
559 if (cur != sp->begin())
560 sp->splice(sp->begin(), *sp, cur, sp->end());
566 new_sp->splice(new_sp->end(), *sp, sp->begin(), cur);
579 cur = sp->begin(); // this will be increased to ++sp->begin()
593 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end();) {
599 for (NodeList::iterator j = sp->begin(); j != sp->end(); ++j) {
614 NodeList::iterator sel_beg = sp->begin(), sel_end;
716 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end();) {
720 for (NodeList::iterator j = sp->begin(); j != sp->end(); ++j) {
732 NodeList::iterator sel_beg = sp->begin();
757 if (sel_end.prev() != sp->begin())
758 sp->splice(sp->begin(), *sp, sel_end.prev(), sp->end());
765 if (sel_beg == sp->begin()) {
766 sp->erase(sp->begin(), sel_end.prev());
771 new_sp->splice(new_sp->end(), *sp, sp->begin(), sel_beg.next());
774 sp->erase(sp->begin(), sel_end.prev());
790 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
792 for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
808 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
809 for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
919 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
920 for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
928 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
929 for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
964 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
965 for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
975 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
976 for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
1079 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
1080 for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
1109 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
1110 for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
1118 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
1119 for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
1134 for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
1135 for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
1153 for (Geom::PathVector::iterator i = pathv.begin(); i != pathv.end(); ) {
1168 for (Geom::PathVector::iterator pit = pathv.begin(); pit != pathv.end(); ++pit) {
1178 for (Geom::Path::iterator cit = pit->begin(); cit != pit->end(); ++cit) {
1184 current_node = subpath->begin().get_pointer();
1221 for (Geom::PathVector::const_iterator i = pathv.begin(); i != pathv.end(); ++i) {
1231 std::string::iterator tsi = nodetype_string.begin();
1232 for (std::list<SubpathPtr>::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
1233 for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
1239 (*i)->begin()->setType(Node::parse_nodetype(*tsi++), false);
1344 for (std::list<SubpathPtr>::iterator spi = _subpaths.begin(); spi != _subpaths.end(); ) {
1350 NodeList::iterator prev = subpath->begin();
1352 for (NodeList::iterator i = ++subpath->begin(); i != subpath->end(); ++i) {
1359 if (!prev->front()->isDegenerate() || !subpath->begin()->back()->isDegenerate()) {
1360 build_segment(builder, prev.ptr(), subpath->begin().ptr());
1419 for (std::list<SubpathPtr>::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
1420 for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
1424 if ((*i)->closed()) tstr << (*i)->begin()->type();
1447 for (Geom::PathVector::iterator i = pv.begin(); i != pv.end(); ++i) {
1449 for (Geom::Path::iterator j = path.begin(); j != path.end_default(); ++j) {
1462 pv.insert(pv.end(), arrows.begin(), arrows.end());
1644 for (std::list<SubpathPtr>::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
1645 for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
1680 std::list<SubpathPtr>::iterator spi = _subpaths.begin();