/inkscape/src/display/ |
H A D | nr-filter-offset.h | 37 double dx, dy; member in class:Inkscape::Filters::FilterOffset
|
H A D | nr-filter-convolve-matrix.h | 55 int dx, dy, kernelUnitLength; member in class:Inkscape::Filters::FilterConvolveMatrix
|
H A D | nr-filter-flood.cpp | 89 double dx = fp_cairo.min()[Geom::X] - sa.min()[Geom::X]; local 91 if( dx < 0.0 ) dx = 0.0; 97 cairo_rectangle(ct, dx, dy, overlap.width(), overlap.height() );
|
H A D | nr-filter-component-transfer.cpp | 81 guint32 dx = k % 255; k /= 255; local 82 component = _v[k]*255 + (_v[k+1] - _v[k])*dx;
|
H A D | drawing-context.h | 54 void translate(double dx, double dy) { cairo_translate(_ct, dx, dy); } argument
|
H A D | nr-filter-gaussian.cpp | 572 double dx = _deviation_x; local 577 dx *= (*bbox).width(); 584 double deviation_x_orig = dx * trans.expansionX();
|
/inkscape/src/filters/ |
H A D | offset.h | 25 double dx, dy; member in class:SPFeOffset
|
/inkscape/src/ |
H A D | sp-radial-gradient.cpp | 181 double dx = d_user.x(), dy = d_user.y(); local 182 cairo_user_to_device_distance(ct, &dx, &dy); 187 double dl = hypot(dx, dy); 188 double tx = tolerance * dx / dl, ty = tolerance * dy / dl;
|
H A D | sp-ellipse.cpp | 193 double const dx = viewbox.width(); local 195 double const dr = hypot(dx, dy) / sqrt(2); 199 this->cx.update(em, ex, dx);
|
/inkscape/src/2geom/ |
H A D | rect.cpp | 132 double dx = 0, dy = 0; local 134 dx = p[X] - rect.left(); 136 dx = rect.right() - p[X]; 143 return dx*dx+dy*dy; 151 double dx = 0, dy = 0; local 153 dx = p[X] - rect.left(); 155 dx = rect.right() - p[X]; 162 return hypot(dx, dy);
|
H A D | circle.cpp | 167 Coord dx = l.vector().x(); local 176 Coord iy = (-D*dx) / (dr*dr); 185 Coord i1x = (D*dy + signmod * dx * sqrt_delta) / (dr*dr); 186 Coord i1y = (-D*dx + fabs(dy) * sqrt_delta) / (dr*dr); 189 Coord i2x = (D*dy - signmod * dx * sqrt_delta) / (dr*dr); 190 Coord i2y = (-D*dx - fabs(dy) * sqrt_delta) / (dr*dr);
|
H A D | bezier-curve.cpp | 276 double dx = inner[X][1] - inner[X][0], dy = inner[Y][1] - inner[Y][0]; local 277 return new BezierCurveN<1>(Point(dx,dy),Point(dx,dy));
|
H A D | basic-intersection.cpp | 248 Geom::Point dx = ((struct rparams *) params)->A(x0) - local 251 gsl_vector_set (f, 0, dx[0]); 252 gsl_vector_set (f, 1, dx[1]);
|
H A D | path-intersection.cpp | 145 Geom::Point dx = ((struct rparams *) params)->A(x0) - local 148 gsl_vector_set (f, 0, dx[0]); 149 gsl_vector_set (f, 1, dx[1]); 417 bool dx = p[i].initialPoint()[X] > (spl.empty()? p[i].finalPoint()[X] : local 422 if(dx != pdx || dy != pdy) { 424 pdx = dx; pdy = dy;
|
/inkscape/src/libdepixelize/priv/ |
H A D | optimization-kopf2011.h | 56 T dx[2]; variable 62 dx[0] = points[1].x - points[0].x; 63 dx[1] = points[3].x - points[2].x; 65 m[0] = dy[0] / dx[0]; 66 m[1] = dy[1] / dx[1]; 68 // It's easier to have a unified logic, then we'll fake dx and dy 72 dx[0] = points[1].y - points[0].y; 73 dx[1] = points[3].y - points[2].y; 75 m[0] = dy[0] / dx[0]; 76 m[1] = dy[1] / dx[ [all...] |
H A D | simplifiedvoronoi.h | 125 typedef void (*PointTransform)(Point<T> &p, T dx, T dy); 158 static void _complexTopLeftTransform(Point<T> &p, T dx, T dy); 159 static void _complexTopRightTransform(Point<T> &p, T dx, T dy); 160 static void _complexBottomRightTransform(Point<T> &p, T dx, T dy); 161 static void _complexBottomLeftTransform(Point<T> &p, T dx, T dy); 621 ::_complexTopLeftTransform(Point<T> &p, T dx, T dy) argument 623 p.x -= dx; 629 ::_complexTopRightTransform(Point<T> &p, T dx, T dy) argument 632 p.y -= dx; 637 ::_complexBottomRightTransform(Point<T> &p, T dx, argument 645 _complexBottomLeftTransform(Point<T> &p, T dx, T dy) argument [all...] |
/inkscape/src/ui/cache/ |
H A D | svg_preview_cache.cpp | 48 int dx = psize; local 50 dx = (dx - width)/2; // watch out for size, since 'unsigned'-'signed' can cause problems if the result is negative 54 ibox.min() - Geom::IntPoint(dx, dy), Geom::IntPoint(psize, psize));
|
/inkscape/src/extension/internal/pdfinput/ |
H A D | svg-builder.h | 75 double dx; // X advance value member in struct:Inkscape::Extension::Internal::SvgGlyph 142 double dx, double dy,
|
/inkscape/src/libcola/ |
H A D | cola.cpp | 15 double dx = gpx->dummy_vars[i]->place_r - gpx->dummy_vars[i]->place_l, local 17 return sqrt(dx*dx + dy*dy);
|
H A D | straightener.cpp | 37 double dx=bx-ax; local 40 if(fabs(dx)<0.0001&&fabs(dy)<0.0001) { 45 if(fabs(dx)<0.0001) { 51 tx=(px-ax)/dx;
|
/inkscape/src/live_effects/ |
H A D | lpe-powerstroke-interpolators.h | 121 Point dx = Point(p1[X] - p0[X], 0); local 122 fit.appendNew<CubicBezier>(p0+_beta*dx, p1-_beta*dx, p1); 153 Point dx = Point(p1[X] - p0[X], 0); local 155 fit.appendNew<CubicBezier>(p0, p1-0.75*dx, p1); 157 fit.appendNew<CubicBezier>(p0+0.75*dx, p1, p1); 159 fit.appendNew<CubicBezier>(p0+_beta*dx, p1-_beta*dx, p1);
|
H A D | lpe-rough-hatches.cpp | 95 Piecewise<SBasis> const &dx){ 103 lc.sign = ( dx.valueAt(times[i][j])>0 ); 381 Piecewise<SBasis> dx = derivative(x); local 405 LevelsCrossings lscs(times,f,dx); 93 LevelsCrossings(std::vector<std::vector<double> > const ×, Piecewise<D2<SBasis> > const &f, Piecewise<SBasis> const &dx) argument
|
/inkscape/src/trace/ |
H A D | quantize.cpp | 445 int dx = x2 - x1, dy = y2 - y1; local 446 int xm = x1 + dx/2, ym = y1 + dy/2; 449 if (dx == 1 && dy == 1) 451 else if (dx > dy)
|
/inkscape/src/libnrtype/ |
H A D | TextWrapper.cpp | 133 // remember where the text ended, before we recompute it, for the dx/dy we'll add after that (if any) 177 // if needed, fill the dx/dy arrays with 0 for the newly created part 179 // note that the SVG spec doesn't require you to give a dx for each codepoint, 180 // so setting the dx to 0 is mandatory 558 void text_wrapper::AddLetterSpacing(double dx, double dy, int g_st, int g_en) argument 567 // letterspacing means: add 'dx * (nbLetter - 1)' to the x position 571 glyph_text[i].x += dx * nbLetter; 575 glyph_text[g_en].x += dx * nbLetter;
|
/inkscape/src/livarot/ |
H A D | PathConversion.cpp | 122 Geom::Point dx = nData->p; local 123 Geom::Point cx = 2 * bx - dx; 130 cx = dx; 132 dx = nData->p; 144 mx = (cx + dx) / 2; 150 cx = dx; 152 dx = nextX; 153 dx = 2 * dx - cx; 164 mx = (cx + dx) / 323 Geom::Point dx = nData->p; local 562 Geom::Point dx = nData->p; local [all...] |