o l^UfS9@sxz ddlZejZWneefyddlmZdZYnwddlmZmZm Z ddl m Z m Z ee e fZ ee e fZee ZeeZe edfZeeZee ZdZejejejejejejejejejejejd ded e d ed e d ef d dZdededefddZdedededefddZejejejejejejejejejdeededede de de f ddZejejejejejejejejed d0dedede defddZ ejejejejejejeejdeddfdedede d e fd!d"Z!d#e"d$efd%d&Z#d'ed$ed(efd)d*Z$ +d1dedede defd,d-Z% +d1dededede def d.d/Z&dS)2N)cythonF)SequenceTupleUnion)IntegralReal) jnx1x2d1d2scalexdcoordsrc1rd1rc2rd2cCsddg}dD]r}g||<}||||||||f\}} } } || kr>t|} | | kr5|| g| n|dg| q|| krL| |}} | | } } | | | |} |D]!}||}||krc| }n|| krj| }n| ||| }||qVqt|S)zGiven two reference coordinates `rc1` & `rc2` and their respective delta vectors `rd1` & `rd2`, returns interpolated deltas for the set of coordinates `coords`.Nrr)lenextendappendzip)rrrrrZ out_arraysr outr r r rr rZpairrrr4lib/python3.10/site-packages/fontTools/varLib/iup.py iup_segments0 $    r deltasreturnc Cst|t|ks Jd|vr|St|}ddt|D}|s$dg|Sg}t|}t|}|dkrUd|||df\}}} } |t||||| || || || ||||D]4} | |dkr|d| || f\}}} } |t||||| || || || ||| | }q^||dkr|d|||df\}}} } |t||||| || || || t|t|ksJt|t|f|S)zFor the contour given in `coords`, interpolate any missing delta values in delta vector `deltas`. Returns fully filled-out delta vector.NcSsg|] \}}|dur|qSNr).0ivrrr csziup_contour..)rrrr)r enumerateiternextrr r) r!rr indicesritstartZi1Zi2Zri1Zri2endrrr iup_contourWsJ " " "$r0endscCst||krt||r|ddnddksJt|}||d|d|d|dg}g}d}|D]}|d7}t||||||}|||}q2|S)zFor the outline given in `coords`, with contour endpoints given in sorted increasing order in `ends`, interpolate any missing delta values in delta vector `deltas`. Returns fully filled-out delta vector.r(rr)sortedrr0r)r!rr1r rr.r/contourrrr iup_deltas0   r7)r%r rypqr%r tolerancecsh||dksJt||d|||||||||}||d|}tfddt||DS)zReturn true if the deltas for points at `i` and `j` (`i < j`) can be successfully used to interpolate deltas for points in between them within provided error tolerance.r4rc3s6|]\\}}\}}tt||||kVqdSr#abscomplex)r$rr8r9r:r;rr s  z%can_iup_in_between..)r allr)r!rr%r r;Zinterprr?rcan_iup_in_betweens , rB)cjdjlcjldjncjndjforceforcedcCst|t|ks Jt|}t}tt|dddD]}||d||d}}||||}} |||d|||d} } dD]} | | } || }|| }|| }| | }| | }||kro||}}||}}n ||}}||}}d}||krt|||krt||krd}na|| kr|krnnt||||krt|||ksnd}n=||kr| |krt||krt|||kr|||k||kkrd}nt||krt|||kr|||k||kkrd}|r||nqFq|S)aThe 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 `deltas`. rr(rFT)rsetranger=minmaxadd)r!rr;r rJr%ZldZlcrcZndZncr rCrDrErFrGrHZc1Zc2r rrIrrr_iup_contour_bound_forced_setsZ"    *   rQ)r%r best_costZbest_jcostrJr;lookbackc Cst|}|dur |}t|t}ddi}ddi}td|D]M}||dd} | ||<|d||<|d|vr7qt|dt||ddD]$} || d} | | krbt||| ||rb| ||<} | ||<| |vrhnqDq||fS)aStraightforward 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(rrr4)rrM MAX_LOOKBACKrLrNrB) r!rrJr;rTr costschainr%rRr rSrrr_iup_contour_optimize_dp!s,     rYlkcCs8t|}||;}|s |S|||d|d||S)z{Rotate list by k items forward. Ie. item at position 0 will be at position k in returned list. Negative k is allowed.N)r)rZr[r rrr _rot_listVs  r\sr cs$;s|Sfdd|DS)Ncsh|]}|qSrr)r$r&r[r rr dsz_rot_set..r)r]r[r rr^r_rot_set`sr`c st}tfddDrdg|S|dkrSdtfddDr3gdg|dSt|}|r|dt|}|dksIJt|t||}t|||}t||\}}t|d}|durz|||}|dusm d|ksJ|ffdd t |Dt| St||||\}}d|d} t |dt|dD]7} t| }|| |krۈ||||}|| |ks|| |kr|| || |} | | kr| } q|ksJ|ffd d t |DS) zFor contour with coordinates `coords`, optimize a set of delta values `deltas` within error `tolerance`. Returns delta vector that has most number of None items instead of the input delta. c3s |] }tt|kVqdSr#r<)r$r9r?rrr@vsz'iup_contour_optimize..Nrrc3s|]}|kVqdSr#r)r$r)d0rrr@sr(cs g|] }|vr |ndqSr#rr$r%)r!solutionrrr' z(iup_contour_optimize..cs g|] }|vr |ndqSr#rrc)best_solr!rrr're) rrArQrNr\r`rYrKrOremoverL) r!rr;r rJr[rXrWr%rRr.rSr)rfrbr!rdr;riup_contour_optimizegs\              rhc Cst||krt||r|ddnddksJt|}||d|d|d|dg}g}d}|D])}t|||d|||d|}t|||dksRJ|||d}q2|S)aFor the outline given in `coords`, with contour endpoints given in sorted increasing order in `ends`, optimize a set of delta values `deltas` within error `tolerance`. Returns delta vector that has most number of None items instead of the input delta. r(rrr2r3r4)r5rrhr) r!rr1r;r rr.r/r6rrriup_delta_optimizes0    ri)r)ra)'rZcompiledZCOMPILEDAttributeError ImportErrorZfontTools.misctypingrrrZnumbersrrZ_PointZ_DeltaZ _PointSegmentZ _DeltaSegmentZ _DeltaOrNoneZ_DeltaOrNoneSegmentZ _EndpointsrVZcfunclocalsintZdoubler r0r7ZinlinereturnsrBrKrQrYlistr\r`rhrirrrrs      ,4    Q  ,  i