+ }i%`^RIHt^RIt^RIt^RIt^RIHtHt^RIH t ^RI H t H t H t HtHtHt^RIHtHtHt.ROt!R R]4t!R R 4t]P0!RR44t!RR 4t]P0!RR44t!RR 4t!RR4t!RR4tR#)) annotationsN) OrderedDictdeque) ContextVar)CallableDequeDictOptionalProtocolUnion)Domain PartialResultResolverCacheCachingResolverLruS3FifoSievecn]tRt^tRt]P RRl4t]P RRl4tRt R#)rzCache() Cache abstract protocol. The :class:`CachingResolver` will look values up, merge what was returned (possibly nothing) with what it got from its actual parser, and *re-set the result*. c$V^8dQhRRRRRR/#keystrvaluerreturnNone)formats"c/Users/ahmad/.openclaw/workspace/my-crawler/.venv/lib/python3.14/site-packages/ua_parser/caching.py __annotate__Cache.__annotate__%s!  s = T c R#)z6Adds or replace ``value`` to the cache at key ``key``.Nrselfrrs&&&r __setitem__Cache.__setitem__$ r#c V^8dQhRRRR/#rrrrzOptional[PartialResult]r)rs"r r!r"*s  s '> r#c R#)z5Returns a partial result for ``key`` if there is any.Nrr&rs&&r __getitem__Cache.__getitem__)r)r#rN) __name__ __module__ __qualname____firstlineno____doc__abcabstractmethodr'r.__static_attributes__rr#r rrs;      r#c>]tRt^/tRtRRltRRltRRltRtR #) raCache following a least-recently used replacement policy: when there is no more room in the cache, whichever entry was last seen the least recently is removed. Simple LRUs are generally outdated and to avoid as they have relatively low hit rates for modern caches (at lower sizes). The main use case here is if the workload can lead to the cache being full of popular items then all of them being replaced at once: :class:`S3Fifo` and :class:`Sieve` are FIFO-based caches and have worst-case O(n) eviction. cV^8dQhRR/#rmaxsizeintr)rs"r r!Lru.__annotate__<s%%%r#c dWn\4Vn\P!4VnR#N)r;rcache threadingLocklockr&r;s&&r __init__ Lru.__init__<s 6Am NN$ r#c V^8dQhRRRR/#r+r)rs"r r!r=Ass'>r#c VP;_uu_4VPPV4pV'dVPPV4VuuRRR4# +'giR#;ir?)rCr@get move_to_endr&res&& r r.Lru.__getitem__AsA YYY s#A &&s+ YYYs AA  A1 c$V^8dQhRRRRRR/#rr)rs"r r!r=Hs!$$s$=$T$r#c $VP;_uu_4\VP4VP8d-WP9dVPP RR7W PV&RRR4R# +'giR#;i)F)lastN)rClenr@r;popitemr%s&&&r r'Lru.__setitem__HsT YYY4::$,,.3jj3H """.#JJsOYYYs AA>> B )r@rCr;N) r0r1r2r3r4rEr.r'r7rr#r rr/s % $$r#c>]tRt^Ot$.R OtR]R&R]R&R]R&RtR#) CacheEntryfreqrrrrr<rN)rVrrr0r1r2r3 __slots____annotations__r7rr#r rUrUOs(I H  Ir#rUcV]tRt^WtRtRRltRRltRRltRR ltR R lt R t R #)ra.FIFO-based quick-demotion lazy-promotion cache [S3-FIFO]_. Experimentally provides excellent hit rate at lower cache sizes, for a relatively simple and efficient implementation. Notably excellent at handling "one hit wonders", aka entries seen only once during a work-set (or reasonable work window). cV^8dQhRR/#r:r)rs"r r!S3Fifo.__annotate__`s%%%r#c Wn/Vn\^\V^ , 44Vn\ 4VnWP, Vn\ 4Vn\ 4Vn \P!4Vn R#N) r;indexmaxr< small_targetrsmall main_targetmainghostrArBrCrDs&&r rES3Fifo.__init__`s` 8: 3w|#45(- "%6%66',w !& NN$ r#c V^8dQhRRRR/#r+r)rs"r r!r\jss'>r#c VPPV4;p'dB\V4\Jd/\ VP ^,^4VnVP #R#r^)r`rItyperUminrVrrKs&& r r.S3Fifo.__getitem__jsG$ $A $$q'Z*?!Q'AF77Nr#c$V^8dQhRRRRRR/#)rrrrrrrr)rs"r r!r\rs!$$s$}$$r#c pVP;_uu_4VPPV4;p'd%\V4\JdW#nRRR4R#\ VP4\ VP4,VP8d\ VP4VP8dVP4\ VP4\ VP4,VP8dVP4\ W^4p\VPPV44\JdVPPV4MVPPV4W@PV&RRR4R# +'giR#;ir?)rCr`rIrjrUrrQrcrer;rd _evict_small _evict_mainr appendleft)r&rrnrLentrys&&& r r'S3Fifo.__setitem__rs YYYZZ^^C(((d1g.CY 4::TYY/4<<?tyy>D$4$44%%'tzz?S^3t||C$$&sq)EDJJNN3'(C/ $$U+ %%e,#JJsO'YYYs>F$D=F$$ F5 cV^8dQhRR/#rrrr)rs"r r!r\sTr#c VPP4pVP'd7V;P^,unVPPV4KcVPVP R#TN)repoprVrrr`r)r&rLs& r rqS3Fifo._evict_mainsO Avvv!  $$Q'JJquu%r#cV^8dQhRR/#rvr)rs"r r!r\s  d r#c *VP'EdVPP4pVP'd%^VnVPP V4KcVP ;q P VP &VPP V4\VP4VP8dKVPP4pVP PV4VJgK_VP VKnR#R#)rN) rcryrVrerrrr`rfrQrdrI)r&rLgs& r rpS3Fifo._evict_smallsjjj  Avvv $$Q'()-JJquu% %%a($**o(8(88 (Azz~~a(A- JJqMr#)rfr`rCrerdr;rcrbN) r0r1r2r3r4rEr.r'rqrpr7rr#r rrWs%%$,  r#cD]tRt^t$R tR]R&R]R&R]R&R]R&R tR #) SieveNodernextrvisitedrrboolzOptional[SieveNode]rN)rrrrrWrr#r rrs3I H  M r#rcJ]tRt^tRtRRltRRltRRltRR ltR t R #) raFIFO-based quick-demotion cache [SIEVE]_. Simpler FIFO-based cache, cousin of :class:`S3Fifo`. Experimentally slightly lower hit rates than :class:`S3Fifo` (if way superior to LRU still), but much more compact (~50% lower memory overhead at larger cache sizes, up to 100% at very small cache sizes). Can be an interesting candidate when trying to save on memory, although the contained entries will generally be much larger than the cache itself. c V^8dQhRRRR/#)rr;r<rrr)rs"r r!Sieve.__annotate__s%%%%r#c Wn/VnRVnRVnRVnRVn\ P!4VnR#r?) r;r@headtailhandprevrArBrCrDs&&r rESieve.__init__s8 +- )- )- )- )- NN$ r#c V^8dQhRRRR/#r+r)rs"r r!rss'>r#c rVPPV4;p'dRVnVP#R#rx)r@rIrr)r&rrss&& r r.Sieve.__getitem__s.JJNN3' '5 ' EM;; r#c$V^8dQhRRRRRR/#rr)rs"r r!rs!!!s!=!T!r#c VP;_uu_4VPPV4;p'dW#nRRR4R#\ VP4VP 8dVP 4\WRR4;q@PV&VP'dW@Pn W@nVPfW@n RRR4R# +'giR#;iNF) rCr@rIrrQr;_evictrrrr)r&rrrLnodes&&& r r'Sieve.__setitem__s YYYJJNN3''q'Y 4::$,,. %.s5$%G GD::c?yyy!% Iyy  YYYs+C B C C0 cV^8dQhRR/#rvr)rs"r r!rs!!!r#c VP'dVPVPr!M VPRr!V'dJVP'd8RVnVP'dVPTr!KBVPRr!KQV'gR#VPVnW nVP VP VP'gW nV'dVPVnR#VPVnR#r)rrrrrr@rr)r&objpobjs& r r Sieve._evicts 999 499 4ckkkCKxxxHHcT IItT HH  JJsww xxxI DIDIr#)r@rrrCr;rrN) r0r1r2r3r4rEr.r'rr7rr#r rrs  %! !!r#cT]tRt^tRtRRlt]RRl4tRRltRR lt R t R #) LocalaLThread local cache decorator. Takes a cache factory and lazily instantiates a cache for each thread it's accessed from. This means the cache capacity and memory consumption is figuratively multiplied by however many threads the cache is used from, but those threads don't share their caching, and thus don't contend on cache use. c V^8dQhRRRR/#)rfactoryzCallable[[], Cache]rrr)rs"r r!Local.__annotate__s 3r#c 2\R4VnWnR#)z local-cacheN)rcvr)r&rs&&r rELocal.__init__s%/ %> r#cV^8dQhRR/#)rrrr)rs"r r!rsur#c VPPR4pVf,VP4pVPPV4V#r?)rrIrset)r&cs& r r@ Local.caches8 GGKK  9 A GGKKNr#c V^8dQhRRRR/#r+r)rs"r r!rss'>r#c (VPV,#r?r@r-s&&r r.Local.__getitem__szz#r#c$V^8dQhRRRRRR/#rr)rs"r r!rs!  s = T r#c "W PV&R#r?rr%s&&&r r'Local.__setitem__s  3r#)rrN) r0r1r2r3r4rEpropertyr@r.r'r7rr#r rrs/  r#rc2]tRtRtRtRRltRRltRtR#) riaA wrapper resolver which takes an underlying concrete :class:`Cache` for the actual caching and cache strategy. This resolver only interacts with the :class:`Cache` and delegates to the wrapped resolver in case of lookup failure. :class:`CachingParser` will set entries back in the cache when filling them up, it does not update results in place (and can't really, they're immutable). c V^8dQhRRRR/#)rresolverrr@rr)rs"r r!CachingResolver.__annotate__"s"""%"r#c WnW nR#r?)parserr@)r&rr@s&&&r rECachingResolver.__init__"s ( ! r#c$V^8dQhRRRRRR/#)ruardomainsr rrr)rs"r r!r&s!3}r#c VPV,pV'd&W#P9dV#W#P(,pVPW4pV'd\TVPVP,VP;'g VPVP ;'g VP VP ;'g VP R7pW@PV&V#))stringr user_agentosdevice)r@rrrrrr)r&rrrsrns""" r __call__CachingResolver.__call__&s 2 --'  ~ %G KK $   1 ++;;q||88##qtt||//qxx A 2r#)r@rN)r0r1r2r3r4rErr7rr#r rrs "r#)rrrrr) __future__rr5 dataclassesrA collectionsrr contextvarsrtypingrrr r r r corer rr__all__rr dataclassrUrrrrrrr#r rs" *"21  H &$$@ HHV I!I!X  <##r#