rDddlZddlmcmZddlZddlmZddl m Z ddl m Z m Z mZddlmZedZedZe dd Gd d e eefZGd de eefZGddeeefZGdde eefZy)N) OrderedDict) dataclass)AnyGenericTypeVar)InvalidArgumentKVTF)slotsfrozencZeZdZUeed<eed<eed<dZeed<ede edffdZ y ) Entrykeyvaluescorerpinsreturn.c>|jdk(rd|jfSy)Nr))rrselfs ^/home/oem/CyberBrain26-unified/.venv/lib/python3.12/site-packages/hypothesis/internal/cache.pysort_keyzEntry.sort_keys 99>tzz? "N) __name__ __module__ __qualname__r __annotations__r intrpropertytuplerrrrrs; F H JD#M %S/rrceZdZdZdZdefdZedee effdZ ede e e e ffdZd!d Zdefd Zd e defd Zd e de fd Zd e de ddfdZdZd e de ddfdZd e ddfdZd e defdZd!dZdefdZd e de defdZd e de dedefdZd e de dedefdZd!dZ deddfdZ!dededdfdZ"deddfdZ#dededefd Z$y)" GenericCacheaGeneric supertype for cache implementations. Defines a dict-like mapping with a maximum size, where as well as mapping to a value, each key also maps to a score. When a write would cause the dict to exceed its maximum size, it first evicts the existing key with the smallest score, then adds the new key to the map. If due to pinning no key can be evicted, ValueError is raised. A key has the following lifecycle: 1. key is written for the first time, the key is given the score self.new_entry(key, value) 2. whenever an existing key is read or written, self.on_access(key, value, score) is called. This returns a new score for the key. 3. After a key is evicted, self.on_evict(key, value, score) is called. The cache will be in a valid state in all of these cases. Implementations are expected to implement new_entry and optionally on_access and on_evict to implement a specific scoring strategy. ) _threadlocalmax_sizer&cd|dkr td||_tj|_y)Nrz Cache size must be at least one.)rr& threadinglocalr%)rr&s r__init__zGenericCache.__init__As- q=!"DE E  &OO-rrc |jjS#t$r*i|j_|jjcYSwxYwN)r%keys_to_indicesAttributeErrorrs rr-zGenericCache.keys_to_indicesNsH 5$$44 4 502D   -$$44 4 50A  A c |jjS#t$r*g|j_|jjcYSwxYwr,)r%datar.rs rr1zGenericCache.dataVsH *$$)) ) *%'D   "$$)) ) *r/Nc0t|jddr|jjd|jj t |jD]\}}||j|j< d|j_yy)aAn exception raised partway through a mutation - most plausibly a RecursionError below a deeply recursive strategy - can leave the heap property or the key index broken. We note the interruption and rebuild both here, on the next operation, from the surviving entries (a sorted list is heap-ordered), rather than attempting a repair at the moment the stack overflowed. interruptedFc|jSr,)r)es rz5GenericCache._repair_if_interrupted..gs rrN) getattrr%r1sortr-clear enumeraterr3)rir5s r_repair_if_interruptedz#GenericCache._repair_if_interrupted^s~ 4$$mU ; IINN3N 4  & & (!$)), 01./$$QUU+ 0,1D   ) |j||jvSr,)r=r-rrs r __contains__zGenericCache.__contains__rs ##%d****rc|j|j|}|j|} |j||jS#t$rd|j _wxYw)NT)r=r-r1!_GenericCache__entry_was_accessed BaseExceptionr%r3r)rrr<results r __getitem__zGenericCache.__getitem__vsl ##%   %1   % %a (|| ,0D   )  s A A)rc Z|jd} |j|}|j|}|j}||k(}|st j d|fd||fdt jvst j|rt j|ndt j|dt jvst j|rt j|nddz}dd|iz} tt j| dx}}||_ |j||:|jd |ur|j4}|jd } | j4} || k}|st j d |fd || fd t jvst j|rt j|nd t j|t j| t j| dz} dd| iz} tt j| dx}x}x} } |j7|j|j|j8yy#t$rd|j_wxYw#t"$rt%|||j'||}t)|j|j*k\rS|jd }|j,d kDr t/d d|j|j=d }||jd <n0t)|j}|jj1| ||j|<|j3|n#t$rd|j_wxYwYmwxYw)Nr?)z+%(py2)s {%(py2)s = %(py0)s.key } == %(py4)sentryr)rDpy2py4zassert %(py6)spy6Trz>Cannot increase size of cache where all keys have been pinned.<=zN%(py2)s {%(py2)s = %(py0)s.sort_key } <= %(py7)s {%(py7)s = %(py5)s.sort_key }evictedrDrhrGrHzassert %(py9)spy9)r=r-r1rrNrOrPrQrRrSrTrUrrbrcr%r3KeyErrorr new_entryrBr&r ValueErrorappend_GenericCache__balanceron_evictr)rrrrnr<rg @py_assert1 @py_assert3 @py_format5 @py_format7rWrZ @py_format8 @py_format10s r __setitem__zGenericCache.__setitem__s ##% $$S)A,IIaLE99 #9# # # #9 # # # # # #5 # # #5 # # #9 # # # # # # # # # # # # # # # #EK ))!,  yy|5(''@499Q<@<+@+@@'+@@@@@'+@@@@@@@w@@@w@@@'@@@<@@@+@@@@@@@@ MM'++w}}gmm D  ! 04!!- 5 #udnnS%&@AE499~.))A,<?@ @ a ::? q! ! 04!!- s 2BB!cX|j|}|j|jdkDS)z,Returns True if the key is currently pinned.r)r-r1r)rrr<s r is_pinnedzGenericCache.is_pinneds+   %yy|  1$$rcV|jdd=|jjy)z3Remove all keys, regardless of their pinned status.N)r1r-r:rs rr:zGenericCache.clears IIaL ""$rcRddjd|jDzdzS)N{z, c3RK|]}|jd|j!yw)z: N)rr).0r5s r z(GenericCache.__repr__..s#LQ!%%"QWWK8Ls%'})joinr1rs r__repr__zGenericCache.__repr__s%TYYL$))LLLsRRrct)zCalled when a key is written that does not currently appear in the map. Returns the score to associate with the key. )NotImplementedErrorrrrs rrrzGenericCache.new_entrys "!rrc|S)zCalled every time a key that is already in the map is read or written. Returns the new score for the key. r"rrrrs r on_accesszGenericCache.on_accesss  rcy)z`Called after a key has been evicted, with the score it had had at the point of eviction.Nr"rs rrvzGenericCache.on_evictsrc |j}t|}|j}t|}||k(}|stjd|fd||fdt j vstjtrtjtnddt j vstj|rtj|ndtj|tj|dt j vstjtrtjtnddt j vstj|rtj|ndtj|tj|dz}dd|iz}ttj|dx}x}x}x}}t|jD] \}} |j| j} | |k(}|stjd|fd | |ftj| d t j vstj|rtj|nd d z} d d | iz} ttj| dx} }|dzdz|dzdzfD]3} | t|jks| j}|j| }|j}||k}|stjd|fd||fdt j vstj| rtj| ndtj|tj|tj|dz}tj|jdzd|iz}ttj|dx}x}x}}6 y)zDebugging method for use in tests. Asserts that all of the cache's invariants hold. When everything is working correctly this should be an expensive no-op. r?rArBrrCrLrMN)z%(py1)s == %(py3)sr<)rErFassert %(py5)srGrrkrmr5roz >assert %(py9)srp)r-rBr1rNrOrPrQrRrSrTrUr;rr_format_assertmsg)rrVrWrXrYrZr[r\r<r5 @py_assert0 @py_format4 @py_format6jrwrxr{r|s r check_validzGenericCache.check_valids^ '':s'(: :C N:(N::::(N::::::s:::s::::::4:::4:::':::(::::::C:::C:::::::::::: :::N:::::::dii( JDAq''. 3.!3 3 3 3.! 3 3 3. 3 3 3 3 3 3! 3 3 3! 3 3 3 3 3 3 3!eaiQ+ Js499~%::I1I)>)>I:)>>III:)>IIIIII1III1III:IIIIII)>III IIIIIII J Jrr<c|j|}|j|j|j|j}||jk7r)||_|j dk(r|j |yyyNr)r1rrrrrru)rr<rg new_scores r__entry_was_accessedz!GenericCache.__entry_was_accessedsc ! NN599ekk5;;G  ##EKzzQq! $rrcb||k}|stjd|fd||fdtjvstj|rtj |nddtjvstj|rtj |nddz}dd|iz}t tj|d}|j|}|j}|j|}|j} || k} | stjd| fd|| ftj |tj |tj |tj | d z} d d | iz} t tj| dx}x}x} x}} |j||j|c|j|<|j|<||j|j|j<||j|j|j<y) N)<)z%(py0)s < %(py2)sr<r)rDrhzassert %(py4)sri)zM%(py3)s {%(py3)s = %(py1)s.sort_key } < %(py8)s {%(py8)s = %(py6)s.sort_key })rErFrjrIassert %(py10)srJ) rNrOrPrQrRrSrTrUr1rr-r) rr<rrw @py_format3ryrrV @py_assert5 @py_assert7rW @py_format9 @py_format11s r__swapzGenericCache.__swapsA1u q1 q q 1 1 yy|<|$$.s19N9Nrr7N)_GenericCache__out_of_order_GenericCache__swaprBr1min)rr<parentrchildrensmallest_childs` r __balancezGenericCache.__balance s a%A%v!+""61- FA& a%A%v!+()1uqy!a%!)&<SC N@R1SShS /NON""1n5 A~." ()1uqy!a%!)&<SC N@R1SShSSSsC25C2C7&C7cd}||z }d}||z}||k(}|stjd|fd||fdtjvstj|rtj |nddtjvstj|rtj |ndtj |tj |dz}dd |iz} t tj| d x}x}x}x}}|j|j|j|jkS) zeReturns True if the indices i, j are in the wrong order. i must be the parent of j. rrr?)z+%(py0)s == ((%(py2)s - %(py4)s) // %(py7)s)r<r)rDrhrirHrrJN) rNrOrPrQrRrSrTrUr1r) rr<rrxrrZ @py_assert8rwrrs r__out_of_orderzGenericCache.__out_of_order"s  QU q UqL qL    qL      q   q      Q   Q      q       yy|$$tyy|'<'<<)z%(py0)s > %(py3)sr&)rDrFrrG) rNrOrPrQrRrSrTrUr&r(r)r%)rr&rVrwrrs rr*zLRUCache.__init__aspx!|x!xx!  %OO-rc |jjS#t$r2t|j_|jjcYSwxYwr,)r%cacher.rrs rrzLRUCache.cachefsJ +$$** * +&1mD   #$$** * +s8AArrc||j|<|jj|t|j|jkDr@|jj dt|j|jkDr?yy)NF)last)r move_to_endrBr&popitemrs rr}zLRUCache.__setitem__ns` 3 s#$**o - JJ  E  *$**o -rcZ|j|}|jj||Sr,)rr)rrvals rrezLRUCache.__getitem__us&jjo s# rc,t|jSr,)rrrs rrzLRUCache.__iter__zsDJJrc,t|jSr,)rBrrs rr]zLRUCache.__len__}s4::rc||jvSr,)rr_s rr`zLRUCache.__contains__sdjj  rcyr,r"rs rrzLRUCache.check_valids rr)rrrrrr*r rr r rr}rerr]rr`rr"rrrrKs *... +{1a4(+++q++t+qQ  !!d! rr)builtinsrP_pytest.assertion.rewrite assertionrewriterNr( collectionsr dataclassesrtypingrrrhypothesis.errorsrr r rr$rrr"rrrs#!((- CL CL e$GAqDM%"@=71a4=@=F \!Q$' @: wq!t}: r