B Jd-@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_arraysjoutx1Zx2d1d2nscalepairxdrF/var/www/html/venv/lib/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 enumerateiternextrr r) r!r rindicesritstarti1i2Zri1Zri2endrrr iup_contourQs2 . ..&r1)r!r 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'r1r)r!r r2rrr-r0contourrrr iup_deltays 0   r8)r!r 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.r5rc3s4|],\\}}\}}tt||||kVqdS)N)abscomplex)r"rypq)r9rr sz%can_iup_in_between..)r'listr rallr)r!r r#rr9Zinterpr)r9rcan_iup_in_betweens 0rB)r!r r9rcCs(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'setranger:minmaxadd)r!r r9rforcedr#ldlcrcndncrcjZdjZlcjZldjZncjZndjc1c2rrforcerrr_iup_contour_bound_forced_setsH "      .  66  rR)r!r r9lookbackc 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&rrr5)rrE MAX_LOOKBACKrDrFrB) r!r rHr9rSrcostschainr# best_costrcostrrr_iup_contour_optimize_dps(       rZ)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)r[r\rrrr _rot_lists r])sr\rcs$;s|Sfdd|DS)Ncsh|]}|qSrr)r"r$)r\rrr sz_rot_set..r)r^r\rr)r\rr_rot_setsr`c 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)r:r;)r"r=)r9rrr?0sz'iup_contour_optimize..Nrrc3s|]}|kVqdS)Nr)r"r)d0rrr?9sr&cs g|]}|kr|ndqS)Nr)r"r#)r!solutionrrr%csz(iup_contour_optimize..cs g|]}|kr|ndqS)Nr)r"r#)best_solr!rrr%s) rrArRrFr'r]r`rZrCrGremoverD) r!r r9rrHr\rWrVr#rXr-rYr)rdrbr!rcr9riup_contour_optimize!sP            rf)r!r r2r9rc 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&rrr3r4r5)r6rr'rfr) r!r r2r9rrr-r0r7rrriup_delta_optimizes 0  $  rg)r)ra)ra)"typingrrrnumbersrrr ImportErrorZfontTools.misccompiledZCOMPILEDZ_PointZ_DeltaZ _PointSegmentZ _DeltaSegmentZ _DeltaOrNoneZ_DeltaOrNoneSegmentZ _EndpointsrUr r1r8boolrBrCrRrZr@intr]r`rfrgrrrrsN    )'H&d