o
    w¨Êhï  ã                   @  sØ   d dl mZ d dlmZ d dlmZ d dlmZmZm	Z	m
Z
mZmZmZmZ g d¢Zeded�ZedƒZG d	d
„ d
e
eef ƒZedeedf d�ZedƒZG dd„ de	eef ƒZededef d�Zdddd„ZdS )é    )Úannotations)Údeque)Úwraps)ÚAnyÚCallableÚDictÚGenericÚHashableÚTupleÚTypeVarÚcast)ÚSimpleCacheÚFastDictCacheÚmemoizedÚ_T)ÚboundÚ_Uc                   @  s0   e Zd ZdZdddd„Zddd„Zddd„ZdS )r   z§
    Very simple cache that discards the oldest item when the cache size is
    exceeded.

    :param maxsize: Maximum size of the cache. (Don't make it too big.)
    é   ÚmaxsizeÚintÚreturnÚNonec                 C  s$   |dksJ ‚i | _ tƒ | _|| _d S ©Nr   )Ú_datar   Ú_keysr   )Úselfr   © r   úF/var/www/html/env/lib/python3.10/site-packages/prompt_toolkit/cache.pyÚ__init__   s   
zSimpleCache.__init__Úkeyr   Úgetter_funcúCallable[[], _U]r   c                 C  sl   z| j | W S  ty5   |ƒ }|| j |< | j |¡ t| j ƒ| jkr1| j ¡ }|| j v r1| j |= | Y S w )zš
        Get object from the cache.
        If not found, call `getter_func` to resolve it, and put that on the top
        of the cache instead.
        )r   ÚKeyErrorr   ÚappendÚlenr   Úpopleft)r   r   r    ÚvalueÚkey_to_remover   r   r   Úget    s   


ôzSimpleCache.getc                 C  s   i | _ tƒ | _dS )zClear cache.N)r   r   r   )r   r   r   r   Úclear7   s   zSimpleCache.clearN)r   )r   r   r   r   )r   r   r    r!   r   r   )r   r   )Ú__name__Ú
__module__Ú__qualname__Ú__doc__r   r(   r)   r   r   r   r   r      s
    
r   Ú_K.Ú_Vc                   @  s&   e Zd ZdZddd	d
„Zddd„ZdS )r   a¿  
    Fast, lightweight cache which keeps at most `size` items.
    It will discard the oldest items in the cache first.

    The cache is a dictionary, which doesn't keep track of access counts.
    It is perfect to cache little immutable objects which are not expensive to
    create, but where a dictionary lookup is still much faster than an object
    instantiation.

    :param get_value: Callable that's called in case of a missing key.
    é@B Ú	get_valueúCallable[..., _V]Úsizer   r   r   c                 C  s$   |dksJ ‚t ƒ | _|| _|| _d S r   )r   r   r1   r3   )r   r1   r3   r   r   r   r   V   s   
zFastDictCache.__init__r   r.   r/   c                 C  sH   t | ƒ| jkr| j ¡ }|| v r| |= | j|Ž }|| |< | j |¡ |S ©N)r$   r3   r   r%   r1   r#   )r   r   r'   Úresultr   r   r   Ú__missing__]   s   

zFastDictCache.__missing__N)r0   )r1   r2   r3   r   r   r   )r   r.   r   r/   )r*   r+   r,   r-   r   r6   r   r   r   r   r   A   s    r   Ú_Fé   r   r   r   úCallable[[_F], _F]c                   s   d‡ fdd„}|S )zI
    Memoization decorator for immutable classes and pure functions.
    Úobjr7   r   c                   s,   t ˆd�‰ tˆƒd‡ ‡fdd„ƒ}tt|ƒS )	N©r   Úar   Úkwr   c                    s2   d‡ ‡‡fdd„}ˆ t tˆ ¡ ƒƒf}ˆ ||¡S )Nr   r   c                     s   ˆˆ i ˆ¤ŽS r4   r   r   )r<   r=   r:   r   r   Ú
create_neww   s   zEmemoized.<locals>.decorator.<locals>.new_callable.<locals>.create_new)r   r   )ÚtupleÚsortedÚitemsr(   )r<   r=   r>   r   ©Úcacher:   )r<   r=   r   Únew_callableu   s   z1memoized.<locals>.decorator.<locals>.new_callable)r<   r   r=   r   r   r   )r   r   r   r7   )r:   rD   r;   rB   r   Ú	decoratorr   s   

zmemoized.<locals>.decoratorN)r:   r7   r   r7   r   )r   rE   r   r;   r   r   m   s   r   N)r8   )r   r   r   r9   )Ú
__future__r   Úcollectionsr   Ú	functoolsr   Útypingr   r   r   r   r	   r
   r   r   Ú__all__r   r   r   r.   r/   r   Úobjectr7   r   r   r   r   r   Ú<module>   s    (,)