Cj$SrSSKJr SSKJrJrJrJrJrJ r \"S5r \"S5r \"S5r SS/r "S S\\ \ 45r"S S\\ \ 45rg ) z Cache classes are dict-like containers used to avoid recalculating expensive operations such as rendering. You can also use them in your own apps for similar reasons. ) annotations) TYPE_CHECKINGDictGenericKeysViewTypeVaroverloadCacheKey CacheValue DefaultValueLRUCache FIFOCachec8^\rSrSrSr/SQrSU4Sjjr\SSj5r\RSSj5rSSjr SSjr SS jr SS jr SS jrSS jrSS jr\r\(a\SSj5r\SSj5rSSSjjrS SjrS!SjrS"SjrSrU=r$)#r a A dictionary-like container with a maximum size. If an additional item is added when the LRUCache is full, the least recently used key is discarded to make room for the new item. The implementation is similar to functools.lru_cache, which uses a (doubly) linked list to keep track of the most recently used items. Each entry is stored as [PREV, NEXT, KEY, VALUE] where PREV is a reference to the previous entry, and NEXT is a reference to the next value. Note that stdlib's @lru_cache is implemented in C and faster! It's best to use @lru_cache where you are caching things that are fairly quick and called many times. Use LRUCache where you want increased flexibility and you are caching slow operations where the overhead of the cache is a small fraction of the total processing time. )_maxsize_cache_full_headhitsmissesct>Xl0UlSUl/UlSUlSUl[ TU]5 g)zfInitialize a LRUCache. Args: maxsize: Maximum size of the cache, before old items are discarded. FrN)rrrrrrsuper__init__)selfmaxsize __class__s _/home/rurouni/.local/share/pipx/venvs/strix-agent/lib/python3.13/site-packages/textual/cache.pyrLRUCache.__init__0s8  46  #%    cUR$)z?int: Maximum size of cache, before new values evict old values.rrs rrLRUCache.maxsize>s}}rcXlgNr!rrs rrr#Cs rc,[UR5$r%boolrr"s r__bool__LRUCache.__bool__GDKK  rc,[UR5$r%lenrr"s r__len__LRUCache.__len__J4;;rc nS[U5SURSURSURS3 $)Nz)r/rrrr"s r__repr__LRUCache.__repr__Ms9 T 9T]]O6$))T\]a]h]h\iijkkrc:[URU5Ulg)z\Grow the maximum size to at least `maxsize` elements. Args: maxsize: New maximum size. N)maxrr&s rgrow LRUCache.growPs 4<<1 rcTURR5 SUl/Ulg)Clear the cache.FN)rclearrrr"s rr?LRUCache.clearXs    rc6URR5$zGet cache keys.rkeysr"s rrD LRUCache.keys^{{!!rcURRU5cURnU(dX3X/URSS&O.USX1U/UlURUSS'URUS'URURU'UR(d#[ UR5UR :a8SUlURnUSnX4SS'USUS'URUS ggg)4Set a value. Args: key: Key. value: Value. NrT)rgetrrr/r)rkeyvalueheadlasts rset LRUCache.setcs ;;??3  '::D!%S 8 1 #1gt%8 !ZZQ **Q#zzDKK zzS- =! zzAw!Q q'QKKQ(> (rcgr%rrLs rrK LRUCache.get;>rcgr%rSrrLdefaults rrKrU),rc@URRU5=ncU=RS- slU$X0RLaBUSUSS'USUSS'URnUSUS'XCS'U=Ul=USS'US'U=RS- slUS$)Get a value from the cache, or return a default if the key is not present. Args: key: Key default: Default to return if key is not present. Returns: Either the value or a default. rIr)rrKrrr)rrLrYlinkrNs rrKrUsKKOOC( (D 1 KK1 KN zz !aDGAJaDGAJ::D1gDGG04 4DJ 4ad1g Q AwrcURRU5nURRU5=nc U=RS- sl[U5eX RLaBUSUSS'USUSS'URnUSUS'X2S'U=Ul=USS'US'U=R S- slUS$)NrIrr])rrKrKeyErrorrr)rrLr^rNs r __getitem__LRUCache.__getitem__s{{s#KKOOC( (D 1 KK1 K3-  zz !aDGAJaDGAJ::D1gDGG04 4DJ 4ad1g Q AwrcXR;$r%rrTs r __contains__LRUCache.__contains__kk!!rcXR;agURUnUSUSS'USUSS'URSU:Xa.URSUlURSU:Xa/UlURU SUlg)z;Discard item in cache from key. Args: key: Cache key. NrIrrJF)rrr)rrLr^s rdiscardLRUCache.discards kk ! {{3!WQ !WQ  ::a=C ADJzz!}# KK  r)rrrrrrrrintreturnNonermrlrmr)rmstrrmrnrmzKeysView[CacheKey]rLr rMr rmrnrLr rmzCacheValue | NonerLr rYr rmzCacheValue | DefaultValuer%rLr rYzDefaultValue | Nonermz CacheValue | DefaultValue | NonerLr rmr rLr rmr))rLr rmrn)__name__ __module__ __qualname____firstlineno____doc__ __slots__rpropertyrsetterr*r0r7r;r?rDrP __setitem__rr rKrareri__static_attributes__ __classcell__)rs@rr r s$I  ^^  ! l2 " ):K > >  , ,*6 , & ,  , =A&9 )8 "rc\rSrSrSr/SQrSSjrSSjrSSjrSSjr SSjr SS jr SS jr \ r \(a\SS j5r\SS j5rSSSjjrSSjrSSjrSrg )raA simple cache that discards the first added key when full (First In First Out). This has a lower overhead than LRUCache, but won't manage a working set as efficiently. It is most suitable for a cache with a relatively low maximum size that is not expected to do many lookups. rrrrc:Xl0UlSUlSUlg)z[Initialize a FIFOCache. Args: maxsize: Maximum size of cache before discarding items. rNrr&s rrFIFOCache.__init__s  24   rc,[UR5$r%r(r"s rr*FIFOCache.__bool__r,rc,[UR5$r%r.r"s rr0FIFOCache.__len__r2rcVSURSURSURS3$)NzN)rr?r"s rr?FIFOCache.clears rc6URR5$rBrCr"s rrDFIFOCache.keysrFrcXR;aQ[UR5UR:a.URHnURRU5 O X RU'g)rHN)rr/rpop)rrLrM first_keys rrP FIFOCache.setsQ kk !c$++&6$--&G![[   *)! Crcgr%rSrTs rrK FIFOCache.getrVrcgr%rSrXs rrKrrZrNcURUnU=RS- slU$![a U=RS- slUs$f=f)r\rIrrr`r)rrLrYresults rrKrsM [[%F IINIM   KK1 KN s(!A  A cURUnU=RS- slU$![a" U=RS- sl[U5Sef=f)NrIr)rrLrs rraFIFOCache.__getitem__/sT [[%F IINIM  * KK1 K3-T ) *s (,AcXR;$r%rdrTs rreFIFOCache.__contains__9rgr)rrrrrkrprorqrsrtrurvrwr%rxryrz)r{r|r}r~rrrr*r0r7r?rDrPrrr rKrarerrSrrrrsI !  " !K > >  , ,*6 , & ,  , =A&9 )*"rN)r __future__rtypingrrrrrr r r r __all__r rrSrrrsn#LL :  \ " ~& { #{wx+,{|h"*,-h"r