U 6c-@sddlmZmZmZddlmZmZz 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}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_arraysjoutx1Zx2d1d2nZscalepairxdr8/tmp/pip-unpacked-wheel-n2hbwplv/fontTools/varLib/iup.py iup_segment$s.  $  r )deltasr rc Cst|t|kstd|kr |St|}ddt|D}|sHdg|Sg}t|}t|}|dkrd|||df\}}} } |t||||| || || || ||||D]j} | |dkr|d| || f\}}} } |t||||| || || || ||| | }q||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|qSNr).0ivrrr ^sziup_contour..)rrrr)rAssertionError enumerateiternextrr r) r!r rindicesritstarti1i2Zri1Zri2endrrr iup_contourQs2 ...&r2)r!r endsrcCst||kr,t||r"|ddnddks0tt|}||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)sortedrr(r2r)r!r r3rrr.r1contourrrr iup_deltays 0  r9)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.r6rc3s4|],\\}}\}}tt||||kVqdSr"abscomplex)r#rypqr:rr sz%can_iup_in_between..)r(listr rallr)r!r r$rr:ZinterprrArcan_iup_in_betweens 0rE)r!r r:rcCst|t|kstt|}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)rr(setranger<minmaxadd)r!r r:rforcedr$ZldlcrcZndZncrcjZdjZlcjZldjZncjZndjZc1c2rrforcerrr_iup_contour_bound_forced_setsH "       .  66 rQ)r!r r:lookbackc Cst|}|dkr|}t|t}ddi}ddi}td|D]}||dd} | ||<|d||<|d|krnq8t|dt||ddD]H} || d} | | krt||| ||r| ||<} | ||<| |krq8qq8||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'rrr6)rrH MAX_LOOKBACKrGrIrE) r!r rKr:rRrcostschainr$ best_costrcostrrr_iup_contour_optimize_dps(     rY)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)rZr[rrrr _rot_lists r\sr[rcs$;s|Sfdd|DS)Ncsh|]}|qSrr)r#r%r[rrr sz_rot_set..rr]rr_r_rot_setsrac st}tfddDr(dg|S|dkr4SdtfddDrfgdg|dSt|}|r6|dt|}|dkstt|t||}t|||}t||\}}t|d}|dk r |||}qԈ d|kst|ffdd t |Dt| nt||||\}}d|d} t |dt|dD]n} t| }|| |kr ||||}q|| |krv|| || |} | | krv| } qv|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|kVqdSr"r;)r#r?rArrrB0sz'iup_contour_optimize..Nrrc3s|]}|kVqdSr"r)r#r)d0rrrB9sr'cs g|]}|kr|ndqSr"rr#r$)r!solutionrrr&csz(iup_contour_optimize..cs g|]}|kr|ndqSr"rrd)best_solr!rrr&s) rrDrQrIr(r\rarYrFrJremoverG) r!r r:rrKr[rVrUr$rWr.rXr)rfrcr!rer:riup_contour_optimize!sP            rh)r!r r3r:rc Cst||kr,t||r"|ddnddks0tt|}||d|d|d|dg}g}d}|D]R}t|||d|||d|}t|||dkst|||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'rrr4r5r6)r7rr(rhr) r!r r3r:rrr.r1r8rrriup_delta_optimizes 0 $  ri)r)rb)rb)"typingrrrZnumbersrrr ImportErrorZfontTools.miscZcompiledZCOMPILEDZ_PointZ_DeltaZ _PointSegmentZ _DeltaSegmentZ _DeltaOrNoneZ_DeltaOrNoneSegmentZ _EndpointsrTr r2r9boolrErFrQrYrCintr\rarhrirrrrs     - (   J * f