Searched defs:left (Results 1 - 25 of 26) sorted by relevance

12

/inkscape/src/libvpsc/
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 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 Dgenerate-constraints.cpp65 void setNeighbours(NodeSet *left, NodeSet *right) { argument
66 leftNeighbours=left;
68 for(NodeSet::iterator i=left->begin();i!=left->end();++i) {
/inkscape/share/extensions/
H A Dpturtle.py37 def left(self,deg): member in class:pTurtle
78 lt = 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) {
H A Dtext_reassemble.h91 #define ALILEFT 0x01 /**< text object horizontal alignment = left */
104 #define LDIR_LR 0x00 /**< left to right */
105 #define LDIR_RL 0x01 /**< right to left */
124 TR_PARA_LJ, /**< ditto, left justified */
214 double xll; /**< x rectangle lower left corner */
293 double left; /**< to left */ member in struct:__anon78
320 void TR_rt_pad_set(RT_PAD *rt_pad, double up, double down, double left, double right);
H A Dwmf-inout.cpp910 tmp -= d->ulCornerOutX; //The WMF boundary rectangle can be anywhere, place its upper left corner in the Inkscape upper left corner
920 tmp -= d->ulCornerOutY; //The WMF boundary rectangle can be anywhere, place its upper left corner in the Inkscape upper left corner
1526 double left, right, top, bottom; // values used, because a bounding rect can have values reversed L<->R, T<->B local
1594 if(!Placeable.Dst.right && !Placeable.Dst.left){ // no page size has been supplied
1598 Placeable.Dst.left = 0;
1630 d->PixelsInX = Placeable.Dst.right - Placeable.Dst.left + 1;
1639 /* Upper left corner in device units, usually both 0, but not always.
1643 d->ulCornerInX = Placeable.Dst.left;
[all...]
H A Dtext_reassemble.c32 NOTE ON COORDINATES: x is positive to the right, y is positive down. So (0,0) is the upper left corner, and the
33 lower left corner of a rectangle has a LARGER Y coordinate than the upper left. Ie, LL=(10,10) UR=(30,5) is typical.
1353 ((br_dst->xur + rp_dst->right) < (br_src->xll - rp_src->left) ) || /* dst fully to the left */
1354 ((br_dst->xll - rp_dst->left) > (br_src->xur + rp_src->right) ) || /* dst fully to the right */
1368 (br_src->xur <= br_dst->xll + rp_dst->left) /* src overlaps just a little on the left (R->L language) */
1379 (br_dst->xll - rp_dst->left ),
1383 (br_src->xll - rp_src->left ),
1904 TR_rt_pad_set(RT_PAD *rt_pad, double up, double down, double left, double right) argument
[all...]
/inkscape/src/live_effects/
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/src/2geom/
H A Dbezier.cpp72 void Bezier::subdivide(Coord t, Bezier *left, Bezier *right) const argument
74 if (left) {
75 left->c_.resize(size());
79 &left->c_[0], &right->c_[0], order());
82 &left->c_[0], NULL, order());
H A Dconvex-hull.h181 Coord left() const { return _boundary[0][X]; } function in class:Geom::ConvexHull
199 /// If the bottommost edge is horizontal, the left point of the edge is returned.
H A Drecursive-bezier-intersection.cpp80 void OldBezier::split(double t, OldBezier &left, OldBezier &right) const { argument
97 left.p.resize(sz);
100 left.p[j] = Vtemp[j][0];
189 * If either of the curves has subdivisions left before it is straight
199 * If neither curve has subdivisions left, the line segments from the first
H A Dbasic-intersection.cpp112 vector<Point> &left, vector<Point> &right) {
129 left.resize(sz);
132 left[j] = Vtemp[j][0];
111 split(vector<Point> const &p, double t, vector<Point> &left, vector<Point> &right) argument
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 Dsbasis-roots.cpp312 //we do not want to count it twice (from the left and from the right)
327 \param a, b left and right bounds
570 double left, double right) {
576 roots.push_back(left*(1-t) + t*right);
579 double middle = (left + right)/2;
580 subdiv_sbasis(compose(s, Linear(0, 0.5)), roots, left, middle); local
568 subdiv_sbasis(SBasis const & s, std::vector<double> & roots, double left, double right) argument
H A Dgeneric-rect.h142 * In 2Geom standard coordinate system, this means upper left. */
151 * the upper left. */
167 C left() const { return f[X].min(); } function in class:Geom::GenericRect
260 /** @brief Set the upper left point of the rectangle. */
/inkscape/src/libavoid/
H A Dvpsc.h172 Variable *left; member in class:Avoid::Constraint
176 Constraint(Variable *left, Variable *right, double gap, bool equality=false);
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/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/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/ui/widget/
H A Dcolor-icc-selector.cpp87 void attachToGridOrTable(GtkWidget *parent, GtkWidget *child, guint left, guint top, guint width, guint height, argument
108 gtk_grid_attach(GTK_GRID(parent), child, left, top, width, height); local
114 gtk_table_attach(GTK_TABLE(parent), child, left, left + width, top, top + height, xoptions, yoptions, xpadding,
/inkscape/src/util/
H A Dziptool.cpp376 int left = 1; // number of possible codes left of current length local
379 left <<= 1; // one more bit, double codes left
380 left -= h->count[len]; // deduct count from possible codes
381 if (left < 0)
403 return left;
441 int left = bitCnt; local
449 while (left--)
466 left
[all...]
/inkscape/src/libuemf/
H A Duwmf.c750 rclBox.left = rclBox16.left;
762 \brief A U_RECT16 may have its values swapped, L<->R and T<->B, this extracts the leftmost as left, and so forth.
764 \param left the leftmost of rc.left and rc.right
766 \param right the rightmost of rc.left and rc.right
769 void U_sanerect16(U_RECT16 rc, double *left, double *top, double *right, double *bottom){ argument
770 if(rc.left < rc.right) { *left = rc.left; *righ
[all...]
H A Duwmf.h833 \brief Coordinates of the upper left, lower right corner.
834 Note that the coordinate system is 0,0 in the upper left corner
841 int16_t left; //!< left coordinate member in struct:__anon343
1056 uint16_t ScanLines[1]; //!< Array of 16 bit left/right pairs
2101 void U_sanerect16(U_RECT16 rc, double *left, double *top, double *right, double *bottom);

Completed in 3668 milliseconds

12