├── .gitignore
├── svg
├── __init__.py
├── svg
│ ├── __init__.py
│ ├── geometry.py
│ └── svg.py
├── README.md
└── LICENSE
├── README.md
├── examples
├── dt-logo.svg
└── dt-logo.mod
├── LICENSE
└── svg2mod.py
/.gitignore:
--------------------------------------------------------------------------------
1 | *~
2 | .*.sw?
3 | *.pyc
4 |
--------------------------------------------------------------------------------
/svg/__init__.py:
--------------------------------------------------------------------------------
1 | from .svg import *
2 |
--------------------------------------------------------------------------------
/svg/svg/__init__.py:
--------------------------------------------------------------------------------
1 | #__all__ = ['geometry', 'svg']
2 |
3 | from .svg import *
4 |
5 | def parse(filename):
6 | f = svg.Svg(filename)
7 | return f
8 |
9 |
--------------------------------------------------------------------------------
/svg/README.md:
--------------------------------------------------------------------------------
1 | SVG parser library
2 | ==================
3 |
4 | This is a SVG parser library written in Python.
5 | ([see here](https://github.com/cjlano/svg]))
6 |
7 | Capabilities:
8 | - Parse SVG XML
9 | - apply any transformation (svg transform)
10 | - Explode SVG Path into basic elements (Line, Bezier, ...)
11 | - Interpolate SVG Path as a series of segments
12 | - Able to simplify segments given a precision using Ramer-Douglas-Peucker algorithm
13 |
14 | Not (yet) supported:
15 | - SVG Path Arc ('A')
16 | - Non-linear transformation drawing (SkewX, ...)
17 |
18 | License: GPLv2+
19 |
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | # svg2mod
2 | This is a small program to convert Inkscape SVG drawings to KiCad footprint module files. It uses [cjlano's python SVG parser and drawing module](https://github.com/cjlano/svg) to interpret drawings and approximate curves using straight line segments. Module files can be output in KiCad's legacy or s-expression (i.e., pretty) formats. Horizontally mirrored modules are automatically generated for use on the back of a 2-layer PCB.
3 |
4 | ## Usage
5 | ```
6 | usage: svg2mod.py [-h] -i FILENAME [-o FILENAME] [--name NAME] [--value VALUE]
7 | [-f FACTOR] [-p PRECISION] [--front-only] [--format FORMAT]
8 | [--units UNITS]
9 |
10 | Convert Inkscape SVG drawings to KiCad footprint modules.
11 |
12 | optional arguments:
13 | -h, --help show this help message and exit
14 | -i FILENAME, --input-file FILENAME
15 | name of the SVG file
16 | -o FILENAME, --output-file FILENAME
17 | name of the module file
18 | --name NAME, --module-name NAME
19 | base name of the module
20 | --value VALUE, --module-value VALUE
21 | value of the module
22 | -f FACTOR, --factor FACTOR
23 | scale paths by this factor
24 | -p PRECISION, --precision PRECISION
25 | smoothness for approximating curves with line segments
26 | (float)
27 | --front-only omit output of back module (legacy output format)
28 | --format FORMAT output module file format (legacy|pretty)
29 | --units UNITS output units, if output format is legacy (decimil|mm)
30 | ```
31 |
32 | ## SVG Files
33 |
34 | svg2mod expects images saved in the uncompressed Inkscape SVG (i.e., not "plain SVG") format.
35 | * Drawings should be to scale (1 mm in Inscape will be 1 mm in KiCad). Use the --factor option to resize the resulting module(s) up or down from there.
36 | * Paths are supported.
37 | * A path may have an outline and a fill. (Colors will be ignored.)
38 | * A path may have holes, defined by interior segments within the path (see included examples). Sometimes this will render propery in KiCad, but sometimes not.
39 | * Paths with filled areas within holes may not work at all.
40 | * Groups may be used. However, styles applied to groups (e.g., stroke-width) are not applied to contained drawing elements. In these cases, it may be necessary to ungroup (and perhaps regroup) the elements.
41 | * Layers must be used to indicate the mapping of drawing elements to KiCad layers.
42 | * Layers must be named according to the rules below.
43 | * Drawing elements will be mapped to front layers by default. Mirrored images of these elements can be automatically generated and mapped to back layers in a separate module (see --front-only option).
44 | * Other types of elements such as rect, arc, and circle are not supported.
45 | * Use Inkscape's "Path->Object To Path" and "Path->Stroke To Path" menu options to convert these elements into paths that will work.
46 |
47 | ### Layers
48 | Layers must be named (case-insensitive) according to the following rules:
49 |
50 | | Inkscape layer name | KiCad layer(s) | KiCad legacy | KiCad pretty |
51 | |:-------------------:|:----------------:|:------------:|:------------:|
52 | | Cu | F.Cu, B.Cu | Yes | Yes |
53 | | Adhes | F.Adhes, B.Adhes | Yes | Yes |
54 | | Paste | F.Paste, B.Paste | Yes | Yes |
55 | | SilkS | F.SilkS, B.SilkS | Yes | Yes |
56 | | Mask | F.Mask, B.Mask | Yes | Yes |
57 | | Dwgs.User | Dwgs.User | Yes | -- |
58 | | Cmts.User | Cmts.User | Yes | -- |
59 | | Eco1.User | Eco1.User | Yes | -- |
60 | | Eco2.User | Eco2.User | Yes | -- |
61 | | Edge.Cuts | Edge.Cuts | Yes | Yes |
62 | | Fab | F.Fab, B.Fab | -- | Yes |
63 | | CrtYd | F.CrtYd, B.CrtYd | -- | Yes |
64 |
65 | Note: If you have a layer "Cu", all of its sub-layers will be treated as "Cu" regardless of their names.
66 |
--------------------------------------------------------------------------------
/examples/dt-logo.svg:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
163 |
--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
1 | CC0 1.0 Universal
2 |
3 | Statement of Purpose
4 |
5 | The laws of most jurisdictions throughout the world automatically confer
6 | exclusive Copyright and Related Rights (defined below) upon the creator and
7 | subsequent owner(s) (each and all, an "owner") of an original work of
8 | authorship and/or a database (each, a "Work").
9 |
10 | Certain owners wish to permanently relinquish those rights to a Work for the
11 | purpose of contributing to a commons of creative, cultural and scientific
12 | works ("Commons") that the public can reliably and without fear of later
13 | claims of infringement build upon, modify, incorporate in other works, reuse
14 | and redistribute as freely as possible in any form whatsoever and for any
15 | purposes, including without limitation commercial purposes. These owners may
16 | contribute to the Commons to promote the ideal of a free culture and the
17 | further production of creative, cultural and scientific works, or to gain
18 | reputation or greater distribution for their Work in part through the use and
19 | efforts of others.
20 |
21 | For these and/or other purposes and motivations, and without any expectation
22 | of additional consideration or compensation, the person associating CC0 with a
23 | Work (the "Affirmer"), to the extent that he or she is an owner of Copyright
24 | and Related Rights in the Work, voluntarily elects to apply CC0 to the Work
25 | and publicly distribute the Work under its terms, with knowledge of his or her
26 | Copyright and Related Rights in the Work and the meaning and intended legal
27 | effect of CC0 on those rights.
28 |
29 | 1. Copyright and Related Rights. A Work made available under CC0 may be
30 | protected by copyright and related or neighboring rights ("Copyright and
31 | Related Rights"). Copyright and Related Rights include, but are not limited
32 | to, the following:
33 |
34 | i. the right to reproduce, adapt, distribute, perform, display, communicate,
35 | and translate a Work;
36 |
37 | ii. moral rights retained by the original author(s) and/or performer(s);
38 |
39 | iii. publicity and privacy rights pertaining to a person's image or likeness
40 | depicted in a Work;
41 |
42 | iv. rights protecting against unfair competition in regards to a Work,
43 | subject to the limitations in paragraph 4(a), below;
44 |
45 | v. rights protecting the extraction, dissemination, use and reuse of data in
46 | a Work;
47 |
48 | vi. database rights (such as those arising under Directive 96/9/EC of the
49 | European Parliament and of the Council of 11 March 1996 on the legal
50 | protection of databases, and under any national implementation thereof,
51 | including any amended or successor version of such directive); and
52 |
53 | vii. other similar, equivalent or corresponding rights throughout the world
54 | based on applicable law or treaty, and any national implementations thereof.
55 |
56 | 2. Waiver. To the greatest extent permitted by, but not in contravention of,
57 | applicable law, Affirmer hereby overtly, fully, permanently, irrevocably and
58 | unconditionally waives, abandons, and surrenders all of Affirmer's Copyright
59 | and Related Rights and associated claims and causes of action, whether now
60 | known or unknown (including existing as well as future claims and causes of
61 | action), in the Work (i) in all territories worldwide, (ii) for the maximum
62 | duration provided by applicable law or treaty (including future time
63 | extensions), (iii) in any current or future medium and for any number of
64 | copies, and (iv) for any purpose whatsoever, including without limitation
65 | commercial, advertising or promotional purposes (the "Waiver"). Affirmer makes
66 | the Waiver for the benefit of each member of the public at large and to the
67 | detriment of Affirmer's heirs and successors, fully intending that such Waiver
68 | shall not be subject to revocation, rescission, cancellation, termination, or
69 | any other legal or equitable action to disrupt the quiet enjoyment of the Work
70 | by the public as contemplated by Affirmer's express Statement of Purpose.
71 |
72 | 3. Public License Fallback. Should any part of the Waiver for any reason be
73 | judged legally invalid or ineffective under applicable law, then the Waiver
74 | shall be preserved to the maximum extent permitted taking into account
75 | Affirmer's express Statement of Purpose. In addition, to the extent the Waiver
76 | is so judged Affirmer hereby grants to each affected person a royalty-free,
77 | non transferable, non sublicensable, non exclusive, irrevocable and
78 | unconditional license to exercise Affirmer's Copyright and Related Rights in
79 | the Work (i) in all territories worldwide, (ii) for the maximum duration
80 | provided by applicable law or treaty (including future time extensions), (iii)
81 | in any current or future medium and for any number of copies, and (iv) for any
82 | purpose whatsoever, including without limitation commercial, advertising or
83 | promotional purposes (the "License"). The License shall be deemed effective as
84 | of the date CC0 was applied by Affirmer to the Work. Should any part of the
85 | License for any reason be judged legally invalid or ineffective under
86 | applicable law, such partial invalidity or ineffectiveness shall not
87 | invalidate the remainder of the License, and in such case Affirmer hereby
88 | affirms that he or she will not (i) exercise any of his or her remaining
89 | Copyright and Related Rights in the Work or (ii) assert any associated claims
90 | and causes of action with respect to the Work, in either case contrary to
91 | Affirmer's express Statement of Purpose.
92 |
93 | 4. Limitations and Disclaimers.
94 |
95 | a. No trademark or patent rights held by Affirmer are waived, abandoned,
96 | surrendered, licensed or otherwise affected by this document.
97 |
98 | b. Affirmer offers the Work as-is and makes no representations or warranties
99 | of any kind concerning the Work, express, implied, statutory or otherwise,
100 | including without limitation warranties of title, merchantability, fitness
101 | for a particular purpose, non infringement, or the absence of latent or
102 | other defects, accuracy, or the present or absence of errors, whether or not
103 | discoverable, all to the greatest extent permissible under applicable law.
104 |
105 | c. Affirmer disclaims responsibility for clearing rights of other persons
106 | that may apply to the Work or any use thereof, including without limitation
107 | any person's Copyright and Related Rights in the Work. Further, Affirmer
108 | disclaims responsibility for obtaining any necessary consents, permissions
109 | or other rights required for any use of the Work.
110 |
111 | d. Affirmer understands and acknowledges that Creative Commons is not a
112 | party to this document and has no duty or obligation with respect to this
113 | CC0 or use of the Work.
114 |
115 | For more information, please see
116 |
117 |
118 |
--------------------------------------------------------------------------------
/svg/svg/geometry.py:
--------------------------------------------------------------------------------
1 | # Copyright (C) 2013 -- CJlano < cjlano @ free.fr >
2 |
3 | # This program is free software; you can redistribute it and/or modify
4 | # it under the terms of the GNU General Public License as published by
5 | # the Free Software Foundation; either version 2 of the License, or
6 | # (at your option) any later version.
7 | #
8 | # This program is distributed in the hope that it will be useful,
9 | # but WITHOUT ANY WARRANTY; without even the implied warranty of
10 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 | # GNU General Public License for more details.
12 | #
13 | # You should have received a copy of the GNU General Public License along
14 | # with this program; if not, write to the Free Software Foundation, Inc.,
15 | # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
16 |
17 | '''
18 | This module contains all the geometric classes and functions not directly
19 | related to SVG parsing. It can be reused outside the scope of SVG.
20 | '''
21 |
22 | import math
23 | import numbers
24 | import operator
25 |
26 | class Point:
27 | def __init__(self, x=None, y=None):
28 | '''A Point is defined either by a tuple/list of length 2 or
29 | by 2 coordinates
30 | >>> Point(1,2)
31 | (1.000,2.000)
32 | >>> Point((1,2))
33 | (1.000,2.000)
34 | >>> Point([1,2])
35 | (1.000,2.000)
36 | >>> Point('1', '2')
37 | (1.000,2.000)
38 | >>> Point(('1', None))
39 | (1.000,0.000)
40 | '''
41 | if (isinstance(x, tuple) or isinstance(x, list)) and len(x) == 2:
42 | x,y = x
43 |
44 | # Handle empty parameter(s) which should be interpreted as 0
45 | if x is None: x = 0
46 | if y is None: y = 0
47 |
48 | try:
49 | self.x = float(x)
50 | self.y = float(y)
51 | except:
52 | raise TypeError("A Point is defined by 2 numbers or a tuple")
53 |
54 | def __add__(self, other):
55 | '''Add 2 points by adding coordinates.
56 | Try to convert other to Point if necessary
57 | >>> Point(1,2) + Point(3,2)
58 | (4.000,4.000)
59 | >>> Point(1,2) + (3,2)
60 | (4.000,4.000)'''
61 | if not isinstance(other, Point):
62 | try: other = Point(other)
63 | except: return NotImplemented
64 | return Point(self.x + other.x, self.y + other.y)
65 |
66 | def __sub__(self, other):
67 | '''Substract two Points.
68 | >>> Point(1,2) - Point(3,2)
69 | (-2.000,0.000)
70 | '''
71 | if not isinstance(other, Point):
72 | try: other = Point(other)
73 | except: return NotImplemented
74 | return Point(self.x - other.x, self.y - other.y)
75 |
76 | def __mul__(self, other):
77 | '''Multiply a Point with a constant.
78 | >>> 2 * Point(1,2)
79 | (2.000,4.000)
80 | >>> Point(1,2) * Point(1,2) #doctest:+IGNORE_EXCEPTION_DETAIL
81 | Traceback (most recent call last):
82 | ...
83 | TypeError:
84 | '''
85 | if not isinstance(other, numbers.Real):
86 | return NotImplemented
87 | return Point(self.x * other, self.y * other)
88 | def __rmul__(self, other):
89 | return self.__mul__(other)
90 |
91 | def __eq__(self, other):
92 | '''Test equality
93 | >>> Point(1,2) == (1,2)
94 | True
95 | >>> Point(1,2) == Point(2,1)
96 | False
97 | '''
98 | if not isinstance(other, Point):
99 | try: other = Point(other)
100 | except: return NotImplemented
101 | return (self.x == other.x) and (self.y == other.y)
102 |
103 | def __repr__(self):
104 | return '(' + format(self.x,'.3f') + ',' + format( self.y,'.3f') + ')'
105 |
106 | def __str__(self):
107 | return self.__repr__();
108 |
109 | def coord(self):
110 | '''Return the point tuple (x,y)'''
111 | return (self.x, self.y)
112 |
113 | def length(self):
114 | '''Vector length, Pythagoras theorem'''
115 | return math.sqrt(self.x ** 2 + self.y ** 2)
116 |
117 | def rot(self, angle):
118 | '''Rotate vector [Origin,self] '''
119 | if not isinstance(angle, Angle):
120 | try: angle = Angle(angle)
121 | except: return NotImplemented
122 | x = self.x * angle.cos - self.y * angle.sin
123 | y = self.x * angle.sin + self.y * angle.cos
124 | return Point(x,y)
125 |
126 |
127 | class Angle:
128 | '''Define a trigonometric angle [of a vector] '''
129 | def __init__(self, arg):
130 | if isinstance(arg, numbers.Real):
131 | # We precompute sin and cos for rotations
132 | self.angle = arg
133 | self.cos = math.cos(self.angle)
134 | self.sin = math.sin(self.angle)
135 | elif isinstance(arg, Point):
136 | # Point angle is the trigonometric angle of the vector [origin, Point]
137 | pt = arg
138 | try:
139 | self.cos = pt.x/pt.length()
140 | self.sin = pt.y/pt.length()
141 | except ZeroDivisionError:
142 | self.cos = 1
143 | self.sin = 0
144 |
145 | self.angle = math.acos(self.cos)
146 | if self.sin < 0:
147 | self.angle = -self.angle
148 | else:
149 | raise TypeError("Angle is defined by a number or a Point")
150 |
151 | def __neg__(self):
152 | return Angle(Point(self.cos, -self.sin))
153 |
154 | class Segment:
155 | '''A segment is an object defined by 2 points'''
156 | def __init__(self, start, end):
157 | self.start = start
158 | self.end = end
159 |
160 | def __str__(self):
161 | return 'Segment from ' + str(self.start) + ' to ' + str(self.end)
162 |
163 | def segments(self, precision=0):
164 | ''' Segments is simply the segment start -> end'''
165 | return [self.start, self.end]
166 |
167 | def length(self):
168 | '''Segment length, Pythagoras theorem'''
169 | s = self.end - self.start
170 | return math.sqrt(s.x ** 2 + s.y ** 2)
171 |
172 | def pdistance(self, p):
173 | '''Perpendicular distance between this Segment and a given Point p'''
174 | if not isinstance(p, Point):
175 | return NotImplemented
176 |
177 | if self.start == self.end:
178 | # Distance from a Point to another Point is length of a segment
179 | return Segment(self.start, p).length()
180 |
181 | s = self.end - self.start
182 | if s.x == 0:
183 | # Vertical Segment => pdistance is the difference of abscissa
184 | return abs(self.start.x - p.x)
185 | else:
186 | # That's 2-D perpendicular distance formulae (ref: Wikipedia)
187 | slope = s.y/s.x
188 | # intercept: Crossing with ordinate y-axis
189 | intercept = self.start.y - (slope * self.start.x)
190 | return abs(slope * p.x - p.y + intercept) / math.sqrt(slope ** 2 + 1)
191 |
192 |
193 | def bbox(self):
194 | xmin = min(self.start.x, self.end.x)
195 | xmax = max(self.start.x, self.end.x)
196 | ymin = min(self.start.y, self.end.y)
197 | ymax = max(self.start.y, self.end.y)
198 |
199 | return (Point(xmin,ymin),Point(xmax,ymax))
200 |
201 | def transform(self, matrix):
202 | self.start = matrix * self.start
203 | self.end = matrix * self.end
204 |
205 | def scale(self, ratio):
206 | self.start *= ratio
207 | self.end *= ratio
208 | def translate(self, offset):
209 | self.start += offset
210 | self.end += offset
211 | def rotate(self, angle):
212 | self.start = self.start.rot(angle)
213 | self.end = self.end.rot(angle)
214 |
215 | class Bezier:
216 | '''Bezier curve class
217 | A Bezier curve is defined by its control points
218 | Its dimension is equal to the number of control points
219 | Note that SVG only support dimension 3 and 4 Bezier curve, respectively
220 | Quadratic and Cubic Bezier curve'''
221 | def __init__(self, pts):
222 | self.pts = list(pts)
223 | self.dimension = len(pts)
224 |
225 | def __str__(self):
226 | return 'Bezier' + str(self.dimension) + \
227 | ' : ' + ", ".join([str(x) for x in self.pts])
228 |
229 | def control_point(self, n):
230 | if n >= self.dimension:
231 | raise LookupError('Index is larger than Bezier curve dimension')
232 | else:
233 | return self.pts[n]
234 |
235 | def rlength(self):
236 | '''Rough Bezier length: length of control point segments'''
237 | pts = list(self.pts)
238 | l = 0.0
239 | p1 = pts.pop()
240 | while pts:
241 | p2 = pts.pop()
242 | l += Segment(p1, p2).length()
243 | p1 = p2
244 | return l
245 |
246 | def bbox(self):
247 | return self.rbbox()
248 |
249 | def rbbox(self):
250 | '''Rough bounding box: return the bounding box (P1,P2) of the Bezier
251 | _control_ points'''
252 | xmin = min([p.x for p in self.pts])
253 | xmax = max([p.x for p in self.pts])
254 | ymin = min([p.y for p in self.pts])
255 | ymax = max([p.y for p in self.pts])
256 |
257 | return (Point(xmin,ymin), Point(xmax,ymax))
258 |
259 | def segments(self, precision=0):
260 | '''Return a polyline approximation ("segments") of the Bezier curve
261 | precision is the minimum significative length of a segment'''
262 | segments = []
263 | # n is the number of Bezier points to draw according to precision
264 | if precision != 0:
265 | n = int(self.rlength() / precision) + 1
266 | else:
267 | n = 1000
268 | #if n < 10: n = 10
269 | if n > 1000 : n = 1000
270 |
271 | for t in range(0, n+1):
272 | segments.append(self._bezierN(float(t)/n))
273 | return segments
274 |
275 | def _bezier1(self, p0, p1, t):
276 | '''Bezier curve, one dimension
277 | Compute the Point corresponding to a linear Bezier curve between
278 | p0 and p1 at "time" t '''
279 | pt = p0 + t * (p1 - p0)
280 | return pt
281 |
282 | def _bezierN(self, t):
283 | '''Bezier curve, Nth dimension
284 | Compute the point of the Nth dimension Bezier curve at "time" t'''
285 | # We reduce the N Bezier control points by computing the linear Bezier
286 | # point of each control point segment, creating N-1 control points
287 | # until we reach one single point
288 | res = list(self.pts)
289 | # We store the resulting Bezier points in res[], recursively
290 | for n in range(self.dimension, 1, -1):
291 | # For each control point of nth dimension,
292 | # compute linear Bezier point a t
293 | for i in range(0,n-1):
294 | res[i] = self._bezier1(res[i], res[i+1], t)
295 | return res[0]
296 |
297 | def transform(self, matrix):
298 | self.pts = [matrix * x for x in self.pts]
299 |
300 | def scale(self, ratio):
301 | self.pts = [x * ratio for x in self.pts]
302 | def translate(self, offset):
303 | self.pts = [x + offset for x in self.pts]
304 | def rotate(self, angle):
305 | self.pts = [x.rot(angle) for x in self.pts]
306 |
307 | class MoveTo:
308 | def __init__(self, dest):
309 | self.dest = dest
310 |
311 | def bbox(self):
312 | return (self.dest, self.dest)
313 |
314 | def transform(self, matrix):
315 | self.dest = matrix * self.dest
316 |
317 | def scale(self, ratio):
318 | self.dest *= ratio
319 | def translate(self, offset):
320 | self.dest += offset
321 | def rotate(self, angle):
322 | self.dest = self.dest.rot(angle)
323 |
324 |
325 | def simplify_segment(segment, epsilon):
326 | '''Ramer-Douglas-Peucker algorithm'''
327 | if len(segment) < 3 or epsilon <= 0:
328 | return segment[:]
329 |
330 | l = Segment(segment[0], segment[-1]) # Longest segment
331 |
332 | # Find the furthest point from the segment
333 | index, maxDist = max([(i, l.pdistance(p)) for i,p in enumerate(segment)],
334 | key=operator.itemgetter(1))
335 |
336 | if maxDist > epsilon:
337 | # Recursively call with segment splited in 2 on its furthest point
338 | r1 = simplify_segment(segment[:index+1], epsilon)
339 | r2 = simplify_segment(segment[index:], epsilon)
340 | # Remove redundant 'middle' Point
341 | return r1[:-1] + r2
342 | else:
343 | return [segment[0], segment[-1]]
344 |
--------------------------------------------------------------------------------
/examples/dt-logo.mod:
--------------------------------------------------------------------------------
1 | PCBNEW-LibModule-V1 Wed 23 Sep 2015 12:56:11 PM
2 | Units mm
3 | $INDEX
4 | DT-Logo-Front
5 | DT-Logo-Back
6 | $EndINDEX
7 | #
8 | # dt-logo.svg
9 | #
10 | $MODULE DT-Logo-Front
11 | Po 0 0 0 15 00000000 00000000 ~~
12 | Li DT-Logo-Front
13 | T0 0 -4.48650007222 1.524 1.524 0 0.3048 N I 21 "DT-Logo-Front"
14 | T1 0 4.48650007222 1.524 1.524 0 0.3048 N I 21 "G***"
15 | DP 0 0 0 0 45 0.00254 23
16 | Dl -1.11500002778 -1.43850007222
17 | Dl 1.11500002778 -1.43850007222
18 | Dl 1.21826499778 -1.43021840222
19 | Dl 1.31612738778 -1.40623191222
20 | Dl 1.40729941778 -1.36782838222
21 | Dl 1.49049330778 -1.31629559222
22 | Dl 1.56442127778 -1.25292132222
23 | Dl 1.62779554778 -1.17899335222
24 | Dl 1.67932833778 -1.09579946222
25 | Dl 1.71773186778 -1.00462743222
26 | Dl 1.74171835778 -0.906765042222
27 | Dl 1.75000002778 -0.803500072222
28 | Dl 1.75000002778 0.803499987556
29 | Dl 1.74171835778 0.906764959926
30 | Dl 1.71773186778 1.00462735636
31 | Dl 1.67932833778 1.09579939584
32 | Dl 1.62779554778 1.17899329736
33 | Dl 1.56442127778 1.25292127989
34 | Dl 1.49049330778 1.31629556242
35 | Dl 1.40729941778 1.36782836393
36 | Dl 1.31612738778 1.40623190342
37 | Dl 1.21826499778 1.43021839985
38 | Dl 1.11500002778 1.43850007222
39 | Dl -1.11500002778 1.43850007222
40 | Dl -1.21826499778 1.43021839985
41 | Dl -1.31612738778 1.40623190342
42 | Dl -1.40729941778 1.36782836393
43 | Dl -1.49049330778 1.31629556242
44 | Dl -1.56442127778 1.25292127989
45 | Dl -1.62779554778 1.17899329736
46 | Dl -1.67932833778 1.09579939584
47 | Dl -1.71773186778 1.00462735636
48 | Dl -1.74171835778 0.906764959926
49 | Dl -1.75000002778 0.803499987556
50 | Dl -1.75000002778 -0.803500072222
51 | Dl -1.74171835778 -0.906765042222
52 | Dl -1.71773186778 -1.00462743222
53 | Dl -1.67932833778 -1.09579946222
54 | Dl -1.62779554778 -1.17899335222
55 | Dl -1.56442127778 -1.25292132222
56 | Dl -1.49049330778 -1.31629559222
57 | Dl -1.40729941778 -1.36782838222
58 | Dl -1.31612738778 -1.40623191222
59 | Dl -1.21826499778 -1.43021840222
60 | Dl -1.11500002778 -1.43850007222
61 | DP 0 0 0 0 45 0.00254 15
62 | Dl -0.799826470222 -0.551812572889
63 | Dl -0.799826470222 0.551656560444
64 | Dl -0.565762111778 0.551656560444
65 | Dl -0.561958169057 0.551588736518
66 | Dl -0.557617048171 0.551401158364
67 | Dl -0.552923190034 0.551117666424
68 | Dl -0.548061035561 0.550762101138
69 | Dl -0.543215025667 0.550358302944
70 | Dl -0.538569601266 0.549930112284
71 | Dl -0.534309203273 0.549501369598
72 | Dl -0.530618272603 0.549095915324
73 | Dl -0.52768125017 0.548737589904
74 | Dl -0.525682576889 0.548450233778
75 | Dl -0.492995048016 0.540568430728
76 | Dl -0.462283746331 0.52830719253
77 | Dl -0.433893631435 0.512020431606
78 | Dl -0.40816966293 0.49206206038
79 | Dl -0.385456800417 0.468785991278
80 | Dl -0.366100003497 0.442546136722
81 | Dl -0.350444231772 0.413696409136
82 | Dl -0.338834444843 0.382590720946
83 | Dl -0.331615602311 0.349582984574
84 | Dl -0.329132663778 0.315027112444
85 | Dl -0.329132663778 -0.315022850889
86 | Dl -0.331662301481 -0.349341511769
87 | Dl -0.339000486336 -0.381745179104
88 | Dl -0.350771125962 -0.412034607335
89 | Dl -0.366598127977 -0.440010550903
90 | Dl -0.3861054 -0.46547376425
91 | Dl -0.40891684965 -0.488225001817
92 | Dl -0.434656384545 -0.508065018045
93 | Dl -0.462947912304 -0.524794567376
94 | Dl -0.493415340546 -0.538214404251
95 | Dl -0.525682576889 -0.548125283111
96 | Dl -0.528861655226 -0.548802540244
97 | Dl -0.532532627931 -0.549415840178
98 | Dl -0.536580107545 -0.549963455711
99 | Dl -0.54088870661 -0.550443659644
100 | Dl -0.545343037667 -0.550854724778
101 | Dl -0.549827713257 -0.551194923911
102 | Dl -0.554227345922 -0.551462529844
103 | Dl -0.558426548203 -0.551655815378
104 | Dl -0.562309932641 -0.551773053311
105 | Dl -0.565762111778 -0.551812516444
106 | Dl -0.799826470222 -0.551812572889
107 | DP 0 0 0 0 75 0.00254 15
108 | Dl -1.11853875578 -1.0274762681
109 | Dl -1.13990576822 -1.02618187506
110 | Dl -1.16015910005 -1.02243221638
111 | Dl -1.17903130383 -1.01642757278
112 | Dl -1.19625493213 -1.00836822494
113 | Dl -1.2115625375 -0.998454453586
114 | Dl -1.22468667251 -0.9868865394
115 | Dl -1.23535988973 -0.973864763088
116 | Dl -1.24331474171 -0.959589405351
117 | Dl -1.24828378102 -0.944260746888
118 | Dl -1.24999956022 -0.9280790684
119 | Dl -1.24999956022 0.927762714222
120 | Dl -1.24828378102 0.943953377266
121 | Dl -1.24331474171 0.959306407746
122 | Dl -1.23535988973 0.973617677884
123 | Dl -1.22468667251 0.986683059904
124 | Dl -1.2115625375 0.998298426028
125 | Dl -1.19625493213 1.00825964848
126 | Dl -1.17903130383 1.01636259948
127 | Dl -1.16015910005 1.02240315125
128 | Dl -1.13990576822 1.02617717602
129 | Dl -1.11853875578 1.027480546
130 | Dl -0.0133061004444 1.027480546
131 | Dl 0.008060891422 1.02617717602
132 | Dl 0.0283142113138 1.02240315125
133 | Dl 0.0471864102696 1.01636259948
134 | Dl 0.064410039328 1.00825964848
135 | Dl 0.0797176495278 0.998298426028
136 | Dl 0.0928417919076 0.986683059904
137 | Dl 0.103515017506 0.973617677884
138 | Dl 0.111469877362 0.959306407746
139 | Dl 0.116438922514 0.943953377266
140 | Dl 0.118154704 0.927762714222
141 | Dl 0.118154704 -0.9280790684
142 | Dl 0.116438922514 -0.944260746888
143 | Dl 0.111469877362 -0.959589405351
144 | Dl 0.103515017506 -0.973864763088
145 | Dl 0.0928417919076 -0.9868865394
146 | Dl 0.0797176495278 -0.998454453586
147 | Dl 0.064410039328 -1.00836822494
148 | Dl 0.0471864102696 -1.01642757278
149 | Dl 0.0283142113138 -1.02243221638
150 | Dl 0.008060891422 -1.02618187506
151 | Dl -0.0133061004444 -1.0274762681
152 | Dl -1.11853875578 -1.0274762681
153 | Dl -0.997979580533 -0.743713298222
154 | Dl -0.614498785111 -0.743713298222
155 | Dl -0.517025410222 -0.743713298222
156 | Dl -0.511574570222 -0.743713298222
157 | Dl -0.450075184458 -0.738785629162
158 | Dl -0.391801897737 -0.724512564011
159 | Dl -0.337519621914 -0.701659015808
160 | Dl -0.287993268846 -0.670989897596
161 | Dl -0.243987750389 -0.633270122417
162 | Dl -0.206267978398 -0.58926460331
163 | Dl -0.17559886473 -0.539738253318
164 | Dl -0.152745321241 -0.485455985483
165 | Dl -0.138472259786 -0.427182712844
166 | Dl -0.133544592222 -0.365683348444
167 | Dl -0.133544592222 0.365366977333
168 | Dl -0.138472259786 0.42687531338
169 | Dl -0.152745321241 0.485172952267
170 | Dl -0.17559886473 0.539491132513
171 | Dl -0.206267978398 0.58906109264
172 | Dl -0.243987750389 0.633114071167
173 | Dl -0.287993268846 0.670881306613
174 | Dl -0.337519621914 0.7015940375
175 | Dl -0.391801897737 0.724483502347
176 | Dl -0.450075184458 0.738780939673
177 | Dl -0.511574570222 0.743717588
178 | Dl -0.517025410222 0.743717588
179 | Dl -0.614498785111 0.743717588
180 | Dl -0.997979580533 0.743717588
181 | Dl -0.997979580533 -0.743713298222
182 | Dl -1.11853875578 -1.0274762681
183 | DP 0 0 0 0 70 0.00254 15
184 | Dl 0.391977936444 -0.747777337733
185 | Dl 0.382259953651 -0.746732845899
186 | Dl 0.373038393029 -0.74370875169
187 | Dl 0.364437270418 -0.738869127051
188 | Dl 0.356580601657 -0.732378043925
189 | Dl 0.349592402583 -0.724399574256
190 | Dl 0.343596689036 -0.715097789986
191 | Dl 0.338717476855 -0.70463676306
192 | Dl 0.335078781877 -0.693180565421
193 | Dl 0.332804619942 -0.680893269013
194 | Dl 0.332019006889 -0.667938945778
195 | Dl 0.332019006889 -0.624653084222
196 | Dl 0.332804618418 -0.611698760513
197 | Dl 0.335078776459 -0.599411462818
198 | Dl 0.338717466187 -0.587955263282
199 | Dl 0.34359667278 -0.577494234053
200 | Dl 0.349592381417 -0.568192447278
201 | Dl 0.356580577273 -0.560213975102
202 | Dl 0.364437245526 -0.553722889673
203 | Dl 0.373038371355 -0.548883263138
204 | Dl 0.382259939935 -0.545859167642
205 | Dl 0.391977936444 -0.544814675333
206 | Dl 0.693055256 -0.544814675333
207 | Dl 0.693055256 0.671999333333
208 | Dl 0.694042585976 0.684300999329
209 | Dl 0.69690207426 0.69596052674
210 | Dl 0.701479968386 0.706824163099
211 | Dl 0.70762251589 0.716738155943
212 | Dl 0.715175964306 0.725548752806
213 | Dl 0.723986561168 0.733102201221
214 | Dl 0.733900554012 0.739244748725
215 | Dl 0.744764190372 0.743822642852
216 | Dl 0.756423717782 0.746682131135
217 | Dl 0.768725383778 0.747669461111
218 | Dl 0.822912868889 0.747669461111
219 | Dl 0.835214534885 0.746682131135
220 | Dl 0.846874062295 0.743822642852
221 | Dl 0.857737698655 0.739244748725
222 | Dl 0.867651691499 0.733102201221
223 | Dl 0.876462288361 0.725548752806
224 | Dl 0.884015736777 0.716738155943
225 | Dl 0.890158284281 0.706824163099
226 | Dl 0.894736178407 0.69596052674
227 | Dl 0.897595666691 0.684300999329
228 | Dl 0.898582996667 0.671999333333
229 | Dl 0.898582996667 -0.544814675333
230 | Dl 1.19004122333 -0.544814675333
231 | Dl 1.19975921378 -0.545859167642
232 | Dl 1.20898078052 -0.548883263138
233 | Dl 1.2175819079 -0.553722889673
234 | Dl 1.22543858025 -0.560213975102
235 | Dl 1.23242678189 -0.568192447278
236 | Dl 1.23842249716 -0.577494234053
237 | Dl 1.24330171038 -0.587955263282
238 | Dl 1.2469404059 -0.599411462818
239 | Dl 1.24921456803 -0.611698760513
240 | Dl 1.25000018111 -0.624653084222
241 | Dl 1.25000018111 -0.667938945778
242 | Dl 1.24921456955 -0.680893269013
243 | Dl 1.24694041132 -0.693180565421
244 | Dl 1.24330172105 -0.70463676306
245 | Dl 1.23842251341 -0.715097789986
246 | Dl 1.23242680306 -0.724399574256
247 | Dl 1.22543860463 -0.732378043925
248 | Dl 1.21758193279 -0.738869127051
249 | Dl 1.2089808022 -0.74370875169
250 | Dl 1.19975922749 -0.746732845899
251 | Dl 1.19004122333 -0.747777337733
252 | Dl 0.391977936444 -0.747777337733
253 | Dl 0.391977936444 -0.747777337733
254 | $EndMODULE DT-Logo-Front
255 | $MODULE DT-Logo-Back
256 | Po 0 0 0 15 00000000 00000000 ~~
257 | Li DT-Logo-Back
258 | T0 0 -4.48650007222 1.524 1.524 0 0.3048 N I 21 "DT-Logo-Back"
259 | T1 0 4.48650007222 1.524 1.524 0 0.3048 N I 21 "G***"
260 | DP 0 0 0 0 45 0.00254 22
261 | Dl 1.11500002778 -1.43850007222
262 | Dl -1.11500002778 -1.43850007222
263 | Dl -1.21826499778 -1.43021840222
264 | Dl -1.31612738778 -1.40623191222
265 | Dl -1.40729941778 -1.36782838222
266 | Dl -1.49049330778 -1.31629559222
267 | Dl -1.56442127778 -1.25292132222
268 | Dl -1.62779554778 -1.17899335222
269 | Dl -1.67932833778 -1.09579946222
270 | Dl -1.71773186778 -1.00462743222
271 | Dl -1.74171835778 -0.906765042222
272 | Dl -1.75000002778 -0.803500072222
273 | Dl -1.75000002778 0.803499987556
274 | Dl -1.74171835778 0.906764959926
275 | Dl -1.71773186778 1.00462735636
276 | Dl -1.67932833778 1.09579939584
277 | Dl -1.62779554778 1.17899329736
278 | Dl -1.56442127778 1.25292127989
279 | Dl -1.49049330778 1.31629556242
280 | Dl -1.40729941778 1.36782836393
281 | Dl -1.31612738778 1.40623190342
282 | Dl -1.21826499778 1.43021839985
283 | Dl -1.11500002778 1.43850007222
284 | Dl 1.11500002778 1.43850007222
285 | Dl 1.21826499778 1.43021839985
286 | Dl 1.31612738778 1.40623190342
287 | Dl 1.40729941778 1.36782836393
288 | Dl 1.49049330778 1.31629556242
289 | Dl 1.56442127778 1.25292127989
290 | Dl 1.62779554778 1.17899329736
291 | Dl 1.67932833778 1.09579939584
292 | Dl 1.71773186778 1.00462735636
293 | Dl 1.74171835778 0.906764959926
294 | Dl 1.75000002778 0.803499987556
295 | Dl 1.75000002778 -0.803500072222
296 | Dl 1.74171835778 -0.906765042222
297 | Dl 1.71773186778 -1.00462743222
298 | Dl 1.67932833778 -1.09579946222
299 | Dl 1.62779554778 -1.17899335222
300 | Dl 1.56442127778 -1.25292132222
301 | Dl 1.49049330778 -1.31629559222
302 | Dl 1.40729941778 -1.36782838222
303 | Dl 1.31612738778 -1.40623191222
304 | Dl 1.21826499778 -1.43021840222
305 | Dl 1.11500002778 -1.43850007222
306 | DP 0 0 0 0 45 0.00254 0
307 | Dl 0.799826470222 -0.551812572889
308 | Dl 0.799826470222 0.551656560444
309 | Dl 0.565762111778 0.551656560444
310 | Dl 0.561958169057 0.551588736518
311 | Dl 0.557617048171 0.551401158364
312 | Dl 0.552923190034 0.551117666424
313 | Dl 0.548061035561 0.550762101138
314 | Dl 0.543215025667 0.550358302944
315 | Dl 0.538569601266 0.549930112284
316 | Dl 0.534309203273 0.549501369598
317 | Dl 0.530618272603 0.549095915324
318 | Dl 0.52768125017 0.548737589904
319 | Dl 0.525682576889 0.548450233778
320 | Dl 0.492995048016 0.540568430728
321 | Dl 0.462283746331 0.52830719253
322 | Dl 0.433893631435 0.512020431606
323 | Dl 0.40816966293 0.49206206038
324 | Dl 0.385456800417 0.468785991278
325 | Dl 0.366100003497 0.442546136722
326 | Dl 0.350444231772 0.413696409136
327 | Dl 0.338834444843 0.382590720946
328 | Dl 0.331615602311 0.349582984574
329 | Dl 0.329132663778 0.315027112444
330 | Dl 0.329132663778 -0.315022850889
331 | Dl 0.331662301481 -0.349341511769
332 | Dl 0.339000486336 -0.381745179104
333 | Dl 0.350771125962 -0.412034607335
334 | Dl 0.366598127977 -0.440010550903
335 | Dl 0.3861054 -0.46547376425
336 | Dl 0.40891684965 -0.488225001817
337 | Dl 0.434656384545 -0.508065018045
338 | Dl 0.462947912304 -0.524794567376
339 | Dl 0.493415340546 -0.538214404251
340 | Dl 0.525682576889 -0.548125283111
341 | Dl 0.528861655226 -0.548802540244
342 | Dl 0.532532627931 -0.549415840178
343 | Dl 0.536580107545 -0.549963455711
344 | Dl 0.54088870661 -0.550443659644
345 | Dl 0.545343037667 -0.550854724778
346 | Dl 0.549827713257 -0.551194923911
347 | Dl 0.554227345922 -0.551462529844
348 | Dl 0.558426548203 -0.551655815378
349 | Dl 0.562309932641 -0.551773053311
350 | Dl 0.565762111778 -0.551812516444
351 | Dl 0.799826470222 -0.551812572889
352 | DP 0 0 0 0 75 0.00254 0
353 | Dl 1.11853875578 -1.0274762681
354 | Dl 1.13990576822 -1.02618187506
355 | Dl 1.16015910005 -1.02243221638
356 | Dl 1.17903130383 -1.01642757278
357 | Dl 1.19625493213 -1.00836822494
358 | Dl 1.2115625375 -0.998454453586
359 | Dl 1.22468667251 -0.9868865394
360 | Dl 1.23535988973 -0.973864763088
361 | Dl 1.24331474171 -0.959589405351
362 | Dl 1.24828378102 -0.944260746888
363 | Dl 1.24999956022 -0.9280790684
364 | Dl 1.24999956022 0.927762714222
365 | Dl 1.24828378102 0.943953377266
366 | Dl 1.24331474171 0.959306407746
367 | Dl 1.23535988973 0.973617677884
368 | Dl 1.22468667251 0.986683059904
369 | Dl 1.2115625375 0.998298426028
370 | Dl 1.19625493213 1.00825964848
371 | Dl 1.17903130383 1.01636259948
372 | Dl 1.16015910005 1.02240315125
373 | Dl 1.13990576822 1.02617717602
374 | Dl 1.11853875578 1.027480546
375 | Dl 0.0133061004444 1.027480546
376 | Dl -0.008060891422 1.02617717602
377 | Dl -0.0283142113138 1.02240315125
378 | Dl -0.0471864102696 1.01636259948
379 | Dl -0.064410039328 1.00825964848
380 | Dl -0.0797176495278 0.998298426028
381 | Dl -0.0928417919076 0.986683059904
382 | Dl -0.103515017506 0.973617677884
383 | Dl -0.111469877362 0.959306407746
384 | Dl -0.116438922514 0.943953377266
385 | Dl -0.118154704 0.927762714222
386 | Dl -0.118154704 -0.9280790684
387 | Dl -0.116438922514 -0.944260746888
388 | Dl -0.111469877362 -0.959589405351
389 | Dl -0.103515017506 -0.973864763088
390 | Dl -0.0928417919076 -0.9868865394
391 | Dl -0.0797176495278 -0.998454453586
392 | Dl -0.064410039328 -1.00836822494
393 | Dl -0.0471864102696 -1.01642757278
394 | Dl -0.0283142113138 -1.02243221638
395 | Dl -0.008060891422 -1.02618187506
396 | Dl 0.0133061004444 -1.0274762681
397 | Dl 1.11853875578 -1.0274762681
398 | Dl 0.997979580533 -0.743713298222
399 | Dl 0.614498785111 -0.743713298222
400 | Dl 0.517025410222 -0.743713298222
401 | Dl 0.511574570222 -0.743713298222
402 | Dl 0.450075184458 -0.738785629162
403 | Dl 0.391801897737 -0.724512564011
404 | Dl 0.337519621914 -0.701659015808
405 | Dl 0.287993268846 -0.670989897596
406 | Dl 0.243987750389 -0.633270122417
407 | Dl 0.206267978398 -0.58926460331
408 | Dl 0.17559886473 -0.539738253318
409 | Dl 0.152745321241 -0.485455985483
410 | Dl 0.138472259786 -0.427182712844
411 | Dl 0.133544592222 -0.365683348444
412 | Dl 0.133544592222 0.365366977333
413 | Dl 0.138472259786 0.42687531338
414 | Dl 0.152745321241 0.485172952267
415 | Dl 0.17559886473 0.539491132513
416 | Dl 0.206267978398 0.58906109264
417 | Dl 0.243987750389 0.633114071167
418 | Dl 0.287993268846 0.670881306613
419 | Dl 0.337519621914 0.7015940375
420 | Dl 0.391801897737 0.724483502347
421 | Dl 0.450075184458 0.738780939673
422 | Dl 0.511574570222 0.743717588
423 | Dl 0.517025410222 0.743717588
424 | Dl 0.614498785111 0.743717588
425 | Dl 0.997979580533 0.743717588
426 | Dl 0.997979580533 -0.743713298222
427 | Dl 1.11853875578 -1.0274762681
428 | DP 0 0 0 0 70 0.00254 0
429 | Dl -0.391977936444 -0.747777337733
430 | Dl -0.382259953651 -0.746732845899
431 | Dl -0.373038393029 -0.74370875169
432 | Dl -0.364437270418 -0.738869127051
433 | Dl -0.356580601657 -0.732378043925
434 | Dl -0.349592402583 -0.724399574256
435 | Dl -0.343596689036 -0.715097789986
436 | Dl -0.338717476855 -0.70463676306
437 | Dl -0.335078781877 -0.693180565421
438 | Dl -0.332804619942 -0.680893269013
439 | Dl -0.332019006889 -0.667938945778
440 | Dl -0.332019006889 -0.624653084222
441 | Dl -0.332804618418 -0.611698760513
442 | Dl -0.335078776459 -0.599411462818
443 | Dl -0.338717466187 -0.587955263282
444 | Dl -0.34359667278 -0.577494234053
445 | Dl -0.349592381417 -0.568192447278
446 | Dl -0.356580577273 -0.560213975102
447 | Dl -0.364437245526 -0.553722889673
448 | Dl -0.373038371355 -0.548883263138
449 | Dl -0.382259939935 -0.545859167642
450 | Dl -0.391977936444 -0.544814675333
451 | Dl -0.693055256 -0.544814675333
452 | Dl -0.693055256 0.671999333333
453 | Dl -0.694042585976 0.684300999329
454 | Dl -0.69690207426 0.69596052674
455 | Dl -0.701479968386 0.706824163099
456 | Dl -0.70762251589 0.716738155943
457 | Dl -0.715175964306 0.725548752806
458 | Dl -0.723986561168 0.733102201221
459 | Dl -0.733900554012 0.739244748725
460 | Dl -0.744764190372 0.743822642852
461 | Dl -0.756423717782 0.746682131135
462 | Dl -0.768725383778 0.747669461111
463 | Dl -0.822912868889 0.747669461111
464 | Dl -0.835214534885 0.746682131135
465 | Dl -0.846874062295 0.743822642852
466 | Dl -0.857737698655 0.739244748725
467 | Dl -0.867651691499 0.733102201221
468 | Dl -0.876462288361 0.725548752806
469 | Dl -0.884015736777 0.716738155943
470 | Dl -0.890158284281 0.706824163099
471 | Dl -0.894736178407 0.69596052674
472 | Dl -0.897595666691 0.684300999329
473 | Dl -0.898582996667 0.671999333333
474 | Dl -0.898582996667 -0.544814675333
475 | Dl -1.19004122333 -0.544814675333
476 | Dl -1.19975921378 -0.545859167642
477 | Dl -1.20898078052 -0.548883263138
478 | Dl -1.2175819079 -0.553722889673
479 | Dl -1.22543858025 -0.560213975102
480 | Dl -1.23242678189 -0.568192447278
481 | Dl -1.23842249716 -0.577494234053
482 | Dl -1.24330171038 -0.587955263282
483 | Dl -1.2469404059 -0.599411462818
484 | Dl -1.24921456803 -0.611698760513
485 | Dl -1.25000018111 -0.624653084222
486 | Dl -1.25000018111 -0.667938945778
487 | Dl -1.24921456955 -0.680893269013
488 | Dl -1.24694041132 -0.693180565421
489 | Dl -1.24330172105 -0.70463676306
490 | Dl -1.23842251341 -0.715097789986
491 | Dl -1.23242680306 -0.724399574256
492 | Dl -1.22543860463 -0.732378043925
493 | Dl -1.21758193279 -0.738869127051
494 | Dl -1.2089808022 -0.74370875169
495 | Dl -1.19975922749 -0.746732845899
496 | Dl -1.19004122333 -0.747777337733
497 | Dl -0.391977936444 -0.747777337733
498 | Dl -0.391977936444 -0.747777337733
499 | $EndMODULE DT-Logo-Back
500 | $EndLIBRARY
--------------------------------------------------------------------------------
/svg/LICENSE:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 2, June 1991
3 |
4 | Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
5 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
6 | Everyone is permitted to copy and distribute verbatim copies
7 | of this license document, but changing it is not allowed.
8 |
9 | Preamble
10 |
11 | The licenses for most software are designed to take away your
12 | freedom to share and change it. By contrast, the GNU General Public
13 | License is intended to guarantee your freedom to share and change free
14 | software--to make sure the software is free for all its users. This
15 | General Public License applies to most of the Free Software
16 | Foundation's software and to any other program whose authors commit to
17 | using it. (Some other Free Software Foundation software is covered by
18 | the GNU Lesser General Public License instead.) You can apply it to
19 | your programs, too.
20 |
21 | When we speak of free software, we are referring to freedom, not
22 | price. Our General Public Licenses are designed to make sure that you
23 | have the freedom to distribute copies of free software (and charge for
24 | this service if you wish), that you receive source code or can get it
25 | if you want it, that you can change the software or use pieces of it
26 | in new free programs; and that you know you can do these things.
27 |
28 | To protect your rights, we need to make restrictions that forbid
29 | anyone to deny you these rights or to ask you to surrender the rights.
30 | These restrictions translate to certain responsibilities for you if you
31 | distribute copies of the software, or if you modify it.
32 |
33 | For example, if you distribute copies of such a program, whether
34 | gratis or for a fee, you must give the recipients all the rights that
35 | you have. You must make sure that they, too, receive or can get the
36 | source code. And you must show them these terms so they know their
37 | rights.
38 |
39 | We protect your rights with two steps: (1) copyright the software, and
40 | (2) offer you this license which gives you legal permission to copy,
41 | distribute and/or modify the software.
42 |
43 | Also, for each author's protection and ours, we want to make certain
44 | that everyone understands that there is no warranty for this free
45 | software. If the software is modified by someone else and passed on, we
46 | want its recipients to know that what they have is not the original, so
47 | that any problems introduced by others will not reflect on the original
48 | authors' reputations.
49 |
50 | Finally, any free program is threatened constantly by software
51 | patents. We wish to avoid the danger that redistributors of a free
52 | program will individually obtain patent licenses, in effect making the
53 | program proprietary. To prevent this, we have made it clear that any
54 | patent must be licensed for everyone's free use or not licensed at all.
55 |
56 | The precise terms and conditions for copying, distribution and
57 | modification follow.
58 |
59 | GNU GENERAL PUBLIC LICENSE
60 | TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
61 |
62 | 0. This License applies to any program or other work which contains
63 | a notice placed by the copyright holder saying it may be distributed
64 | under the terms of this General Public License. The "Program", below,
65 | refers to any such program or work, and a "work based on the Program"
66 | means either the Program or any derivative work under copyright law:
67 | that is to say, a work containing the Program or a portion of it,
68 | either verbatim or with modifications and/or translated into another
69 | language. (Hereinafter, translation is included without limitation in
70 | the term "modification".) Each licensee is addressed as "you".
71 |
72 | Activities other than copying, distribution and modification are not
73 | covered by this License; they are outside its scope. The act of
74 | running the Program is not restricted, and the output from the Program
75 | is covered only if its contents constitute a work based on the
76 | Program (independent of having been made by running the Program).
77 | Whether that is true depends on what the Program does.
78 |
79 | 1. You may copy and distribute verbatim copies of the Program's
80 | source code as you receive it, in any medium, provided that you
81 | conspicuously and appropriately publish on each copy an appropriate
82 | copyright notice and disclaimer of warranty; keep intact all the
83 | notices that refer to this License and to the absence of any warranty;
84 | and give any other recipients of the Program a copy of this License
85 | along with the Program.
86 |
87 | You may charge a fee for the physical act of transferring a copy, and
88 | you may at your option offer warranty protection in exchange for a fee.
89 |
90 | 2. You may modify your copy or copies of the Program or any portion
91 | of it, thus forming a work based on the Program, and copy and
92 | distribute such modifications or work under the terms of Section 1
93 | above, provided that you also meet all of these conditions:
94 |
95 | a) You must cause the modified files to carry prominent notices
96 | stating that you changed the files and the date of any change.
97 |
98 | b) You must cause any work that you distribute or publish, that in
99 | whole or in part contains or is derived from the Program or any
100 | part thereof, to be licensed as a whole at no charge to all third
101 | parties under the terms of this License.
102 |
103 | c) If the modified program normally reads commands interactively
104 | when run, you must cause it, when started running for such
105 | interactive use in the most ordinary way, to print or display an
106 | announcement including an appropriate copyright notice and a
107 | notice that there is no warranty (or else, saying that you provide
108 | a warranty) and that users may redistribute the program under
109 | these conditions, and telling the user how to view a copy of this
110 | License. (Exception: if the Program itself is interactive but
111 | does not normally print such an announcement, your work based on
112 | the Program is not required to print an announcement.)
113 |
114 | These requirements apply to the modified work as a whole. If
115 | identifiable sections of that work are not derived from the Program,
116 | and can be reasonably considered independent and separate works in
117 | themselves, then this License, and its terms, do not apply to those
118 | sections when you distribute them as separate works. But when you
119 | distribute the same sections as part of a whole which is a work based
120 | on the Program, the distribution of the whole must be on the terms of
121 | this License, whose permissions for other licensees extend to the
122 | entire whole, and thus to each and every part regardless of who wrote it.
123 |
124 | Thus, it is not the intent of this section to claim rights or contest
125 | your rights to work written entirely by you; rather, the intent is to
126 | exercise the right to control the distribution of derivative or
127 | collective works based on the Program.
128 |
129 | In addition, mere aggregation of another work not based on the Program
130 | with the Program (or with a work based on the Program) on a volume of
131 | a storage or distribution medium does not bring the other work under
132 | the scope of this License.
133 |
134 | 3. You may copy and distribute the Program (or a work based on it,
135 | under Section 2) in object code or executable form under the terms of
136 | Sections 1 and 2 above provided that you also do one of the following:
137 |
138 | a) Accompany it with the complete corresponding machine-readable
139 | source code, which must be distributed under the terms of Sections
140 | 1 and 2 above on a medium customarily used for software interchange; or,
141 |
142 | b) Accompany it with a written offer, valid for at least three
143 | years, to give any third party, for a charge no more than your
144 | cost of physically performing source distribution, a complete
145 | machine-readable copy of the corresponding source code, to be
146 | distributed under the terms of Sections 1 and 2 above on a medium
147 | customarily used for software interchange; or,
148 |
149 | c) Accompany it with the information you received as to the offer
150 | to distribute corresponding source code. (This alternative is
151 | allowed only for noncommercial distribution and only if you
152 | received the program in object code or executable form with such
153 | an offer, in accord with Subsection b above.)
154 |
155 | The source code for a work means the preferred form of the work for
156 | making modifications to it. For an executable work, complete source
157 | code means all the source code for all modules it contains, plus any
158 | associated interface definition files, plus the scripts used to
159 | control compilation and installation of the executable. However, as a
160 | special exception, the source code distributed need not include
161 | anything that is normally distributed (in either source or binary
162 | form) with the major components (compiler, kernel, and so on) of the
163 | operating system on which the executable runs, unless that component
164 | itself accompanies the executable.
165 |
166 | If distribution of executable or object code is made by offering
167 | access to copy from a designated place, then offering equivalent
168 | access to copy the source code from the same place counts as
169 | distribution of the source code, even though third parties are not
170 | compelled to copy the source along with the object code.
171 |
172 | 4. You may not copy, modify, sublicense, or distribute the Program
173 | except as expressly provided under this License. Any attempt
174 | otherwise to copy, modify, sublicense or distribute the Program is
175 | void, and will automatically terminate your rights under this License.
176 | However, parties who have received copies, or rights, from you under
177 | this License will not have their licenses terminated so long as such
178 | parties remain in full compliance.
179 |
180 | 5. You are not required to accept this License, since you have not
181 | signed it. However, nothing else grants you permission to modify or
182 | distribute the Program or its derivative works. These actions are
183 | prohibited by law if you do not accept this License. Therefore, by
184 | modifying or distributing the Program (or any work based on the
185 | Program), you indicate your acceptance of this License to do so, and
186 | all its terms and conditions for copying, distributing or modifying
187 | the Program or works based on it.
188 |
189 | 6. Each time you redistribute the Program (or any work based on the
190 | Program), the recipient automatically receives a license from the
191 | original licensor to copy, distribute or modify the Program subject to
192 | these terms and conditions. You may not impose any further
193 | restrictions on the recipients' exercise of the rights granted herein.
194 | You are not responsible for enforcing compliance by third parties to
195 | this License.
196 |
197 | 7. If, as a consequence of a court judgment or allegation of patent
198 | infringement or for any other reason (not limited to patent issues),
199 | conditions are imposed on you (whether by court order, agreement or
200 | otherwise) that contradict the conditions of this License, they do not
201 | excuse you from the conditions of this License. If you cannot
202 | distribute so as to satisfy simultaneously your obligations under this
203 | License and any other pertinent obligations, then as a consequence you
204 | may not distribute the Program at all. For example, if a patent
205 | license would not permit royalty-free redistribution of the Program by
206 | all those who receive copies directly or indirectly through you, then
207 | the only way you could satisfy both it and this License would be to
208 | refrain entirely from distribution of the Program.
209 |
210 | If any portion of this section is held invalid or unenforceable under
211 | any particular circumstance, the balance of the section is intended to
212 | apply and the section as a whole is intended to apply in other
213 | circumstances.
214 |
215 | It is not the purpose of this section to induce you to infringe any
216 | patents or other property right claims or to contest validity of any
217 | such claims; this section has the sole purpose of protecting the
218 | integrity of the free software distribution system, which is
219 | implemented by public license practices. Many people have made
220 | generous contributions to the wide range of software distributed
221 | through that system in reliance on consistent application of that
222 | system; it is up to the author/donor to decide if he or she is willing
223 | to distribute software through any other system and a licensee cannot
224 | impose that choice.
225 |
226 | This section is intended to make thoroughly clear what is believed to
227 | be a consequence of the rest of this License.
228 |
229 | 8. If the distribution and/or use of the Program is restricted in
230 | certain countries either by patents or by copyrighted interfaces, the
231 | original copyright holder who places the Program under this License
232 | may add an explicit geographical distribution limitation excluding
233 | those countries, so that distribution is permitted only in or among
234 | countries not thus excluded. In such case, this License incorporates
235 | the limitation as if written in the body of this License.
236 |
237 | 9. The Free Software Foundation may publish revised and/or new versions
238 | of the General Public License from time to time. Such new versions will
239 | be similar in spirit to the present version, but may differ in detail to
240 | address new problems or concerns.
241 |
242 | Each version is given a distinguishing version number. If the Program
243 | specifies a version number of this License which applies to it and "any
244 | later version", you have the option of following the terms and conditions
245 | either of that version or of any later version published by the Free
246 | Software Foundation. If the Program does not specify a version number of
247 | this License, you may choose any version ever published by the Free Software
248 | Foundation.
249 |
250 | 10. If you wish to incorporate parts of the Program into other free
251 | programs whose distribution conditions are different, write to the author
252 | to ask for permission. For software which is copyrighted by the Free
253 | Software Foundation, write to the Free Software Foundation; we sometimes
254 | make exceptions for this. Our decision will be guided by the two goals
255 | of preserving the free status of all derivatives of our free software and
256 | of promoting the sharing and reuse of software generally.
257 |
258 | NO WARRANTY
259 |
260 | 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
261 | FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
262 | OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
263 | PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
264 | OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
265 | MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
266 | TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
267 | PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
268 | REPAIR OR CORRECTION.
269 |
270 | 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
271 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
272 | REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
273 | INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
274 | OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
275 | TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
276 | YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
277 | PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
278 | POSSIBILITY OF SUCH DAMAGES.
279 |
280 | END OF TERMS AND CONDITIONS
281 |
282 | How to Apply These Terms to Your New Programs
283 |
284 | If you develop a new program, and you want it to be of the greatest
285 | possible use to the public, the best way to achieve this is to make it
286 | free software which everyone can redistribute and change under these terms.
287 |
288 | To do so, attach the following notices to the program. It is safest
289 | to attach them to the start of each source file to most effectively
290 | convey the exclusion of warranty; and each file should have at least
291 | the "copyright" line and a pointer to where the full notice is found.
292 |
293 |
294 | Copyright (C)
295 |
296 | This program is free software; you can redistribute it and/or modify
297 | it under the terms of the GNU General Public License as published by
298 | the Free Software Foundation; either version 2 of the License, or
299 | (at your option) any later version.
300 |
301 | This program is distributed in the hope that it will be useful,
302 | but WITHOUT ANY WARRANTY; without even the implied warranty of
303 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
304 | GNU General Public License for more details.
305 |
306 | You should have received a copy of the GNU General Public License along
307 | with this program; if not, write to the Free Software Foundation, Inc.,
308 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
309 |
310 | Also add information on how to contact you by electronic and paper mail.
311 |
312 | If the program is interactive, make it output a short notice like this
313 | when it starts in an interactive mode:
314 |
315 | Gnomovision version 69, Copyright (C) year name of author
316 | Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
317 | This is free software, and you are welcome to redistribute it
318 | under certain conditions; type `show c' for details.
319 |
320 | The hypothetical commands `show w' and `show c' should show the appropriate
321 | parts of the General Public License. Of course, the commands you use may
322 | be called something other than `show w' and `show c'; they could even be
323 | mouse-clicks or menu items--whatever suits your program.
324 |
325 | You should also get your employer (if you work as a programmer) or your
326 | school, if any, to sign a "copyright disclaimer" for the program, if
327 | necessary. Here is a sample; alter the names:
328 |
329 | Yoyodyne, Inc., hereby disclaims all copyright interest in the program
330 | `Gnomovision' (which makes passes at compilers) written by James Hacker.
331 |
332 | , 1 April 1989
333 | Ty Coon, President of Vice
334 |
335 | This General Public License does not permit incorporating your program into
336 | proprietary programs. If your program is a subroutine library, you may
337 | consider it more useful to permit linking proprietary applications with the
338 | library. If this is what you want to do, use the GNU Lesser General
339 | Public License instead of this License.
340 |
--------------------------------------------------------------------------------
/svg/svg/svg.py:
--------------------------------------------------------------------------------
1 | # SVG parser in Python
2 |
3 | # Copyright (C) 2013 -- CJlano < cjlano @ free.fr >
4 |
5 | # This program is free software; you can redistribute it and/or modify
6 | # it under the terms of the GNU General Public License as published by
7 | # the Free Software Foundation; either version 2 of the License, or
8 | # (at your option) any later version.
9 | #
10 | # This program is distributed in the hope that it will be useful,
11 | # but WITHOUT ANY WARRANTY; without even the implied warranty of
12 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 | # GNU General Public License for more details.
14 | #
15 | # You should have received a copy of the GNU General Public License along
16 | # with this program; if not, write to the Free Software Foundation, Inc.,
17 | # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
18 |
19 | from __future__ import absolute_import
20 | import traceback
21 | import sys
22 | import os
23 | import copy
24 | import re
25 | import xml.etree.ElementTree as etree
26 | import itertools
27 | import operator
28 | import json
29 | from .geometry import *
30 |
31 | svg_ns = '{http://www.w3.org/2000/svg}'
32 |
33 | # Regex commonly used
34 | number_re = r'[-+]?(?:\d+(?:\.\d*)?|\.\d+)(?:[eE][-+]?\d+)?'
35 | unit_re = r'em|ex|px|in|cm|mm|pt|pc|%'
36 |
37 | # Unit converter
38 | unit_convert = {
39 | None: 1, # Default unit (same as pixel)
40 | 'px': 1, # px: pixel. Default SVG unit
41 | 'em': 10, # 1 em = 10 px FIXME
42 | 'ex': 5, # 1 ex = 5 px FIXME
43 | 'in': 96, # 1 in = 96 px
44 | 'cm': 96 / 2.54, # 1 cm = 1/2.54 in
45 | 'mm': 96 / 25.4, # 1 mm = 1/25.4 in
46 | 'pt': 96 / 72.0, # 1 pt = 1/72 in
47 | 'pc': 96 / 6.0, # 1 pc = 1/6 in
48 | '%' : 1 / 100.0 # 1 percent
49 | }
50 |
51 | class Transformable:
52 | '''Abstract class for objects that can be geometrically drawn & transformed'''
53 | def __init__(self, elt=None):
54 | # a 'Transformable' is represented as a list of Transformable items
55 | self.items = []
56 | self.id = hex(id(self))
57 | # Unit transformation matrix on init
58 | self.matrix = Matrix()
59 | self.viewport = Point(800, 600) # default viewport is 800x600
60 | if elt is not None:
61 | self.id = elt.get('id', self.id)
62 | # Parse transform attibute to update self.matrix
63 | self.getTransformations(elt)
64 |
65 | def bbox(self):
66 | '''Bounding box'''
67 | bboxes = [x.bbox() for x in self.items]
68 | if len( bboxes ) < 1:
69 | return (Point(0, 0), Point(0, 0))
70 | xmin = min([b[0].x for b in bboxes])
71 | xmax = max([b[1].x for b in bboxes])
72 | ymin = min([b[0].y for b in bboxes])
73 | ymax = max([b[1].y for b in bboxes])
74 |
75 | return (Point(xmin,ymin), Point(xmax,ymax))
76 |
77 | # Parse transform field
78 | def getTransformations(self, elt):
79 | t = elt.get('transform')
80 | if t is None: return
81 |
82 | svg_transforms = [
83 | 'matrix', 'translate', 'scale', 'rotate', 'skewX', 'skewY']
84 |
85 | # match any SVG transformation with its parameter (until final parenthese)
86 | # [^)]* == anything but a closing parenthese
87 | # '|'.join == OR-list of SVG transformations
88 | transforms = re.findall(
89 | '|'.join([x + '[^)]*\)' for x in svg_transforms]), t)
90 |
91 | for t in transforms:
92 | op, arg = t.split('(')
93 | op = op.strip()
94 | # Keep only numbers
95 | arg = [float(x) for x in re.findall(number_re, arg)]
96 | print('transform: ' + op + ' '+ str(arg))
97 |
98 | if op == 'matrix':
99 | self.matrix *= Matrix(arg)
100 |
101 | if op == 'translate':
102 | tx = arg[0]
103 | if len(arg) == 1: ty = 0
104 | else: ty = arg[1]
105 | self.matrix *= Matrix([1, 0, 0, 1, tx, ty])
106 |
107 | if op == 'scale':
108 | sx = arg[0]
109 | if len(arg) == 1: sy = sx
110 | else: sy = arg[1]
111 | self.matrix *= Matrix([sx, 0, 0, sy, 0, 0])
112 |
113 | if op == 'rotate':
114 | cosa = math.cos(math.radians(arg[0]))
115 | sina = math.sin(math.radians(arg[0]))
116 | if len(arg) != 1:
117 | tx, ty = arg[1:3]
118 | self.matrix *= Matrix([1, 0, 0, 1, tx, ty])
119 | self.matrix *= Matrix([cosa, sina, -sina, cosa, 0, 0])
120 | if len(arg) != 1:
121 | self.matrix *= Matrix([1, 0, 0, 1, -tx, -ty])
122 |
123 | if op == 'skewX':
124 | tana = math.tan(math.radians(arg[0]))
125 | self.matrix *= Matrix([1, 0, tana, 1, 0, 0])
126 |
127 | if op == 'skewY':
128 | tana = math.tan(math.radians(arg[0]))
129 | self.matrix *= Matrix([1, tana, 0, 1, 0, 0])
130 |
131 | def transform(self, matrix=None):
132 | if matrix is None:
133 | matrix = self.matrix
134 | else:
135 | matrix *= self.matrix
136 | #print( "do transform: {}: {}".format( self.__class__.__name__, matrix ) )
137 | #print( "do transform: {}: {}".format( self, matrix ) )
138 | #traceback.print_stack()
139 | for x in self.items:
140 | x.transform(matrix)
141 |
142 | def length(self, v, mode='xy'):
143 | # Handle empty (non-existing) length element
144 | if v is None:
145 | return 0
146 |
147 | # Get length value
148 | m = re.search(number_re, v)
149 | if m: value = m.group(0)
150 | else: raise TypeError(v + 'is not a valid length')
151 |
152 | # Get length unit
153 | m = re.search(unit_re, v)
154 | if m: unit = m.group(0)
155 | else: unit = None
156 |
157 | if unit == '%':
158 | if mode == 'x':
159 | return float(value) * unit_convert[unit] * self.viewport.x
160 | if mode == 'y':
161 | return float(value) * unit_convert[unit] * self.viewport.y
162 | if mode == 'xy':
163 | return float(value) * unit_convert[unit] * self.viewport.x # FIXME
164 |
165 | return float(value) * unit_convert[unit]
166 |
167 | def xlength(self, x):
168 | return self.length(x, 'x')
169 | def ylength(self, y):
170 | return self.length(y, 'y')
171 |
172 | def flatten(self):
173 | '''Flatten the SVG objects nested list into a flat (1-D) list,
174 | removing Groups'''
175 | # http://rightfootin.blogspot.fr/2006/09/more-on-python-flatten.html
176 | # Assigning a slice a[i:i+1] with a list actually replaces the a[i]
177 | # element with the content of the assigned list
178 | i = 0
179 | flat = copy.deepcopy(self.items)
180 | while i < len(flat):
181 | while isinstance(flat[i], Group):
182 | flat[i:i+1] = flat[i].items
183 | i += 1
184 | return flat
185 |
186 | def scale(self, ratio):
187 | for x in self.items:
188 | x.scale(ratio)
189 | return self
190 |
191 | def translate(self, offset):
192 | for x in self.items:
193 | x.translate(offset)
194 | return self
195 |
196 | def rotate(self, angle):
197 | for x in self.items:
198 | x.rotate(angle)
199 | return self
200 |
201 | class Svg(Transformable):
202 | '''SVG class: use parse to parse a file'''
203 | # class Svg handles the