| /inkscape/src/livarot/ |
| H A D | sweep-event.cpp | 45 int const no = inds[half]; local
46 if (px[1] < events[no].posx[1]
47 || (px[1] == events[no].posx[1] && px[0] < events[no].posx[0]))
50 events[no].ind = curInd;
52 inds[curInd] = no;
129 int const no = inds[half]; local
130 if (px[1] < events[no].posx[1]
131 || (px[1] == events[no].posx[1] && px[0] < events[no]
[all...] |
| H A D | float-line.cpp | 309 void FloatLigne::InsertBord(int no, float /*p*/, int guess) argument
312 if ( no < 0 || no >= int(bords.size()) ) {
317 s_first = s_last = no;
318 bords[no].s_prev = -1;
319 bords[no].s_next = -1;
325 while ( c >= 0 && c < int(bords.size()) && CmpBord(bords[c], bords[no]) < 0 ) {
330 bords[no].s_prev = s_last;
331 bords[s_last].s_next = no;
332 s_last = no;
[all...] |
| H A D | ShapeRaster.cpp | 381 int no = qrsData[oBord].ind; local
382 if ( no >= 0 ) {
383 qrsData[no].bord = nBord;
384 qrsData[no].x = x;
386 qrsData[nBord].ind = no;
389 return no;
396 int no = nbQRas++; local
397 qrsData[no].bord = bord;
398 qrsData[no].x = x;
399 qrsData[bord].ind = no;
504 int no = qrsData[bord].ind; local
1619 CreateEdge(int no, float to, float step) argument
1653 AvanceEdge(int no, float to, bool exact, float step) argument
1685 DestroyEdge(int no, float to, FloatLigne* line) argument
1733 AvanceEdge(int no, float to, FloatLigne *line, bool exact, float step) argument
1782 DestroyEdge(int no, BitLigne *line) argument
1810 AvanceEdge(int no, float to, BitLigne *line, bool exact, float step) argument
1839 DestroyEdge(int no, AlphaLigne* line) argument
1882 AvanceEdge(int no, float to, AlphaLigne *line, bool exact, float step) argument
[all...] |
| H A D | int-line.cpp | 83 int no = firstAc; local
85 while ( no >= 0 ) {
86 int nn = bords[no].other;
87 sum += ValAt(at, bords[nn].pos, bords[no].pos, bords[nn].val, bords[no].val);
88 no = bords[no].next;
958 void IntLigne::Enqueue(int no) argument
961 firstAc = lastAc = no;
962 bords[no]
972 Dequeue(int no) argument
[all...] |
| H A D | Shape.h | 36 * the Shape class (was the Digraph class, as the header says) stores digraphs (no kidding!) of which
264 void ForceToPolygon(); // force the Shape to believe it's a polygon (eulerian+intersection-free+no
265 // duplicate edges+no duplicate points)
450 int no; member in struct:Shape::edge_list
508 void CreateEdge(int no, float to, float step);
509 void AvanceEdge(int no, float to, bool exact, float step);
510 void DestroyEdge(int no, float to, FloatLigne *line);
511 void AvanceEdge(int no, float to, FloatLigne *line, bool exact, float step);
512 void DestroyEdge(int no, BitLigne *line);
513 void AvanceEdge(int no, floa
[all...] |
| H A D | ShapeSweep.cpp | 1999 Shape::CreateIncidence (Shape * a, int no, int nPt) argument
2002 adir = a->eData[no].rdx;
2003 diff = getPoint(nPt).x - a->pData[a->getEdge(no).st].rx;
2005 t *= a->eData[no].ilength;
2006 return PushIncidence (a, no, nPt, t);
2654 Shape::TesteAdjacency (Shape * a, int no, const Geom::Point atx, int nPt, argument
2657 if (nPt == a->swsData[no].stPt || nPt == a->swsData[no].enPt)
2662 ast = a->pData[a->getEdge(no).st].rx;
2663 aen = a->pData[a->getEdge(no)
[all...] |
| /inkscape/src/libnrtype/ |
| H A D | FontInstance.cpp | 400 // character has no visual representation, but is valid (eg whitespace)
569 // there is no specific linethrough information, mock it up from other font fields
612 int no = -1; local
618 no = id_to_no[glyph_id];
621 no = id_to_no[glyph_id];
623 if ( no < 0 ) {
626 Geom::Point rmin(glyphs[no].bbox[0],glyphs[no].bbox[1]);
627 Geom::Point rmax(glyphs[no].bbox[2],glyphs[no]
634 int no = -1; local
651 int no = -1; local
[all...] |
| /inkscape/src/ |
| H A D | sp-namedview.cpp | 71 this->svg_units = unit_table.getUnit("px"); // legacy behavior: if no viewbox present, default to 'px' units
657 SPObject *no = this->document->getObjectByRepr(child); local
658 if ( !SP_IS_OBJECT(no) ) {
662 if (SP_IS_GUIDE(no)) {
663 SPGuide *g = (SPGuide *) no;
1151 * If no default unit is set, "px" is returned
|