Cross Reference: /inkscape/src/ui/tool/node.h

Lines Matching defs:iterator
19 #include <iterator>
293  * neighbors. It is a bidirectional iterator.
296  * increment and decrement them. When using ++/--, the end iterator will eventually
297  * be returned. Whent using advance()/retreat(), the end iterator will only be returned
302  * When @a i is a node iterator, then:
303  * - <code>++i</code> moves the iterator to the next node in sequence order;
304  * - <code>--i</code> moves the iterator to the previous node in sequence order;
307  * - <code>i.advance()</code> moves the iterator to the next node with wrap-around;
308  * - <code>i.retreat()</code> moves the iterator to the previous node with wrap-around.
310  * next() and prev() do not change their iterator. They can return the end iterator
314  * without having access to the iterator's container.
373     typedef NodeIterator<value_type> iterator;
389     iterator begin() { return iterator(ln_next); }
390     iterator end() { return iterator(this); }
408     iterator before(double t, double *fracpart = NULL);
409     iterator before(Geom::PathTime const &pvp);
420     iterator insert(iterator pos, Node *x);
423     void insert(iterator pos, InputIterator first, InputIterator last) {
426     void splice(iterator pos, NodeList &list);
427     void splice(iterator pos, NodeList &list, iterator i);
428     void splice(iterator pos, NodeList &list, iterator first, iterator last);
436     iterator erase(iterator pos);
437     iterator erase(iterator first, iterator last) {
438         NodeList::iterator ret = first;
451     static iterator get_iterator(Node *n) { return iterator(n); }
454     static NodeList &get(iterator const &i);
514 // definitions for node iterator