Searched defs:split (Results 1 - 12 of 12) sorted by relevance

/inkscape/src/libvpsc/
H A Dblocks.cpp151 void Blocks::split(Block *b, Block *&l, Block *&r, Constraint *c) { function in class:vpsc::Blocks
152 b->split(l,r,c);
H A Dblock.cpp246 // We also do not consider equality constraints as potential split points
358 f<<" need to split between: "<<*vl<<" and "<<*vr<<endl;
362 f<<" going to split on: "<<*c<<endl;
364 split(lb,rb,c);
369 void Block::split(Block* &l, Block* &r, Constraint* c) { function in class:vpsc::Block
/inkscape/src/2geom/
H A Dcrossing.cpp153 Crossings reverse_tb(Crossings const &cr, unsigned split, std::vector<double> max) { argument
156 double mx = max[i->b - split];
163 CrossingSet reverse_ta(CrossingSet const &cr, unsigned split, std::vector<double> max) { argument
167 if(i < split) std::reverse(res.begin(), res.end());
173 CrossingSet reverse_tb(CrossingSet const &cr, unsigned split, std::vector<double> max) { argument
176 Crossings res = reverse_tb(cr[i], split, max);
177 if(i >= split) std::reverse(res.begin(), res.end());
H A Dconic_section_clipper_impl.h135 std::list<Point>::iterator split (std::list<Point> & points,
259 std::list<Point>::iterator CLIPPER_CLASS::split (std::list<Point> & points, function in class:Geom::CLIPPER_CLASS
265 //std::cerr << "CLIP: split: [" << *sp << ", " << *ip << ", "
288 //DBGINFO("CLIP: split: no further split")
292 std::list<Point>::iterator ip = split (points, sp, fp);
315 std::list<Point>::iterator ip = split (points, sp, fp);
322 //DBGINFO("CLIP: split: no further split")
H A Drecursive-bezier-intersection.cpp24 void split(double t, OldBezier &a, OldBezier &b) const;
76 * split the curve at the midpoint, returning an array with the two parts
80 void OldBezier::split(double t, OldBezier &left, OldBezier &right) const { function in class:Geom::OldBezier
107 * split the curve at the midpoint, returning an array with the two parts
227 a.split(0.5, A[0], A[1]);
233 b.split(0.5, B[0], B[1]);
269 b.split(0.5, B[0], B[1]);
H A Dbasic-intersection.cpp106 * split the curve at the midpoint, returning an array with the two parts
111 void split(vector<Point> const &p, double t, function in namespace:Geom
162 split(in, (dr[i+1]-dr[i]) / (1 - dr[i]), l, r);
H A Dconicsec.cpp174 void RatQuad::split(RatQuad &a, RatQuad &b) const { function in class:Geom::RatQuad
/inkscape/src/widgets/
H A Deraser-toolbar.cpp75 GtkAction *split = GTK_ACTION( g_object_get_data(tbl, "split") ); local
79 gtk_action_set_visible( split, TRUE );
83 gtk_action_set_visible( split, FALSE );
191 g_object_set_data( holder, "split", act );
195 GtkAction *split = GTK_ACTION( g_object_get_data(holder, "split") ); local
199 gtk_action_set_visible( split, TRUE );
203 gtk_action_set_visible( split, FALSE );
/inkscape/src/display/
H A Dcurve.cpp154 SPCurve::split() const function in class:SPCurve
/inkscape/src/live_effects/
H A Dlpe-copy_rotate.cpp163 LPECopyRotate::split(Geom::PathVector &path_on, Geom::Path const &divider) function in class:Inkscape::LivePathEffect::LPECopyRotate
224 split(path_on,divider);
/inkscape/src/libavoid/
H A Dvpsc.cpp246 * is between two variables in the same block. Then, we must split the block
279 // constraint is within block, need to split first
303 // v was satisfied by the above split!
368 f<<" found split point: "<<*v<<" lm="<<v->lm<<endl;
374 b->split(l,r,v);
577 void Blocks::split(Block *b, Block *&l, Block *&r, Constraint *c) { function in class:Avoid::Blocks
578 b->split(l,r,c);
915 // We also do not consider equality constraints as potential split points
929 f<<" left split path: "<<*c<<endl;
949 f<<" right split pat
1180 void Block::split(Block* &l, Block* &r, Constraint* c) { function in class:Avoid::Block
[all...]
/inkscape/src/
H A Dsp-text.cpp932 void TextTagAttributes::split(unsigned index, TextTagAttributes *second) function in class:TextTagAttributes

Completed in 39 milliseconds