yIf dZdZddlZddlZddlZ ddlmZn#e$r ddlmZYnwxYwddl m Z m Z m Z m Z mZmZddl mZddl mZGd d eZd ZddZddZddZddZd ejd fdZd dejd fdZdS)z?`functools.lru_cache` compatible memoizing function decorators.) fifo_cache lfu_cache lru_cache mru_cacherr_cache ttl_cacheN)RLock) FIFOCacheLFUCacheLRUCacheMRUCacheRRCacheTTLCache)cached)keysc*eZdZdZedZdS)_UnboundTTLCachecHtj|tj||dSN)r__init__mathinf)selfttltimers C/var/www/piapp/venv/lib/python3.11/site-packages/cachetools/func.pyrz_UnboundTTLCache.__init__s!$#u55555cdSr)rs rmaxsizez_UnboundTTLCache.maxsizestrN)__name__ __module__ __qualname__rpropertyr!r rrrrs>666Xrrcfd}|S)Ncr tjn tj}t|t d|}fd|_|S)NT)cachekeylockinfocdS)Nr!typedr r-srz+_cache..decorator.. sw+O+Or)rtypedkeyhashkeyrr cache_parameters)funcr)wrapperr(r!r.s r decoratorz_cache..decoratorsR$6dmm$,G&u#EGG$GGGMM#O#O#O#O#O rr )r(r!r.r5s``` r_cacher6s0 rFc|tid|St|r'ttdd||Stt|||S)zDecorator to wrap a function with a memoizing callable that saves up to `maxsize` results based on a First In First Out (FIFO) algorithm. Nr7)r6callabler r-s rrr&sg b$&&& '  :1vinnc511':::i(('5999rc|tid|St|r'ttdd||Stt|||S)zDecorator to wrap a function with a memoizing callable that saves up to `maxsize` results based on a Least Frequently Used (LFU) algorithm. Nr7)r6r9r r-s rrr4g b$&&& '  90vhsmmS%00999hw''%888rc|tid|St|r'ttdd||Stt|||S)zDecorator to wrap a function with a memoizing callable that saves up to `maxsize` results based on a Least Recently Used (LRU) algorithm. Nr7)r6r9r r-s rrrBr;rc|tid|St|r'ttdd||Stt|||S)zDecorator to wrap a function with a memoizing callable that saves up to `maxsize` results based on a Most Recently Used (MRU) algorithm. Nr7)r6r9rr-s rrrPsg b$&&& '  90vhsmmS%00999hw''%888rc|tid|St|r(ttd|d||Stt||||S)zDecorator to wrap a function with a memoizing callable that saves up to `maxsize` results based on a Random Replacement (RR) algorithm. Nr7)r6r9r)r!choicer.s rrr]sn b$&&& '  @7vgc6**C77@@@ggv..???riXc|tt||d|St|r)ttd||d||Stt|||||S)zDecorator to wrap a function with a memoizing callable that saves up to `maxsize` results based on a Least Recently Used (LRU) algorithm with a per-item time-to-live (TTL) value. Nr7)r6rr9r)r!rrr.s rrrks} &sE22D%@@@ '  ErJsEE X &&&&%%%%%%%%&IHHHHHHHHHHHHHHHx : : : : 9 9 9 9 9 9 9 9 9 9 9 9e @ @ @ @s$. E E E E E Es  ''