o .d@sFdZddlZddlmZddlmZddlmZGdddejZdS)aBA simple LRU Cache implementation. Copied from https://github.com/pallets/jinja/blob/master/src/jinja2/utils.py BSD-3-Clause License Copyright 2007 Pallets Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. N)abc)deque)Lockc@seZdZdZdefddZddZddZd d Zd d Z d dZ d.de de fddZ d.ddZddZddZddZddZddZd d!Zd"d#Zd$d%Zd&d'Zd(d)Zd*d+Zd,d-Ze ZdS)/LRUCachez"A simple LRU Cache implementation.capacitycCs ||_i|_t|_|dSN)r_mappingr_queue _postinit)selfrr J/var/www/Matress/matenv/lib/python3.10/site-packages/liquid/utils/cache.py__init__/s zLRUCache.__init__cCs4|jj|_|jj|_|jj|_t|_|jj |_ dSr) r popleft_popleftpop_popremove_remover_wlockappend_appendr r r r r 5s   zLRUCache._postinitcCs|j|j|jdS)Nrrr rrr r r __getstate__=szLRUCache.__getstate__cCs|j||dSr)__dict__updater )r dr r r __setstate__Ds  zLRUCache.__setstate__cCs|jfSr)rrr r r __getnewargs__HszLRUCache.__getnewargs__cCs,||j}|j|j|j|j|S)z&Return a shallow copy of the instance.) __class__rrrr extend)r rvr r r copyKs z LRUCache.copyNkeydefaultcCs"z||WSty|YSw)z0Return an item from the cache dict or `default`.KeyErrorr r$r%r r r getRs   z LRUCache.getcCs*z||WSty|||<|YSw)zvSet `default` if the key is not in the cache otherwise leave unchanged. Return the value of this key. r&r(r r r setdefaultYs   zLRUCache.setdefaultcCs<|jz|j|jW|jdS|jw)zClear the cache.N)racquirerclearr releaserr r r r,cs   zLRUCache.clearcCs ||jvS)z$Check if a key exists in this cache.rr r$r r r __contains__l zLRUCache.__contains__cCs t|jS)z%Return the current size of the cache.)lenrrr r r __len__pr1zLRUCache.__len__cCsd|jjd|jdS)N< >)r __name__rrr r r __repr__tszLRUCache.__repr__cCs~|jz3|j|}|jd|kr1tt ||Wdn1s'wY|||W|j S|j w)zGet an item from the cache. Moves the item up so that it has the highest priority then. Raise a `KeyError` if it does not exist. N) rr+rr contextlibsuppress ValueErrorrrr-)r r$r"r r r __getitem__ws     zLRUCache.__getitem__cCsn|jz+||jvr||nt|j|jkr|j|=||||j|<W|jdS|jw)ziSets the value for an item. Moves the item up so that it has the highest priority then. N) rr+rrr2rrrr-)r r$valuer r r __setitem__s      zLRUCache.__setitem__cCst|jz.|j|=tt ||Wdn1swYW|jdSW|jdS|jw)z^Remove an item from the cache dict. Raise a `KeyError` if it does not exist. N)rr+rr:r;r<rr-r/r r r __delitem__s   zLRUCache.__delitem__cs$fddtjD}||S)zReturn a list of items.csg|] }|j|fqSr r.).0r$rr r sz"LRUCache.items..)listr reverse)r resultr rr itemsszLRUCache.itemscCsdd|DS)zReturn a list of all values.cSsg|]}|dqS)r )rAxr r r rBsz#LRUCache.values..)rFrr r r valuesszLRUCache.valuescCst|S)z7Return a list of all keys ordered by most recent usage.)rCrr r r keyssz LRUCache.keyscCtt|jSr)reversedtupler rr r r __iter__szLRUCache.__iter__cCrK)zCIterate over the keys in the cache dict, oldest items coming first.)iterrMr rr r r __reversed__szLRUCache.__reversed__r)r7 __module__ __qualname____doc__intrr rrrr#strobjectr)r*r,r0r3r8r=r?r@rFrIrJrNrP__copy__r r r r r(s.    r) rSr: collectionsrr threadingrMutableMappingrr r r r s !