-h_SrSSKJr SSKJr \"5r\"5r\SS4Sjr\4Sjr \4Sjr Sr "S S \ 5r S rg ) z - the popular ``_memoize_default`` works like a typical memoize and returns the default otherwise. - ``CachedMetaClass`` uses ``_memoize_default`` to do the same with classes. wraps)debugFc^^^UUU4SjnU$)a:This is a typical memoization decorator, BUT there is one difference: To prevent recursion it sets defaults. Preventing recursion is in this case the much bigger use than speed. I don't think, that there is a big speed difference, but there are many cases where recursion could happen (think about a = b; b = a). c>^UUUU4SjnU$)NcF>T (a URnO-T (aUSRnOURRnUTnX[UR 554nXT;aXE$T[ LaTXE'T"U/UQ70UD6nXdU'U$![a 0=UT'nNVf=f)Nr) memoize_cacheinference_stateKeyError frozensetitems _NO_DEFAULT) objargskwargscachememokeyrvdefaultfunctioninference_state_is_first_argsecond_arg_is_inference_states gC:\Users\julio\OneDrive\Documentos\Trabajo\Ideas Frescas\venv\Lib\site-packages\jedi/inference/cache.pywrapper/_memoize_default..func..wrappers+)).Q--++99 ,Xi 78C{y +- 'DIc3D3F3S   ,)++h$ ,sB B B )rrrrrs` rfunc_memoize_default..funcs  .r)rrrrs``` r_memoize_defaultr!s4 Kr c^U4SjnU$)Nc$>[TSS9"U5$)NT)rrr!rrs r decorator1inference_state_function_cache..decorator5sdSTXYYr rrr&s` rinference_state_function_cacher)4sZ r c^U4SjnU$)Nc">[TS9"U5$)N)rr$r%s rr&/inference_state_method_cache..decorator<s066r rr(s` rinference_state_method_cacher-;s7 r c SnU$)Nc [SS9"U5$)NT)rr$)calls rr&8inference_state_as_method_param_cache..decoratorCsdCDIIr r)r&s r%inference_state_as_method_param_cacher2BsJ r c@^\rSrSrSr\"5U4Sj5rSrU=r$)CachedMetaClassIz This is basically almost the same than the decorator above, it just caches class initializations. Either you do it this way or with decorators, but with decorators you lose class access (isinstance, etc). c$>[TU]"U0UD6$)N)super__call__)selfrr __class__s rr8CachedMetaClass.__call__Osw000r r) __name__ __module__ __qualname____firstlineno____doc__r2r8__static_attributes__ __classcell__)r:s@rr4r4Is +,1-1r r4c SnU$)z This is a special memoizer. It memoizes generators and also checks for recursion errors and returns no further iterator elemends in that case. c0^[T5U4Sj5nU$)Nc?># URRnUT nX[UR 554nXT;aXEupgOT "U/UQ70UD6n/nXg4XE'SnXxn U [ La[ R"SU-5 gU v US- nM4![a 0=UT 'nNf=f![a= UR[ 5 [US5n U cUR5 gXS'Nhf=f7f)Nrz"Found a generator recursion for %s) r r r r r _RECURSION_SENTINELrwarning IndexErrorappendnextpop) rrrrrractual_generator cached_lsti next_elementrs rrEinference_state_method_generator_cache..func..wrapperZs#''55E ,Xi 78C{/3y, *#+C#A$#A&#A  ,8 A 2#-=L#':: &JS&PQ;#"Q ,)++h$ ,("2%%&9:#'(8$#?L#+"(%1rN 2sWC2B=C2&B( C2B%"C2$B%%C2(>C/&C2(C/,C2.C//C2r)rrs` rr4inference_state_method_generator_cache..funcYs! x   Br r)rs r&inference_state_method_generator_cacherTTs #J Kr N)r@ functoolsrjedirobjectrrHr!r)r-r2typer4rTrr rrYs[ h h)u38#L,7*51d1*r