Searched defs:it (Results 1 - 25 of 53) sorted by relevance

123

/inkscape/src/
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 Dsp-cursor.cpp106 std::map<char, RGBA>::const_iterator it = colorMap.find(xpm[1 + colors + y][x]); local
107 pixmap_buffer[y * width + x] = (it == colorMap.end()) ? 0u : it->second;
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-marker.cpp96 * as the marker is removed from the tree, even if it is still referenced
106 std::map<unsigned int, SPMarkerView>::iterator it; local
107 for (it = views_map.begin(); it != views_map.end(); ++it) {
108 SPGroup::hide( it->first );
219 std::map<unsigned int, SPMarkerView>::iterator it; local
220 for (it = views_map.begin(); it != views_map.end(); ++it) {
332 std::map<unsigned int, SPMarkerView>::iterator it = marker->views_map.find(key); local
366 std::map<unsigned int, SPMarkerView>::iterator it = marker->views_map.find(key); 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/libdepixelize/priv/
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...]
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 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...]
/inkscape/src/libvpsc/
H A Dblocks.cpp62 vector<Constraint*>::iterator it=v->out.begin(); local
63 for(;it!=v->out.end();++it) {
64 Constraint *c=*it;
H A Dgenerate-constraints.cpp90 /* I don't know how important it is to handle NaN correctly
91 * (e.g. we probably handle it badly in other code anyway, and
197 NodeSet::iterator it=scanline.find(v); local
198 if(it--!=scanline.begin()) {
199 Node *u=*it;
203 it=scanline.find(v);
204 if(++it!=scanline.end()) {
205 Node *u=*it;
/inkscape/share/extensions/
H A Dscour.inkscape.py9 inkex.errormsg("Failed to import Python module 'scour'.\nPlease make sure it is installed (e.g. using 'pip install scour' or 'sudo apt-get install python-scour') and try again.") namespace
16 inkex.errormsg("Failed to import Python module 'six'.\nPlease make sure it is installed (e.g. using 'pip install six' or 'sudo apt-get install python-six') and try again.") namespace
/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...]
H A Dgeomtypes.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,
392 std::vector<Point>::iterator it = simplified.ps.begin(); local
393 if (it != simplified.ps.end()) ++it;
403 it = simplified.ps.erase(it);
408 ++it;
/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 Dlivepatheffect-editor.cpp348 PathEffectList::iterator it; local
349 for( it = effectlist.begin() ; it!=effectlist.end(); ++it)
351 if ( !(*it)->lpeobject ) {
355 if ((*it)->lpeobject->get_lpe()) {
357 row[columns.col_name] = (*it)->lpeobject->get_lpe()->getName();
358 row[columns.lperef] = *it;
359 row[columns.col_visible] = (*it)->lpeobject->get_lpe()->isVisible();
363 row[columns.lperef] = *it;
[all...]
/inkscape/src/libcola/
H A Dstraightener.cpp147 for(vector<double>::iterator it=bs.begin();it!=bs.end();++it) {
148 sortedEdges.insert(make_pair(*it,e));
242 // it points to the first node to the right of v
243 NodeSet::iterator it=openNodes.lower_bound(v); local
245 if(it--!=openNodes.begin()) {
246 l=*it;
249 it=openNodes.upper_bound(v);
250 if(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/live_effects/
H A Dlpe-lattice2.cpp244 std::vector<Parameter *>::iterator it = param_vector.begin(); local
245 while (it != param_vector.end()) {
246 if ((*it)->widget_is_visible) {
247 Parameter * param = *it;
268 ++it;
H A Dlpe-perspective_path.cpp214 std::vector<Parameter *>::iterator it = param_vector.begin(); local
215 while (it != param_vector.end()) {
216 if ((*it)->widget_is_visible) {
217 Parameter * param = *it;
231 ++it;
H A Dlpe-roughen.cpp114 std::vector<Parameter *>::iterator it = param_vector.begin(); local
115 while (it != param_vector.end()) {
116 if ((*it)->widget_is_visible) {
117 Parameter *param = *it;
166 ++it;
216 // closingline.isDegenerate() did not work, because it only checks for
H A Dlpe-simplify.cpp87 std::vector<Parameter *>::iterator it = param_vector.begin(); local
89 while (it != param_vector.end()) {
90 if ((*it)->widget_is_visible) {
91 Parameter * param = *it;
123 ++it;
182 // closingline.isDegenerate() did not work, because it only checks for
H A Dlpe-transform_2pts.cpp203 for (Geom::PathVector::iterator it = pathvector.begin(); it != pathvector.end(); ++it) {
204 n += it->size_closed();
276 std::vector<Parameter *>::iterator it = param_vector.begin(); local
281 while (it != param_vector.end()) {
282 if ((*it)->widget_is_visible) {
283 Parameter *param = *it;
347 ++it;
/inkscape/src/ui/
H A Duxmanager.cpp58 std::map<SPDesktop*, TrackItem>::iterator it = trackedBoxes.find(desktop); local
59 if (it != trackedBoxes.end())
61 trackedBoxes.erase(it);
189 for (vector<SPDesktopWidget*>::iterator it = dtws.begin(); it != dtws.end(); ++it) {
190 SPDesktopWidget* dtw = *it;
205 taskNum = val; // in case it was out of range
255 for (vector<GtkWidget*>::const_iterator it = toolboxes.begin(); it !
[all...]
/inkscape/src/ui/widget/
H A Dfont-variants.cpp416 std::map<Glib::ustring,int>::iterator it; local
418 if((it = res->openTypeTables.find("liga"))!= res->openTypeTables.end() ||
419 (it = res->openTypeTables.find("clig"))!= res->openTypeTables.end()) {
425 if((it = res->openTypeTables.find("dlig"))!= res->openTypeTables.end()) {
431 if((it = res->openTypeTables.find("hlig"))!= res->openTypeTables.end()) {
437 if((it = res->openTypeTables.find("calt"))!= res->openTypeTables.end()) {
443 if((it = res->openTypeTables.find("subs"))!= res->openTypeTables.end()) {
449 if((it = res->openTypeTables.find("sups"))!= res->openTypeTables.end()) {
455 if((it = res->openTypeTables.find("smcp"))!= res->openTypeTables.end()) {
461 if((it
[all...]

Completed in 37 milliseconds

123