Searched refs:st (Results 1 - 25 of 39) sorted by relevance

12

/inkscape/src/livarot/
H A Dint-line.cpp155 printf("(%i %f -> %i %f) ", runs[i].st, runs[i].vst, runs[i].en, runs[i].ven); // localization ok
160 int IntLigne::AddRun(int st, int en, float vst, float ven) argument
162 if ( st >= en ) {
172 runs[n].st = st;
202 int curPos = (a->runs[0].st < b->runs[0].st) ? a->runs[0].st : b->runs[0].st;
206 if ( curPos == a->runs[0].st ) {
[all...]
H A DBitLigne.h24 int st,en; member in class:BitLigne
H A Dfloat-line.cpp558 runs[i].st, runs[i].vst, runs[i].en, runs[i].ven, runs[i].pente); // localization ok
565 int FloatLigne::AddRun(float st, float en, float vst, float ven) argument
567 return AddRun(st, en, vst, ven, (ven - vst) / (en - st));
571 int FloatLigne::AddRun(float st, float en, float vst, float ven, float pente) argument
573 if ( st >= en ) {
579 r.st = st;
611 runs[i].st = a->runs[i].st;
[all...]
H A DShape.cpp65 printf("ar %u : dx=(%f %f) st=%i en=%i\n",i, _aretes[i].dx[0], _aretes[i].dx[1], _aretes[i].st, _aretes[i].en); // localizing ok
370 if (getEdge(cb).st == p)
374 _aretes[cb].st = -1;
403 if (getEdge(cb).st == a)
405 _aretes[cb].st = numberOfPoints();
412 if (getEdge(cb).st == a)
414 _aretes[cb].st = numberOfPoints();
422 if (getEdge(cb).st == b)
424 _aretes[cb].st
1121 AddEdge(int st, int en) argument
1185 AddEdge(int st, int en, int leF, int riF) argument
[all...]
H A Dfloat-line.h16 float st; member in struct:float_ligne_run
20 float pente; ///< (ven-vst)/(en-st)
41 float pente; ///< (ven-vst)/(en-st)
58 position on the (pixel) line: st en
113 int AddRun(float st, float en, float vst, float ven, float pente);
117 int AddRun(float st, float en, float vst, float ven);
H A Dint-line.h15 int st; member in struct:int_ligne_run
61 int AddRun(int st, int en, float vst, float ven);
H A DAlphaLigne.h67 void AddRun(int st,float pente);
H A DBitLigne.cpp24 st=ist;
26 if ( en <= st ) en=st+1;
27 stBit=(int)floor(((float)st)*invScale); // round to pixel boundaries in the canvas
40 curMax=st;
51 curMax=st+1;
H A Dsweep-tree.cpp45 if (src->getEdge(bord).st < src->getEdge(bord).en) {
85 bOrig = src->pData[src->getEdge(bord).st].rx;
87 if (src->getEdge(bord).st > src->getEdge(bord).en) {
112 if (newOne->src->getEdge(newOne->bord).st >
171 bOrig = src->pData[src->getEdge(bord).st].rx;
173 if (src->getEdge(bord).st > src->getEdge(bord).en)
329 if (src->getEdge(bord).st > src->getEdge(bord).en)
340 if (insNode->src->getEdge(insNode->bord).st >
363 if (insertL->src->getEdge(insertL->bord).st != fromPt
371 int ils = insertL->src->getEdge(insertL->bord).st;
[all...]
H A DShapeMisc.cpp57 eData[i].rdx = pData[getEdge(i).en].rx - pData[getEdge(i).st].rx;
93 while (bestB >= 0 && getEdge(bestB).st != fi)
131 while (swdData[nb].misc != 0 || getEdge(nb).st != cPt);
207 eData[i].rdx = pData[getEdge(i).en].rx - pData[getEdge(i).st].rx;
235 while (bestB >= 0 && getEdge(bestB).st != fi)
252 int curStartPt=getEdge(curBord).st;
271 while (swdData[nb].misc != 0 || getEdge(nb).st != cPt);
302 curStartPt=getEdge(nb).st;
360 eData[i].rdx = pData[getEdge(i).en].rx - pData[getEdge(i).st].rx;
403 while (bestB >= 0 && getEdge(bestB).st !
[all...]
H A DShapeSweep.cpp114 eData[i].rdx = pData[getEdge(i).en].rx - pData[getEdge(i).st].rx;
281 if (chgts[i].src->getEdge(chgts[i].bord).st <
295 if (chgts[i].src->getEdge(chgts[i].bord).st >
360 if ((ptSh->getEdge(cb).st < ptSh->getEdge(cb).en
362 || (ptSh->getEdge(cb).st > ptSh->getEdge(cb).en
363 && nPt == ptSh->getEdge(cb).st))
368 if ((ptSh->getEdge(cb).st > ptSh->getEdge(cb).en
370 || (ptSh->getEdge(cb).st < ptSh->getEdge(cb).en
371 && nPt == ptSh->getEdge(cb).st))
395 if ((ptSh->getEdge(cb).st < ptS
2111 AssemblePoints(int st, int en) argument
[all...]
H A DShapeRaster.cpp59 eData[i].rdx=pData[getEdge(i).en].rx - pData[getEdge(i).st].rx;
100 eData[i].rdx = pData[getEdge(i).en].rx - pData[getEdge(i).st].rx;
173 if ( (d == DOWNWARDS && nPt == std::max(e.st, e.en)) ||
174 (d == UPWARDS && nPt == std::min(e.st, e.en)) )
237 if ( nPt == std::min(e.st, e.en) ) {
315 if ( (d == DOWNWARDS && nPt == std::max(e.st, e.en)) ||
316 (d == UPWARDS && nPt == std::min(e.st, e.en)) )
341 if ( (d == DOWNWARDS && nPt == std::min(e.st, e.en)) ||
342 (d == UPWARDS && nPt == std::max(e.st, e.en)) )
639 if ( ( e.st < curP
[all...]
H A DShape.h74 double leStX, leStY, riStX, riStY; // on the left side: (leStX,leStY) is the smallest vector from the source to st
139 // add an edge between points of indices st and en
140 int AddEdge(int st, int en);
143 // add an edge between points of indices st and en
144 int AddEdge(int st, int en, int leF, int riF);
158 if (getEdge(b).st == p) {
161 return getEdge(b).st;
167 if (p == getEdge(b).st) {
180 if (p == getEdge(b).st) {
193 if (p == getEdge(b).st) {
357 int st, en; // start and end points of the edge member in struct:Shape::dg_arete
[all...]
H A DShapeDraw.cpp71 int stP=getEdge(i).st;
89 int stP=getEdge(i).st;
H A DPathConversion.cpp996 double tresh, int lev, double st, double et, int piece)
1020 double mt = (st + et) / 2;
1025 RecCubicTo(iS, hisD, m, md, tresh, lev - 1, st, mt, piece);
1036 double tresh, int lev, double st, double et, int piece)
1050 const double mt = (st + et) / 2;
1052 RecBezierTo(0.5 * (iS + iP), iS, m, tresh, lev - 1, st, mt, piece);
1115 double tresh, int lev, double st, double et,
1148 orig.orig->PointAndTangentAt(orig.piece, orig.tSt * (1 - st) + orig.tEn * st, os_pos, os_tgt);
1166 AddPoint(iS, piece, st);
994 RecCubicTo(Geom::Point const &iS, Geom::Point const &isD, Geom::Point const &iE, Geom::Point const &ieD, double tresh, int lev, double st, double et, int piece) argument
1033 RecBezierTo(Geom::Point const &iP, Geom::Point const &iS, Geom::Point const &iE, double tresh, int lev, double st, double et, int piece) argument
1113 RecCubicTo(Geom::Point const &iS, Geom::Point const &isD, Geom::Point const &iE, Geom::Point const &ieD, double tresh, int lev, double st, double et, int piece, offset_orig &orig) argument
1195 RecBezierTo(Geom::Point const &iP, Geom::Point const &iS,Geom::Point const &iE, double tresh, int lev, double st, double et, int piece, offset_orig& orig) argument
[all...]
/inkscape/src/libnrtype/
H A DTextWrapper.h99 bool NextChar(int &st, int &en) const;
100 bool NextWord(int &st, int &en) const;
101 bool NextPara(int &st, int &en) const;
H A DTextWrapper.cpp581 * \a st and \en are start and end glyph indices.
586 bool text_wrapper::NextChar(int &st, int &en) const argument
588 if ( st < 0 || en < 0 ) {st = 0; en = 0;}
589 if ( st >= en ) en = st;
590 if ( st >= glyph_length || en >= glyph_length ) return false; // finished
591 st = en;
597 bool text_wrapper::NextWord(int &st, int &en) const argument
599 if ( st <
608 NextPara(int &st, int &en) const argument
[all...]
H A DLayout-TNG-Scanline-Makers.cpp148 result[0].x_start = line_rasterization.runs[0].st;
149 result[0].x_end = line_rasterization.runs[0].st;
157 result[i].x_start = line_decent_length_runs.runs[i].st;
/inkscape/share/extensions/
H A Ddraw_from_triangle.py318 st = Style(so)#style for dots, lines and circles
362 draw_SVG_circle(0, pt, params, st, 'Circumcentre', layer)
364 draw_SVG_circle(r, pt, params, st, 'Circumcircle', layer)
369 draw_SVG_circle(0, pt, params, st, 'Incentre', layer)
372 draw_SVG_circle(r, pt, params, st, 'Incircle', layer)
379 draw_SVG_tri(v_mat, params, st,'ContactTriangle',layer)
386 draw_SVG_tri(v_mat, params, st,'ExtouchTriangle',layer)
390 draw_SVG_circle(0, pt, params, st, 'Orthocentre', layer)
394 draw_SVG_tri(v_mat, params, st,'OrthicTriangle',layer)
398 draw_SVG_circle(0, pt, params, st, 'Centroi
[all...]
H A Dpolyhedron_3d.py141 def draw_SVG_dot((cx, cy), st, name, parent):
142 style = { 'stroke': '#000000', 'stroke-width':str(st.th), 'fill': st.fill, 'stroke-opacity':st.s_opac, 'fill-opacity':st.f_opac}
145 'r':str(st.r),
149 def draw_SVG_line((x1, y1),(x2, y2), st, name, parent):
150 style = { 'stroke': '#000000', 'stroke-width':str(st.th), 'stroke-linecap':st.linecap}
156 def draw_SVG_poly(pts, face, st, nam
[all...]
H A Dmerge_styles.py121 for (st, el) in common.all_matches():
122 st.remove(common.keys())
123 el.attrib['style'] = st.to_str("")
H A Dgcodetools.py1674 def __init__(self,st,end,c,a):
1675 self.st = P(st)
1678 self.r = (P(st)-P(c)).mag()
1679 self.a = ( (self.st-self.c).angle() - (self.end-self.c).angle() ) % math.pi2
1689 self.st = self.c + (self.st-self.c)*r/self.r
1698 st = P(gcodetools.transform(self.st.to_list(), layer, True))
1701 r = (st
[all...]
/inkscape/src/display/
H A Dnr-filter-turbulence.h54 void set_stitchTiles(bool st);
/inkscape/src/io/
H A Dsys.cpp229 struct stat st; local
231 if (g_lstat (filename, &st) == 0) {
232 success = ((st.st_mode & S_IWRITE) != 0);
/inkscape/src/
H A Dinkview.cpp236 struct stat st; local
237 if (stat (argv[i], &st)
238 || !S_ISREG (st.st_mode)
239 || (st.st_size < 64)) {

Completed in 182 milliseconds

12