=wgF4ddlmZddlZddlZddlmZddlmZddlmZddl m Z ddl m Z ddl m Z mZ dd lmZd Zdd ZddZddZddZddZy#e$rGd d eZY*wxYw))with_statementN)array) nsmallest) itemgetter)Lock)time) iteritemsxrange)CounterceZdZdZy)r cy)Nr)selfkeys H/var/www/horilla/myenv/lib/python3.12/site-packages/whoosh/util/cache.py __missing__zCounter.__missing__+sN)__name__ __module__ __qualname__rrrrr r *s rr cJitjfd}|S)z4Caching decorator with an unbounded cache size. cF |S#t$r|}||<|cYSwxYwNKeyError)argsresultcachefuncs rcaching_wrapperz&unbound_cache..caching_wrapper5s8 ;  4[F E$KM s   ) functoolswraps)rr rs` @r unbound_cacher#/s- E__T rcfd}|S)aA simple cache that, when the cache is full, deletes the least recently used 10% of the cached values. This function duplicates (more-or-less) the protocol of the ``functools.lru_cache`` decorator in the Python 3.2 standard library. Arguments to the cached function must be hashable. View the cache statistics tuple ``(hits, misses, maxsize, currsize)`` with f.cache_info(). Clear the cache and statistics with f.cache_clear(). Access the underlying function with f.__wrapped__. cddgiitjfd}fd}fd}||_||_|S)NrcD |}dxxdz cc<t |<|S#t$r`dxxdz cc<tk(r5tdzxsdtt dD] \}}|=|= ||<|}YwwxYw#t |<wxYwNr )r)rlenrr rr) rrk_datalastusedmaxsizestats user_functions rwrapperz7lru_cache..decorating_function..wrapperTs (daA "&M $aA t9' )'R-*<1*3H*=.8m!=(1!G$QK ( +D1T d $"&"$A&B  B B  BBc.ddtfSNrr(r*r-r/r0sr cache_infoz:lru_cache..decorating_function..cache_infog8U1XwD 9 9rcZjjdxd<d<yr5clear)r-r.r0sr cache_clearz;lru_cache..decorating_function..cache_clearjs( JJL NN "# #E!HuQxrr!r"r8r=)r1r2r8r=r-r.r0r/s` @@@rdecorating_functionz&lru_cache..decorating_functionOsRA  '  ( $ : $ ()rrr/r?s` r lru_cacherAAs"F rcfd}|S)aA simple cache that, when the cache is full, deletes the least frequently used 10% of the cached values. This function duplicates (more-or-less) the protocol of the ``functools.lru_cache`` decorator in the Python 3.2 standard library. Arguments to the cached function must be hashable. View the cache statistics tuple ``(hits, misses, maxsize, currsize)`` with f.cache_info(). Clear the cache and statistics with f.cache_clear(). Access the underlying function with f.__wrapped__. cddgittjfd}fd}fd}||_||_|S)NrcD |}dxxdz cc<|xxdz cc<|S#t$r`dxxdz cc<tk(r5tdzxsdtt dD] \}}|=|= ||<|}YwwxYw#|xxdz cc<wxYwr')rr*rr r) rrr+r,r-r/r0usecountr1s rr2z7lfu_cache..decorating_function..wrappers $daA !#M $aA t9' )'R-*<1*3H*=.8m!=(1!G$QK ( +D1T d $!#r3c.ddtfSr5r6r7srr8z:lfu_cache..decorating_function..cache_infor9rcFjjyrr;)r-rEsrr=z;lfu_cache..decorating_function..cache_clears JJL NN r)r r!r"r8r=)r1r2r8r=r-r0rEr/s` @@@rr?z&lfu_cache..decorating_functionsTA9  '  ( $ : ()rrr@s` r lfu_cacherHus!D rcfd}|S)aA very simple cache that, when the cache is filled, deletes 10% of the cached values AT RANDOM. This function duplicates (more-or-less) the protocol of the ``functools.lru_cache`` decorator in the Python 3.2 standard library. Arguments to the cached function must be hashable. View the cache statistics tuple ``(hits, misses, maxsize, currsize)`` with f.cache_info(). Clear the cache and statistics with f.cache_clear(). Access the underlying function with f.__wrapped__. cddgitjfd}fd}fd}||_||_|S)NrcX |}dxxdz cc<|S#t$rdxxdz cc<tk(r]j}tdzxsdD]8}t j dt|dz }|j |}|=: ||<|}Y|SwxYw)Nrr(r))rr*keysr randomrandintpop) rrrLinr+r-r/r0r1s rr2z:random_cache..decorating_function..wrappers $daA M $aA t9'99;D#GrM$6Q7$"NN1c$i!m< HHQK G$+D1T dM $sBB)(B)c.ddtfSr5r6r7srr8z=random_cache..decorating_function..cache_infor9rc&jyrr;)r-srr=z>random_cache..decorating_function..cache_clears JJLrr>)r1r2r8r=r-r0r/s` @@rr?z)random_cache..decorating_functionsMA  '  (   : ()rrr@s` r random_cacherTs< rcfd}|S)aDouble-barrel least-recently-used cache decorator. This is a simple LRU algorithm that keeps a primary and secondary dict. Keys are checked in the primary dict, and then the secondary. Once the primary dict fills up, the secondary dict is cleared and the two dicts are swapped. This function duplicates (more-or-less) the protocol of the ``functools.lru_cache`` decorator in the Python 3.2 standard library. Arguments to the cached function must be hashable. View the cache statistics tuple ``(hits, misses, maxsize, currsize)`` with f.cache_info(). Clear the cache and statistics with f.cache_clear(). Access the underlying function with f.__wrapped__. ciidddgtjfd}fd}fd}||_||_|S)Nrcd}|}| }|}||vrdxxdz cc<||S||vrdxxdz cc<||Sdxxdz cc<|}|||<t|k\r| d<|j|S)Nr()r*r<) rptrabrrr/r0r1s rr2z:db_lru_cache..decorating_function..wrappers(Cc A#gACaxaA v aA v aA &-#q6W$#&wE!HGGI rcRddtdtdzfS)NrYrZrr(r6)r/r0srr8z=db_lru_cache..decorating_function..cache_infos/8U1XwE!H E!H 0MM Mrcfdjdjdxd<d<y)$Clear the cache and cache statisticsrr(rYrZNr;)r0srr=z>db_lru_cache..decorating_function..cache_clears1 !HNN  !HNN "# #E!HuQxrr>)r1r2r8r=r0r/s` @rr?z)db_lru_cache..decorating_functionsPRAq!  '  ( * N $ ()rrr@s` r db_lru_cacheras &N rcfd}|S)auLeast-recently-used cache decorator. This function duplicates (more-or-less) the protocol of the ``functools.lru_cache`` decorator in the Python 3.2 standard library, but uses the clock face LRU algorithm instead of an ordered dictionary. If *maxsize* is set to None, the LRU features are disabled and the cache can grow without bound. Arguments to the cached function must be hashable. View the cache statistics named tuple (hits, misses, maxsize, currsize) with f.cache_info(). Clear the cache and statistics with f.cache_clear(). Access the underlying function with f.__wrapped__. c>gdi rPdg ztddt Dttj fd}ntjfd} fd} fd}||_||_|S)N)rrrBc3 K|]}dyw)rNr).0r,s r zCclockface_lru_cache..decorating_function..*s$@1Q$@s cx|} 5 |\}}d |< dxxdz cc<ddd|S#1swYSxYw#t$rw|} 5 d}|} |dz z} |}|rd |<n|r||k(r|}| vr |=||<d |<n4||f |<| d< dxxdz cc<dddY|S#1swYY|SxYwwxYw)Nr(rrXr)rrposrhandend current_ref current_key clock_keys clock_refsr-lockr/r0r1s rr2zAclockface_lru_cache..decorating_function..wrapper-s;(&&&*3i V*+ 3aA  &P Q&P E !&*D1F&$Qx"#$(1H#7D*4T*:K*45 4 0%0DCK /9.> #.$#6(,[(936 4 034 4 0 %##&&*6NS #'aaA =&&> ?&&> E!&s<9,9699B9 AB*B9*B5 /B95B9c|} |}dxxdz cc<|S#t$r|}||<dxxdz cc<Y|SwxYwr5r)rrrr-r0r1s rr2zAclockface_lru_cache..decorating_function..wrapper\s`"!#YF!HMH   "*D1F &DI!HMH "s  ==c.ddtfSr5r6r7srr8zDclockface_lru_cache..decorating_function..cache_infohr9rcxjdxd<xd<d<tD] }d|<d|<y)r`rr(rXN)r<r )rPrnror-r/r0s rr=zEclockface_lru_cache..decorating_function..cache_clearksL JJL-. .E!H .uQx%(G_ " $ 1 ! 1  "r)rr rr!r"r8r=) r1r2r8r=rnror-rpr0r/s ` @@@@@rr?z0clockface_lru_cache..decorating_function"s ')Js$@w$@AJ6D __] ++ + ,+ \__] + ,  : " "()rrr@s` rclockface_lru_cacherts"Sh r)d) __future__rr!rMrheapqroperatorr threadingrr whoosh.compatr r collectionsr ImportErrordictr#rArHrTrartrrrr~sh8&+#$1h0f,^7teQ$sAA'&A'