i|1SSKrSSKJr SSKJr SSKJrJrJr SSK J r \"S5r \"S5r \"SS S 9"S S \\ \ 455r "S S\\ \ 45r"SS\\ \ 45r"SS\\ \ 45rg)N) OrderedDict) dataclass)AnyGenericTypeVar)InvalidArgumentKVTF)slotsfrozencd\rSrSr%\\S'\\S'\\S'Sr\\S'\ S\ \S44S j5r S r g ) Entrykeyvaluescorerpinsreturn.c@URS:XaSUR4$g)Nr))rrselfs X/var/www/html/ai-image-ml/venv/lib/python3.13/site-packages/hypothesis/internal/cache.pysort_keyEntry.sort_keys 99>tzz? "N) __name__ __module__ __qualname____firstlineno__r __annotations__r intrpropertytupler__static_attributes__rrrrrs; F H JD#M %S/rrc\rSrSrSrSrS\4Sjr\S\ \ \44Sj5r \S\ \ \ \44Sj5rS\4S jrS \ S\4S jrS \ S\4S jrS \ S \SS4SjrSrS \ S \SS4SjrS \ SS4SjrS \ S\4SjrS!SjrS\4SjrS \ S \S\4SjrS \ S \S\S\4SjrS \ S \S\S\4SjrS!Sjr S\SS4Sjr!S\S\SS4Sjr"S\SS4Sjr#S\S\S\4S jr$Sr%g)" GenericCache(aGeneric 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,cfUS::a [S5eXl[R"5Ulg)Nrz Cache size must be at least one.)rr, threadinglocalr+rr,s r__init__GenericCache.__init__As+ q=!"DE E &OO-rrcURR$![a* 0URlURRs$f=fN)r+keys_to_indicesAttributeErrorrs rr5GenericCache.keys_to_indicesNsH 5$$44 4 502D   -$$44 4 51A  A cURR$![a* /URlURRs$f=fr4)r+datar6rs rr:GenericCache.dataVsH *$$)) ) *%'D   "$$)) ) *r8c[UR5[UR5:Xde[UR5$r4)lenr5r:rs r__len__GenericCache.__len__^s14''(C N:::499~rrcXR;$r4)r5rrs r __contains__GenericCache.__contains__bs****rcxURUnURUnURU5 UR$r4)r5r:!_GenericCache__entry_was_accessedr)rriresults r __getitem__GenericCache.__getitem__es7   %1 !!!$||rrNc ZSnURUnURUnURU:XdeX%lUR U5 UbmURSULa)URURSR::deURURURUR 5 gg![ a [ XURX55n[UR5UR:aSURSnURS:a [S5SeURUR SnXPRS'O0[UR5nURRU5 X@RU'URU5 GN^f=f)Nrz>Cannot increase size of cache where all keys have been pinned.)r5r:rrrEKeyErrorr new_entryr=r,r ValueErrorappend_GenericCache__balanceron_evictr)rrrevictedrFentrys r __setitem__GenericCache.__setitem__ksl )$$S)A$IIaLE99# ##K  % %a (  yy|5(''499Q<+@+@@@@ MM'++w}}gmm D - #dnnS&@AE499~.))A,<?@ @ a ::? NN1  rcXURUnURURS:$)z,Returns True if the key is currently pinned.r)r5r:r)rrrFs r is_pinnedGenericCache.is_pinneds+   %yy|  1$$rcVURSS2 URR5 g)z3Remove all keys, regardless of their pinned status.N)r:r5clearrs rrcGenericCache.clears IIaL ""$rcRSSRSUR55-S-$)N{z, c3Z# UH!oR<SUR<3v M# g7f)z: N)rr).0es r (GenericCache.__repr__..s!L)Q%%"QWWK8)s)+})joinr:rs r__repr__GenericCache.__repr__s%TYYL$))LLLsRRrc[e)zvCalled when a key is written that does not currently appear in the map. Returns the score to associate with the key. )NotImplementedErrorrrrs rrLGenericCache.new_entrys "!rrcU$)zkCalled every time a key that is already in the map is read or written. Returns the new score for the key. rrrrrs r on_accessGenericCache.on_accesss  rcg)zXCalled after a key has been evicted, with the score it had had at the point of eviction.Nrrus rrPGenericCache.on_evictsrc[UR5[UR5:Xde[UR5HupURURU:XdeUS-S-US-S-4HVnU[UR5:dMUR URUR ::aMGUR5e M g)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. rN)r=r5r: enumeraterr)rrFrijs r check_validGenericCache.check_valids 4''(C N:::dii(DA''.!3 33!eaiQ+s499~%::1)>)>>I I>,)rrFcURUnURURURUR5nX2R:wa)X2lUR S:XaUR U5 gggNr)r:rvrrrrrO)rrFrR new_scores r__entry_was_accessed!GenericCache.__entry_was_accesseds_ ! NN599ekk5;;G  ##KzzQq! $rr}cX:deURURURUR:deURUURUsURU'URU'XRURUR'X RURUR'gr4)r:rr5rrrFr}s r__swapGenericCache.__swapsu uyy|$$tyy|'<'<<<<%)YYq\499Q<" ! diil12TYYq\--.12TYYq\--.rc,^US- S-=nS:a;TRX!5(aTRX!5 UnOOUS- S-=nS:aM;SU-S-SU-S-4Vs/sHo3[TR5:dMUPM! sn=n(a~[ UU4SjS9nTRX5(aTRX5 UnOgSU-S-SU-S-4Vs/sHo3[TR5:dMUPM! sn=n(aM}ggs snfs snf)zWhen we have made a modification to the heap such that the heap property has been violated locally around i but previously held for all other indexes (and no other values have been modified), this fixes the heap so that the heap property holds everywhere.rr{rc6>TRUR$r4r:r)r}rs r(GenericCache.__balance..s19N9Nr)rN)_GenericCache__out_of_order_GenericCache__swapr=r:min)rrFparentr}childrensmallest_childs` r __balanceGenericCache.__balances a%A%v!+""6-- F& a%A%v!+()1uqy!a%!)&<S&<C N@R1&<SShS /NON""155 A." ()1uqy!a%!)&<S&<C N@R1&<SShSSSSsD =D D8DcXS- S-:XdeURURURUR:$)zUReturns True if the indices i, j are in the wrong order. i must be the parent of j. rr{rrs r__out_of_orderGenericCache.__out_of_orders? UqL   yy|$$tyy|'<'<<boolrBrHrSrWrZr]r`rcstrrnrLrrvrPr~rErrOrr&rrrr(r((s,-I . .5af55*d5A;'**++d+qQ EqEEtE>* q  t   t %Q%4% % S#S"Q"q"S"Qq"A"a""" J"c"d"333334*====rr(cv^\rSrSrSrSrS\4U4SjjrS\4SjrS\ S \ S\ 4S jr S\ S \ S \ S\ 4S jr SrU=r$) LRUReusedCacheiacThe only concrete implementation of GenericCache we use outside of tests currently. Adopts a modified least-recently used eviction policy: It evicts the key that has been used least recently, but it will always preferentially evict keys that have never been accessed after insertion. Among keys that have been accessed, it ignores the number of accesses. This retains most of the benefits of an LRU cache, but adds an element of scan-resistance to the process: If we end up scanning through a large number of keys without reusing them, this does not evict the existing entries in preference for the new ones. )__tickr,c2>[TU]U5 SUlgr)superr1_LRUReusedCache__tick)rr, __class__s rr1LRUReusedCache.__init__s " rrcDU=RS- slUR$Nr)rrs rtickLRUReusedCache.ticks q {{rrrc&SUR54$rrrrs rrLLRUReusedCache.new_entry499;rrc&SUR54$)Nr{rrus rrvLRUReusedCache.on_accessrr)rrr r!rrr#r1rr r rrLrvr& __classcell__)rs@rrrsg Ic Q q S  Q q    rrc\rSrSrSrS\SS4Sjr\S\\ \ 44Sj5r S\ S \ SS4S jr S\ S\ 4S jr S rS\4S jrS\ S\4SjrSSjrSrg)LRUCachei#a This is a drop-in replacement for a GenericCache (despite the lack of inheritance) in performance critical environments. It turns out that GenericCache's heap balancing for arbitrary scores can be quite expensive compared to the doubly linked list approach of lru_cache or OrderedDict. This class is a pure LRU and does not provide any sort of affininty towards the number of accesses beyond recency. If soft-pinning entries which have been accessed at least once is important, use LRUReusedCache. r,rNcTUS:deXl[R"5Ulgr)r,r.r/r+r0s rr1LRUCache.__init__9s"!|| %OO-rcURR$![a2 [5URlURRs$f=fr4)r+cacher6rrs rrLRUCache.cache>sJ +$$** * +&1mD   #$$** * +s9AArrcX RU'URRU5 [UR5UR:a?URR SS9 [UR5UR:aM>gg)NF)last)r move_to_endr=r,popitemrrs rrSLRUCache.__setitem__Fs^ 3 s#$**o - JJ  E  *$**o -rcZURUnURRU5 U$r4)rr)rrvals rrHLRUCache.__getitem__Ms&jjo s# rc,[UR5$r4)rVrrs rrWLRUCache.__iter__RsDJJrc,[UR5$r4)r=rrs rr>LRUCache.__len__Us4::rcXR;$r4)rrAs rrBLRUCache.__contains__Xsjj  rcgr4rrs rr~LRUCache.check_valid\s rr*r)rrr r!rr#r1r$rr r rrSrHrWr>rrBr~r&rrrrr#s *... +{1a4(+++q++t+qQ  !!d! rr)r. collectionsr dataclassesrtypingrrrhypothesis.errorsrr r rr(rrrrrrs#!((- CL CL e$GAqDM%"X=71a4=X=v \!Q$' @: wq!t}: r