Searched defs:st (Results 1 - 18 of 18) sorted by relevance

/inkscape/src/livarot/
H A DBitLigne.h24 int st,en; member in class:BitLigne
H A DAlphaLigne.cpp251 void AlphaLigne::AddRun(int st,float pente) argument
258 steps[nStep].x=st;
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 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 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...]
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 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 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 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...]
/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)) {
H A Dsp-image.cpp799 struct stat st; local
800 memset(&st, 0, sizeof(st));
803 val = g_stat(image->pixbuf->originalPath().c_str(), &st);
807 if ( st.st_mtime != image->pixbuf->modificationTime() ) {
H A Dcolor-profile.cpp775 struct stat st; local
776 if ( g_stat(filepath, &st) == 0 && (st.st_size > 128) ) {
788 if ( calcSize > 128 && calcSize <= static_cast<size_t>(st.st_size) ) {
/inkscape/src/display/
H A Dnr-filter-turbulence.cpp357 void FilterTurbulence::set_stitchTiles(bool st){ argument
358 stitchTiles = st;
/inkscape/src/libnrtype/
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...]
/inkscape/src/widgets/
H A Dicon.cpp458 GStatBuf st; local
459 memset(&st, 0, sizeof(st));
460 if ( !g_stat(it->c_str(), &st) ) {
461 unsigned long when = st.st_mtime;
494 GStatBuf st; local
495 memset(&st, 0, sizeof(st));
496 if ( !g_stat(fullpath.c_str(), &st) ) {
497 unsigned long when = st
[all...]
/inkscape/src/libuemf/
H A Duemf.c1073 \param st start top position in the pixel array in the record to start extracting
1082 int st,
1095 if(sl>w || st >h)return(NULL); // This is hopeless, the start point is outside of the array.
1101 if(st<0){
1102 if(st+eh<=0)return(NULL); // This is hopeless, the start point is outside of the array.
1103 eh += st;
1104 st = 0;
1107 if(st+eh > h)eh=h-st;
1108 if(!sl && !st
1077 RGBA_to_RGBA( char *rgba_px, int w, int h, int sl, int st, int *eew, int *eeh ) argument
[all...]

Completed in 223 milliseconds