B
    "ec                 @   s   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mZ dddg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eeegef dddZdS )    )deque)wraps)	AnyCallableDequeDictGenericHashableTupleTypeVarcastSimpleCacheFastDictCachememoized_T)Zbound_Uc               @   sJ   e Zd ZdZdeddddZeeg ef eddd	Z	d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.)
       N)maxsizereturnc             C   s$   |dkst i | _t | _|| _d S )Nr   )AssertionError_datar   _keysr   )selfr    r   3lib/python3.7/site-packages/prompt_toolkit/cache.py__init__   s    zSimpleCache.__init__)keygetter_funcr   c             C   sl   y
| j | S  tk
rf   | }|| j |< | j| t| j | jkrb| j }|| j krb| j |= |S X dS )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.
        N)r   KeyErrorr   appendlenr   popleft)r   r   r   valuekey_to_remover   r   r   get   s    



zSimpleCache.get)r   c             C   s   i | _ t | _dS )zClear cache.N)r   r   r   )r   r   r   r   clear5   s    zSimpleCache.clear)r   )__name__
__module____qualname____doc__intr   r   r   r   r$   r%   r   r   r   r   r      s   _K._Vc               @   s<   e Zd ZdZdedef eddddZee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 .N)	get_valuesizer   c             C   s$   |dkst t | _|| _|| _d S )Nr   )r   r   r   r.   r/   )r   r.   r/   r   r   r   r   T   s    zFastDictCache.__init__)r   r   c             C   sH   t | | jkr&| j }|| kr&| |= | j| }|| |< | j| |S )N)r    r/   r   r!   r.   r   )r   r   r#   resultr   r   r   __missing__[   s    

zFastDictCache.__missing__)r-   )
r&   r'   r(   r)   r   r,   r*   r   r+   r1   r   r   r   r   r   ?   s   
_F   )r   r   c                s   t t d fdd}|S )zI
    Memoization decorator for immutable classes and pure functions.
    )objr   c                s4   t d ttttd fdd}tt|S )N)r   )akwr   c                 s6   t d fdd} tt f}||S )N)r   c                  s
    S )Nr   r   )r5   r6   r4   r   r   
create_newu   s    zEmemoized.<locals>.decorator.<locals>.new_callable.<locals>.create_new)r   tuplesorteditemsr$   )r5   r6   r7   r   )cacher4   )r5   r6   r   new_callables   s    z1memoized.<locals>.decorator.<locals>.new_callable)r   r   r   r   r2   )r4   r<   )r   )r;   r4   r   	decoratorp   s    
zmemoized.<locals>.decorator)r2   )r   r=   r   )r   r   r   k   s    N)r3   )collectionsr   	functoolsr   typingr   r   r   r   r   r	   r
   r   r   __all__r   r   r   r+   r,   r   objectr2   r*   r   r   r   r   r   <module>   s   ,,)