Cross Reference: /inkscape/src/ui/tool/path-manipulator.cpp

Lines Matching refs:iterator
231     for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
232         NodeList::iterator sp_start = (*i)->begin(), sp_end = (*i)->end();
233         for (NodeList::iterator j = sp_start; j != sp_end; ++j) {
237                 for (NodeList::iterator ins = sp_start; ins != sp_end; ++ins)
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) {
270             NodeList::iterator k = j.next();
287 void PathManipulator::insertNode(NodeList::iterator first, double t, bool take_selection)
289     NodeList::iterator inserted = subdivideSegment(first, t);
301 add_or_replace_if_extremum(std::vector< std::pair<NodeList::iterator, double> > &vec,
302                            double & extrvalue, double testvalue, NodeList::iterator const& node, double t)
307         vec.push_back( std::pair<NodeList::iterator, double>( node, t ) );
311         vec.push_back( std::pair<NodeList::iterator, double>( node, t ) );
323     for (SubpathList::iterator subp = _subpaths.begin(); subp != _subpaths.end(); ++subp) {
325         std::vector< std::pair<NodeList::iterator, double> > extremum_vector;
327         for (NodeList::iterator first = (*subp)->begin(); first != (*subp)->end(); ++first) {
328             NodeList::iterator second = first.next();
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) {
370                 NodeList::iterator k = j.next();
404 void PathManipulator::weldNodes(NodeList::iterator preserve_pos)
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;
468                     NodeList::iterator next = sel_beg.next();
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;
528                     NodeList::iterator next = sel_beg.next();
543     for (SubpathList::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
545         NodeList::iterator cur = sp->begin(), end = sp->end();
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;
646 unsigned PathManipulator::_deleteStretch(NodeList::iterator start, NodeList::iterator end, bool keep_shape)
652     for (NodeList::iterator i = start; i != end; i = i.next()) {
669         for (NodeList::iterator cur = start.prev(); cur != end; cur = cur.next()) {
691         NodeList::iterator next = start.next();
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();
741             NodeList::iterator sel_end = sel_beg;
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) {
810             NodeList::iterator k = j.next();
890     NodeList::iterator i = NodeList::get_iterator(n);
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) {
985  * Otherwise the invalidated iterator in the dragpoint can cause crashes. */
989     _dragpoint->setIterator(NodeList::iterator());
992 /** Insert a node in the segment beginning with the supplied iterator,
994 NodeList::iterator PathManipulator::subdivideSegment(NodeList::iterator first, double t)
996     if (!first) throw std::invalid_argument("Subdivide after invalid iterator");
998     NodeList::iterator second = first.next();
1008     NodeList::iterator insert_at = first;
1011     NodeList::iterator inserted;
1070  * @return The matching node, or an empty iterator if none found
1072 NodeList::iterator PathManipulator::extremeNode(NodeList::iterator origin, bool search_selected,
1075     NodeList::iterator match;
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(); ) {
1156         // so we do not increment the iterator even though it is theoretically invalidated.
1168     for (Geom::PathVector::iterator pit = pathv.begin(); pit != pathv.end(); ++pit) {
1178         for (Geom::Path::iterator cit = pit->begin(); cit != pit->end(); ++cit) {
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) {
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) {
1419     for (std::list<SubpathPtr>::iterator i = _subpaths.begin(); i != _subpaths.end(); ++i) {
1420         for (NodeList::iterator j = (*i)->begin(); j != (*i)->end(); ++j) {
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) {
1539         NodeList::iterator iter = NodeList::get_iterator(n);
1612     NodeList::iterator iters[5];
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();
1682     NodeList::iterator first = (*spi)->before(pvp->asPathTime());