Warning: session_start(): Session cannot be started after headers have already been sent in /home/tvrreohg/public_html/manga.php on line 13
3
2jT @ sb d d Z dd Zdd Zdd Zdd d
Zi dd fd d
Zdd Zdd ZdddZdddZ d S )c C s d d g}xdD ]}g ||< }|| || || || f\}} }
} || kr~t | } |
| krl|j|
g| q|jdg| q|| kr| | }} | |
}
} | |
| | }
xJ| D ]B}|| }||kr|
}n || kr| }n|
|| |
}|j| qW qW t| S )N )r r )lenextendappendzip)coordsZrc1Zrd1Zrc2Zrd2Z
out_arraysjoutx1Zx2d1d2nZscalepairxd r 9/tmp/pip-build-_d5lkt3n/fonttools/fontTools/varLib/iup.py iup_segment s.
$
r c C s t | t |kstd | kr | S t | }dd t| D }|sHdg| S g }t|}t|}|dkrd|||d f\}}} }
|jt||| || | | ||
| |
|j| | xr|D ]j} | | dkr|d | || f\}}} }
|jt||| || | | ||
| |
|j| | | }qW ||d kr|d |||d f\}}} }
|jt||| || | | ||
| |
t | t |kstt | t |f|S )Nc S s g | ]\}}|d k r|qS )Nr ).0ivr r r
. s z iup_contour..r r )r r )r AssertionError enumerateiternextr r r ) deltar r
indicesr itstarti1i2Zri1Zri2endr r r iup_contour' s2
.
. .&r$ c C s t ||kr,t||r"|d d ndd ks0tt|}||d |d |d |d g }g }d}x<|D ]4}|d7 }t| || ||| }|j| |}qfW |S )Nr r r )sortedr r r$ r )r r endsr
r r r# contourr r r iup_deltaI s 0
r+ c s || dkst tt||d | || | | || | | }| |d | } t| t|ksdt t fddt| |D S )Nr' r c 3 s4 | ],\\}}\}}t t|| || kV qd S )N)abscomplex)r r ypq) tolerancer r ` s z%can_iup_in_between..)r listr r allr )Zdeltasr r r r1 Zinterpr )r1 r can_iup_in_betweenY s
0r5 r c C s t | t |kstt }| d |d }}| d |d }}xtt | d ddD ]}|| } }
| |d ||d }}xpd D ]f} |
| } | | }
|| }|| }|| }|| }||kr|| }}|| }}n|| }}|| }}d}|| ko|kn rFt||| |
ko8t||| kn sd}n||kr||krrt|
| |krd}nt|
|krn^||kr| |k r|
|kr|
| |k ||k krd}n$||
kr||
| k ||k krd}|r|j| P qW | |
}}qVW |S )
a The forced set is a conservative set of points on the contour that must be encoded
explicitly (ie. cannot be interpolated). Calculating this set allows for significantly
speeding up the dynamic-programming, as well as resolve circularity in DP.
The set is precise; that is, if an index is in the returned set, then there is no way
that IUP can generate delta for that point, given coords and delta.
r r FTr r r r )r r )r r setrangeminmaxr, add)r r r1 forcedZndZncldlcr r cr cjZdjZlcjZldjZncjZndjc1c2r r forcer r r _iup_contour_bound_forced_setb sP
0
rC Nc C s t | }|dkr|}ddi}ddi}xtd|D ]}||d d } | ||< |d ||< |d |krfq0xdt|d t|| ddD ]F}
||
d } | | k rt| ||
||r| ||< } |
||< |
|krP qW q0W ||fS ) a Straightforward Dynamic-Programming. For each index i, find least-costly encoding of
points 0 to i where i is explicitly encoded. We find this by considering all previous
explicit points j and check whether interpolation can fill points between j and i.
Note that solution always encodes last point explicitly. Higher-level is responsible
for removing that restriction.
As major speedup, we stop looking further whenever we see a "forced" point.Nr r r' r r r )r r7 r9 r5 ) r r r; r1 Zlookbackr
costschainr best_costr costr r r _iup_contour_optimize_dp s&
rI c C s8 t | }||; }|s| S | || d | d|| S )zxRotate list by k items forward. Ie. item at position 0 will be
at position k in returned list. Negative k is allowed.N)r )lkr
r r r _rot_list s
rL c s$ ; s| S fdd| D S )Nc s h | ]}| qS r r )r r )rK r
r r s z_rot_set..r )srK r
r )rK r
r _rot_set s rO c s t }tfddD r(d g| S |dkr4S d tfddD rfgd g|d S t|}|r0|d t| }|dkstt|t||}t|||}t||\}}t |d }x |d k rj | || }qW |ks
t|ffddt
|D t| nt || ||\}}d |d } xt
|d d| d D ]r}
t |
}x*||
| krj || || }qW ||
| krr||
||
| } | | krr| } qrW fd dt
|D S )
Nc 3 s | ]}t t| kV qd S )N)r, r- )r r/ )r1 r r r2 s z'iup_contour_optimize..r r c 3 s | ]} |kV qd S )Nr )r r )d0r r r2 s c s g | ]}|kr | nd qS )Nr )r r )r solutionr r r s z(iup_contour_optimize..r' c s g | ]}| kr| nd qS )Nr )r r )best_solr r r r s ) r r4 rC r9 r rL rO rI r6 r: r7 ) r r r1 r
r; rK rF rE r rG r rH r )rS rQ r rR r1 r iup_contour_optimize sL
rT c C s t ||kr,t||r"|d d ndd ks0tt|}||d |d |d |d g }g }d}xZ|D ]R}t| ||d |||d |}t||| d kst|j| |d }qfW |S )Nr r r% r& r' r )r( r r rT r ) r r r) r1 r
r r r# r* r r r iup_delta_optimize s 0
$
rU )r )rP )rP )
r r$ r+ r5 rC rI rL rO rT rU r r r r s &"
D%
H