| Server IP : 217.160.0.135 / Your IP : 216.73.217.85 Web Server : Apache System : Linux www 6.18.52-i1-ampere #1203 SMP Mon Sep 14 18:29:59 CEST 2026 aarch64 User : sws1074145052 ( 1074145052) PHP Version : 8.3.32 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : OFF | Sudo : OFF | Pkexec : OFF Directory : /usr/lib/python3/dist-packages/prompt_toolkit/__pycache__/ |
Upload File : |
�
�Ïc� � �h � d dl mZ d dlmZ d dlmZmZmZmZm Z m
Z
m Z m Z m
Z
g d�Z e de
�� � Z e d� � Z G d� d e eef � � Z e d
e e
d f �� � Z e d � � Z G d
� deeef � � Z e ded ef �� � Zddedeegef fd�ZdS )� )�deque)�wraps) �Any�Callable�Deque�Dict�Generic�Hashable�Tuple�TypeVar�cast)� SimpleCache�
FastDictCache�memoized�_T)�bound�_Uc �P � e Zd ZdZd deddfd�Zdedeg ef defd �Z d d
�Z
dS )
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�returnNc �X � |dk sJ �i | _ t � � | _ || _ d S �Nr )�_datar �_keysr )�selfr s �6/usr/lib/python3/dist-packages/prompt_toolkit/cache.py�__init__zSimpleCache.__init__ s, � ���{�{�{�{�#%��
� %����
� #�� � � � �key� getter_funcc �, � | j | S # t $ rz |� � }|| j |< | j � |� � t | j � � | j k r*| j � � � }|| j v r| j |= |cY S w xY 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_removes r �getzSimpleCache.get s� � � ��:�c�?� "��� � � � �K�M�M�E� #�D�J�s�O� �J� � �c� "� "� "� �4�:���� �-�-� $�
� 2� 2� 4� 4�
� �D�J�.�.� �
�=�1��L�L�L� ���s � �BB�Bc �: � i | _ t � � | _ dS )z Clear cache.N)r r r )r s r �clearzSimpleCache.clear5 s � ���
��W�W��
�
�
r )r )r N) �__name__�
__module__� __qualname__�__doc__�intr r r r r) r+ � r r r r s� � � � � � �� �$� $�� $�D� $� $� $� $��r� ���R��(8� �R� � � � �. � � � � � r r �_K.�_Vc �H � e Zd ZdZd dedef deddfd�Zd edefd
�Z dS ) 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.�sizer Nc �X � |dk sJ �t � � | _ || _ || _ d S r )r r r6 r7 )r r6 r7 s r r zFastDictCache.__init__T s, � ��a�x�x�x�x� %����
�"����� � � r r c �� � t | � � | j k r | j � � � }|| v r| |= | j |� }|| |< | j � |� � |S �N)r% r7 r r& r6 r$ )r r r( �results r � __missing__zFastDictCache.__missing__[ sm � � �t�9�9�t�y� � � �J� .� .� 0� 0�M� ��$�$�� �'� �� ��%����S� � �
���#� � � ��
r )r5 )
r, r- r. r/ r r3 r0 r r2 r< r1 r r r r ? sw � � � � � �
�
�(� �(�3��7�"3� �3� �T� � � � �
�r�
�b�
�
�
�
�
�
r r �_F� r r c �0 � � dt dt f� fd� }|S )zI
Memoization decorator for immutable classes and pure functions.
�objr c � �� �� t ��� � �t � � � dt dt dt f�� fd� � � }t t |� � S )N)r �a�kwr c � �� �� dt f� ��fd� }� t t �� � � � � � � f}�� ||� � S )Nr c � �� �� i ���S r: r1 )rB rC r@ s ���r �
create_newzEmemoized.<locals>.decorator.<locals>.new_callable.<locals>.create_newu s �� ��s�A�}��}�}�$r )r �tuple�sorted�itemsr) )rB rC rF r �cacher@ s `` ��r � new_callablez1memoized.<locals>.decorator.<locals>.new_callables sl ���� �
%��
%�
%�
%�
%�
%�
%�
%�
%� �e�F�2�8�8�:�:� .� .�/�/�0�C��9�9�S�*�-�-� -r )r r r r
r= )r@ rK rJ r s ` @�r � decoratorzmemoized.<locals>.decoratorp so ���� �,7��,H�,H�,H�� �s��� .�S� .�� .�� .� .� .� .� .� .�
�� .� �B� �%�%�%r )r= )r rL s ` r r r k s7 �� �
&�r� &�b� &� &� &� &� &� &� �r N)r> )� collectionsr � functoolsr �typingr r r r r r
r r r
�__all__r r r r2 r3 r �objectr= r0 r r1 r r �<module>rR s� �� � � � � � � � � � � � � V� V� V� V� V� V� V� V� V� V� V� V� V� V� V� V� V� V� V� V� V� V� � � ��
�W�T��"�"�"�� �W�T�]�]��) � ) � ) � ) � ) �'�"�b�&�/� ) � ) � ) �X
�W�T��x��}�-�.�.�.�� �W�T�]�]��&� &� &� &� &�D��R��L� &� &� &�R
�W�T��#�v�+�.�/�/�/��� �c� �X�r�d�B�h�%7� � � � � � r