+ i: 6^RIt]Pt^RIHtHtH t ^RI H t H t ]] ] 3,t ]] ] 3,t]] ,t]],t] ]R3,t]],t]] ,t^t]P*]P,!]P.]P.]P0]P0]P0]P0]P0]P0]P0R7 RRl44tRR ltR R lt]P*]P8]P,!]P.]P.]P0]P0]P0]P0R 7]P:!]4R Rl4444t]P,!]P0]P0]P0]P0]P0]P0]P.]R7RRRll4t ]P,!]P.]P.]P0]P.]P0]]P0R7]!4^R3RRll4t!RRlt"RRlt#RRRllt$RRRllt%R# ]]3d ^RIHtELi;i)N)cython)SequenceTupleUnion)IntegralReal) jnx1x2d1d2scalexdc TV^8dQhR\R\R\R\R\/#)coordsrc1rd1rc2rd2) _PointSegment_Point_Delta)formats"t/Users/tonyclaw/.openclaw/workspace/skills/math-calculator/venv/lib/python3.14/site-packages/fontTools/varLib/iup.py __annotate__r(s400 0 &0-30:@0GM0cRR.pRFp.;WV&pW,W6,W&,WF,3wrrW8XdG\V4p W8XdVPV .V ,4MVP^.V ,4KvW8dYrYrW, W, , p VFFpW,pW8:dT pM!W8dT pMW, V ,pV V,pVPV4KH K \V!#)zGiven two reference coordinates `rc1` & `rc2` and their respective delta vectors `rd1` & `rd2`, returns interpolated deltas for the set of coordinates `coords`.Nr)lenextendappendzip)rrrrr out_arraysr outr r r rr rpairrrnudges&&&&& r iup_segmentr+s*J   7 8F Ax B4!8$ A37#  7RW%DAw5(J JJqM%%L  rc<V^8dQhR\R\R\/#)rdeltasrreturn)_DeltaOrNoneSegmentr _DeltaSegment)rs"rrr[s"11+1]1}1rc \V4\V48XgQhRV9dV#\V4p\V4UUu.uF wr4VfK VNK pppV'g R.V,#.p\V4p\V4pV^8wdH^WVR,3wrrVP \ WV W,W ,W,W ,44VP W,4VFpp W, ^8dHV^,WV 3wrrVP \ WV W,W ,W,W ,44VP W ,4T pKr W^, 8wdOV^,W(V^,3wrrVP \ WV W,W ,W,W ,44\V4\V48XgQ\V4\V434hV#uuppi)zFor the contour given in `coords`, interpolate any missing delta values in delta vector `deltas`. Returns fully filled-out delta vector.N)rr)r# enumerateiternextr$r+r%)r-rr ivindicesr(itstarti1i2ri1ri2ends&& r iup_contourr@[s v;#f+ %% % 6  F A&v.@.TQ!qq.G@ x!| C gB HE zeGBK7 " v{FKfk  JJv} ;?$qy#c9 BC JJbM6; V[&+  6; A~ 19a : " v{FKfk  v;#c( ";S[#c($;; " JKAs G* G*cHV^8dQhR\R\R\R\/#)rr-rendsr.)r/r _Endpointsr0)rs"rrrs, )6>Hrc`\V4V8Xd0\V4V'dVR,^,M^^,8XgQh\V4pW#^, V^, V^, V^, .,p.p^pVF/pV^, p\WVWV4pVPV4TpK1 V#)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.r2)sortedr#r@r$)r-rrBr r(r:r?contours&&& r iup_deltarGs $<4 CKDDHqLaST3T$TT T F A q5!a%QA. .D C E qf3/c1BC 7  Jr)r6r rypqc TV^8dQhR\R\R\R\R\/#)rr-rr6r tolerance)r0rrr)rs"rrrs:     rc0aW2, ^8gQh\W^,VW,W,W,W,4pW^,Vp\;QJd(V3Rl\W44F 'dK R# R#!V3Rl\W444#)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.c3z<"TF0wwrwr4\\W, W$, 44S8*xK2 R#5iNabscomplex).0rrHrIrJrLs& r %can_iup_in_between..s51NFQFQ GAE15 !"i/1s8;FT)r+allr&)r-rr6r rLinterps&&&&f rcan_iup_in_betweenrXs. 5A:: A*FIvy&)VY WF EA F 3!&13333!&1 r)cjdjlcjldjncjndjforceforcedcHV^8dQhR\R\R\R\/#rr-rrLr.)r0rrset)rs"rrrs2NN N#0N=ANNrcD\V4\V48XgQh\V4p\4p\\V4^, RR4EFpW^, ,W^, ,rvW,W,rWV, ^,,WV, ^,,rREFkp W,p W,pW|,pWl,pW,pW,pVV8:d TTppTTppMTTppTTppRpVV8Xd+\VV, 4V8d\V4V8dRpMVT u;8:dV8:d:MM6\ VV4V, Tu;8:d\ VV4V,8:gMRpMVV8wdV V8d>\V4V8d-\VV, 4V8dW, V8VV88wdRpM<\V4V8d-\VV, 4V8dVW,8VV88wdRpV'gEKYVP V4EK EK V#)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`. FTr2r!)r#rcrangerQminmaxadd)r-rrLr r`r6ldlcrcndncr rYrZr[r\r]r^c1c2r rr_s&&& r_iup_contour_bound_forced_setrps( 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)r6r best_costbest_jcostr`rLcHV^8dQhR\R\R\R\/#)rr-rrLlookback)r0rrr)rs"rrr.s0)) ) ) )  )rc \V4pVfTp\V\4pR^/pRR/p\^V4FpWh^, ,^,p WV&V^, Wx&V^, V9dK8\V^, \ W, R4R4F>p Wj,^,p W8d\ WWV4'd T ;Wh&p WV&W9gK=K K Wv3#)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.Nr2)r#rf MAX_LOOKBACKrergrX) r-rr`rLrur costschainr6rqr rss &&&&& r_iup_contour_optimize_dpr{%s2 F A8\*H GE JE 1a[a%L1$ aq5 q5F? q1uc!,3R8A8a.zs 9&Q3w{ y (&s"%FTNc3.<"TF pSV8HxK R#5irOr)rSrd0s& rrTrs #Fq27Fsr2) r#rVrprgrrr{rcrhremovere)r-rrLr r`r~rzrysolutionr6best_solrqr:rsrs&&f @riup_contour_optimizerksW F A  s 9& 9sss 9& 999vz Av  B s #F #sss #F ###ttfA&&&+69 EFUc&k !Av v6%6%&Q'0 R 5 Em LLOA !5F#55!@EaI1H}&)$6I62&< M30 OV_fi #AE)1q5#e*q.1EuHAai- QU#HAI~|eAI&66$*2i2 !5F#55!@EaI1H}&)$6I MAJ<Js J) J.c TV^8dQhR\R\R\R\R\/#)rr-rrBrLr.)r0rrCrr/)rs"rrrs:      rc\V4V8Xd0\V4V'dVR,^,M^^,8XgQh\V4pW$^, V^, V^, V^, .,p.p^pVF[p\WV^,WV^,V4p\V4Wv, ^,8XgQhVPV4V^,pK] V#)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. r2)rEr#rr$) r-rrBrLr r(r:r?rFs &&&& riup_delta_optimizers $<4 CKDDHqLaST3T$TT T F A q5!a%QA. .D C E& 37 #VC!G%rsM& ?? # tTz  tTz   VT\" |, h    jj jj }} }} }} }} -- mm mm 0 0f1h4 jj jj mm mm mm mm* }} }}    **  N Nb jj jjmm ::  mm 5 ))X#$bJ[  $&%%&sJJJ