python3-ufolib 2.1.1-1 / usr / share / doc / ufolib / html / _modules / ufoLib / pointPen.html

This file is indexed.

/usr/share/doc/ufolib/html/_modules/ufoLib/pointPen.html is in python3-ufolib 2.1.1-1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below. 

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
  "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">

<html xmlns="http://www.w3.org/1999/xhtml">
  <head>
    <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
    <title>ufoLib.pointPen &#8212; ufoLib 1.3.0a documentation</title>
    <link rel="stylesheet" href="../../_static/classic.css" type="text/css" />
    <link rel="stylesheet" href="../../_static/pygments.css" type="text/css" />
    <script type="text/javascript">
      var DOCUMENTATION_OPTIONS = {
        URL_ROOT:    '../../',
        VERSION:     '1.3.0a',
        COLLAPSE_INDEX: false,
        FILE_SUFFIX: '.html',
        HAS_SOURCE:  true,
        SOURCELINK_SUFFIX: '.txt'
      };
    </script>
    <script type="text/javascript" src="../../_static/jquery.js"></script>
    <script type="text/javascript" src="../../_static/underscore.js"></script>
    <script type="text/javascript" src="../../_static/doctools.js"></script>
    <link rel="index" title="Index" href="../../genindex.html" />
    <link rel="search" title="Search" href="../../search.html" /> 
  </head>
  <body>
    <div class="related" role="navigation" aria-label="related navigation">
      <h3>Navigation</h3>
      <ul>
        <li class="right" style="margin-right: 10px">
          <a href="../../genindex.html" title="General Index"
             accesskey="I">index</a></li>
        <li class="right" >
          <a href="../../py-modindex.html" title="Python Module Index"
             >modules</a> |</li>
        <li class="nav-item nav-item-0"><a href="../../index.html">ufoLib 1.3.0a documentation</a> &#187;</li>
          <li class="nav-item nav-item-1"><a href="../index.html" >Module code</a> &#187;</li>
          <li class="nav-item nav-item-2"><a href="../ufoLib.html" accesskey="U">ufoLib</a> &#187;</li> 
      </ul>
    </div>  

    <div class="document">
      <div class="documentwrapper">
        <div class="bodywrapper">
          <div class="body" role="main">
            
  <h1>Source code for ufoLib.pointPen</h1><div class="highlight"><pre>
<span></span><span class="sd">&quot;&quot;&quot;</span>
<span class="sd">=========</span>
<span class="sd">PointPens</span>
<span class="sd">=========</span>

<span class="sd">Where **SegmentPens** have an intuitive approach to drawing</span>
<span class="sd">(if you&#39;re familiar with postscript anyway), the **PointPen**</span>
<span class="sd">is geared towards accessing all the data in the contours of</span>
<span class="sd">the glyph. A PointsPen has a very simple interface, it just</span>
<span class="sd">steps through all the points in a call from glyph.drawPoints().</span>
<span class="sd">This allows the caller to provide more data for each point.</span>
<span class="sd">For instance, whether or not a point is smooth, and its name.</span>
<span class="sd">&quot;&quot;&quot;</span>
<span class="kn">from</span> <span class="nn">fontTools.pens.basePen</span> <span class="k">import</span> <span class="n">AbstractPen</span>
<span class="kn">import</span> <span class="nn">math</span>

<span class="n">__all__</span> <span class="o">=</span> <span class="p">[</span><span class="s2">&quot;AbstractPointPen&quot;</span><span class="p">,</span> <span class="s2">&quot;BasePointToSegmentPen&quot;</span><span class="p">,</span> <span class="s2">&quot;PointToSegmentPen&quot;</span><span class="p">,</span>
		   <span class="s2">&quot;SegmentToPointPen&quot;</span><span class="p">]</span>


<div class="viewcode-block" id="AbstractPointPen"><a class="viewcode-back" href="../../ufoLib/pointPen.html#ufoLib.pointPen.AbstractPointPen">[docs]</a><span class="k">class</span> <span class="nc">AbstractPointPen</span><span class="p">(</span><span class="nb">object</span><span class="p">):</span>
	<span class="sd">&quot;&quot;&quot;</span>
<span class="sd">	Baseclass for all PointPens.</span>
<span class="sd">	&quot;&quot;&quot;</span>

<div class="viewcode-block" id="AbstractPointPen.beginPath"><a class="viewcode-back" href="../../ufoLib/pointPen.html#ufoLib.pointPen.AbstractPointPen.beginPath">[docs]</a>	<span class="k">def</span> <span class="nf">beginPath</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">identifier</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">):</span>
		<span class="sd">&quot;&quot;&quot;Start a new sub path.&quot;&quot;&quot;</span>
		<span class="k">raise</span> <span class="ne">NotImplementedError</span></div>

<div class="viewcode-block" id="AbstractPointPen.endPath"><a class="viewcode-back" href="../../ufoLib/pointPen.html#ufoLib.pointPen.AbstractPointPen.endPath">[docs]</a>	<span class="k">def</span> <span class="nf">endPath</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
		<span class="sd">&quot;&quot;&quot;End the current sub path.&quot;&quot;&quot;</span>
		<span class="k">raise</span> <span class="ne">NotImplementedError</span></div>

<div class="viewcode-block" id="AbstractPointPen.addPoint"><a class="viewcode-back" href="../../ufoLib/pointPen.html#ufoLib.pointPen.AbstractPointPen.addPoint">[docs]</a>	<span class="k">def</span> <span class="nf">addPoint</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">smooth</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span> <span class="n">name</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span>
				 <span class="n">identifier</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">):</span>
		<span class="sd">&quot;&quot;&quot;Add a point to the current sub path.&quot;&quot;&quot;</span>
		<span class="k">raise</span> <span class="ne">NotImplementedError</span></div>

<div class="viewcode-block" id="AbstractPointPen.addComponent"><a class="viewcode-back" href="../../ufoLib/pointPen.html#ufoLib.pointPen.AbstractPointPen.addComponent">[docs]</a>	<span class="k">def</span> <span class="nf">addComponent</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">baseGlyphName</span><span class="p">,</span> <span class="n">transformation</span><span class="p">,</span> <span class="n">identifier</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span>
					 <span class="o">**</span><span class="n">kwargs</span><span class="p">):</span>
		<span class="sd">&quot;&quot;&quot;Add a sub glyph.&quot;&quot;&quot;</span>
		<span class="k">raise</span> <span class="ne">NotImplementedError</span></div></div>


<div class="viewcode-block" id="BasePointToSegmentPen"><a class="viewcode-back" href="../../ufoLib/pointPen.html#ufoLib.pointPen.BasePointToSegmentPen">[docs]</a><span class="k">class</span> <span class="nc">BasePointToSegmentPen</span><span class="p">(</span><span class="n">AbstractPointPen</span><span class="p">):</span>
	<span class="sd">&quot;&quot;&quot;</span>
<span class="sd">	Base class for retrieving the outline in a segment-oriented</span>
<span class="sd">	way. The PointPen protocol is simple yet also a little tricky,</span>
<span class="sd">	so when you need an outline presented as segments but you have</span>
<span class="sd">	as points, do use this base implementation as it properly takes</span>
<span class="sd">	care of all the edge cases.</span>
<span class="sd">	&quot;&quot;&quot;</span>

	<span class="k">def</span> <span class="nf">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">currentPath</span> <span class="o">=</span> <span class="kc">None</span>

	<span class="k">def</span> <span class="nf">beginPath</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">):</span>
		<span class="k">assert</span> <span class="bp">self</span><span class="o">.</span><span class="n">currentPath</span> <span class="ow">is</span> <span class="kc">None</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">currentPath</span> <span class="o">=</span> <span class="p">[]</span>

	<span class="k">def</span> <span class="nf">_flushContour</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">segments</span><span class="p">):</span>
		<span class="sd">&quot;&quot;&quot;Override this method.</span>

<span class="sd">		It will be called for each non-empty sub path with a list</span>
<span class="sd">		of segments: the &#39;segments&#39; argument.</span>

<span class="sd">		The segments list contains tuples of length 2:</span>
<span class="sd">			(segmentType, points)</span>

<span class="sd">		segmentType is one of &quot;move&quot;, &quot;line&quot;, &quot;curve&quot; or &quot;qcurve&quot;.</span>
<span class="sd">		&quot;move&quot; may only occur as the first segment, and it signifies</span>
<span class="sd">		an OPEN path. A CLOSED path does NOT start with a &quot;move&quot;, in</span>
<span class="sd">		fact it will not contain a &quot;move&quot; at ALL.</span>

<span class="sd">		The &#39;points&#39; field in the 2-tuple is a list of point info</span>
<span class="sd">		tuples. The list has 1 or more items, a point tuple has</span>
<span class="sd">		four items:</span>
<span class="sd">			(point, smooth, name, kwargs)</span>
<span class="sd">		&#39;point&#39; is an (x, y) coordinate pair.</span>

<span class="sd">		For a closed path, the initial moveTo point is defined as</span>
<span class="sd">		the last point of the last segment.</span>

<span class="sd">		The &#39;points&#39; list of &quot;move&quot; and &quot;line&quot; segments always contains</span>
<span class="sd">		exactly one point tuple.</span>
<span class="sd">		&quot;&quot;&quot;</span>
		<span class="k">raise</span> <span class="ne">NotImplementedError</span>

	<span class="k">def</span> <span class="nf">endPath</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
		<span class="k">assert</span> <span class="bp">self</span><span class="o">.</span><span class="n">currentPath</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span>
		<span class="n">points</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">currentPath</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">currentPath</span> <span class="o">=</span> <span class="kc">None</span>
		<span class="k">if</span> <span class="ow">not</span> <span class="n">points</span><span class="p">:</span>
			<span class="k">return</span>
		<span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">points</span><span class="p">)</span> <span class="o">==</span> <span class="mi">1</span><span class="p">:</span>
			<span class="c1"># Not much more we can do than output a single move segment.</span>
			<span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span><span class="p">,</span> <span class="n">smooth</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="n">kwargs</span> <span class="o">=</span> <span class="n">points</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span>
			<span class="n">segments</span> <span class="o">=</span> <span class="p">[(</span><span class="s2">&quot;move&quot;</span><span class="p">,</span> <span class="p">[(</span><span class="n">pt</span><span class="p">,</span> <span class="n">smooth</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="n">kwargs</span><span class="p">)])]</span>
			<span class="bp">self</span><span class="o">.</span><span class="n">_flushContour</span><span class="p">(</span><span class="n">segments</span><span class="p">)</span>
			<span class="k">return</span>
		<span class="n">segments</span> <span class="o">=</span> <span class="p">[]</span>
		<span class="k">if</span> <span class="n">points</span><span class="p">[</span><span class="mi">0</span><span class="p">][</span><span class="mi">1</span><span class="p">]</span> <span class="o">==</span> <span class="s2">&quot;move&quot;</span><span class="p">:</span>
			<span class="c1"># It&#39;s an open contour, insert a &quot;move&quot; segment for the first</span>
			<span class="c1"># point and remove that first point from the point list.</span>
			<span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span><span class="p">,</span> <span class="n">smooth</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="n">kwargs</span> <span class="o">=</span> <span class="n">points</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span>
			<span class="n">segments</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="s2">&quot;move&quot;</span><span class="p">,</span> <span class="p">[(</span><span class="n">pt</span><span class="p">,</span> <span class="n">smooth</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="n">kwargs</span><span class="p">)]))</span>
			<span class="n">points</span><span class="o">.</span><span class="n">pop</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
		<span class="k">else</span><span class="p">:</span>
			<span class="c1"># It&#39;s a closed contour. Locate the first on-curve point, and</span>
			<span class="c1"># rotate the point list so that it _ends_ with an on-curve</span>
			<span class="c1"># point.</span>
			<span class="n">firstOnCurve</span> <span class="o">=</span> <span class="kc">None</span>
			<span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">points</span><span class="p">)):</span>
				<span class="n">segmentType</span> <span class="o">=</span> <span class="n">points</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="mi">1</span><span class="p">]</span>
				<span class="k">if</span> <span class="n">segmentType</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span><span class="p">:</span>
					<span class="n">firstOnCurve</span> <span class="o">=</span> <span class="n">i</span>
					<span class="k">break</span>
			<span class="k">if</span> <span class="n">firstOnCurve</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span>
				<span class="c1"># Special case for quadratics: a contour with no on-curve</span>
				<span class="c1"># points. Add a &quot;None&quot; point. (See also the Pen protocol&#39;s</span>
				<span class="c1"># qCurveTo() method and fontTools.pens.basePen.py.)</span>
				<span class="n">points</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="kc">None</span><span class="p">,</span> <span class="s2">&quot;qcurve&quot;</span><span class="p">,</span> <span class="kc">None</span><span class="p">,</span> <span class="kc">None</span><span class="p">,</span> <span class="kc">None</span><span class="p">))</span>
			<span class="k">else</span><span class="p">:</span>
				<span class="n">points</span> <span class="o">=</span> <span class="n">points</span><span class="p">[</span><span class="n">firstOnCurve</span><span class="o">+</span><span class="mi">1</span><span class="p">:]</span> <span class="o">+</span> <span class="n">points</span><span class="p">[:</span><span class="n">firstOnCurve</span><span class="o">+</span><span class="mi">1</span><span class="p">]</span>

		<span class="n">currentSegment</span> <span class="o">=</span> <span class="p">[]</span>
		<span class="k">for</span> <span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span><span class="p">,</span> <span class="n">smooth</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="n">kwargs</span> <span class="ow">in</span> <span class="n">points</span><span class="p">:</span>
			<span class="n">currentSegment</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="n">pt</span><span class="p">,</span> <span class="n">smooth</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="n">kwargs</span><span class="p">))</span>
			<span class="k">if</span> <span class="n">segmentType</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span>
				<span class="k">continue</span>
			<span class="n">segments</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="n">segmentType</span><span class="p">,</span> <span class="n">currentSegment</span><span class="p">))</span>
			<span class="n">currentSegment</span> <span class="o">=</span> <span class="p">[]</span>

		<span class="bp">self</span><span class="o">.</span><span class="n">_flushContour</span><span class="p">(</span><span class="n">segments</span><span class="p">)</span>

	<span class="k">def</span> <span class="nf">addPoint</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">smooth</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span> <span class="n">name</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">):</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">currentPath</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span><span class="p">,</span> <span class="n">smooth</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="n">kwargs</span><span class="p">))</span></div>


<div class="viewcode-block" id="PointToSegmentPen"><a class="viewcode-back" href="../../ufoLib/pointPen.html#ufoLib.pointPen.PointToSegmentPen">[docs]</a><span class="k">class</span> <span class="nc">PointToSegmentPen</span><span class="p">(</span><span class="n">BasePointToSegmentPen</span><span class="p">):</span>
	<span class="sd">&quot;&quot;&quot;</span>
<span class="sd">	Adapter class that converts the PointPen protocol to the</span>
<span class="sd">	(Segment)Pen protocol.</span>
<span class="sd">	&quot;&quot;&quot;</span>

	<span class="k">def</span> <span class="nf">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">segmentPen</span><span class="p">,</span> <span class="n">outputImpliedClosingLine</span><span class="o">=</span><span class="kc">False</span><span class="p">):</span>
		<span class="n">BasePointToSegmentPen</span><span class="o">.</span><span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">)</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">pen</span> <span class="o">=</span> <span class="n">segmentPen</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">outputImpliedClosingLine</span> <span class="o">=</span> <span class="n">outputImpliedClosingLine</span>

	<span class="k">def</span> <span class="nf">_flushContour</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">segments</span><span class="p">):</span>
		<span class="k">assert</span> <span class="nb">len</span><span class="p">(</span><span class="n">segments</span><span class="p">)</span> <span class="o">&gt;=</span> <span class="mi">1</span>
		<span class="n">pen</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">pen</span>
		<span class="k">if</span> <span class="n">segments</span><span class="p">[</span><span class="mi">0</span><span class="p">][</span><span class="mi">0</span><span class="p">]</span> <span class="o">==</span> <span class="s2">&quot;move&quot;</span><span class="p">:</span>
			<span class="c1"># It&#39;s an open path.</span>
			<span class="n">closed</span> <span class="o">=</span> <span class="kc">False</span>
			<span class="n">points</span> <span class="o">=</span> <span class="n">segments</span><span class="p">[</span><span class="mi">0</span><span class="p">][</span><span class="mi">1</span><span class="p">]</span>
			<span class="k">assert</span> <span class="nb">len</span><span class="p">(</span><span class="n">points</span><span class="p">)</span> <span class="o">==</span> <span class="mi">1</span><span class="p">,</span> <span class="s2">&quot;illegal move segment point count: </span><span class="si">%d</span><span class="s2">&quot;</span> <span class="o">%</span> <span class="nb">len</span><span class="p">(</span><span class="n">points</span><span class="p">)</span>
			<span class="n">movePt</span><span class="p">,</span> <span class="n">smooth</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="n">kwargs</span> <span class="o">=</span> <span class="n">points</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span>
			<span class="k">del</span> <span class="n">segments</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span>
		<span class="k">else</span><span class="p">:</span>
			<span class="c1"># It&#39;s a closed path, do a moveTo to the last</span>
			<span class="c1"># point of the last segment.</span>
			<span class="n">closed</span> <span class="o">=</span> <span class="kc">True</span>
			<span class="n">segmentType</span><span class="p">,</span> <span class="n">points</span> <span class="o">=</span> <span class="n">segments</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span>
			<span class="n">movePt</span><span class="p">,</span> <span class="n">smooth</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="n">kwargs</span> <span class="o">=</span> <span class="n">points</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span>
		<span class="k">if</span> <span class="n">movePt</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span>
			<span class="c1"># quad special case: a contour with no on-curve points contains</span>
			<span class="c1"># one &quot;qcurve&quot; segment that ends with a point that&#39;s None. We</span>
			<span class="c1"># must not output a moveTo() in that case.</span>
			<span class="k">pass</span>
		<span class="k">else</span><span class="p">:</span>
			<span class="n">pen</span><span class="o">.</span><span class="n">moveTo</span><span class="p">(</span><span class="n">movePt</span><span class="p">)</span>
		<span class="n">outputImpliedClosingLine</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">outputImpliedClosingLine</span>
		<span class="n">nSegments</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">segments</span><span class="p">)</span>
		<span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">nSegments</span><span class="p">):</span>
			<span class="n">segmentType</span><span class="p">,</span> <span class="n">points</span> <span class="o">=</span> <span class="n">segments</span><span class="p">[</span><span class="n">i</span><span class="p">]</span>
			<span class="n">points</span> <span class="o">=</span> <span class="p">[</span><span class="n">pt</span> <span class="k">for</span> <span class="n">pt</span><span class="p">,</span> <span class="n">smooth</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="n">kwargs</span> <span class="ow">in</span> <span class="n">points</span><span class="p">]</span>
			<span class="k">if</span> <span class="n">segmentType</span> <span class="o">==</span> <span class="s2">&quot;line&quot;</span><span class="p">:</span>
				<span class="k">assert</span> <span class="nb">len</span><span class="p">(</span><span class="n">points</span><span class="p">)</span> <span class="o">==</span> <span class="mi">1</span><span class="p">,</span> <span class="s2">&quot;illegal line segment point count: </span><span class="si">%d</span><span class="s2">&quot;</span> <span class="o">%</span> <span class="nb">len</span><span class="p">(</span><span class="n">points</span><span class="p">)</span>
				<span class="n">pt</span> <span class="o">=</span> <span class="n">points</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span>
				<span class="k">if</span> <span class="n">i</span> <span class="o">+</span> <span class="mi">1</span> <span class="o">!=</span> <span class="n">nSegments</span> <span class="ow">or</span> <span class="n">outputImpliedClosingLine</span> <span class="ow">or</span> <span class="ow">not</span> <span class="n">closed</span><span class="p">:</span>
					<span class="n">pen</span><span class="o">.</span><span class="n">lineTo</span><span class="p">(</span><span class="n">pt</span><span class="p">)</span>
			<span class="k">elif</span> <span class="n">segmentType</span> <span class="o">==</span> <span class="s2">&quot;curve&quot;</span><span class="p">:</span>
				<span class="n">pen</span><span class="o">.</span><span class="n">curveTo</span><span class="p">(</span><span class="o">*</span><span class="n">points</span><span class="p">)</span>
			<span class="k">elif</span> <span class="n">segmentType</span> <span class="o">==</span> <span class="s2">&quot;qcurve&quot;</span><span class="p">:</span>
				<span class="n">pen</span><span class="o">.</span><span class="n">qCurveTo</span><span class="p">(</span><span class="o">*</span><span class="n">points</span><span class="p">)</span>
			<span class="k">else</span><span class="p">:</span>
				<span class="k">assert</span> <span class="mi">0</span><span class="p">,</span> <span class="s2">&quot;illegal segmentType: </span><span class="si">%s</span><span class="s2">&quot;</span> <span class="o">%</span> <span class="n">segmentType</span>
		<span class="k">if</span> <span class="n">closed</span><span class="p">:</span>
			<span class="n">pen</span><span class="o">.</span><span class="n">closePath</span><span class="p">()</span>
		<span class="k">else</span><span class="p">:</span>
			<span class="n">pen</span><span class="o">.</span><span class="n">endPath</span><span class="p">()</span>

	<span class="k">def</span> <span class="nf">addComponent</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">glyphName</span><span class="p">,</span> <span class="n">transform</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">):</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">pen</span><span class="o">.</span><span class="n">addComponent</span><span class="p">(</span><span class="n">glyphName</span><span class="p">,</span> <span class="n">transform</span><span class="p">)</span></div>


<div class="viewcode-block" id="SegmentToPointPen"><a class="viewcode-back" href="../../ufoLib/pointPen.html#ufoLib.pointPen.SegmentToPointPen">[docs]</a><span class="k">class</span> <span class="nc">SegmentToPointPen</span><span class="p">(</span><span class="n">AbstractPen</span><span class="p">):</span>
	<span class="sd">&quot;&quot;&quot;</span>
<span class="sd">	Adapter class that converts the (Segment)Pen protocol to the</span>
<span class="sd">	PointPen protocol.</span>
<span class="sd">	&quot;&quot;&quot;</span>

	<span class="k">def</span> <span class="nf">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">pointPen</span><span class="p">,</span> <span class="n">guessSmooth</span><span class="o">=</span><span class="kc">True</span><span class="p">):</span>
		<span class="k">if</span> <span class="n">guessSmooth</span><span class="p">:</span>
			<span class="bp">self</span><span class="o">.</span><span class="n">pen</span> <span class="o">=</span> <span class="n">GuessSmoothPointPen</span><span class="p">(</span><span class="n">pointPen</span><span class="p">)</span>
		<span class="k">else</span><span class="p">:</span>
			<span class="bp">self</span><span class="o">.</span><span class="n">pen</span> <span class="o">=</span> <span class="n">pointPen</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">contour</span> <span class="o">=</span> <span class="kc">None</span>

	<span class="k">def</span> <span class="nf">_flushContour</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
		<span class="n">pen</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">pen</span>
		<span class="n">pen</span><span class="o">.</span><span class="n">beginPath</span><span class="p">()</span>
		<span class="k">for</span> <span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">contour</span><span class="p">:</span>
			<span class="n">pen</span><span class="o">.</span><span class="n">addPoint</span><span class="p">(</span><span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span><span class="o">=</span><span class="n">segmentType</span><span class="p">)</span>
		<span class="n">pen</span><span class="o">.</span><span class="n">endPath</span><span class="p">()</span>

	<span class="k">def</span> <span class="nf">moveTo</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">pt</span><span class="p">):</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">contour</span> <span class="o">=</span> <span class="p">[]</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">contour</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="n">pt</span><span class="p">,</span> <span class="s2">&quot;move&quot;</span><span class="p">))</span>

	<span class="k">def</span> <span class="nf">lineTo</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">pt</span><span class="p">):</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">contour</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="n">pt</span><span class="p">,</span> <span class="s2">&quot;line&quot;</span><span class="p">))</span>

	<span class="k">def</span> <span class="nf">curveTo</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="o">*</span><span class="n">pts</span><span class="p">):</span>
		<span class="k">for</span> <span class="n">pt</span> <span class="ow">in</span> <span class="n">pts</span><span class="p">[:</span><span class="o">-</span><span class="mi">1</span><span class="p">]:</span>
			<span class="bp">self</span><span class="o">.</span><span class="n">contour</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="n">pt</span><span class="p">,</span> <span class="kc">None</span><span class="p">))</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">contour</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="n">pts</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">],</span> <span class="s2">&quot;curve&quot;</span><span class="p">))</span>

	<span class="k">def</span> <span class="nf">qCurveTo</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="o">*</span><span class="n">pts</span><span class="p">):</span>
		<span class="k">if</span> <span class="n">pts</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span>
			<span class="bp">self</span><span class="o">.</span><span class="n">contour</span> <span class="o">=</span> <span class="p">[]</span>
		<span class="k">for</span> <span class="n">pt</span> <span class="ow">in</span> <span class="n">pts</span><span class="p">[:</span><span class="o">-</span><span class="mi">1</span><span class="p">]:</span>
			<span class="bp">self</span><span class="o">.</span><span class="n">contour</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="n">pt</span><span class="p">,</span> <span class="kc">None</span><span class="p">))</span>
		<span class="k">if</span> <span class="n">pts</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span><span class="p">:</span>
			<span class="bp">self</span><span class="o">.</span><span class="n">contour</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="n">pts</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">],</span> <span class="s2">&quot;qcurve&quot;</span><span class="p">))</span>

	<span class="k">def</span> <span class="nf">closePath</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
		<span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">contour</span><span class="p">)</span> <span class="o">&gt;</span> <span class="mi">1</span> <span class="ow">and</span> <span class="bp">self</span><span class="o">.</span><span class="n">contour</span><span class="p">[</span><span class="mi">0</span><span class="p">][</span><span class="mi">0</span><span class="p">]</span> <span class="o">==</span> <span class="bp">self</span><span class="o">.</span><span class="n">contour</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">][</span><span class="mi">0</span><span class="p">]:</span>
			<span class="bp">self</span><span class="o">.</span><span class="n">contour</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">contour</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span>
			<span class="k">del</span> <span class="bp">self</span><span class="o">.</span><span class="n">contour</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span>
		<span class="k">else</span><span class="p">:</span>
			<span class="c1"># There&#39;s an implied line at the end, replace &quot;move&quot; with &quot;line&quot;</span>
			<span class="c1"># for the first point</span>
			<span class="n">pt</span><span class="p">,</span> <span class="n">tp</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">contour</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span>
			<span class="k">if</span> <span class="n">tp</span> <span class="o">==</span> <span class="s2">&quot;move&quot;</span><span class="p">:</span>
				<span class="bp">self</span><span class="o">.</span><span class="n">contour</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">=</span> <span class="n">pt</span><span class="p">,</span> <span class="s2">&quot;line&quot;</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">_flushContour</span><span class="p">()</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">contour</span> <span class="o">=</span> <span class="kc">None</span>

	<span class="k">def</span> <span class="nf">endPath</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">_flushContour</span><span class="p">()</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">contour</span> <span class="o">=</span> <span class="kc">None</span>

	<span class="k">def</span> <span class="nf">addComponent</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">glyphName</span><span class="p">,</span> <span class="n">transform</span><span class="p">):</span>
		<span class="k">assert</span> <span class="bp">self</span><span class="o">.</span><span class="n">contour</span> <span class="ow">is</span> <span class="kc">None</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">pen</span><span class="o">.</span><span class="n">addComponent</span><span class="p">(</span><span class="n">glyphName</span><span class="p">,</span> <span class="n">transform</span><span class="p">)</span></div>


<span class="k">class</span> <span class="nc">GuessSmoothPointPen</span><span class="p">(</span><span class="n">AbstractPointPen</span><span class="p">):</span>
	<span class="sd">&quot;&quot;&quot;</span>
<span class="sd">	Filtering PointPen that tries to determine whether an on-curve point</span>
<span class="sd">	should be &quot;smooth&quot;, ie. that it&#39;s a &quot;tangent&quot; point or a &quot;curve&quot; point.</span>
<span class="sd">	&quot;&quot;&quot;</span>

	<span class="k">def</span> <span class="nf">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">outPen</span><span class="p">):</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">_outPen</span> <span class="o">=</span> <span class="n">outPen</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">_points</span> <span class="o">=</span> <span class="kc">None</span>

	<span class="k">def</span> <span class="nf">_flushContour</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
		<span class="n">points</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">_points</span>
		<span class="n">nPoints</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">points</span><span class="p">)</span>
		<span class="k">if</span> <span class="ow">not</span> <span class="n">nPoints</span><span class="p">:</span>
			<span class="k">return</span>
		<span class="k">if</span> <span class="n">points</span><span class="p">[</span><span class="mi">0</span><span class="p">][</span><span class="mi">1</span><span class="p">]</span> <span class="o">==</span> <span class="s2">&quot;move&quot;</span><span class="p">:</span>
			<span class="c1"># Open path.</span>
			<span class="n">indices</span> <span class="o">=</span> <span class="nb">range</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">nPoints</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span>
		<span class="k">elif</span> <span class="n">nPoints</span> <span class="o">&gt;</span> <span class="mi">1</span><span class="p">:</span>
			<span class="c1"># Closed path. To avoid having to mod the contour index, we</span>
			<span class="c1"># simply abuse Python&#39;s negative index feature, and start at -1</span>
			<span class="n">indices</span> <span class="o">=</span> <span class="nb">range</span><span class="p">(</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="n">nPoints</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span>
		<span class="k">else</span><span class="p">:</span>
			<span class="c1"># closed path containing 1 point (!), ignore.</span>
			<span class="n">indices</span> <span class="o">=</span> <span class="p">[]</span>
		<span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="n">indices</span><span class="p">:</span>
			<span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span><span class="p">,</span> <span class="n">dummy</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="n">kwargs</span> <span class="o">=</span> <span class="n">points</span><span class="p">[</span><span class="n">i</span><span class="p">]</span>
			<span class="k">if</span> <span class="n">segmentType</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span>
				<span class="k">continue</span>
			<span class="n">prev</span> <span class="o">=</span> <span class="n">i</span> <span class="o">-</span> <span class="mi">1</span>
			<span class="nb">next</span> <span class="o">=</span> <span class="n">i</span> <span class="o">+</span> <span class="mi">1</span>
			<span class="k">if</span> <span class="n">points</span><span class="p">[</span><span class="n">prev</span><span class="p">][</span><span class="mi">1</span><span class="p">]</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span> <span class="ow">and</span> <span class="n">points</span><span class="p">[</span><span class="nb">next</span><span class="p">][</span><span class="mi">1</span><span class="p">]</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span><span class="p">:</span>
				<span class="k">continue</span>
			<span class="c1"># At least one of our neighbors is an off-curve point</span>
			<span class="n">pt</span> <span class="o">=</span> <span class="n">points</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="mi">0</span><span class="p">]</span>
			<span class="n">prevPt</span> <span class="o">=</span> <span class="n">points</span><span class="p">[</span><span class="n">prev</span><span class="p">][</span><span class="mi">0</span><span class="p">]</span>
			<span class="n">nextPt</span> <span class="o">=</span> <span class="n">points</span><span class="p">[</span><span class="nb">next</span><span class="p">][</span><span class="mi">0</span><span class="p">]</span>
			<span class="k">if</span> <span class="n">pt</span> <span class="o">!=</span> <span class="n">prevPt</span> <span class="ow">and</span> <span class="n">pt</span> <span class="o">!=</span> <span class="n">nextPt</span><span class="p">:</span>
				<span class="n">dx1</span><span class="p">,</span> <span class="n">dy1</span> <span class="o">=</span> <span class="n">pt</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">-</span> <span class="n">prevPt</span><span class="p">[</span><span class="mi">0</span><span class="p">],</span> <span class="n">pt</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span> <span class="o">-</span> <span class="n">prevPt</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span>
				<span class="n">dx2</span><span class="p">,</span> <span class="n">dy2</span> <span class="o">=</span> <span class="n">nextPt</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">-</span> <span class="n">pt</span><span class="p">[</span><span class="mi">0</span><span class="p">],</span> <span class="n">nextPt</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span> <span class="o">-</span> <span class="n">pt</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span>
				<span class="n">a1</span> <span class="o">=</span> <span class="n">math</span><span class="o">.</span><span class="n">atan2</span><span class="p">(</span><span class="n">dx1</span><span class="p">,</span> <span class="n">dy1</span><span class="p">)</span>
				<span class="n">a2</span> <span class="o">=</span> <span class="n">math</span><span class="o">.</span><span class="n">atan2</span><span class="p">(</span><span class="n">dx2</span><span class="p">,</span> <span class="n">dy2</span><span class="p">)</span>
				<span class="k">if</span> <span class="nb">abs</span><span class="p">(</span><span class="n">a1</span> <span class="o">-</span> <span class="n">a2</span><span class="p">)</span> <span class="o">&lt;</span> <span class="mf">0.05</span><span class="p">:</span>
					<span class="n">points</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">=</span> <span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span><span class="p">,</span> <span class="kc">True</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="n">kwargs</span>

		<span class="k">for</span> <span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span><span class="p">,</span> <span class="n">smooth</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="n">kwargs</span> <span class="ow">in</span> <span class="n">points</span><span class="p">:</span>
			<span class="bp">self</span><span class="o">.</span><span class="n">_outPen</span><span class="o">.</span><span class="n">addPoint</span><span class="p">(</span><span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span><span class="p">,</span> <span class="n">smooth</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">)</span>

	<span class="k">def</span> <span class="nf">beginPath</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
		<span class="k">assert</span> <span class="bp">self</span><span class="o">.</span><span class="n">_points</span> <span class="ow">is</span> <span class="kc">None</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">_points</span> <span class="o">=</span> <span class="p">[]</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">_outPen</span><span class="o">.</span><span class="n">beginPath</span><span class="p">()</span>

	<span class="k">def</span> <span class="nf">endPath</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">_flushContour</span><span class="p">()</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">_outPen</span><span class="o">.</span><span class="n">endPath</span><span class="p">()</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">_points</span> <span class="o">=</span> <span class="kc">None</span>

	<span class="k">def</span> <span class="nf">addPoint</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">smooth</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span> <span class="n">name</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">):</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">_points</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span><span class="p">,</span> <span class="kc">False</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="n">kwargs</span><span class="p">))</span>

	<span class="k">def</span> <span class="nf">addComponent</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">glyphName</span><span class="p">,</span> <span class="n">transformation</span><span class="p">):</span>
		<span class="k">assert</span> <span class="bp">self</span><span class="o">.</span><span class="n">_points</span> <span class="ow">is</span> <span class="kc">None</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">_outPen</span><span class="o">.</span><span class="n">addComponent</span><span class="p">(</span><span class="n">glyphName</span><span class="p">,</span> <span class="n">transformation</span><span class="p">)</span>


<span class="k">class</span> <span class="nc">ReverseContourPointPen</span><span class="p">(</span><span class="n">AbstractPointPen</span><span class="p">):</span>
	<span class="sd">&quot;&quot;&quot;</span>
<span class="sd">	This is a PointPen that passes outline data to another PointPen, but</span>
<span class="sd">	reversing the winding direction of all contours. Components are simply</span>
<span class="sd">	passed through unchanged.</span>

<span class="sd">	Closed contours are reversed in such a way that the first point remains</span>
<span class="sd">	the first point.</span>
<span class="sd">	&quot;&quot;&quot;</span>

	<span class="k">def</span> <span class="nf">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">outputPointPen</span><span class="p">):</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">pen</span> <span class="o">=</span> <span class="n">outputPointPen</span>
		<span class="c1"># a place to store the points for the current sub path</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">currentContour</span> <span class="o">=</span> <span class="kc">None</span>

	<span class="k">def</span> <span class="nf">_flushContour</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
		<span class="n">pen</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">pen</span>
		<span class="n">contour</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">currentContour</span>
		<span class="k">if</span> <span class="ow">not</span> <span class="n">contour</span><span class="p">:</span>
			<span class="n">pen</span><span class="o">.</span><span class="n">beginPath</span><span class="p">(</span><span class="n">identifier</span><span class="o">=</span><span class="bp">self</span><span class="o">.</span><span class="n">currentContourIdentifier</span><span class="p">)</span>
			<span class="n">pen</span><span class="o">.</span><span class="n">endPath</span><span class="p">()</span>
			<span class="k">return</span>

		<span class="n">closed</span> <span class="o">=</span> <span class="n">contour</span><span class="p">[</span><span class="mi">0</span><span class="p">][</span><span class="mi">1</span><span class="p">]</span> <span class="o">!=</span> <span class="s2">&quot;move&quot;</span>
		<span class="k">if</span> <span class="ow">not</span> <span class="n">closed</span><span class="p">:</span>
			<span class="n">lastSegmentType</span> <span class="o">=</span> <span class="s2">&quot;move&quot;</span>
		<span class="k">else</span><span class="p">:</span>
			<span class="c1"># Remove the first point and insert it at the end. When</span>
			<span class="c1"># the list of points gets reversed, this point will then</span>
			<span class="c1"># again be at the start. In other words, the following</span>
			<span class="c1"># will hold:</span>
			<span class="c1">#   for N in range(len(originalContour)):</span>
			<span class="c1">#       originalContour[N] == reversedContour[-N]</span>
			<span class="n">contour</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">contour</span><span class="o">.</span><span class="n">pop</span><span class="p">(</span><span class="mi">0</span><span class="p">))</span>
			<span class="c1"># Find the first on-curve point.</span>
			<span class="n">firstOnCurve</span> <span class="o">=</span> <span class="kc">None</span>
			<span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">contour</span><span class="p">)):</span>
				<span class="k">if</span> <span class="n">contour</span><span class="p">[</span><span class="n">i</span><span class="p">][</span><span class="mi">1</span><span class="p">]</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span><span class="p">:</span>
					<span class="n">firstOnCurve</span> <span class="o">=</span> <span class="n">i</span>
					<span class="k">break</span>
			<span class="k">if</span> <span class="n">firstOnCurve</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span>
				<span class="c1"># There are no on-curve points, be basically have to</span>
				<span class="c1"># do nothing but contour.reverse().</span>
				<span class="n">lastSegmentType</span> <span class="o">=</span> <span class="kc">None</span>
			<span class="k">else</span><span class="p">:</span>
				<span class="n">lastSegmentType</span> <span class="o">=</span> <span class="n">contour</span><span class="p">[</span><span class="n">firstOnCurve</span><span class="p">][</span><span class="mi">1</span><span class="p">]</span>

		<span class="n">contour</span><span class="o">.</span><span class="n">reverse</span><span class="p">()</span>
		<span class="k">if</span> <span class="ow">not</span> <span class="n">closed</span><span class="p">:</span>
			<span class="c1"># Open paths must start with a move, so we simply dump</span>
			<span class="c1"># all off-curve points leading up to the first on-curve.</span>
			<span class="k">while</span> <span class="n">contour</span><span class="p">[</span><span class="mi">0</span><span class="p">][</span><span class="mi">1</span><span class="p">]</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span>
				<span class="n">contour</span><span class="o">.</span><span class="n">pop</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
		<span class="n">pen</span><span class="o">.</span><span class="n">beginPath</span><span class="p">(</span><span class="n">identifier</span><span class="o">=</span><span class="bp">self</span><span class="o">.</span><span class="n">currentContourIdentifier</span><span class="p">)</span>
		<span class="k">for</span> <span class="n">pt</span><span class="p">,</span> <span class="n">nextSegmentType</span><span class="p">,</span> <span class="n">smooth</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="n">kwargs</span> <span class="ow">in</span> <span class="n">contour</span><span class="p">:</span>
			<span class="k">if</span> <span class="n">nextSegmentType</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span><span class="p">:</span>
				<span class="n">segmentType</span> <span class="o">=</span> <span class="n">lastSegmentType</span>
				<span class="n">lastSegmentType</span> <span class="o">=</span> <span class="n">nextSegmentType</span>
			<span class="k">else</span><span class="p">:</span>
				<span class="n">segmentType</span> <span class="o">=</span> <span class="kc">None</span>
			<span class="n">pen</span><span class="o">.</span><span class="n">addPoint</span><span class="p">(</span><span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span><span class="o">=</span><span class="n">segmentType</span><span class="p">,</span> <span class="n">smooth</span><span class="o">=</span><span class="n">smooth</span><span class="p">,</span> <span class="n">name</span><span class="o">=</span><span class="n">name</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">)</span>
		<span class="n">pen</span><span class="o">.</span><span class="n">endPath</span><span class="p">()</span>

	<span class="k">def</span> <span class="nf">beginPath</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">identifier</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">):</span>
		<span class="k">assert</span> <span class="bp">self</span><span class="o">.</span><span class="n">currentContour</span> <span class="ow">is</span> <span class="kc">None</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">currentContour</span> <span class="o">=</span> <span class="p">[]</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">currentContourIdentifier</span> <span class="o">=</span> <span class="n">identifier</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">onCurve</span> <span class="o">=</span> <span class="p">[]</span>

	<span class="k">def</span> <span class="nf">endPath</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
		<span class="k">assert</span> <span class="bp">self</span><span class="o">.</span><span class="n">currentContour</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">_flushContour</span><span class="p">()</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">currentContour</span> <span class="o">=</span> <span class="kc">None</span>

	<span class="k">def</span> <span class="nf">addPoint</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">smooth</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span> <span class="n">name</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">):</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">currentContour</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="n">pt</span><span class="p">,</span> <span class="n">segmentType</span><span class="p">,</span> <span class="n">smooth</span><span class="p">,</span> <span class="n">name</span><span class="p">,</span> <span class="n">kwargs</span><span class="p">))</span>

	<span class="k">def</span> <span class="nf">addComponent</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">glyphName</span><span class="p">,</span> <span class="n">transform</span><span class="p">,</span> <span class="n">identifier</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">):</span>
		<span class="k">assert</span> <span class="bp">self</span><span class="o">.</span><span class="n">currentContour</span> <span class="ow">is</span> <span class="kc">None</span>
		<span class="bp">self</span><span class="o">.</span><span class="n">pen</span><span class="o">.</span><span class="n">addComponent</span><span class="p">(</span><span class="n">glyphName</span><span class="p">,</span> <span class="n">transform</span><span class="p">,</span> <span class="n">identifier</span><span class="o">=</span><span class="n">identifier</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">)</span>
</pre></div>

          </div>
        </div>
      </div>
      <div class="sphinxsidebar" role="navigation" aria-label="main navigation">
        <div class="sphinxsidebarwrapper">
<div id="searchbox" style="display: none" role="search">
  <h3>Quick search</h3>
    <form class="search" action="../../search.html" method="get">
      <div><input type="text" name="q" /></div>
      <div><input type="submit" value="Go" /></div>
      <input type="hidden" name="check_keywords" value="yes" />
      <input type="hidden" name="area" value="default" />
    </form>
</div>
<script type="text/javascript">$('#searchbox').show(0);</script>
        </div>
      </div>
      <div class="clearer"></div>
    </div>
    <div class="related" role="navigation" aria-label="related navigation">
      <h3>Navigation</h3>
      <ul>
        <li class="right" style="margin-right: 10px">
          <a href="../../genindex.html" title="General Index"
             >index</a></li>
        <li class="right" >
          <a href="../../py-modindex.html" title="Python Module Index"
             >modules</a> |</li>
        <li class="nav-item nav-item-0"><a href="../../index.html">ufoLib 1.3.0a documentation</a> &#187;</li>
          <li class="nav-item nav-item-1"><a href="../index.html" >Module code</a> &#187;</li>
          <li class="nav-item nav-item-2"><a href="../ufoLib.html" >ufoLib</a> &#187;</li> 
      </ul>
    </div>
    <div class="footer" role="contentinfo">
        &#169; Copyright 2017, Tal Leming, Erik van Blokland, Just van Rossum.
      Created using <a href="http://sphinx-doc.org/">Sphinx</a> 1.6.5.
    </div>
  </body>
</html>

APT Browse - Built by Thomas Orozco.