,[g:dZddlmZddlmZddlZddlZddlZeZdZ GddeZ Gdd e Z Gd d e Z Gd d e Z GddeZGddeZy)z! LRU caching class and decorator )abstractmethod)ABCMetaNlcReZdZeZedZeddZedZedZ y)Cachecy)!Remove all entries from the cacheNselfs N/var/www/html/bid-api/venv/lib/python3.12/site-packages/repoze/lru/__init__.pyclearz Cache.clearNcy)5Return value for key. If not in cache, return defaultNr r keydefaults r getz Cache.getrrcy)#Add key to the cache with value valNr r rvals r putz Cache.putrrcy)Remove key from the cacheNr r rs r invalidatezCache.invalidaterrN) __name__ __module__ __qualname__r __metaclass__rr rrrr rr rrsWM00DD22((rrc0eZdZdZdZddZdZdZdZy) UnboundedCachez9 a simple unbounded cache backed by a dictionary c"t|_yr)dict_datar s r __init__zUnboundedCache.__init__)s V rNc:|jj||Sr)r(rrs r rzUnboundedCache.get,szz~~c7++rc8|jjyr)r(r r s r r zUnboundedCache.clear/s rc> |j|=y#t$rYywxYwr)r(KeyErrorrs r rzUnboundedCache.invalidate2s$  3   s  c"||j|<yr)r(rs r rzUnboundedCache.put8s 3rr) r r!r"__doc__r)rr rrr rr r%r%$s , rr%c0eZdZdZdZdZddZdZdZy) LRUCachez Implements a pseudo-LRU algorithm (CLOCK) The Clock algorithm is not kept strictly to improve performance, e.g. to allow get() and invalidate() to work without acquiring the lock. ct|}|dkr td||_tj|_d|_|dz |_d|_d|_ d|_ d|_ d|_ d|_ d|_|jyNzsize must be >0r)int ValueErrorsize threadingLocklockhandmaxpos clock_keys clock_refsdata evictionshitsmisseslookupsr r r7s r r)zLRUCache.__init__Bs4y !8./ / NN$  Qh      rc|j5i|_|j}tg|z|_dg|z|_d|_d|_d|_d|_ d|_ dddy#1swYyxYwrFrN r:r?r7_MARKERr=r>r;r@rArBrCrDs r r zLRUCache.clearSsc YYDI99D&i$.DO$gnDODIDNDIDKDLYY AA''A0Nc|xjdz c_ |j|\}}|xjdz c_d|j |<|S#t$r|xjdz c_|cYSwxYw)rr4T)rCr?rAr-rBr>)r rrposrs r rz LRUCache.getfsl   yy~HC IINI $   KK1 KN s'A A21A2cT|j}|j}|j}|j}|j5|j |}|)|\}} | |ur||f||<d|j|< dddy|j } d} d} || } | dk(r!d|| <| dz } | |kDrd} | dz } | | k\rcd|| <n]|| }|j|t}|tur|xjdz c_ ||| <d|| <| |f||<| dz } | |kDrd} | |_n dddy#1swYyxYw)rNTrkr4F) r<r>r=r?r:rr;poprHr@)r rrr<r>r=r?entryrKold_valr;count max_countrefoldkeyoldentrys r rz LRUCache.putrsf__ __ yy YYHHSME  % W#%!$c DI'+$Y99DEI &$;',Jt$AIDf} QJE ),1 4('-F $xx8Hw.!+'*Jt$'+Jt$!%s DIAIDf}  $DI98WYYs4D:BDD'cz|jj|t}|turd|j|d<yyrFrNr?rNrHr>r rrOs r rzLRUCache.invalidate9 c7+  ).DOOE!H % rr) r r!r"r/r)r rrrr rr r1r1<s! "& 3j.rr1c6eZdZdZefdZdZddZddZdZ y) ExpiringLRUCachez Implements a pseudo-LRU algorithm (CLOCK) with expiration times The Clock algorithm is not kept strictly to improve performance, e.g. to allow get() and invalidate() to work without acquiring the lock. c,||_t|}|dkr td||_t j |_d|_|dz |_d|_ d|_ d|_ d|_ d|_ d|_d|_|j!yr3)default_timeoutr5r6r7r8r9r:r;r<r=r>r?r@rArBrCr )r r7r^s r r)zExpiringLRUCache.__init__s.4y !8./ / NN$  Qh      rc|j5i|_|j}tg|z|_dg|z|_d|_d|_d|_d|_ d|_ dddy#1swYyxYwrFrGrDs r r zExpiringLRUCache.clearsc YYDI99D&i$.DO$gnDODIDNDIDKDL!YYrINcf|xjdz c_ |j|\}}}|t jkDr&|xj dz c_d|j |<|S|xjdz c_d|j |<|S#t$r|xjdz c_|cYSwxYw)z@Return value for key. If not in cache or expired, return defaultr4TF)rCr?r-rBtimerAr>)r rrrKrexpiress r rzExpiringLRUCache.gets    $ # Cg TYY[ IINI#'DOOC J KK1 K#(DOOC N  KK1 KN sB B0/B0c|j}|j}|j}|j}|j}| |j }|j5|j |} | 1| d} | |tj|zf||<d|| < dddy|j} d} d} || }|dk(r!d|| <| dz } | |kDrd} | dz } | | k\ryd|| <ns|| }|j|t}|tur|xjdz c_ ||| <d|| <| |tj|zf||<| dz } | |kDrd} | |_n dddy#1swYyxYw)zAdd key to the cache with value val key will expire in $timeout seconds. If key is already in cache, val and timeout will be updated. NrTrMr4F) r<r>r=r?r:r^rrar;rNrHr@)r rrtimeoutr<r>r=r?r:rOrKr;rQrRrSrTrUs r rzExpiringLRUCache.puts__ __ yyyy ?**G YYHHSME Ah #tyy{W'<=S "& 3Y99DEI &$;',Jt$AIDf} QJE ),1 4('-F $xx8Hw.!+'*Jt$'+Jt$!%sDIIK',A BDIAIDf}  $DI98UYYs$((9v.rr\c$eZdZdZ ddZdZy) lru_cachez Decorator for LRU-cached function timeout parameter specifies after how many seconds a cached entry should be considered invalid. Nct|(| t}n| t|}n t||}||_||_y)N)r^)r%r1r\cache_ignore_unhashable_args)r maxsizerjrdignore_unhashable_argss r r)zlru_cache.__init__>s@ =&( )('J '=$rcjtfd}d}||d||d||d|_|S)Nc |r|t|jfn|}j|}|ur|i|}j|||S#t$r }j r |i|cYd}~S|d}~wwxYwr) frozensetitemsrr TypeErrorrk) argskwargsrrerjfuncmarkerr s r cached_wrapperz*lru_cache.__call__..cached_wrapperQs ;AtYv||~67tiiV,&=//CIIc3'  //000G  s#A A=A80A=6A88A=cBt|||}||urt|||yyr)getattrsetattr)sourcetargetattrvalues r _maybe_copyz'lru_cache.__call__.._maybe_copy`s)FD&1EF"e,#rr!r r/)rjrH_cache)r rvrxrrjrws`` @@r __call__zlru_cache.__call__MsO   - D.,7D.*5D.)4 %r)NNF)r r!r"r/r)rr rr rhrh8s(- >rrhcBeZdZdZdefdZd dZd dZd dZd dZ dZ y) CacheMakerz3Generates decorators that can be cleared later Nc.||_||_i|_y)zCreate cache decorator factory. - maxsize : the default size for created caches. - timeout : the defaut expiraiton time for created caches. N)_maxsize_timeoutr)r rlrds r r)zCacheMaker.__init__os    rc|. ttj}||jvrn-||jvrt d|z| |j }| t d| |j}|||fS)Nzcache %s already in usezCache must have a maxsize set)struuiduuid4rr-rr6r)r namerlrds r _resolve_settingzCacheMaker._resolve_settingzs <4::<(t{{*  4;; 4t;< < ?mmG ?<= = ?mmGWg%%rcx|j|d\}}}tx}|j|<td|S)Nr)rr%rrhr rrl_rjs r memoizedzCacheMaker.memoizeds>00q9gq$2$44 D!u%%rcz|j||\}}}t|x}|j|<t||S)zNamed arguments: - name (optional) is a string, and should be unique amongst all caches - maxsize (optional) is an int, overriding any default value set by the constructor )rr1rrhrs r lrucachezCacheMaker.lrucachesB 00w?gq$,W$55 D!%((rcdtz|j|||\}}}t||x}|j|<t |||S)NaYNamed arguments: - name (optional) is a string, and should be unique amongst all caches - maxsize (optional) is an int, overriding any default value set by the constructor - timeout (optional) is an int, overriding any default value set by the constructor or the default value (%d seconds) )rfrr\rrh)r rrlrdrjs r expiring_lrucachezCacheMaker.expiring_lrucachesW  "&!6!6tWg!Ngw$4Wg$FF D!%11rct|dk(r|jj}|D]}|j|j!y)z_Clear the given cache(s). If no 'names' are passed, clear all caches. rN)lenrkeysr )r namesrs r r zCacheMaker.clears@ u:?KK$$&ED KK  # # %r)NNNr)NN) r r!r"r/rfr)rrrrr r rr rrls+#-= &,& ) 2 &rr)r/abcrrr8rarobjectrHrfrr%r1r\rhrr rr rsy'  ((F((U0r.ur.lB.uB.L11hM&M&r