Searched defs:right (Results 1 - 23 of 23) sorted by relevance

/inkscape/src/libvpsc/
H A Dconstraint.cpp13 Constraint::Constraint(Variable *left, Variable *right, double gap, bool equality) argument
15 right(right),
23 right->in.push_back(this);
31 for(i=right->in.begin(); i!=right->in.end(); ++i) {
34 right->in.erase(i);
42 os<<*c.left<<"+"<<c.gap<<type<<*c.right<<"("<<c.slack()<<")"<<(c.active?"-active":"");
H A Dconstraint.h27 Variable *right; 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(); }
43 ||l->left->block==l->right->block
47 ||r->left->block==r->right->block
52 if(l->right->id<r->right->id) return true;
H A Dgenerate-constraints.cpp65 void setNeighbours(NodeSet *left, NodeSet *right) { argument
67 rightNeighbours=right;
72 for(NodeSet::iterator i=right->begin();i!=right->end();++i) {
95 * Nevertheless, we try to do the right thing here and in
/inkscape/share/extensions/
H A Dpturtle.py35 def right(self,deg): member in class:pTurtle
77 rt = right
/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
120 The one optimization that this plugin makes that if the right side
210 double const right = dbls[2]; local
211 if (!(middle <= right)) {
235 if (fabs(middle - .5 * (left + right)) > 1e-4) {
238 outsvg += stop_svg(rightcolor, right);
241 prev_right = right;
H A Dtext_reassemble.h93 #define ALIRIGHT 0x04 /**< text object horizontal alignment = right */
104 #define LDIR_LR 0x00 /**< left to right */
105 #define LDIR_RL 0x01 /**< right to left */
126 TR_PARA_RJ /**< ditto, right justified */
216 double xur; /**< x upper right corner */
294 double right; /**< to right */ 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.cpp808 // if the stroke is the same as the fill, and the right size not to change the end size of the object, do not do it separately
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
1607 Placeable.Dst.right = Dst.x;
1613 Placeable.Dst.right = round(((double) Placeable.Inch) * 297.0/25.4);
1630 d->PixelsInX = Placeable.Dst.right - Placeable.Dst.left + 1;
2035 tmp_path << "L " << pix_to_xy( d, rc.right, rc.top ) << " ";
2036 tmp_path << "L " << pix_to_xy( d, rc.right, rc.bottom ) << " ";
2054 tmp_path << "L " << pix_to_xy( d, rc.right, rc.top ) << " ";
2055 tmp_path << "L " << pix_to_xy( d, rc.right, r
[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
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 */
1367 (br_src->xll >= br_dst->xur - rp_dst->right) || /* src overlaps just a little on the right (L->R language) */
1381 (br_dst->xur + rp_dst->right),
1385 (br_src->xur + rp_src->right),
1399 (rp_dst->right),
1403 (rp_src->right),
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.cpp113 Piecewise<D2<SBasis> > right = m - k*n;
114 right = compose(right,Linear(right.cuts.back(),right.cuts.front()));
116 line[X] = Linear(left.lastValue()[X],right.firstValue()[X]);
117 line[Y] = Linear(left.lastValue()[Y],right.firstValue()[Y]);
120 output.concat(right);
121 line[X] = Linear(right.lastValue()[X],left.firstValue()[X]);
122 line[Y] = Linear(right
194 Piecewise<D2<SBasis> > left, right; local
[all...]
/inkscape/src/2geom/
H A Dconvex-hull.h183 Coord right() const { return _boundary[_lower-1][X]; } function in class:Geom::ConvexHull
196 /// If the topmost edge is horizontal, the right point of the edge is returned.
H A Dbasic-intersection.cpp112 vector<Point> &left, vector<Point> &right) {
130 right.resize(sz);
134 right[j] = Vtemp[sz-1-j][j];
111 split(vector<Point> const &p, double t, vector<Point> &left, vector<Point> &right) argument
H A Dbezier.h76 * @param right Output polynomial corresponding to \f$[t, 1]\f$
80 inline T casteljau_subdivision(double t, T const *v, T *left, T *right, unsigned order) { argument
85 if (!left && !right) {
89 if (!right) {
102 if (right != v) {
103 std::copy(v, v + order + 1, right);
107 left[i-1] = right[0];
110 right[j-1] = lerp(t, right[j-1], right[
[all...]
H A Dsbasis-roots.cpp62 correct, but do it by putting the sbasis terms in the right spots in the matrix. normal eigenvalue
67 should be able to put the sbasis coeffs directly into a matrix in the right spots so that the
312 //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;
581 subdiv_sbasis(compose(s, Linear(0.5, 1.)), roots, middle, right); local
568 subdiv_sbasis(SBasis const & s, std::vector<double> & roots, double left, double right) argument
H A Dgeneric-rect.h145 * In 2Geom standard coordinate system, this means lower right. */
166 /** @brief Return leftmost coordinate of the rectangle (+X is to the right). */
168 /** @brief Return rightmost coordinate of the rectangle (+X is to the right). */
169 C right() const { return f[X].max(); } function in class:Geom::GenericRect
265 /** @brief Set the lower right point of the rectangle. */
/inkscape/src/libavoid/
H A Dvpsc.h173 Variable *right; member in class:Avoid::Constraint
176 Constraint(Variable *left, Variable *right, double gap, bool equality=false);
H A Dvpsc.cpp68 c->right->in.push_back(c);
131 Variable *r=(*c)->right;
186 Block *r=c->right->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);
372 COLA_ASSERT(v->left->block == v->right->block);
483 if(!c->right->visited) {
484 dfsVisit(c->right, orde
1214 Constraint(Variable *left, Variable *right, double gap, bool equality) argument
[all...]
/inkscape/src/libdepixelize/priv/
H A Dpixelgraph.h49 adj.right,
66 unsigned right: 1; member in struct:Tracer::PixelGraph::Node::Adj
273 // pixels are stored from left to right. There may be padding at the end of
302 dest->adj.right = 0;
324 dest->adj.right = 0;
348 if ( it->adj.right )
357 assert((it - 1)->adj.right);
378 it->adj.right = 1;
400 it->adj.right = 1;
410 it->adj.right
[all...]
H A Dsimplifiedvoronoi.h237 NodeTransform right,
276 // Top-right
279 // Bottom-right
307 // Top-right
310 // Bottom-right
324 // Top-right
327 // Bottom-right
350 // Top-right
353 // Bottom-right
374 // Top-right
881 _genericComplexBottomRight(PixelGraph::const_iterator a_it, PixelGraph::const_iterator b_it, PixelGraph::const_iterator c_it, PixelGraph::const_iterator d_it, Cell *const cells_it, int x, int y, PointTransform transform, NodeTransform, NodeTransform topright, NodeTransform right, NodeTransform bottomright, NodeTransform bottom, NodeTransform bottomleft, NodeTransform, NodeTransform topleft) argument
[all...]
/inkscape/src/libcola/
H A Dgradient_projection.h19 : left(l), right(r), gap(g) {}
21 unsigned right; member in class:SimpleConstraint
78 * rightof: variables to which right must be to the right of.
90 right(NULL),
98 CList rightof; // variables to which right dummy var must be to the right of
121 right = new vpsc::Variable(vars.size(),place_r,weight);
122 vars.push_back(right);
131 cs.push_back(new vpsc::Constraint(v,right,(*ci
184 vpsc::Variable* right; member in class:DummyVarPair
[all...]
/inkscape/src/ui/widget/
H A Dregistered-widget.cpp57 RegisteredCheckButton::RegisteredCheckButton (const Glib::ustring& label, const Glib::ustring& tip, const Glib::ustring& key, Registry& wr, bool right, Inkscape::XML::Node* repr_in, SPDocument *doc_in, char const *active_str, char const *inactive_str) argument
70 set_alignment (right? 1.0 : 0.0, 0.5);
116 RegisteredToggleButton::RegisteredToggleButton (const Glib::ustring& /*label*/, const Glib::ustring& tip, const Glib::ustring& key, Registry& wr, bool right, Inkscape::XML::Node* repr_in, SPDocument *doc_in, char const *active_str, char const *inactive_str) argument
124 set_alignment (right? 1.0 : 0.0, 0.5);
/inkscape/src/libuemf/
H A Duwmf.c752 rclBox.right = rclBox16.right;
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; *right = rc.right; }
771 else { *left = rc.right; *righ
[all...]
H A Duwmf.h833 \brief Coordinates of the upper left, lower right corner.
835 of the screen an N,M in the lower right corner.
843 int16_t right; //!< right 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);
H A Duemf.h368 Recall that EMF coordinates have UL closest to {0,0}, LR is below and to the right of UL and so has LARGER
370 which when viewing the EMF file, would actually be on the BOTTOM of the bounding rectangle. Similarly, left and right
389 #define U_TA_RIGHT 0x02 //!< Reference point is on right edge of bounding rectangle
559 \brief Coordinates of the upper left, lower right corner.
562 of the screen an N,M in the lower right corner.
568 int32_t right; //!< right coordinate member in struct:__anon120
951 #define U_GRADIENT_FILL_RECT_H 0x00000000 //!< Gradient is left to right.
1539 #define U_LAYOUT_LTR 0x00000000 //!< Left to right lsyout.
1541 #define U_LAYOUT_BITMAPORIENTATIONPRESERVED 0x00000008 //!< Do not flip bitmaps if layout is right t
[all...]

Completed in 2304 milliseconds