File: //kunden/lib/python3/dist-packages/dulwich/__pycache__/lru_cache.cpython-39.pyc
a
�~�_8 � @ s> d Z e� ZG dd� de�ZG dd� de�ZG dd� de�ZdS )z)A simple least-recently-used (LRU) cache.c @ s. e Zd ZdZdZd
dd�Zdd� Zdd � ZdS ) �_LRUNodez:This maintains the linked-list which is the lru internals.)�prev�next_key�key�value�cleanup�sizeNc C s( d | _ t| _|| _|| _|| _d | _d S �N)r � _null_keyr r r r r )�selfr r r � r �3/usr/lib/python3/dist-packages/dulwich/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__c C s* | j d ur| � | j| j� d | _ d | _d S r )r r r �r
r r r � run_cleanup2 s
z_LRUNode.run_cleanup)N)r �
__module__� __qualname__�__doc__� __slots__r
r r r r r r r s
r c @ s� e Zd ZdZd(dd�Zdd� Zdd � Zd
d � Zd d
� Zd)dd�Z dd� Z
d*dd�Z dd� Z dd� Z
dd� Zdd� Zd d � Zd d � 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
= s zLRUCache.__init__c C s
|| j v S r )r )r
r r r r � __contains__E 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__H s" zLRUCache.__getitem__c C s
t | j�S r )�lenr r r r r �__len__g s zLRUCache.__len__c c s� | j }|dur&|jdur&td|f ��|dur�|jtu rV|| jurPtd|f ��d}n$| j|j }|j|urztd|f ��|jdu r�|| j ur�td|f ��n |jj|jkr�td|f ��|V |}q&dS )z2Walk the LRU list, only meant to be used in tests.NzIthe _most_recently_used entry is not supposed to have a previous entry %sz0only the last node should have no next value: %sz/inconsistency found, node.next.prev != node: %sz@only the _most_recently_used should not have a previous node: %sz/inconsistency found, node.prev.next != node: %s)r r �AssertionErrorr r r r r �r
r" r# r r r � _walk_lruj s:
�
�
�
��zLRUCache._walk_lruc C sx |t u rtd��|| jv r:| j| }|�� ||_||_nt|||d�}|| j|< | �|� t| j�| j krt| �� dS )�] 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 key�r N)
r �
ValueErrorr r r r r �_record_accessr% �
_max_cache)r
r r r r" r r r �add� s
z LRUCache.addc C s | j S )z(Get the number of entries we will cache.)r/ r r r r �
cache_size� s zLRUCache.cache_sizec C s* | j �|d �}|d u r|S | �|� |jS r )r �getr. r )r
r �defaultr" r r r r2 � s
z LRUCache.getc C s
| 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.
Returns: An unordered list of keys that are currently cached.
)r �keysr r r r r4 � s z
LRUCache.keysc C s t dd� | j�� D ��S )z"Get the key:value pairs as a dict.c s s | ]\}}||j fV qd S r )r )�.0�k�nr r r � <genexpr>� � z!LRUCache.items.<locals>.<genexpr>)�dictr �itemsr r r r r; � s zLRUCache.itemsc 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 r � s zLRUCache.cleanupc C s | j ||dd� dS )z<Add a value to the cache, there will be no cleanup function.Nr, )r0 )r
r r r r r � __setitem__� s zLRUCache.__setitem__c 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. � s"
zLRUCache._record_accessc C sz || j u r|j| _ | j�|j� | j d u r0d | _|�� |jd urL|j|j_|jturj| j|j }|j|_d |_t|_d S r ) r r r �popr r 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)r@ 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< �minr r r r r r s �zLRUCache._update_max_cache)r N)N)N)N)N)r r r r r
r r$ r& r) r0 r1 r2 r4 r; r r> r. r@ r= rA rB r r r r r r : s&
r c @ sH e Zd ZdZddd�Zddd�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.
Args:
max_size: The max number of bytes to store before we start
clearing out entries.
after_cleanup_size: After cleaning up, shrink everything to this
size.
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()'
� N��after_cleanup_size� � )r )� _value_size�
_compute_sizer% �_update_max_sizer r
�max�int)r
�max_sizerK Z compute_sizer r r r
s zLRUSizeCache.__init__c C s� |t u rtd��| j�|d�}| �|�}|| jkrZ|durD| �|� |durV|||� dS |du r|t|||d�}|| j|< n| j|j 8 _||_ | j|7 _| �
|� | j| j kr�| � � dS )r* r+ Nr, )
r r- r r2 rO �_after_cleanup_sizer@ r rN r r. � _max_sizer )r
r r r r" Z value_lenr r r r0 7 s&
zLRUSizeCache.addc 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 r ] s zLRUSizeCache.cleanupc C s | j |j8 _ t�| |� d S r )rN r r r@ )r
r" r r r r@ g s zLRUSizeCache._remove_nodec C s. | j ||d� tt|d �d�}| �|� dS )z/Change the number of bytes that will be cached.rJ rL rM N)rP rQ rR r )r
rS rK r r r r rB k s zLRUSizeCache.resizec C s2 || _ |d u r | j d d | _nt|| j �| _d S rC )rU rT rF )r
rS rK r r r rP q s z LRUSizeCache._update_max_size)rH NN)N)N)N)
r r r r r
r0 r r@ rB rP r r r r rG s �
&
rG N)r �objectr r r rG r r r r �<module> s
]