Searched refs:left (Results 1 - 25 of 97) sorted by relevance

1234

/inkscape/src/libvpsc/
H A Dconstraint.h26 Variable *left; member in class:vpsc::Constraint
30 Constraint(Variable *left, Variable *right, double gap, bool equality=false);
32 inline double slack() const { return right->position() - gap - left->position(); }
42 l->left->block->timeStamp > l->timeStamp
43 ||l->left->block==l->right->block
46 r->left->block->timeStamp > r->timeStamp
47 ||r->left->block==r->right->block
51 if(l->left->id==r->left->id) {
55 if(l->left
[all...]
H A Dconstraint.cpp13 Constraint::Constraint(Variable *left, Variable *right, double gap, bool equality) argument
14 : left(left),
22 left->out.push_back(this);
27 for(i=left->out.begin(); i!=left->out.end(); ++i) {
30 left->out.erase(i);
42 os<<*c.left<<"+"<<c.gap<<type<<*c.right<<"("<<c.slack()<<")"<<(c.active?"-active":"");
H A Dblock.cpp71 if ((c->left->block != this && in) || (c->right->block != this && !in)) {
80 f<<" merging on: "<<*c<<",c->left->offset="<<c->left->offset<<",c->right->offset="<<c->right->offset<<endl;
82 double dist = c->right->offset - c->left->offset - c->gap;
83 Block *l=c->left->block;
136 Block *lb=v->left->block;
142 f<<" timestamps: left="<<lb->timeStamp<<" right="<<rb->timeStamp<<" constraint="<<v->timeStamp<<endl;
183 while (v->left->block == v->right->block) {
202 return c->left->block==this && c->active && last!=c->left;
[all...]
H A Dsolve_VPSC.cpp156 Block *lb = v->left->block, *rb = v->right->block;
160 if(lb->isActiveDirectedPathBetween(v->right,v->left)) {
169 inactive.push_back(lb->splitBetween(v->left,v->right,lb,rb));
225 Block *b = v->left->block, *l=NULL, *r=NULL;
226 assert(v->left->block == v->right->block);
295 Variable *l=(*c)->left;
346 Block *l=c->left->block;
/inkscape/share/extensions/
H A Dlayout_nup.py129 (top & bottom, left & right) or (top, right, bottom, left).
160 top, right, bottom, left = 0,1,2,3
166 - pgEdge[left] - pgEdge[right]
167 - num[cols]*(margin[left] + margin[right])) / num[cols],
176 sep = (size[width]+margin[right]+margin[left],
182 'x': str(pgEdge[left] + margin[left] + padding[left]),
184 'width': str(size[width] - padding[left]
[all...]
H A Dfuncplot.py39 def drawfunction(xstart, xend, ybottom, ytop, samples, width, height, left, bottom,
51 xoff = left
53 if polar : # Set scale so that left side of rectangle is -1, right side is +1.
55 centerx = left + width/2.0
74 xstart = (left-xzero)/scalex
75 xend = (left+width-xzero)/scalex
106 a.append(['M ',[left, coordy(0)]])
139 a.append([' M ',[left, coordy(0)]])
175 a.append([' L ',[left + width, coordy(0)]])
H A Dparam_curves.py34 def drawfunction(t_start, t_end, xleft, xright, ybottom, ytop, samples, width, height, left, bottom,
43 xoff = left
57 xleft = (left-xzero)/scalex
58 xright = (left+width-xzero)/scalex
85 a.append(['M ',[left, coordy(0)]])
150 help="x-value of rectangle's left")
H A Dpturtle.py37 def left(self,deg): member in class:pTurtle
78 lt = left
H A Dvoronoi.py146 print "circle through left=%d right=%d bottom=%d" % (s1.sitenum, s2.sitenum, s3.sitenum)
205 # this new bisector edge between the left and right vectors in
210 # if the new bisector intersects with the left edge, remove
211 # the left edge's vertex, and put in the new one
235 # vectors. Get the Halfedge to the left and right of the above HE
238 llbnd = lbnd.left
242 # get the Site to the left of the left HE and to the right of
257 # set the endpoint of the left and right Halfedge to be this vector
272 # if the site to the left o
[all...]
/inkscape/src/live_effects/
H A Dlpe-bounding-box.cpp43 Geom::Path p(Geom::Point(bbox->left(), bbox->top()));
46 p.appendNew<Geom::LineSegment>(Geom::Point(bbox->left(), bbox->bottom()));
47 p.appendNew<Geom::LineSegment>(Geom::Point(bbox->left(), bbox->top()));
H A Dlpe-perp_bisector.h30 void bisector_end_set(SPItem *item, Geom::Point const &p, guint state, bool left = true);
49 friend void PB::bisector_end_set(SPItem *item, Geom::Point const &p, guint state, bool left);
59 Geom::Point C; // left end of bisector
H A Dlpe-dynastroke.cpp59 capping(_("Capping:"), _("left capping"), "capping", &wr, this, "M 100,5 C 50,5 0,0 0,0 0,0 50,-5 100,-5")
112 Piecewise<D2<SBasis> > left = m + k*n;
116 line[X] = Linear(left.lastValue()[X],right.firstValue()[X]);
117 line[Y] = Linear(left.lastValue()[Y],right.firstValue()[Y]);
118 output = left;
121 line[X] = Linear(right.lastValue()[X],left.firstValue()[X]);
122 line[Y] = Linear(right.lastValue()[Y],left.firstValue()[Y]);
194 Piecewise<D2<SBasis> > left, right; local
198 left = m + n1;//+ n;
238 left
[all...]
H A Dlpe-perp_bisector.cpp34 void bisector_end_set(Geom::Point const &p, guint state, bool left = true);
64 KnotHolderEntityEnd::bisector_end_set(Geom::Point const &p, guint state, bool left) { argument
71 if (left) {
97 length_left(_("Length left:"), _("Specifies the left end of the bisector"), "length-left", &wr, this, 200),
159 _("Adjust the \"left\" end of the bisector") );
/inkscape/doc/
H A Dkeys.css32 padding-left: 40px;
42 padding-left: 60px;
54 padding-left: 40px;
93 padding-left: 40px;
101 margin-left:40px;
103 padding-left: 20px;
175 padding-left: 10px;
179 padding-left: 80px;
191 border-left: 1px solid #999999;
192 padding-left
[all...]
/inkscape/src/libavoid/
H A Dvpsc.cpp67 c->left->out.push_back(c);
126 Variable *l=(*c)->left;
177 Block *l=c->left->block;
263 Block *lb = v->left->block, *rb = v->right->block;
267 if(lb->isActiveDirectedPathBetween(v->right,v->left)) {
272 //lb->getActiveDirectedPathBetween(e.path,v->right,v->left);
282 =lb->splitBetween(v->left,v->right,lb,rb);
371 Block *b = v->left->block, *l=NULL, *r=NULL;
372 COLA_ASSERT(v->left->block == v->right->block);
495 * neighbouring (left) bloc
1214 Constraint(Variable *left, Variable *right, double gap, bool equality) argument
[all...]
/inkscape/src/libcola/
H A Dgradient_projection.h19 : left(l), right(r), gap(g) {}
20 unsigned left; member in class:SimpleConstraint
77 * leftof: variables to which left must be to the left of,
89 left(NULL),
97 CList leftof; // variables to which left dummy var must be to the left of
119 left = new vpsc::Variable(vars.size(),place_l,weight);
120 vars.push_back(left);
126 cs.push_back(new vpsc::Constraint(left,
183 vpsc::Variable* left; // Variables used in constraints member in class:DummyVarPair
[all...]
/inkscape/src/2geom/
H A Dbezier.h75 * @param left Output polynomial corresponding to \f$[0, t]\f$
80 inline T casteljau_subdivision(double t, T const *v, T *left, T *right, unsigned order) { argument
85 if (!left && !right) {
90 if (left != v) {
91 std::copy(v, v + order + 1, left);
95 left[j] = lerp(t, left[j-1], left[j]);
98 left[order] = val;
99 return left[orde
[all...]
H A Drect.cpp133 if ( p[X] < rect.left() ) {
134 dx = p[X] - rect.left();
152 if ( p[X] < rect.left() ) {
153 dx = p[X] - rect.left();
/inkscape/src/extension/internal/
H A Dgimpgrad.cpp109 a left possition, right possition and middle possition. SVG gradients
111 left and right colors are averaged in a linear manner and the middle
121 of the previous segment is the same color as the left side of the
202 double const left = dbls[0]; local
203 if (left != prev_right) {
207 if (!(left <= middle)) {
233 outsvg += stop_svg(leftcolor, left);
235 if (fabs(middle - .5 * (left + right)) > 1e-4) {
/inkscape/src/libdepixelize/priv/
H A Dpixelgraph.h53 adj.left,
70 unsigned left: 1; member in struct:Tracer::PixelGraph::Node::Adj
273 // pixels are stored from left to right. There may be padding at the end of
306 dest->adj.left = 0;
328 dest->adj.left = 0;
349 assert((it + 1)->adj.left);
356 if ( it->adj.left )
382 it->adj.left = 1;
404 it->adj.left = 1;
411 it->adj.left
[all...]
/inkscape/src/trace/
H A Dsiox.cpp1159 unsigned int left = leftBase;
1167 point = points[left];
1170 left++;
1180 if (left > right)
1183 point = points[left];
1184 points[left] = points[right];
1187 left++;
1192 colorSignatureStage1(points, leftBase, left,
1194 colorSignatureStage1(points, left, rightBase,
1248 unsigned int left
[all...]
/inkscape/src/display/
H A Ddrawing-context.h66 cairo_rectangle(_ct, r.left(), r.top(), r.width(), r.height());
69 cairo_rectangle(_ct, r.left(), r.top(), r.width(), r.height());
73 cairo_move_to ( _ct, r.left(), r.top() );
80 cairo_move_to ( _ct, r.left(), r.top() );
H A Dsp-ctrlcurve.cpp89 cairo_move_to (buf->ct, p0[Geom::X] - buf->rect.left(), p0[Geom::Y] - buf->rect.top());
91 p1[Geom::X] - buf->rect.left(), p1[Geom::Y] - buf->rect.top(),
92 p2[Geom::X] - buf->rect.left(), p2[Geom::Y] - buf->rect.top(),
93 p3[Geom::X] - buf->rect.left(), p3[Geom::Y] - buf->rect.top() );
H A Dsp-ctrlline.cpp91 cairo_move_to(buf->ct, s[Geom::X] - buf->rect.left(), s[Geom::Y] - buf->rect.top());
92 cairo_line_to(buf->ct, e[Geom::X] - buf->rect.left(), e[Geom::Y] - buf->rect.top());
101 cairo_move_to(buf->ct, s[Geom::X] - buf->rect.left(), s[Geom::Y] - buf->rect.top());
102 cairo_line_to(buf->ct, e[Geom::X] - buf->rect.left(), e[Geom::Y] - buf->rect.top());
H A Dguideline.cpp86 cairo_translate(buf->ct, -buf->rect.left(), -buf->rect.top());
114 cairo_move_to(buf->ct, buf->rect.left() + 0.5, position + 0.5);
121 //try to intersect with left vertical of rect
122 double y_intersect_left = (buf->rect.left() - point_on_line_dt[Geom::X]) * parallel_to_line[Geom::Y] / parallel_to_line[Geom::X] + point_on_line_dt[Geom::Y];
124 // intersects with left vertical!
126 sp_guideline_drawline (buf, buf->rect.left(), static_cast<gint>(round(y_intersect_left)), buf->rect.right(), static_cast<gint>(round(y_intersect_right)), gl->rgba);
134 sp_guideline_drawline (buf, buf->rect.right(), static_cast<gint>(round(y_intersect_right)), buf->rect.left(), static_cast<gint>(round(y_intersect_left)), gl->rgba);
140 if ( (x_intersect_top >= buf->rect.left()) && (x_intersect_top <= buf->rect.right()) ) {
149 if ( (x_intersect_top >= buf->rect.left()) && (x_intersect_top <= buf->rect.right()) ) {

Completed in 33 milliseconds

1234