ldZddlmZddlZddlZddlZ ddlmZ ddl m Z ddl mZdd lmZdd lmZdd lmZdd lmZd Zej0dgdZGddeZGddeZddZddZddZdej@dfdZ!ddedfdZ"y#e $r ddlmZYwxYw#e $r ddl m Z YwxYw)z?`functools.lru_cache` compatible memoizing function decorators.)absolute_importN) monotonic)time)RLock)keys)LFUCache)LRUCache)RRCache)TTLCache) lfu_cache lru_cacherr_cache ttl_cache CacheInfo)hitsmissesmaxsizecurrsizec eZdZdZedZy) _UnboundCacheNct|SN)lenselfs "lib/third_party/cachetools/func.pyrz_UnboundCache.currsize#s t9)__name__ __module__ __qualname__rpropertyrrrrrs '  rrc"eZdZdZedZy)_UnboundTTLCachecFtj|td||y)Ninf)r __init__float)rttltimers rr(z_UnboundTTLCache.__init__*s dE%L#u5rcyrr#rs rrz_UnboundTTLCache.maxsize-s rN)rr r!r(r"rr#rrr%r%(s6  rr%Fcfd}|S)Nc rtjntjtddgfd}fd}fd}t j |t |ds|_||_||_ |S)Nrc5\}}j}j}dddtS#1swYxYwr)rr _CacheInfo)rrrrcachelockstatss r cache_infoz-_cache..decorator..cache_info9sA  f-->> fgx 88 4s 8Ac~5 jddgdd dddy#ddgddwxYw#1swYyxYw)Nr)clear)r1r2r3sr cache_clearz._cache..decorator..cache_clear@sA   ++-V%( 4V%( 4s3'3 03<c*|i|}5 |}dxxdz cc<|cdddS#t$rdxxdz cc<YnwxYw dddn #1swYnxYw|i|} 5||<ddd|S#1swY|SxYw#t$rY|SwxYw)Nrr)KeyError ValueError) argskwargskvr1funckeyr2r3s rwrapperz*_cache..decorator..wrapperGs t v a  Ah! (a-( 4   (a-(   44   a %(h h  h sVA+AAAAA&B(A8.B8B=BB BB __wrapped__) rtypedkeyhashkeyr functoolsupdate_wrapperhasattrrBr4r7) r?r4r7rAr@r2r3r1typeds ` @@@r decoratorz_cache..decorator4sq $--dllC 7D FE9"Wd+ 7M * g#G%G Nrr#)r1rHrIs`` r_cacherJ2s)V rcX|tt|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. )rJrr rrHs rr r b* _ -/5 )) (7#U ++rcX|tt|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. )rJrr rMs rrrorNrcZ|tt|Stt|||S)zDecorator to wrap a function with a memoizing callable that saves up to `maxsize` results based on a Random Replacement (RR) algorithm. )rJrr )rchoicerHs rrr|s, _ -/5 )) ''6*E 22riXc`|tt|||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. )rJr%r )rr*r+rHs rrrs4  _ "3. 66 (7C/ 77r)F)rKF)#__doc__ __future__r collectionsrErandomrr default_timer ImportError threadingrdummy_threadingrlfur lrur rrr r*r __all__ namedtupler0dictrr%rJr rrQrrr#rrrbsE& )-$ = #[ # #K$MO Dx-` , ,e 3s-u 8})() $#$s"BB% B"!B"% B32B3