Searched refs:lines (Results 1 - 19 of 19) 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/share/extensions/
H A Dgenerate_voronoi.py157 if c.lines[edge[0]][1] == 0: # vertical line
158 xtemp = c.lines[edge[0]][2]/c.lines[edge[0]][0]
165 ytemp = (c.lines[edge[0]][2] - q['width']*c.lines[edge[0]][0])/c.lines[edge[0]][1]
168 if c.lines[edge[0]][1] == 0: # vertical line
169 xtemp = c.lines[edge[0]][2]/c.lines[edge[0]][0]
176 ytemp = c.lines[edg
[all...]
H A Dsplit.py39 """Returns a list of lines"""
41 lines = []
90 lines.append(text)
92 return lines
112 lines = self.split_lines(node)
113 if not lines:
116 for line in lines:
H A Dvoronoi2svg.py106 def clipEdge(self,vertices, lines, edge, bbox):
115 line = (lines[edge[0]])
336 vertices,lines,edges = voronoi.computeVoronoiDiagram(pts)
342 continue # infinite lines have no need to be handled in the clipped box
344 segment = self.clipEdge(vertices,lines,edge,clipBox)
H A Dgcodetools.py15 Removed the biarc curves - straight lines are better.
23 30 May Eliminating redundant lines in divided Beziers. Changed subdivision of lines
32 Changed csp_normalized_slope to reject lines shorter than 1e-9.
1773 # lines are parallel
1777 # lines are the same
3592 self.OptionParser.add_option("", "--area-fill-angle", action="store", type="float", dest="area_fill_angle", default="0", help="Fill area with lines heading this angle")
3593 self.OptionParser.add_option("", "--area-fill-shift", action="store", type="float", dest="area_fill_shift", default="0", help="Shift the lines by tool d * shift")
4484 def sort_lines(lines):
4485 if len(lines)
[all...]
H A Dvoronoi.py84 # lines in the Voronoi diagram: a*x + b*y = c
111 self.lines = [] # equation of line 3-tuple (a b c), for the equation of the line a*x+b*y = c
151 self.lines.append((edge.a, edge.b, edge.c))
734 lines in the Voronoi diagram: a*x + b*y = c
743 return (context.vertices,context.lines,context.edges)
/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 Dvanishing-point.cpp527 for (std::vector<SPCtrlLine *>::const_iterator i = this->lines.begin(); i != this->lines.end(); ++i) {
530 this->lines.clear();
593 Regenerates the lines list from the current selection; is called on each move
594 of a dragger, so that lines are always in sync with the actual perspective
599 // delete old lines
600 for (std::vector<SPCtrlLine *>::const_iterator i = this->lines.begin(); i != this->lines.end(); ++i) {
603 this->lines.clear();
605 // do nothing if perspective lines ar
[all...]
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.
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 Dgradient-drag.cpp600 if (!lines.empty()) {
601 for (std::vector<SPCtrlLine *>::const_iterator l = lines.begin(); l != lines.end() && (!over_line); ++l) {
630 lines(0),
696 for (std::vector<SPCtrlLine *>::const_iterator it = this->lines.begin(); it != this->lines.end(); ++it) {
699 this->lines.clear();
1857 * Create a line from p1 to p2 and add it to the lines list.
1867 this->lines.push_back(line);
1873 * Create a curve from p0 to p3 and add it to the lines lis
[all...]
/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/ui/tools/
H A Dgradient-tool.cpp485 if (!drag->lines.empty()) {
486 for (std::vector<SPCtrlLine *>::const_iterator l = drag->lines.begin(); l != drag->lines.end() && (!over_line); ++l) {
591 if (!drag->lines.empty()) {
592 for (std::vector<SPCtrlLine *>::const_iterator l = drag->lines.begin(); l != drag->lines.end(); ++l) {
616 if (!drag->lines.empty()) {
617 for (std::vector<SPCtrlLine *>::const_iterator l = drag->lines.begin(); l != drag->lines.end() && (!over_line); ++l) {
H A Dmesh-tool.cpp460 if (! drag->lines.empty()) {
461 for (std::vector<SPCtrlLine *>::const_iterator l = drag->lines.begin(); l != drag->lines.end() && (!over_line); ++l) {
596 if (!drag->lines.empty()) {
597 for (std::vector<SPCtrlLine *>::const_iterator l = drag->lines.begin(); l != drag->lines.end() ; ++l) {
627 if (!drag->lines.empty()) {
628 for (std::vector<SPCtrlLine *>::const_iterator l = drag->lines.begin(); l != drag->lines.end() && (!over_line); ++l) {
/inkscape/packaging/
H A Drelease-sign-tarballs64 lines=$(bzr diff | wc -l)
65 if [ $lines -gt 0 ]; then
/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 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) {
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...]

Completed in 2065 milliseconds