B Sc-@sddlmZmZmZddlmZmZy ddlZWn ek rPddl mZYnXej r^dZ ndZ eeefZ eeefZ ee Zee Zee dfZeeZeeZdZee e e e edd d Zeeed d d ZeeeedddZeeeeeedddZd&eeeedddZiddfeeeedddZeedddZeeedddZd'eeeedd!d"Z d(eeeeed#d$d%Z!dS)))SequenceTupleUnion)IntegralRealN)cythonTF)coordsrc1rd1rc2rd2returncCsddg}xdD]}g||<}||||||||f\}} } } || kr~t|} | | krl|| g| q|dg| q|| kr| |}} | | } } | | | |} xJ|D]B}||}||kr| }n|| kr| }n| ||| }||qWqWt|S)zGiven two reference coordinates `rc1` & `rc2` and their respective delta vectors `rd1` & `rd2`, returns interpolated deltas for the set of coordinates `coords`. N)rr)lenextendappendzip)r r r r r Z out_arraysjoutZx1Zx2d1d2nZscaleZpairxdr3lib/python3.7/site-packages/fontTools/varLib/iup.py iup_segment$s.   $   r)deltasr rc Cst|t|kstd|kr |St|}ddt|D}|sHdg|Sg}t|}t|}|dkrd|||df\}}} } |t||||| || || || |||xr|D]j} | |dkr|d| || f\}}} } |t||||| || || || ||| | }qW||dkr|d|||df\}}} } |t||||| || || || t|t|kstt|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|]\}}|dk r|qS)Nr).0ivrrr ^sziup_contour..)rrrr)rAssertionError enumerateiternextrrr) rr rindicesritstartZi1Zi2Zri1Zri2endrrr iup_contourQs2 . ..&r,)rr endsrcCst||kr,t||r"|ddnddks0tt|}||d|d|d|dg}g}d}x<|D]4}|d7}t||||||}|||}qfW|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)sortedrr$r,r)rr r-rrr*r+contourrrr iup_deltays 0   r3)rr r r tolerancercs||dksttt||d|||||||||}||d|}t|t|ksdttfddt||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.r0rc3s4|],\\}}\}}tt||||kVqdS)N)abscomplex)rrypq)r4rr sz%can_iup_in_between..)r$listrrallr)rr r rr4Zinterpr)r4rcan_iup_in_betweens 0r=)rr r4rcCs(t|t|kstt|}t}xtt|dddD]}||d||d}}||||}} |||d|||d} } xdD]} | | } || }|| }|| }| | }| | }||kr||}}||}}n||}}||}}d}||kr2t|||kr t||kr d}n|| krJ|krnn4t||||krzt|||ks nd}n||kr | |krt||kr t|||kr |||k||kkr d}n:t||kr t|||kr |||k||kkr d}|r||PqWq:W|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#)rrFT)rr$setranger5minmaxadd)rr r4rforcedr ZldZlcrcZndZncrZcjZdjZlcjZldjZncjZndjZc1Zc2rrZforcerrr_iup_contour_bound_forced_setsH "      .  66  rE)rr r4lookbackc Cst|}|dkr|}t|t}ddi}ddi}xtd|D]}||dd} | ||<|d||<|d|krpq:xdt|dt||ddD]F} || d} | | krt||| ||r| ||<} | ||<| |krPqWq:W||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#rrr0)rr@ MAX_LOOKBACKr?rAr=) rr rCr4rFrcostschainr best_costrcostrrr_iup_contour_optimize_dps(       rM)lkcCs8t|}||;}|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)rNrOrrrr _rot_lists rP)srOrcs$;s|Sfdd|DS)Ncsh|]}|qSrr)rr!)rOrrr sz_rot_set..r)rQrOrr)rOrr_rot_setsrSc s$t}tfddDr(dg|S|dkr4SdtfddDrfgdg|dSt|}|r:|dt|}|dkstt|t||}t|||}t||\}}t|d}x|dk r |||}qW d|kst|ffdd t |Dt| nt||||\}}d|d} xt |dt|dD]r} t| }x*|| |kr ||||}qW|| |kr||| || |} | | kr|| } q|W|kst|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|kVqdS)N)r5r6)rr8)r4rrr:0sz'iup_contour_optimize..Nrrc3s|]}|kVqdS)Nr)rr)d0rrr:9sr#cs g|]}|kr|ndqS)Nr)rr )rsolutionrrr"csz(iup_contour_optimize..cs g|]}|kr|ndqS)Nr)rr )best_solrrrr"s) rr<rErAr$rPrSrMr>rBremover?) rr r4rrCrOrJrIr rKr*rLr)rWrUrrVr4riup_contour_optimize!sP            rY)rr r-r4rc Cst||kr,t||r"|ddnddks0tt|}||d|d|d|dg}g}d}xZ|D]R}t|||d|||d|}t|||dkst|||d}qfW|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#rrr.r/r0)r1rr$rYr) rr r-r4rrr*r+r2rrriup_delta_optimizes 0  $  rZ)r)rT)rT)"typingrrrZnumbersrrr ImportErrorZfontTools.miscZcompiledZCOMPILEDZ_PointZ_DeltaZ _PointSegmentZ _DeltaSegmentZ _DeltaOrNoneZ_DeltaOrNoneSegmentZ _EndpointsrHrr,r3boolr=r>rErMr;intrPrSrYrZrrrrsN    )'H&d