o aT @sbddZddZddZddZdd d Zidd fd d ZddZddZdddZdddZ d S)cCsddg}dD]r}g||<}||||||||f\}} } } || kr>t|} | | kr5|| g| n|dg| q|| krL| |}} | | } } | | | |} |D]!}||}||krc| }n|| krj| }n| ||| }||qVqt|S)Nr)lenextendappendzip)coordsZrc1Zrd1Zrc2Zrd2Z out_arraysjoutZx1Zx2d1d2nZscaleZpairxdr6/usr/lib/python3/dist-packages/fontTools/varLib/iup.py iup_segments0 $    rc 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)NcSsg|] \}}|dur|qSNr).0ivrrr .sziup_contour..)rrrr)r enumerateiternextrrr) deltarr indicesr itstartZi1Zi2Zri1Zri2endrrr iup_contour's2 . . .$r!cCst||krt||r|ddnddksJt|}||d|d|d|dg}g}d}|D]}|d7}t||||||}|||}q2|SNrrr)sortedrr!r)rrendsr r rr contourrrr iup_deltaIs0  r)cs||dksJtt||d|||||||||}||d|}t|t|ks2Jtfddt||DS)Nr%rc3s6|]\\}}\}}tt||||kVqdSrabscomplex)rrypq tolerancerr `s4z%can_iup_in_between..)listrrallr)Zdeltasrrr r1Zinterprr0rcan_iup_in_betweenYs 0r5rcCst|t|ks Jt}|d|d}}|d|d}}tt|dddD]}||} } ||d||d}}dD]} | | } | | } || }|| }|| }|| }||krh||}}||}}n ||}}||}}d}|| kr~|krnnt|||| krt|||ksnd}nD||kr||krt| ||krd}n1t| |kr n)||kr| |kr| |kr| ||k||kkrd}n|| kr|| |k||kkrd}|r||nq?| | }}q)|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 delta. rrrrFT)rsetrangeminmaxr+add)rrr1forcedZndZncZldZlcrrcr ZcjZdjZlcjZldjZncjZndjZc1Zc2r r Zforcerrr_iup_contour_bound_forced_setbsZ     *   r=Nc Cst|}|dur |}ddi}ddi}td|D]M}||dd} | ||<|d||<|d|vr2qt|dt||ddD]$} || d} | | kr]t||| ||r]| ||<} | ||<| |vrcnq?q||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.Nrrrr%)rr7r9r5) rrr;r1Zlookbackr costschainr best_costr costrrr_iup_contour_optimize_dps*     rCcCs8t|}||;}|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 rrr _rot_lists rFcs$;s|Sfdd|DS)Ncsh|]}|qSrr)rrrEr rr sz_rot_set..r)srEr rrGr_rot_setsrJc st}tfddDrdg|S|dkrSdtfddDr3gdg|dSt|}|r|dt|}|dksIJt|t||}t|||}t||\}}t|d}|durz|||}|dusm|ksJ|ffddt |Dt| St||||\}}d|d} t |dd|dD]7} t| }|| |krֈ||||}|| |ks|| |kr|| || |} | | kr| } qfd dt |DS) Nc3s |] }tt|kVqdSrr*)rr.r0rrr2sz'iup_contour_optimize..rrc3s|]}|kVqdSrr)rr)d0rrr2scs g|] }|vr |ndqSrrrr)rsolutionrrr z(iup_contour_optimize..r%cs g|] }|vr |ndqSrrrM)best_solrrrrrO) rr4r=r9rFrJrCr6r:r7) rrr1r r;rEr@r?rrArrBr)rPrLrrNr1riup_contour_optimizesT           rQc Cst||krt||r|ddnddksJt|}||d|d|d|dg}g}d}|D])}t|||d|||d|}t|||dksRJ|||d}q2|Sr")r&rrQr) rrr'r1r r rr r(rrriup_delta_optimize s0 $  rR)r)rK) rr!r)r5r=rCrFrJrQrRrrrrs&" D% H