Searched refs:begin (Results 1 - 25 of 352) sorted by relevance

1234567891011>>

/inkscape/src/libdepixelize/priv/
H A Dintegral.h37 Geom::Coord integral(F f, T begin, T end, unsigned samples) argument
40 const T width = (end - begin) / samples;
43 ret += width * f(begin + width * (i + .5));
H A Diterator.h48 ::const_iterator begin)
52 difference_type idx = ptr - to_ptr<T>(begin);
53 return begin + idx;
59 begin)
63 difference_type idx = ptr - to_ptr<T>(begin);
64 return begin + idx;
74 ToIter(const_iterator begin) : argument
75 begin(begin)
80 return to_iterator<T>(ptr, begin);
46 to_iterator(T const *ptr, typename std::vector<T> ::const_iterator begin) argument
57 to_iterator(T *ptr, typename std::vector<T>::iterator begin) argument
89 typename std::vector<T>::const_iterator begin; member in class:Tracer::ToIter
[all...]
H A Dhomogeneoussplines.h72 iterator begin() function in class:Tracer::HomogeneousSplines
74 return _polygons.begin();
77 const_iterator begin() const function in class:Tracer::HomogeneousSplines
79 return _polygons.begin();
124 // different from [begin, end) STL style
190 for ( voronoi_citer cell_it = voronoi.begin(), cell_end = voronoi.end()
193 for ( iterator polygon_it = _polygons.begin(),
232 for ( typename std::vector<Polygon>::iterator it = _polygons.begin(),
253 const points_iter dst_begin = dst.begin();
256 const points_citer src_begin = src.begin();
[all...]
H A Dsplines-kopf2011.h52 iterator it = source.begin();
104 it = source.holes.begin(), end = source.holes.end()
118 it = diagram.begin() , end = diagram.end() ; it != end ; ++it ) {
125 it2 = ++it->vertices.begin(), end2 = it->vertices.end()
146 iterator paths_it = begin();
148 it = homogeneousSplines.begin(), end = homogeneousSplines.end()
/inkscape/src/
H A Dknot-ptr.cpp9 if (std::find(deleted_knots.begin(), deleted_knots.end(), knot) == deleted_knots.end()) {
15 std::list<void*>::iterator it = std::find(deleted_knots.begin(), deleted_knots.end(), knot);
22 if (std::find(deleted_knots.begin(), deleted_knots.end(), knot) != deleted_knots.end()) {
H A Dprofile-manager.cpp38 for (std::set<SPObject *>::const_iterator i = current.begin(); i != current.end(); ++i)
41 sort( newList.begin(), newList.end() );
44 std::set_difference( _knownProfiles.begin(), _knownProfiles.end(), newList.begin(), newList.end(),
45 std::insert_iterator<std::vector<SPObject*> >(diff1, diff1.begin()) );
48 std::set_difference( newList.begin(), newList.end(), _knownProfiles.begin(), _knownProfiles.end(),
49 std::insert_iterator<std::vector<SPObject*> >(diff2, diff2.begin()) );
52 for ( std::vector<SPObject*>::iterator it = diff1.begin(); it < diff1.end(); ++it ) {
54 _knownProfiles.erase( remove(_knownProfiles.begin(), _knownProfile
[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();
140 for(; i != this->_active.begin(); ) {
149 i = this->_pending.begin();
[all...]
H A Dobject-test.h28 clock_t begin, end; local
80 begin = clock();
91 std::cout << "Took " << double(end - begin) / double(CLOCKS_PER_SEC) << " seconds to construct the test document\n";
126 clock_t begin, end; local
145 begin = clock();
156 std::cout << "Took " << double(end - begin) / double(CLOCKS_PER_SEC) << " seconds to write " << num_clones << " clones of a path\n";
158 begin = clock();
165 std::cout << "Took " << double(end - begin) / double(CLOCKS_PER_SEC) << " seconds to remove " << num_clones << " clones of a path\n";
170 clock_t begin, end; local
189 begin
[all...]
H A Dsp-item-update-cns.cpp21 for (vector<SPGuideConstraint>::const_iterator fi(found_cns.begin()),
26 if ( find(item.constraints.begin(),
H A Dresource-manager.cpp44 std::reverse(parts.begin(), parts.end());
46 parts.erase(parts.begin());
64 for ( std::vector<std::string>::iterator it = parts.begin(); it != parts.end(); ++it ) {
68 for ( std::vector<std::string>::iterator it = baseParts.begin(); it != baseParts.end(); ++it ) {
76 parts.erase( parts.begin() );
77 baseParts.erase( baseParts.begin() );
81 for ( std::vector<std::string>::iterator it = parts.begin(); it != parts.end(); ++it ) {
85 for ( std::vector<std::string>::iterator it = baseParts.begin(); it != baseParts.end(); ++it ) {
94 parts.insert(parts.begin(), "..");
183 for (std::set<SPObject *>::const_iterator it = images.begin(); i
[all...]
H A Ddocument-subset.cpp47 found = std::find(children.begin(), children.end(), obj);
49 return found - children.begin();
59 Siblings::const_iterator first=children.begin();
86 return last - children.begin();
92 children.insert(children.begin()+index, obj);
101 for ( Siblings::iterator iter=children.begin()
108 children.begin(), iter);
122 found = std::find(children.begin(), children.end(), obj);
123 unsigned index = found - children.begin();
141 for ( Map::iterator iter=records.begin()
[all...]
H A Dvanishing-point.cpp80 for (std::list<VanishingPoint>::iterator i = dr1->vps.begin(); i != dr1->vps.end(); ++i) {
110 for (std::set<VanishingPoint*, less_ptr>::iterator vp = sel_vps.begin(); vp != sel_vps.end(); ++vp) {
122 for (std::list<SPBox3D *>::iterator i = bx_lst.begin(); i != bx_lst.end(); ++i) {
123 if (std::find(sel_boxes.begin(), sel_boxes.end(), *i) == sel_boxes.end()) {
140 for (std::vector<VPDragger *>::const_iterator di = dragger->parent->draggers.begin(); di != dragger->parent->draggers.end(); ++di) {
150 for (std::list<VanishingPoint>::iterator j = dragger->vps.begin(); j != dragger->vps.end(); ++j) {
158 drag->draggers.erase(std::remove(drag->draggers.begin(), drag->draggers.end(), dragger),drag->draggers.end());
228 for (std::list<VanishingPoint>::iterator i = dragger->vps.begin(); i != dragger->vps.end(); ++i) {
262 for (std::vector<SPItem*>::const_iterator i=itemlist.begin();i!=itemlist.end();++i) {
361 if (!vp.is_finite() || std::find (vps.begin(), vp
[all...]
H A Dsatisfied-guide-cns.cpp13 for(std::vector<SPGuide *>::const_iterator it = nv.guides.begin(); it != nv.guides.end(); ++it) {
/inkscape/src/libdepixelize/
H A Dsplines.h71 iterator begin() function in class:Tracer::Splines
73 return _paths.begin();
76 const_iterator begin() const function in class:Tracer::Splines
78 return _paths.begin();
/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/svg/
H A Dstrip-trailing-zeros.cpp26 str.erase(str.begin() + (nz_ix == p_ix
31 : str.begin() + e_ix));
/inkscape/src/ui/tool/
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();
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) {
323 for (SubpathList::iterator subp = _subpaths.begin(); subp != _subpaths.end(); ++subp) {
327 for (NodeList::iterator first = (*subp)->begin(); first != (*subp)->end(); ++first) {
342 for (std::vector<double>::iterator it = rs.begin(); i
[all...]
/inkscape/src/util/
H A Dlist-container-test.h12 Inkscape::Util::ListContainer<int>::const_iterator iter(c.begin());
47 Inkscape::Util::ListContainer<int>::iterator container_iter=container.begin();
147 c_a.insert(c_a.end(), c_b.begin(), c_b.end());
166 c.insert(c.begin(), 1);
172 c.insert(c.begin(), 3);
175 Inkscape::Util::ListContainer<int>::iterator pos=c.begin();
186 c.erase(c.begin());
189 Inkscape::Util::ListContainer<int>::iterator pos=c.begin();
194 pos=c.begin();
199 c.erase(c.begin());
[all...]
/inkscape/src/2geom/
H A Dcrossing.cpp105 std::sort(edges.begin(), edges.end(), TimeOrder());
132 std::merge(a.begin(), a.end(), b.begin(), b.end(), n.begin(), CrossingOrder(i));
145 for(Crossings::const_iterator i = cr.begin(); i != cr.end(); ++i) {
155 for(Crossings::const_iterator i = cr.begin(); i != cr.end(); ++i) {
167 if(i < split) std::reverse(res.begin(), res.end());
177 if(i >= split) std::reverse(res.begin(), res.end());
212 cr_b.erase(std::find(cr_b.begin(), cr_b.end(), cur));
214 cr_b.erase(std::find(cr_b.begin(), cr_
[all...]
/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 ci = gcs.begin();c
[all...]
/inkscape/src/xml/
H A Dcomposite-node-observer.cpp31 for ( ObserverRecordList::iterator iter=_active.begin() ;
45 for ( ObserverRecordList::iterator iter=_active.begin() ;
60 for ( ObserverRecordList::iterator iter=_active.begin() ;
75 for ( ObserverRecordList::iterator iter=_active.begin() ;
90 for ( ObserverRecordList::iterator iter=_active.begin() ;
179 observers.begin(), observers.end(),
205 observers.begin(), observers.end(),
230 iter = observers.begin();
244 _active.insert(_active.end(), _pending.begin(), _pending.end());
/inkscape/src/libvpsc/
H A Dsolve_VPSC.cpp34 for(ConstraintList::iterator i=inactive.begin();i!=inactive.end();++i) {
53 for(set<Block*>::iterator i=bs->begin();i!=bs->end();++i) {
65 for(list<Variable*>::iterator i=vs->begin();i!=vs->end();++i) {
93 for(set<Block*>::const_iterator i=bs->begin();i!=bs->end();++i) {
98 for(set<Block*>::const_iterator i=bs->begin();i!=bs->end();++i) {
200 for(set<Block*>::const_iterator i(bs->begin());i!=bs->end();++i) {
216 for(set<Block*>::const_iterator i(bs->begin());i!=bs->end();++i) {
256 for(ConstraintList::iterator i=l.begin();i!=end;++i) {
294 for(vector<Constraint*>::iterator c=vs[i]->in.begin();c!=vs[i]->in.end();++c) {
299 for(vector<Constraint*>::iterator c=vs[i]->out.begin();
[all...]
/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)
/inkscape/src/libavoid/
H A Dvpsc.cpp77 for(Constraints::iterator i=inactive.begin();i!=inactive.end();++i) {
89 for(set<Block*>::iterator i=bs->begin();i!=bs->end();++i) {
104 for(Variables::const_iterator i=vs.begin();i!=vs.end();++i) {
125 for(vector<Constraint*>::iterator c=vs[i]->in.begin();c!=vs[i]->in.end();++c) {
130 for(vector<Constraint*>::iterator c=vs[i]->out.begin();c!=vs[i]->out.end();++c) {
137 vector<node*>::iterator i=graph.begin();
149 for(set<node*>::iterator j=u->out.begin();j!=u->out.end();++j) {
166 for(set<Block*>::const_iterator i=bs->begin();i!=bs->end();++i) {
172 for(set<Block*>::const_iterator i=bs->begin();i!=bs->end();++i) {
194 vector<node*>::iterator i=graph.begin();
[all...]

Completed in 29 milliseconds

1234567891011>>