Searched refs:it (Results 1 - 25 of 151) sorted by relevance

1234567

/inkscape/src/display/
H A Dcanvas-temporary-item-list.cpp28 for ( std::list<TemporaryItem*>::iterator it = itemlist.begin(); it != itemlist.end(); ++it ) {
29 TemporaryItem * tempitem = *it;
49 // check if the item is in the list, if so, delete it. (in other words, don't wait for the item to delete itself)
51 for ( std::list<TemporaryItem*>::iterator it = itemlist.begin(); it != itemlist.end(); ++it ) {
52 if ( *it == tempitem ) {
67 // no need to delete the item, it doe
[all...]
/inkscape/src/libdepixelize/priv/
H A Dsplines-kopf2011.h5 This library is free software; you can redistribute it and/or modify it
19 This library is distributed in the hope that it will be useful,
52 iterator it = source.begin(); local
54 Geom::Path ret(to_geom_point(midpoint(prev, *it)));
56 for ( iterator end = source.end() ; it != end ; ++it ) {
59 if ( !it->visible ) {
60 prev = *it;
66 Geom::Point middle = to_geom_point(midpoint(prev, *it));
[all...]
H A Dpixelgraph.h5 This library is free software; you can redistribute it and/or modify it
19 This library is distributed in the hope that it will be useful,
341 PixelGraph::Node *it = &_nodes.front(); local
343 for ( int j = 0 ; j != _width ; ++j, ++it ) {
344 if ( it->adj.top )
345 assert((it - _width)->adj.bottom);
346 if ( it->adj.topright )
347 assert((it - _width + 1)->adj.bottomleft);
348 if ( it
373 iterator it = nodeBottomRight(begin()); // [1][1] local
397 Node *it = &_nodes[1]; local
420 Node *it = &((*this)[1][_height - 1]); local
434 iterator it = nodeBottom(begin()); // [0][1] local
457 iterator it = nodeBottom(begin() + _width - 1);// [_width - 1][1] local
[all...]
H A Doptimization-kopf2011.h5 This library is free software; you can redistribute it and/or modify it
19 This library is distributed in the hope that it will be useful,
86 skip1visible(typename std::vector< Point<T> >::iterator it, argument
89 for ( ++it ; it != end ; ++it ) {
90 if ( it->visible )
91 return it;
101 border_detection(typename std::vector< Point<T> >::iterator it, argument
216 typename Path::iterator it = ret.begin() + j; local
[all...]
H A Dhomogeneoussplines.h5 This library is free software; you can redistribute it and/or modify it
19 This library is distributed in the hope that it will be useful,
153 SelfCommonEdge _common_edge(Points &points, points_riter it);
232 for ( typename std::vector<Polygon>::iterator it = _polygons.begin(),
233 end = _polygons.end() ; it != end ; ++it ) {
234 SelfCommonEdge ce = _common_edge(it->vertices, it->vertices.rbegin());
236 _fill_holes(it
341 _common_edge(Points &points, points_riter it) argument
[all...]
H A Diterator.h5 This library is free software; you can redistribute it and/or modify it
19 This library is distributed in the hope that it will be useful,
34 const T *to_ptr(typename std::vector<T>::const_iterator it) argument
36 return &*it;
40 T *to_ptr(typename std::vector<T>::iterator it) argument
42 return &*it;
99 const T *operator()(const_iterator it) const
101 return to_ptr<T>(it);
104 T *operator()(iterator it) cons
[all...]
/inkscape/src/
H A Dsatisfied-guide-cns.cpp13 for(std::vector<SPGuide *>::const_iterator it = nv.guides.begin(); it != nv.guides.end(); ++it) {
14 SPGuide &g = *(*it);
H A Dknot-ptr.cpp15 std::list<void*>::iterator it = std::find(deleted_knots.begin(), deleted_knots.end(), knot); local
16 if (it != deleted_knots.end()) {
17 deleted_knots.erase(it);
23 g_warning("Accessed knot after it was freed at %p", knot);
H A Dremoveoverlap.cpp46 for (std::vector<SPItem*>::iterator it(selected.begin());
47 it != selected.end();
48 ++it)
50 SPItem* item = *it;
75 for ( std::vector<Record>::iterator it = records.begin();
76 it != records.end();
77 ++it )
79 Geom::Point const curr = it->midpoint;
80 Geom::Point const dest(it->vspc_rect->getCentreX(),
81 it
[all...]
H A Ddevice-manager.cpp47 for (std::vector<GdkDeviceFake>::iterator it = fakeList.begin(); it != fakeList.end() && valid; ++it) {
48 const bool name_matches = (device->get_name() == (*it).name);
49 const bool source_matches = (device->get_source() == (*it).source);
50 const bool mode_matches = (device->get_mode() == (*it).mode);
51 const bool num_axes_matches = (device->get_n_axes() == (*it).num_axes);
53 const bool num_keys_matches = (device->get_n_keys() == (*it).num_keys);
55 const bool num_keys_matches = (gdk_device_get_n_keys(device->gobj()) == (*it).num_keys);
128 for (std::map<Glib::ustring, Gdk::AxisUse>::iterator it
462 std::list<Glib::RefPtr<InputDeviceImpl> >::iterator it = std::find_if(devices.begin(), devices.end(), IdMatcher(id)); local
478 std::list<Glib::RefPtr<InputDeviceImpl> >::iterator it = std::find_if(devices.begin(), devices.end(), IdMatcher(id)); local
500 std::list<Glib::RefPtr<InputDeviceImpl> >::iterator it = std::find_if(devices.begin(), devices.end(), IdMatcher(id)); local
533 std::list<Glib::RefPtr<InputDeviceImpl> >::iterator it = std::find_if(devices.begin(), devices.end(), IdMatcher(id)); local
550 std::list<Glib::RefPtr<InputDeviceImpl> >::iterator it = std::find_if(devices.begin(), devices.end(), IdMatcher(id)); local
566 std::list<Glib::RefPtr<InputDeviceImpl> >::iterator it = std::find_if(devices.begin(), devices.end(), IdMatcher(id)); local
[all...]
H A Dresource-manager.cpp64 for ( std::vector<std::string>::iterator it = parts.begin(); it != parts.end(); ++it ) {
65 // TODO debug g_message(" [%s]", it->c_str());
68 for ( std::vector<std::string>::iterator it = baseParts.begin(); it != baseParts.end(); ++it ) {
69 // TODO debug g_message(" [%s]", it->c_str());
81 for ( std::vector<std::string>::iterator it = parts.begin(); it !
[all...]
H A Dprofile-manager.cpp52 for ( std::vector<SPObject*>::iterator it = diff1.begin(); it < diff1.end(); ++it ) {
53 SPObject* tmp = *it;
62 for ( std::vector<SPObject*>::iterator it = diff2.begin(); it < diff2.end(); ++it ) {
63 SPObject* tmp = *it;
H A Dsp-namedview.cpp156 // first create the child xml node, then hook it to repr. This order is important, to not set off listeners to repr before the new node is complete.
280 for(std::vector<Inkscape::CanvasGrid *>::const_iterator it=this->grids.begin();it!=this->grids.end();++it )
281 delete *it;
328 for(std::vector<SPGuide *>::const_iterator it=this->guides.begin();it!=this->guides.end();++it ) {
329 (*it)->setColor(this->guidecolor);
330 (*it)
[all...]
H A Devent-log.cpp118 std::vector<DialogConnection>::iterator it = std::find_if(_connections.begin(), _connections.end(), ConnectionMatcher(event_list_view, callback_connections)); local
119 if (it != _connections.end()) {
120 _connections.erase(it);
127 for (std::vector<DialogConnection>::iterator it(_connections.begin()); it != _connections.end(); ++it)
129 addBlocker(blockers, &(*it->_callback_connections)[Inkscape::EventLog::CALLB_SELECTION_CHANGE]);
130 addBlocker(blockers, &(*it->_callback_connections)[Inkscape::EventLog::CALLB_COLLAPSE]);
133 for (std::vector<DialogConnection>::iterator it(_connections.begin()); it !
[all...]
H A Did-clash.cpp237 // Make a note of this change, if we need to fix up refs to it
262 std::list<IdReference>::const_iterator it; local
264 for (it = pos->second.begin(); it != it_end; ++it) {
265 switch (it->type) {
268 it->elem->getRepr()->setAttribute(it->attr, new_uri);
273 sp_style_set_property_url(it->elem, it
330 std::list<IdReference>::const_iterator it; local
[all...]
H A Dsp-guide.cpp66 for(std::vector<SPGuideLine *>::const_iterator it = this->views.begin(); it != this->views.end(); ++it) {
67 sp_guideline_set_color(*it, this->color);
87 for(std::vector<SPGuideLine *>::const_iterator it = this->views.begin(); it != this->views.end(); ++it) {
88 sp_guideline_delete(*it);
289 for(std::vector<SPGuideLine *>::const_iterator it = this->views.begin(); it !
[all...]
/inkscape/src/libdepixelize/
H A Dkopftracer2011.cpp5 This library is free software; you can redistribute it and/or modify it
19 This library is distributed in the hope that it will be useful,
143 for ( HomogeneousSplines<Precision>::iterator it = splines.begin(),
144 end = splines.end() ; it != end ; ++it ) {
146 it2 = it->vertices.begin(), end2 = it->vertices.end()
151 it2 = it->holes.begin(), end2 = it
517 PixelGraph::const_iterator it = i ? a : b; local
608 PixelGraph::const_iterator it = diagonals[MAIN_DIAGONAL].first.first; local
[all...]
/inkscape/src/svg/
H A Dtest-stubs.cpp32 std::map<std::string,long long int>::const_iterator it=int_prefs.find(std::string(path) + '/' + std::string(attr)); local
33 long long int ret = it==int_prefs.end() ? def : it->second;
/inkscape/src/libcola/
H A Dgradient_projection.cpp66 for (DummyVars::iterator it=dummy_vars.begin();it!=dummy_vars.end();++it){
67 (*it)->updatePosition();
82 for (DummyVars::iterator it=dummy_vars.begin();it!=dummy_vars.end();++it){
83 (*it)->computeDescentVector();
105 for (DummyVars::iterator it=dummy_vars.begin();it!
[all...]
/inkscape/src/extension/internal/
H A Dsvg.cpp55 for ( List<AttributeRecord const> it = repr->attributeList(); it; ++it ) {
56 const gchar* attrName = g_quark_to_string(it->key);
62 for ( std::vector<gchar const*>::iterator it = attrsRemoved.begin(); it != attrsRemoved.end(); ++it ) {
63 repr->setAttribute(*it, 0);
75 for ( std::vector<Inkscape::XML::Node *>::iterator it = nodesRemoved.begin(); it !
[all...]
/inkscape/src/ui/dialog/
H A Dtemplate-load-tab.cpp109 for (std::set<Glib::ustring>::iterator it = _keywords.begin() ; it != _keywords.end() ; ++it){
110 _keywords_combo.append(*it);
157 for (std::map<Glib::ustring, TemplateData>::iterator it = _tdata.begin() ; it != _tdata.end() ; ++it) {
160 row[_columns.textValue] = it->first;
166 for (std::map<Glib::ustring, TemplateData>::iterator it = _tdata.begin() ; it !
288 std::list<Inkscape::Extension::Effect *>::iterator it = effects.begin(); local
[all...]
H A Dswatches.cpp224 for (std::map<SwatchesPanel*, SPDocument*>::iterator it = docPerPanel.begin(); it != docPerPanel.end(); ++it) {
225 rawObjects[GTK_WIDGET(it->first->gobj())] = it->first;
314 for ( std::vector<GtkWidget*>::iterator it = popupExtras.begin(); it != popupExtras.end(); ++ it) {
315 gtk_widget_set_sensitive(*it, show);
423 // blank line. skip it
[all...]
/inkscape/src/util/
H A Dege-tags.cpp111 for ( std::vector<Tag>::iterator it = tags.begin(); (it != tags.end()) && !present; ++it ) {
112 if (tag.key == it->key) {
116 std::vector<Label>::iterator itOld = std::find_if( it->labels.begin(), it->labels.end(), std::bind2nd(sameLang(), *it2) );
117 if (itOld != it->labels.end()) {
120 it->labels.push_back(*it2);
/inkscape/src/libavoid/
H A Dshape.cpp8 * This library is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
18 * This library is distributed in the hope that it will be useful,
85 // Destroying a shape without calling removeShape(), so do it now.
92 VertInf *it = _firstVert; local
95 VertInf *tmp = it;
96 it = it->shNext;
100 while (it != _firstVert);
136 VertInf *it local
158 VertInf *it = _firstVert; local
[all...]
/inkscape/src/libnrtype/
H A DLayout-TNG.h58 text editing where the output refers back to where it came from.
69 - Flow: Not often used, but when it is it means all the text
81 - This is where it gets weird because a span will contain one or more
113 - "Why isn't foo here?": Ask yourself if it's possible to implement foo
114 externally using iterators. However this may not mean that it doesn't
117 places (internal only) where it would save significant amounts of memory.
130 large number are trivial and will be inline, but is it really necessary
211 /** Empties everything stored in this class and resets it to its
212 original state, like when it wa
[all...]

Completed in 672 milliseconds

1234567