o U hZ=@sdZddlmZmZddlmZmZmZmZe Z edZ edZ Gdddee e fZ Gdd d ee e fZGd d d ee e fZd S) z)A simple least-recently-used (LRU) cache.)IterableIterator)CallableGenericOptionalTypeVarKVc@sfeZdZUdZdZeded<eed<eeed<dded e d dfd d Z d e fd dZ dddZ dS)_LRUNodez:This maintains the linked-list which is the lru internals.)cleanupkeynext_keyprevsizevaluez_LRUNode[K, V]rr rNr rreturncCs(d|_t|_||_||_||_d|_dSN)r _null_keyr r rr r)selfr rr re/var/www/html/construction_image-detection-poc/venv/lib/python3.10/site-packages/dulwich/lru_cache.py__init__,s  z_LRUNode.__init__cCs<|jdurd}n|jj}|jjd|jd|jd|dS)N(z n:z p:))rr __class____name__r )rprev_keyrrr__repr__7s $z_LRUNode.__repr__cCs(|jdur ||j|jd|_|`dSr)r r rrrrr run_cleanup>s z_LRUNode.run_cleanuprrN)r __module__ __qualname____doc__ __slots__r__annotations__rintr rstrrrrrrrr #s    r c @seZdZUdZeeeefed<eeeefed< d2de dee ddfd d Z d ede fd d Z d edefddZ de fddZdeeeeffddZ d3d ededeeeegdfddfddZde fddZd3d edeedeefddZdeefddZdeeeffdd Zd4d!d"Zd ededdfd#d$Zd%eeefddfd&d'Zd%eeefddfd(d)Zd4d*d+Zd4d,d-Zd3de dee ddfd.d/Zd3d4d0d1Z dS)5LRUCachez?A class which manages a cache of entries, removing unused ones._least_recently_used_most_recently_useddN max_cacheafter_cleanup_countrcCs"i|_d|_d|_|||dSr)_cacher*r)_update_max_cacherr,r-rrrrLszLRUCache.__init__r cCs ||jvSr)r.)rr rrr __contains__V zLRUCache.__contains__cCs|j}||}|j}||ur|jS|j}|j}|tur||_n||}||_|s*J|s.J||_|j|_||_||_d|_|jSr)r.r*rrr rr)r )rr cachenodemru node_prevr node_nextrrr __getitem__Ys&zLRUCache.__getitem__cCs t|jSr)lenr.rrrr__len__zr2zLRUCache.__len__ccs|j}|dur|jdurtd||duri|jtur,||jur)td|d}n|j|j}|j|ur>td||jdurP||jurOtd|n|jj|jkr^td||V|}|dusdSdS)z2Walk the LRU list, only meant to be used in tests.NzGthe _most_recently_used entry is not supposed to have a previous entry z.only the last node should have no next value: z-inconsistency found, node.next.prev != node: z>only the _most_recently_used should not have a previous node: z-inconsistency found, node.prev.next != node: )r*rAssertionErrorr rr)r.r rr4r7rrr _walk_lru}sH       zLRUCache._walk_lrurr cCs||turtd||jvr|j|}|||_||_n t|||d}||j|<||t|j|j kr<|dSdS)]Add a new value to the cache. Also, if the entry is ever removed from the cache, call cleanup(key, value). Args: key: The key to store it under value: The object to store cleanup: None or a function taking (key, value) to indicate 'value' should be cleaned up. cannot use _null_key as a keyr N) r ValueErrorr.rrr r _record_accessr9 _max_cache)rr rr r4rrradds     z LRUCache.addcCs|jS)z(Get the number of entries we will cache.)rCrrrr cache_sizeszLRUCache.cache_sizedefaultcCs*|j|d}|dur |S|||jSr)r.getrBr)rr rFr4rrrrGs  z LRUCache.getcCs |jS)aGet the list of keys currently cached. Note that values returned here may not be available by the time you request them later. This is simply meant as a peak into the current state. Returns: An unordered list of keys that are currently cached. )r.keysrrrrrHs z LRUCache.keyscCsdd|jDS)z"Get the key:value pairs as a dict.cSsi|]\}}||jqSr)r).0knrrr sz"LRUCache.items..)r.itemsrrrrrMzLRUCache.itemscCs0t|j|jkr|t|j|jksdSdS)zClear the cache until it shrinks to the requested size. This does not completely wipe the cache, just makes sure it is under the after_cleanup_count. N)r9r._after_cleanup_count _remove_lrurrrrr szLRUCache.cleanupcCs|j||dddS)z integer". If not supplied, it defaults to 'len()' rNr`)r,) _value_sizer9r]_update_max_sizer(rmaxr&)rr_r`rarrrr<s  zLRUSizeCache.__init__r rr cCs|turtd|j|d}||}||jkr-|dur"|||dur+|||dS|dur>t|||d}||j|<n|jdusEJ|j |j8_ ||_|j |7_ | ||j |j krh| dSdS)r>r?Nr@) rrAr.rGr]_after_cleanup_sizerSr rrerB _max_sizer )rr rr r4 value_lenrrrrDXs*        zLRUSizeCache.addcCs(|j|jkr||j|jksdSdS)zClear the cache until it shrinks to the requested size. This does not completely wipe the cache, just makes sure it is under the after_cleanup_size. N)rerhrPrrrrr s zLRUSizeCache.cleanupr4cCs.|jdusJ|j|j8_t||dSr)rrer(rS)rr4rrrrSszLRUSizeCache._remove_nodecCs.|j||dtt|dd}||dS)z/Change the number of bytes that will be cached.rbrcrdN)rfrgr&r/)rr_r`r,rrrrUszLRUSizeCache.resizecCs4||_|dur|jdd|_dSt||j|_dSrV)rirhrY)rr_r`rrrrfszLRUSizeCache._update_max_size)r^NNrr )rr!r"r#rr r&r%rrrrDr r rSrUrfrrrrr\0sH    ) r\N)r#collections.abcrrtypingrrrrobjectrrr r r(r\rrrrs#k