Searched refs:iterator (Results 1 - 25 of 285) sorted by relevance

1234567891011>>

/inkscape/src/
H A Dtext-editing.h26 typedef std::pair<Inkscape::Text::Layout::iterator, Inkscape::Text::Layout::iterator> iterator_pair;
47 std::vector<Geom::Point> sp_te_create_selection_quads(SPItem const *item, Inkscape::Text::Layout::iterator const &start, Inkscape::Text::Layout::iterator const &end, Geom::Affine const &transform);
49 Inkscape::Text::Layout::iterator sp_te_get_position_by_coords (SPItem const *item, Geom::Point const &i_p);
50 void sp_te_get_cursor_coords (SPItem const *item, Inkscape::Text::Layout::iterator const &position, Geom::Point &p0, Geom::Point &p1);
53 SPStyle const * sp_te_style_at_position(SPItem const *text, Inkscape::Text::Layout::iterator const &position);
54 SPObject const * sp_te_object_at_position(SPItem const *text, Inkscape::Text::Layout::iterator const &position);
56 Inkscape::Text::Layout::iterator sp_te_insert(SPItem *item, Inkscape::Text::Layout::iterator cons
[all...]
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...]
H A Dcomposite-undo-stack-observer.cpp47 for(UndoObserverRecordList::iterator i = this->_active.begin(); i != _active.end(); ++i) {
60 for(UndoObserverRecordList::iterator i = this->_active.begin(); i != _active.end(); ++i) {
72 for(UndoObserverRecordList::iterator i = this->_active.begin(); i != _active.end(); ++i) {
84 for(UndoObserverRecordList::iterator i = this->_active.begin(); i != _active.end(); ++i) {
96 for(UndoObserverRecordList::iterator i = this->_active.begin(); i != _active.end(); ++i) {
109 UndoObserverRecordList::iterator i = std::find_if(list.begin(), list.end(), std::bind1st(std::equal_to< UndoStackObserverRecord >(), eq_comp));
124 UndoObserverRecordList::iterator i = std::find_if(list.begin(), list.end(), std::bind1st(std::equal_to< UndoStackObserverRecord >(), eq_comp));
139 UndoObserverRecordList::iterator i = this->_active.begin();
H A Dknot-ptr.cpp15 std::list<void*>::iterator it = std::find(deleted_knots.begin(), deleted_knots.end(), knot);
/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 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 Doptimization-kopf2011.h85 typename std::vector< Point<T> >::iterator
86 skip1visible(typename std::vector< Point<T> >::iterator it,
87 typename std::vector< Point<T> >::iterator end)
101 border_detection(typename std::vector< Point<T> >::iterator it,
102 typename std::vector< Point<T> >::iterator end)
104 typename std::vector< Point<T> >::iterator begin = it;
110 typename std::vector< Point<T> >::iterator prev = it;
216 typename Path::iterator it = ret.begin() + j;
/inkscape/src/libnrtype/
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...]
H A DLayout-TNG-OutIter.cpp22 Layout::iterator Layout::_cursorXOnLineToIterator(unsigned line_index, double local_x) const
49 if (best_char_index == -1) return iterator(this, char_index);
50 return iterator(this, best_char_index);
82 Layout::iterator Layout::getNearestCursorPositionTo(double x, double y) const
159 Layout::iterator Layout::getLetterAt(double x, double y) const
164 for (iterator it = begin() ; it != end() ; it.nextCharacter()) {
172 Layout::iterator Layout::sourceToIterator(void *source_cookie /*, Glib::ustring::const_iterator text_iterator*/) const
183 return iterator(this, char_index);
185 return iterator(this, char_index);
189 if (text_iterator <= text_source->text_begin) return iterator(thi
[all...]
/inkscape/src/2geom/
H A Dconic_section_clipper_impl.h135 std::list<Point>::iterator split (std::list<Point> & points,
136 std::list<Point>::iterator sp,
137 std::list<Point>::iterator fp) const;
139 std::list<Point>::iterator sp,
140 std::list<Point>::iterator fp,
144 std::list<Point>::iterator sp,
145 std::list<Point>::iterator fp,
255 * between the two passed points and an iterator pointing to the new point
259 std::list<Point>::iterator CLIPPER_CLASS::split (std::list<Point> & points,
260 std::list<Point>::iterator s
[all...]
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/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/util/
H A Dlist-copy.h15 #include <iterator>
/inkscape/src/ui/tool/
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...]
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 Dpath-manipulator.h74 void insertNode(NodeList::iterator first, double t, bool take_selection);
76 void weldNodes(NodeList::iterator preserve_pos = NodeList::iterator());
97 NodeList::iterator subdivideSegment(NodeList::iterator after, double t);
98 NodeList::iterator extremeNode(NodeList::iterator origin, bool search_selected,
118 unsigned _deleteStretch(NodeList::iterator first, NodeList::iterator last, bool keep_shape);
H A Dpath-manipulator.cpp231 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
[all...]
H A Dcurve-drag-point.h38 void setIterator(NodeList::iterator i) { first = i; }
39 NodeList::iterator getIterator() { return first; }
54 NodeList::iterator first;
/inkscape/src/display/
H A Ddrawing-group.cpp78 for (ChildrenList::iterator i = _children.begin(); i != _children.end(); ++i) {
83 for (ChildrenList::iterator i = _children.begin(); i != _children.end(); ++i) {
97 for (ChildrenList::iterator i = _children.begin(); i != _children.end(); ++i) {
102 for (ChildrenList::iterator i = _children.begin(); i != _children.end(); ++i) {
120 for (ChildrenList::iterator i = _children.begin(); i != _children.end(); ++i) {
128 for (ChildrenList::iterator i = _children.begin(); i != _children.end(); ++i) {
H A Dcanvas-temporary-item-list.cpp28 for ( std::list<TemporaryItem*>::iterator it = itemlist.begin(); it != itemlist.end(); ++it ) {
51 for ( std::list<TemporaryItem*>::iterator it = itemlist.begin(); it != itemlist.end(); ++it ) {
/inkscape/src/libcola/
H A Dgradient_projection.cpp66 for (DummyVars::iterator it=dummy_vars.begin();it!=dummy_vars.end();++it){
82 for (DummyVars::iterator it=dummy_vars.begin();it!=dummy_vars.end();++it){
105 for (DummyVars::iterator it=dummy_vars.begin();it!=dummy_vars.end();++it){
118 for (DummyVars::iterator it=dummy_vars.begin();it!=dummy_vars.end();++it){
136 for (DummyVars::iterator it=dummy_vars.begin();it!=dummy_vars.end();++it){
147 for (DummyVars::iterator it=dummy_vars.begin();it!=dummy_vars.end();++it){
155 for (DummyVars::iterator it=dummy_vars.begin();it!=dummy_vars.end();++it){
175 for(DummyVars::iterator dit=dummy_vars.begin();
199 for(vector<Constraint*>::iterator ci = lcs.begin();ci!=lcs.end();++ci) {
202 for(vector<Constraint*>::iterator c
[all...]
/inkscape/src/libavoid/
H A Dviscluster.h58 ClusterRefList::iterator _pos;
/inkscape/src/ui/tools/
H A Dtext-tool.h51 Inkscape::Text::Layout::iterator text_sel_start;
52 Inkscape::Text::Layout::iterator text_sel_end;
98 void sp_text_context_place_cursor (TextTool *tc, SPObject *text, Inkscape::Text::Layout::iterator where);
100 Inkscape::Text::Layout::iterator *sp_text_context_get_cursor_position(TextTool *tc, SPObject *text);
/inkscape/src/live_effects/
H A Dlpe-fill-between-strokes.cpp48 for (Geom::PathVector::iterator iter = linked_pathv.begin(); iter != linked_pathv.end(); ++iter)
52 for (Geom::PathVector::iterator iter = second_pathv.begin(); iter != second_pathv.end(); ++iter)
81 for (Geom::PathVector::iterator iter = linked_pathv.begin(); iter != linked_pathv.end(); ++iter)
93 for (Geom::PathVector::iterator iter = second_pathv.begin(); iter != second_pathv.end(); ++iter)

Completed in 107 milliseconds

1234567891011>>