Searched defs:lines (Results 1 - 9 of 9) sorted by relevance

/inkscape/share/templates/
H A Di18n.py16 lines = templates[0].getElementsByTagName(element) variable
17 if lines:
18 sys.stdout.write("N_(\"" + lines[0].firstChild.nodeValue + "\"),")
/inkscape/src/
H A Dline-snapper.cpp34 /* Get the lines that we will try to snap to */
35 const LineList lines = _getSnapLines(p.getPoint()); local
37 for (LineList::const_iterator i = lines.begin(); i != lines.end(); ++i) {
105 /* Get the lines that we will try to snap to */
106 const LineList lines = _getSnapLines(pp); local
108 for (LineList::const_iterator i = lines.begin(); i != lines.end(); ++i) {
143 // We're probably dealing with parallel lines, so snapping doesn't make any sense here
162 // Will only be overridden in the guide-snapper class, because grid lines do
[all...]
H A Dgradient-drag.h130 and of lines (simple canvas items). It also remembers one of the draggers as selected.
185 std::vector<SPCtrlLine *> lines; member in class:GrDrag
H A Dvanishing-point.h30 VP_FINITE = 0, // perspective lines meet in the VP
31 VP_INFINITE // perspective lines are parallel
176 std::vector<SPCtrlLine *> lines; member in struct:Box3D::VPDrag
190 bool show_lines; /* whether perspective lines are drawn at all */
191 unsigned int front_or_rear_lines; /* whether we draw perspective lines from all corners or only the
208 * Create a line from p1 to p2 and add it to the lines list.
/inkscape/src/2geom/
H A Dellipse.cpp456 // we simply re-use the procedure for lines and filter out
507 // determined by mu Q + R is reducible to a product of two lines. If it's not,
509 // lines with the original ellipses (if there are any) give the coordinates
513 // Out of three possible pairs of lines that go through four points of intersection
514 // of two ellipses, this corresponds to cross-lines. These intersect the ellipses
539 Line lines[2]; local
548 lines[0] = Line(1, q, alpha);
549 lines[1] = Line(1, s, beta);
557 lines[0] = Line(q, 1, alpha);
558 lines[
[all...]
/inkscape/src/extension/internal/
H A Dtext_reassemble.h258 uint32_t phase1; /**< Number of complexes (lines + text fragments) entered in phase 1 */
259 uint32_t lines; /**< Number of lines in phase 1 */ member in struct:__anon76
322 int TR_check_set_vadvance(TR_INFO *tri, int src, int lines);
H A Dwmf-print.cpp181 /* -1/1200 in next two lines so that WMF read in will write out again at exactly the same size */
600 if (!FixPPTDashLine) { // if this is set code elsewhere will break dots/dashes into many smaller lines.
921 int lines = 0; local
933 lines++;
944 U_POINT16 *lpPoints = new U_POINT16[moves + lines + curves * 3];
1027 if (moves == 1 && moves + lines == nodes && closed) {
H A Dtext_reassemble.c9 4. Phase I: For all saved text objects construct lines.
13 8. Phase II; for all lines construct paragraphs.
16 current paragraph. Reaverage line spacing over all lines in paragraph. Check next one.
20 13. Over all phase I lines in each paragraph.
524 This lets the value of "src - lines" determine the weight to give to each new vadvance value
526 since there can be some noise introduced when lines have different maximum font sizes.
527 \param lines index of the first text block that was added to the growing complex.
529 int TR_check_set_vadvance(TR_INFO *tri, int src, int lines){ argument
558 weight = (1.0 / (double) (src - lines));
562 else { /* only happens when src = lines
[all...]
H A Demf-print.cpp695 if (FixPPTDashLine) { // will break up line into many smaller lines. Override gradient if that was set, cannot do both.
797 returned PathVector is an empty path. If the input path is already just straight lines and vertices the output will be the
1504 int lines = 0; local
1516 lines++;
1527 U_POINT *lpPoints = new U_POINT[moves + lines + curves * 3];
1612 if (moves == 1 && moves + lines == nodes && closed) {

Completed in 52 milliseconds