Searched defs:iterator (Results 1 - 16 of 16) sorted by relevance

/inkscape/src/libdepixelize/priv/
H A Diterator.h29 #include <iterator>
40 T *to_ptr(typename std::vector<T>::iterator it)
57 typename std::vector<T>::iterator to_iterator(T *ptr,
58 typename std::vector<T>::iterator
61 typedef typename std::vector<T>::iterator It;
72 typedef typename std::vector<T>::iterator iterator; typedef in class:Tracer::ToIter
83 iterator operator()(T *ptr) const
97 typedef typename std::vector<T>::iterator iterator; typedef in class:Tracer::ToPtr
[all...]
H A Dsplines-kopf2011.h43 typedef typename std::vector< Point<T> >::const_iterator iterator; typedef
52 iterator it = source.begin();
56 for ( iterator end = source.end() ; it != end ; ++it ) {
146 iterator paths_it = begin();
H A Dhomogeneoussplines.h42 typedef typename Points::iterator points_iter;
44 typedef typename std::vector<Points>::iterator holes_iter;
64 typedef typename std::vector<Polygon>::iterator iterator; typedef in class:Tracer::HomogeneousSplines
72 iterator begin()
82 iterator end()
109 typedef typename Points::iterator points_iter;
193 for ( iterator polygon_it = _polygons.begin(),
203 for ( iterator polygon2_it = polygon_it + 1
232 for ( typename std::vector<Polygon>::iterator i
[all...]
H A Dpixelgraph.h75 typedef std::vector<Node>::iterator iterator; typedef in class:Tracer::PixelGraph
80 typedef std::pair<iterator, iterator> Edge;
113 iterator begin()
123 iterator end()
182 iterator nodeTop(iterator n)
187 iterator nodeBottom(iterator
[all...]
H A Dsimplifiedvoronoi.h55 typedef typename std::vector<Cell>::iterator iterator; typedef in class:Tracer::SimplifiedVoronoi
68 iterator begin()
78 iterator end()
/inkscape/src/libdepixelize/
H A Dsplines.h52 typedef std::vector<Path>::iterator iterator; typedef in class:Tracer::Splines
71 iterator begin()
81 iterator end()
/inkscape/src/
H A Devent-log.h44 typedef Gtk::TreeModel::iterator iterator; typedef in class:Inkscape::EventLog
81 iterator getCurrEvent() const { return _curr_event; }
82 iterator getCurrEventParent() const { return _curr_event_parent; }
84 void setCurrEvent(iterator event) { _curr_event = event; }
85 void setCurrEventParent(iterator event) { _curr_event_parent = event; }
125 iterator _curr_event; //< current event in _event_list_store
126 iterator _last_event; //< end position in _event_list_store
127 iterator _curr_event_parent; //< parent to current event, if any
129 iterator _last_save
[all...]
/inkscape/src/ui/tool/
H A Dcontrol-point-selection.h49 typedef set_type::iterator iterator; typedef in class:Inkscape::UI::ControlPointSelection
60 iterator begin() { return _points.begin(); }
62 iterator end() { return _points.end(); }
66 std::pair<iterator, bool> insert(const value_type& x, bool notify = true);
77 void erase(iterator pos);
79 void erase(iterator first, iterator last);
82 iterator find(const key_type &k) {
H A Dnode.h19 #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
373 typedef NodeIterator<value_type> iterator; typedef in class:Inkscape::UI::NodeList
[all...]
/inkscape/src/util/
H A Dlist-container.h83 typedef List<T> iterator; typedef in class:Inkscape::Util::ListContainer
91 iterator begin() { return _head; }
93 iterator end() { return iterator(); }
97 for ( iterator iter = _head ; iter ; ++iter ) {
129 iterator insert(const_iterator position, const_reference value) {
243 iterator insert_after(const_iterator pos, const_reference value) {
/inkscape/src/2geom/
H A Dconvex-hull.h48 * This iterator allows us to avoid duplicating any points in the hull
119 typedef std::vector<Point>::const_iterator iterator; typedef in class:Geom::ConvexHull
205 /** @brief Get the begin iterator to the points that form the hull.
210 iterator begin() const { return _boundary.begin(); }
211 /// Get the end iterator to the points that form the hull.
212 iterator end() const { return _boundary.end(); }
221 /** @brief Get an iterator range to the upper part of the hull.
229 /** @brief Get an iterator range to the lower part of the hull.
H A Dpathvector.h126 typedef Sequence::iterator iterator; typedef in class:Geom::PathVector
151 iterator begin() { return _data.begin(); }
152 iterator end() { return _data.end(); }
179 iterator insert(iterator pos, Path const &p) {
183 void insert(iterator out, InputIter first, InputIter last) {
187 iterator erase(iterator i) {
191 iterator eras
[all...]
H A Dpath.h38 #include <iterator>
327 typedef PathInternal::BaseIterator<Path> iterator; typedef in class:Geom::Path
439 iterator begin() { return iterator(*this, 0); }
440 iterator end() { return end_default(); }
441 iterator end_default() { return iterator(*this, size_default()); }
442 iterator end_open() { return iterator(*this, size_open()); }
443 iterator end_close
[all...]
/inkscape/share/extensions/
H A Dvoronoi.py180 siteIter = siteList.iterator()
707 def iterator(self): member in class:SiteList
/inkscape/src/libnrtype/
H A Dfont-lister.cpp73 Gtk::TreeModel::iterator treeModelIter = font_list_store->append();
99 Gtk::TreeModel::iterator treeModelIter = style_list_store->append();
114 Gtk::TreeModel::iterator iter = font_list_store->get_iter("0");
131 void FontLister::ensureRowStyles(GtkTreeModel* model, GtkTreeIter const* iterator) argument
133 Gtk::TreeIter iter(model, iterator);
144 // FontLister::print_document_font( const Gtk::TreeModel::iterator &iter ) {
162 Gtk::TreeModel::iterator iter2 = font_list_store->get_iter("0");
176 Gtk::TreeModel::iterator treeModelIter = font_list_store->prepend();
196 Gtk::TreeModel::iterator iter = font_list_store->get_iter(path);
204 Gtk::TreeModel::iterator ite
[all...]
H A DLayout-TNG.h66 things start with creating a Layout::iterator with begin() or end().
129 - There are a massive number of functions acting on Layout::iterator. A
133 - The separation of methods between Layout and Layout::iterator is a
135 model where the iterator itself can only move around; the base class is
146 class iterator;
147 friend class iterator;
238 that generated a particular glyph. See Layout::iterator.
274 that generated a particular area. See Layout::iterator.
362 Layout::iterator.
424 SPCurve* convertToCurves(iterator cons
940 class Layout::iterator { class in class:Inkscape::Text::Layout
944 iterator() : function in class:Inkscape::Text::Layout::iterator
1052 inline iterator(Layout const *p, unsigned c, int g) function in class:Inkscape::Text::Layout::iterator
1054 inline iterator(Layout const *p, unsigned c) function in class:Inkscape::Text::Layout::iterator
[all...]

Completed in 47 milliseconds