Searched defs:en (Results 1 - 8 of 8) sorted by relevance

/inkscape/src/livarot/
H A DBitLigne.h24 int st,en; member in class:BitLigne
H A Dfloat-line.h17 float en; 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.h16 int en; 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 ) {
580 r.en = en;
612 runs[i].en = a->runs[i].en;
[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
377 else if (getEdge(cb).en == p)
381 _aretes[cb].en = -1;
407 else if (getEdge(cb).en == a)
409 _aretes[cb].en = numberOfPoints();
416 else if (getEdge(cb).en == a)
418 _aretes[cb].en = numberOfPoints();
426 else if (getEdge(cb).en == b)
428 _aretes[cb].en
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 ) {
173 runs[n].en = en;
216 const bool inA = ( curPos >= runA.st && curPos < runA.en );
217 const bool inB = ( curPos >= runB.st && curPos < runB.en );
230 startA = runA.st <= runB.en;
231 endB = runA.st >= runB.en;
232 nextPos = startA ? runA.st : runB.en;
[all...]
H A DShape.h139 // 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);
159 return getEdge(b).en;
170 else if (p == getEdge(b).en) {
183 else if (p == getEdge(b).en) {
198 } else if (p == getEdge(b).en) {
217 } else if (p == getEdge(b).en) {
357 int st, en; // star member in struct:Shape::dg_arete
[all...]
H A DShapeSweep.cpp114 eData[i].rdx = pData[getEdge(i).en].rx - pData[getEdge(i).st].rx;
282 chgts[i].src->getEdge(chgts[i].bord).en)
296 chgts[i].src->getEdge(chgts[i].bord).en)
360 if ((ptSh->getEdge(cb).st < ptSh->getEdge(cb).en
361 && nPt == ptSh->getEdge(cb).en)
362 || (ptSh->getEdge(cb).st > ptSh->getEdge(cb).en
368 if ((ptSh->getEdge(cb).st > ptSh->getEdge(cb).en
369 && nPt == ptSh->getEdge(cb).en)
370 || (ptSh->getEdge(cb).st < ptSh->getEdge(cb).en
395 if ((ptSh->getEdge(cb).st < ptSh->getEdge(cb).en
2111 AssemblePoints(int st, int en) argument
[all...]

Completed in 53 milliseconds