a w=ic-@sddlmZmZmZddlmZmZz ddlZWneyNddl mZYn0ej 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}dD]}g||<}||||||||f\}} } } || kr|t|} | | krj|| g| q |dg| q || kr| |}} | | } } | | | |} |D]B}||}||kr| }n|| kr| }n| ||| }||qq t|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)r r r r r Z out_arraysjoutx1Zx2d1d2nscalepairxdre/home/droni/.local/share/virtualenvs/DPS-5Je3_V2c/lib/python3.9/site-packages/fontTools/varLib/iup.py iup_segment$s.  $  r!)deltasr rc Cst|t|ksJd|vr |St|}ddt|D}|sHdg|Sg}t|}t|}|dkrd|||df\}}} } |t||||| || || || ||||D]j} | |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 ^ziup_contour..)rrrr)r enumerateiternextrr!r) r"r rindicesritstarti1i2Zri1Zri2endrrr iup_contourQs2 ...&r3)r"r endsrcCst||kr,t||r"|ddnddks0Jt|}||d|d|d|dg}g}d}|D]4}|d7}t||||||}|||}qd|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)sortedrr3r)r"r r4rrr/r2contourrrr iup_deltays 0  r:)r"r r%r tolerancercs||dksJtt||d|||||||||}||d|}t|t|ksdJtfddt||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.r7rc3s4|],\\}}\}}tt||||kVqdSr#abscomplex)r$rypqr;rr r(z%can_iup_in_between..)listr!rallr)r"r r%rr;ZinterprrBr can_iup_in_betweens 0rF)r"r r;rcCst|t|ksJt|}t}tt|dddD]}||d||d}}||||}} |||d|||d} } dD]} | | } || }|| }|| }| | }| | }||kr||}}||}}n||}}||}}d}||kr*t|||krt||krd}n|| krB|krznn4t||||krrt|||ksnd}n||kr| |krt||krt|||kr|||k||kkrd}n:t||krt|||kr|||k||kkrd}|r||q6qq6|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"r r;rforcedr%ldlcrcndncrcjZdjZlcjZldjZncjZndjc1c2rrforcerrr _iup_contour_bound_forced_setsH "       .  66 rV)r"r r;lookbackc Cst|}|dur|}t|t}ddi}ddi}td|D]}||dd} | ||<|d||<|d|vrnq8t|dt||ddD]H} || d} | | krt||| ||r| ||<} | ||<| |vrq8qq8||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)rrr7)rrI MAX_LOOKBACKrHrJrF) r"r rLr;rWrcostschainr% best_costrcostrrr _iup_contour_optimize_dps(     r^)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_listsrasr`rcs$;s|Sfdd|DS)Ncsh|]}|qSrr)r$r&r`rrr r(z_rot_set..rrbrrdr _rot_setsrfc st}tfddDr(dg|S|dkr4SdtfddDrfgdg|dSt|}|r6|dt|}|dksJt|t||}t|||}t||\}}t|d}|dur|||}qԈ d|ksJ|ffdd t |Dt| nt||||\}}d|d} t |dt|dD]n} t| }|| |kr||||}q|| |krv|| || |} | | krv| } qv|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$r@rBrr rC0r(z'iup_contour_optimize..Nrrc3s|]}|kVqdSr#r)r$r)d0rr rC9r(r)cs g|]}|vr|ndqSr#rr$r%)r"solutionrr r'cr(z(iup_contour_optimize..cs g|]}|vr|ndqSr#rri)best_solr"rr r'r() rrErVrJrarfr^rGrKremoverH) r"r r;rrLr`r[rZr%r\r/r]r)rkrhr"rjr;r iup_contour_optimize!sP            rm)r"r r4r;rc Cst||kr,t||r"|ddnddks0Jt|}||d|d|d|dg}g}d}|D]R}t|||d|||d|}t|||dksJ|||d}qd|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)rrr5r6r7)r8rrmr) r"r r4r;rrr/r2r9rrr iup_delta_optimizes 0 $  rn)r)rg)rg)"typingrrrnumbersrrr ImportErrorZfontTools.misccompiledZCOMPILEDZ_PointZ_DeltaZ _PointSegmentZ _DeltaSegmentZ _DeltaOrNoneZ_DeltaOrNoneSegmentZ _EndpointsrYr!r3r:boolrFrGrVr^rDintrarfrmrnrrrr sz      - (   J * f