File: //kunden/lib/python3/dist-packages/breezy/__pycache__/lru_cache.cpython-39.pyc
a
�*�^�- � @ sj d Z ddlmZmZ ddlmZ ddlmZmZ e � Z
G dd� de �Z G dd � d e �Z G d
d � d e �Z
d S )
z)A simple least-recently-used (LRU) cache.� )�absolute_import�division� )�trace)� viewitems�viewkeysc @ s$ e Zd ZdZdZdd� Zdd� ZdS )�_LRUNodez:This maintains the linked-list which is the lru internals.)�prev�next_key�key�valuec C s d | _ t| _|| _|| _d S �N)r � _null_keyr
r r )�selfr r � r �2/usr/lib/python3/dist-packages/breezy/lru_cache.py�__init__& s z_LRUNode.__init__c C s0 | j d u rd }n| j j}d| jj| j| j|f S )Nz%s(%r n:%r p:%r))r r � __class__�__name__r
)r Zprev_keyr r r �__repr__, s
�z_LRUNode.__repr__N)r �
__module__� __qualname__�__doc__� __slots__r r r r r r r ! s r c @ s� e Zd ZdZd$dd�Zdd� Zdd � Zd
d � Zd d
� Zdd� Z d%dd�Z
dd� Z dd� Z dd� Z
dd� Zdd� Zd d � Zd d � Zd&d d!�Zd'd"d#�ZdS )(�LRUCachez?A class which manages a cache of entries, removing unused ones.�d Nc C s" i | _ d | _d | _| �||� d S r
)�_cache�_most_recently_used�_least_recently_used�_update_max_cache�r � max_cache�after_cleanup_countr r r r 8 s zLRUCache.__init__c C s
|| j v S r
)r )r r r r r � __contains__@ s zLRUCache.__contains__c C sr | j }|| }| j}||u r"|jS |j}|j}|tu r>|| _n|| }||_||_|j|_||_|| _d |_|jS r
)r r r r r
r r r )r r �cache�nodeZmruZ node_prevr
� node_nextr r r � __getitem__C s" zLRUCache.__getitem__c C s
t | j�S r
)�lenr �r r r r �__len__b s zLRUCache.__len__c C sp |t u rtd��|| jv r6| j| }||_| �|� n t||�}|| j|< | �|� t| j�| jkrl| �� dS )� Add a new value to the cache� cannot use _null_key as a keyN) r �
ValueErrorr r �_record_accessr r( �
_max_cache�cleanup)r r r r% r r r � __setitem__e s
zLRUCache.__setitem__c C s | j S )z(Get the number of entries we will cache.)r/ r) r r r �
cache_sizev s zLRUCache.cache_sizec C s* | j �|d �}|d u r|S | �|� |jS r
)r �getr. r )r r �defaultr% r r r r3 z s
z LRUCache.getc C s t t| j��S )a Get 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.
:return: An unordered list of keys that are currently cached.
)�listr r r) r r r �keys� s
z
LRUCache.keysc C s t dd� t| j�D ��S )z9Get a new dict with the same key:value pairs as the cachec s s | ]\}}||j fV qd S r
)r )�.0�k�nr r r � <genexpr>� � z#LRUCache.as_dict.<locals>.<genexpr>)�dictr r r) r r r �as_dict� s zLRUCache.as_dictc C s t | j�| jkr| �� q dS )z�Clear 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)r( r �_after_cleanup_count� _remove_lrur) r r r r0 � s zLRUCache.cleanupc C s� | j du r|| _ || _dS || j u r(dS || ju r:|j| _|jdurN|j|j_|jturl| j|j }|j|_| j j|_|| j _|| _ d|_dS )z Record that key was accessed.N)r r r r
r r r �r r% r& r r r r. � s"
zLRUCache._record_accessc C sr || j u r|j| _ | j�|j� | j d u r0d | _|jd urD|j|j_|jturb| j|j }|j|_d |_t|_d S r
)r r r �popr r r
r r@ r r r � _remove_node� s
zLRUCache._remove_nodec C s | � | j� dS )z�Remove one entry from the lru, and handle consequences.
If there are no more references to the lru, then this entry should be
removed from the cache.
N)rB r r) r r r r? � s zLRUCache._remove_lruc C s | j r| �� q dS )zClear out all of the cache.N)r r? r) r r r �clear� s zLRUCache.clearc C s | j ||d� dS )z1Change the number of entries that will be cached.)r" N)r r r r r �resize� s �zLRUCache.resizec C s: || _ |d u r | j d d | _nt|| j �| _| �� d S �N� �
)r/ r> �minr0 r r r r r � s �zLRUCache._update_max_cache)r N)N)N)N)r r r r r r# r' r* r1 r2 r3 r6 r= r0 r. rB r? rC rD r r r r r r 5 s"
r c @ sF e Zd ZdZddd�Zdd� Zdd � Zd
d � Zdd d
�Zddd�Z dS )� LRUSizeCacheaU An LRUCache that removes things based on the size of the values.
This differs in that it doesn't care how many actual items there are,
it just restricts the cache to be cleaned up after so much data is stored.
The size of items added will be computed using compute_size(value), which
defaults to len() if not supplied.
� Nc C sH d| _ || _|du rt| _| j||d� tj| tt|d �d�d� dS )a� Create a new LRUSizeCache.
:param max_size: The max number of bytes to store before we start
clearing out entries.
:param after_cleanup_size: After cleaning up, shrink everything to this
size.
:param compute_size: A function to compute the size of the values. We
use a function here, so that you can pass 'len' if you are just
using simple strings, or a more complex function if you are using
something like a list of strings, or even a custom object.
The function should take the form "compute_size(value) => integer".
If not supplied, it defaults to 'len()'
r N��after_cleanup_size� r )r! )� _value_size�
_compute_sizer( �_update_max_sizer r �max�int)r �max_sizerL Z compute_sizer r r r � s zLRUSizeCache.__init__c C s� |t u rtd��| j�|d�}| �|�}|| jkr^t�d||| j| j� |durZ| � |� dS |du r|t
||�}|| j|< n| j | �|j �8 _ | j |7 _ | �
|� | j | jkr�| �� dS )r+ r, NzfAdding the key %r to an LRUSizeCache failed. value %d is too big to fit in a the cache with size %d %d)r r- r r3 rO �_after_cleanup_sizer Zmutter� _max_sizerB r rN r r. r0 )r r r r% Z value_lenr r r r1 s(
�
zLRUSizeCache.__setitem__c C s | j | jkr| �� q dS )z�Clear 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)rN rT r? r) r r r r0 s zLRUSizeCache.cleanupc C s& | j | �|j�8 _ t�| |� d S r
)rN rO r r rB )r r% r r r rB ) s zLRUSizeCache._remove_nodec C s. | j ||d� tt|d �d�}| �|� dS )z/Change the number of bytes that will be cached.rK rM r N)rP rQ rR r )r rS rL r! r r r rD - s zLRUSizeCache.resizec C s2 || _ |d u r | j d d | _nt|| j �| _d S rE )rU rT rH )r rS rL r r r rP 3 s z LRUSizeCache._update_max_size)rJ NN)N)N)
r r r r r r1 r0 rB rD rP r r r r rI � s �
rI N)r Z
__future__r r � r Zsixishr r �objectr r r rI r r r r �<module> s .