:Sh'dZddlZddlZejejejeZejddz dz Z dejdz dz Z d d Z dS) zPython program for golden section search (straight-up copied from Wikipedia). This implementation reuses function evaluations, saving 1/2 of the evaluations per iteration, and returns a bounding interval.N)level-C6?ct||t||}}||z }||kr||fSttjtj||z tjt z }td|fd}|t|zz}|t |zz}|||dk} |||dk} t|dz D]i} | | kr1|}|}| } t |z}|t|zz}||| |dz k} 9|}|}| } t |z}|t |zz}|| |dz k} j| | kr||fS||fS)ayGolden-section search. Given a function f with a single local minimum in the interval [a,b], gss returns a subset interval [c,d] that contains the minimum with d-c <= tol. Example: >>> f = lambda x: (x-2)**2 >>> a = 1 >>> b = 5 >>> tol = 1e-5 >>> (c,d) = gss(f, a, b, tol) >>> print(c, d) 1.9999959837979107 2.0000050911830893 zRAbout to perform %d iterations of golden section search to find the best frameratecT ||S#t$r|cYSwxYw)N) TypeError)x is_last_iterfs e/var/www/html/movieo_spanner_bot/venv/lib/python3.11/site-packages/ffsubsync/golden_section_search.py f_wrappedzgss..f_wrapped,sF 1Q %% %   1Q44KKK s ''rr) minmaxintmathceilloginvphiloggerinfoinvphi2range) rabtolhnrcdycydks ` rgssr&s"!QiiQQ AACxx!t  DIdhsQw''$(6*:*:: ; ;<r0s22 ',''''  8 $ $ $)A,, a  yty|| q ;;;;;;r'