h:pSSKr\RrSSKJrJrJ r SSK J r J r \\ \ 4r \\ \ 4r\\ r\\r\ \S4r\\r\\ rSr\R*\R,"\R.\R.\R0\R0\R0\R0\R0\R0\R0S9 S\S\ S \S \ S \4 S j55rS \S\S\4SjrS \S\S\S\4Sjr\R*\R8\R,"\R.\R.\R0\R0\R0\R0S9\R:"\5S \S\S\ S\ S\ 4 Sj5555r\R,"\R0\R0\R0\R0\R0\R0\R.\S9S$S \S\S\ S\4Sjj5r \R,"\R.\R.\R0\R.\R0\\R0S9\"5SS4S \S\S\ S\ 4Sjj5r!S\"S\4Sjr#S\S\S \4S!jr$S%S \S\S\ S\4S"jjr%S%S \S\S\S\ S\4 S#jjr&g!\\4a SSKJr GNf=f)&N)cython)SequenceTupleUnion)IntegralReal) jnx1x2d1d2scalexdcoordsrc1rd1rc2rd2cvSS/nSHn/=XV'nXX6X&XF4uppX:Xa=[U5n X:XaURU /U -5 OURS/U -5 M\X:aXpXpX- X- - n UH4nXnX::aU nOX:aU nO X- U -nU U-nURU5 M6 M [U6$)zGiven two reference coordinates `rc1` & `rc2` and their respective delta vectors `rd1` & `rd2`, returns interpolated deltas for the set of coordinates `coords`.Nrr)lenextendappendzip)rrrrr out_arraysr outr r rrr rpairrrnudges F/var/www/html/env/lib/python3.13/site-packages/fontTools/varLib/iup.py iup_segmentr$s*J   7 8F Ax B4!8$ A37#  7RW%DAw5(J JJqM%%L  deltasreturnc *[U5[U5:XdeSU;aU$[U5n[U5VVs/sH up4UcM UPM nnnU(dS/U-$/n[U5n[U5nUS:wa3SXUS4uppUR [ XU XX XX 55 UR X5 UHSn X- S:a3US-XU 4uppUR [ XU XX XX 55 UR X 5 U nMU XS- :wa6US-X(US4uppUR [ XU XX XX 55 [U5[U5:Xd[U5[U545eU$s snnf)zFor the contour given in `coords`, interpolate any missing delta values in delta vector `deltas`. Returns fully filled-out delta vector.N)rrrr)r enumerateiternextrr$r)r&rr ivindicesr itstarti1i2ri1ri2ends r# iup_contourr7[s v;#f+ %% % 6  F A&v.@.TQ!q.G@ x!| C gB HE zeGBK7 " v{FKfk  JJv} ;?$qy#c9 BC JJbM6; V[&+  6; A~ 19a : " v{FKfk  v;#c( ";S[#c($;; " JKAs F Fendsc[U5U:Xa![U5U(aUSS-OSS-:Xde[U5nX#S- US- US- US- /-n/nSnUH+nUS- n[XUXU5nURU5 UnM- U$)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)sortedrr7r)r&rr8r r r1r6contours r# iup_deltar?s $<4 CKDDHqLaST3T$TT T F A q5!a%QA. .D C E qf3/c1BC 7  Jr%)r-r rypqr-r tolerancec^X2- S:de[XS-UXXXX5nXS-Un[U4Sj[X555$)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.r<rc3j># UH(uupup4[[X- X$- 55T:*v M* g7fNabscomplex).0rr@rArBrCs r# %can_iup_in_between..s51NFQFQ GAE15 !"i/1s03)r$allr)r&rr-r rCinterps ` r#can_iup_in_betweenrOsc. 5A:: A*FIvy&)VY WF EA F !&1 r%)cjdjlcjldjncjndjforceforcedcP[U5[U5:Xde[U5n[5n[[U5S- SS5GHXnXS- XS- pvXXpXU- S-XU- S-pSGH&n Xn XnX|nXlnXnXnUU::a UUnnUUnnOUUnnUUnnSnUU:Xa$[UU- 5U:a[U5U:aSnOUU s=::aU::a/O O,[ UU5U- Us=::a[ UU5U-::dO SnOoUU:waiU U:a2[U5U:a"[UU- 5U:aX- U:UU::waSnO1[U5U:a"[UU- 5U:aUX-:UU::waSnU(dGMUR U5 GMV GM[ U$)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)rsetrangerHminmaxadd)r&rrCr rWr-ldlcrcndncr rPrQrRrSrTrUc1c2rrrVs r#_iup_contour_bound_forced_setres( v;#f+ %% % F A UF 3v;?B +A1u By&)1A "Fq519$5BABB%C%C%C%CczcBcBBcBcBERxrBw<)+B)0C ErRB i/2PRy9PP E 8BwGi/ #BG y 8"$.2"527!C$(E Gi/ #BG y 8"$r~"527!C$(Eu 1 q ,~ Mr%)r-r best_costbest_jcostrWrClookbackc d[U5nUcUn[U[5nSS0nSS0n[SU5HvnXhS- S-n XU'US- Xx'US- U;aM#[US- [ X- S5S5H3n XjS-n X:a[ XXU5(a U =Xh'n XU'X;dM2 Mt Mx Xv4$)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)rrr<)rr[ MAX_LOOKBACKrZr\rO) r&rrWrCrir costschainr-rfr rhs r#_iup_contour_optimize_dpro%s2 F A8\*H GE JE 1a[a%L1$ aq5 q5F? q1uc!,3R8A8a# UHn[[U65T:*v M g7frFrG)rJrArCs r#rK'iup_contour_optimize..zs 9&Q3w{ y (&s!$Nrrc3.># UH nTU:Hv M g7frFrv)rJrd0s r#rKrzs #Fq27Fsr)) rrMrer\rsrwrorYr]removerZ)r&rrCr rWrqrnrmsolutionr-best_solrfr1rhr|s ` @r#iup_contour_optimizerksM F A  9& 999vz Av  B #F ###ttfA&&&+69 EFUc&k !Av v6%6%&Q'0 R 5 Em LLOAm  !5F#55!@EaI1H}&)$6I62&< M30 OV_fi #AE)1q5#e*q.1EuHAai- QU#Hai-AI~|eAI&66$*2i2 !5F#55!@EaI1H}&)$6I MAJ<Js G?&HcH[U5U:Xa![U5U(aUSS-OSS-:Xde[U5nX$S- US- US- US- /-n/nSnUHFn[XUS-XUS-U5n[U5Xv- S-:XdeURU5 US-nMH U$)zFor 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;r<)r=rrr) r&rr8rCr r r1r6r>s r#iup_delta_optimizers $<4 CKDDHqLaST3T$TT T F A q5!a%QA. .D C E& 37 #VC!G%rs& ?? # tTz  tTz   VT\" |, h    jj jj }} }} }} }} -- mm mm 0 0 &0-30:@0GM0 0f1+1]1}1h )6>H4 jj jj mm mm mm mm     * }} }}    **  EFN N#0N=ANN Nb jj jjmm ::  mm 5 ) ) ) )  ))X####$$$$EHb b#0b=AbbR       [  $&%%&sJ##J54J5