NhSSKJr SSKJr SSKJr SSKJrJrJ r J r J r J r J r Jr /SQr\ "S\ S9r\ "S5r"S S \ \\45r\ "S \ \ S 4S9r\ "S 5r"SS\ \\45r\ "S\S \4S9rSSSjjrg)) annotations)deque)wraps)AnyCallableDictGenericHashableTupleTypeVarcast) SimpleCache FastDictCachememoized_T)bound_Uc:\rSrSrSrSS SjjrS SjrS SjrSrg) rz Very simple cache that discards the oldest item when the cache size is exceeded. :param maxsize: Maximum size of the cache. (Don't make it too big.) cLUS:de0Ul[5UlXlgNr)_datar_keysmaxsize)selfrs Q/home/mande/repo/quber/.venv/lib/python3.13/site-packages/prompt_toolkit/cache.py__init__SimpleCache.__init__s#{{#% % # cXURU$![a U"5nX0RU'URRU5 [ UR5UR :a6URR 5nX@R;a URU Us$f=f)zz Get object from the cache. If not found, call `getter_func` to resolve it, and put that on the top of the cache instead. )rKeyErrorrappendlenrpopleft)rkey getter_funcvalue key_to_removes rgetSimpleCache.get s ::c? " ME#JJsO JJ  c "4::- $ 2 2 4  JJ. =1L sBB)(B)c00Ul[5Ulg)z Clear cache.N)rrr)rs rclearSimpleCache.clear7s W r)rrrN))rintreturnNone)r%rr&zCallable[[], _U]r0r)r0r1) __name__ __module__ __qualname____firstlineno____doc__rr)r,__static_attributes__rrrrs$.rr_K._Vc0\rSrSrSrSSSjjrS SjrSrg) rAa Fast, lightweight cache which keeps at most `size` items. It will discard the oldest items in the cache first. The cache is a dictionary, which doesn't keep track of access counts. It is perfect to cache little immutable objects which are not expensive to create, but where a dictionary lookup is still much faster than an object instantiation. :param get_value: Callable that's called in case of a missing key. cJUS:de[5UlXlX lgr)rr get_valuesize)rr>r?s rrFastDictCache.__init__Vs axx % " rc[U5UR:a!URR5nX ;aX UR"U6nX0U'URR U5 U$N)r#r?rr$r>r")rr%r(results r __missing__FastDictCache.__missing__]s\ t9tyy  JJ..0M$'%S  # r)rr>r?N)i@B)r>zCallable[..., _V]r?r/r0r1)r%r9r0r:)r2r3r4r5r6rrDr7r8rrrrAs ( rr_Fc^SU4SjjnU$)zA Memoization decorator for immutable classes and pure functions. ch>^^[TS9m[T5SUU4Sjj5n[[U5$)N)rc>^^SUUU4SjjnT[[TR5554nTRX25$)Nc>T"T0TD6$rBr8)akwobjsr create_newEmemoized..decorator..new_callable..create_newwsA}}$r)r0r)tuplesorteditemsr))rKrLrNr%cacherMs`` r new_callable1memoized..decorator..new_callableus8 % %eF288:./0C99S- -r)rKrrLrr0r)rrr rF)rMrTrSrs` @r decoratormemoized..decoratorrs2,7,H s .  .B %%r)rMrFr0rFr8)rrVs` rrrms & rN)i)rr/r0zCallable[[_F], _F]) __future__r collectionsr functoolsrtypingrrrr r r r r __all__rrrr9r:robjectrFrr8rrr^s"OOO   T" T])'"b&/)X Tx}-. T]&DRL&R T#v+./r