Server : LiteSpeed System : Linux barito.iixcp.rumahweb.net 5.14.0-611.49.1.el9_7.x86_64 #1 SMP PREEMPT_DYNAMIC Tue Apr 21 16:39:08 EDT 2026 x86_64 User : elvh3918 ( 1528) PHP Version : 8.2.31 Disable Function : mail Directory : /usr/local/lib/python3.9/site-packages/kombu/utils/__pycache__/ |
a
��Sh�) � @ sJ d Z ddlmZ ddlZddlZddlZddlmZmZ ddl m
Z
m Z ddl m
Z
mZ ddlmZmZ ddlmZ d d
lmZ d Ze� ZG d d
� d
�ZG dd� de�Zddefdd�ZG dd� d�Z dd� Z e e fe
ffdd�Z e e ffdd�Z d2dd�Z!d d � Z"d3d d!�Z#d4d#d$�Z$d5d'd(�Z%d6d+d,�Z&d7d.d/�Z'd0d1� Z(e Z)e Z*dS )8zFunctional Utilities.� )� annotationsN)� OrderedDict�UserDict)�Iterable�Mapping)�count�repeat)�sleep�time)�wraps� )� safe_repr)�LRUCache�memoize�lazy�maybe_evaluate�is_list�
maybe_list�
dictfilter�retry_over_timec @ s$ e Zd Zdd� Zdd� Zdd� ZdS )�ChannelPromisec C s
|| _ d S �N)� __contract__)�selfZcontract� r �@/usr/local/lib/python3.9/site-packages/kombu/utils/functional.py�__init__ s zChannelPromise.__init__c C s2 z| j W S ty, | �� }| _ | Y S 0 d S r )� __value__�AttributeErrorr )r �valuer r r �__call__ s
zChannelPromise.__call__c C s8 z t | j�W S ty2 dt| j�d�d� Y S 0 d S )Nz <promise: 0x�x�>)�reprr r �idr �r r r r �__repr__% s zChannelPromise.__repr__N)�__name__�
__module__� __qualname__r r r& r r r r r s r c @ s� e Zd ZdZd dd�Zdd� Zdd� Zd d
d �Zd d
� Zdd� Z dd� Z
e
Z dd� Z e Z
dd� ZeZd dd�Zdd� Zdd � ZeZe Ze
ZdS ) r aM LRU Cache implementation using a doubly linked list to track access.
Arguments:
---------
limit (int): The maximum number of keys to keep in the cache.
When a new key is inserted and the limit has been exceeded,
the *Least Recently Used* key will be discarded from the
cache.
Nc C s || _ t�� | _t� | _d S r )�limit� threading�RLock�mutexr �data)r r* r r r r 7 s
zLRUCache.__init__c C sB | j �( | j�|� }| |< |W d � S 1 s40 Y d S r )r- r. �pop�r �keyr r r r � __getitem__< s zLRUCache.__getitem__c O sz | j �` | j| j }}|j|i |�� |rXt|�|krXtt|�| �D ]}|jdd� qFW d � n1 sl0 Y d S )NF)�last)r- r. r* �update�len�range�popitem)r �args�kwargsr. r* �_r r r r4 A s zLRUCache.updateTc C s6 | j � | j�|�W d � S 1 s(0 Y d S r )r- r. r7 )r r3 r r r r7 J s zLRUCache.popitemc C s` | j �F | jr4t| j�| jkr4| j�tt| j��� || j|< W d � n1 sR0 Y d S r )r- r* r5 r. r/ �next�iterr0 r r r � __setitem__N s zLRUCache.__setitem__c C s
t | j�S r )r< r. r% r r r �__iter__U s zLRUCache.__iter__c
c s\ | j �B | D ],}z|| j| fV W q ty6 Y q 0 q W d � n1 sN0 Y d S r �r- r. �KeyError�r �kr r r �_iterate_itemsX s zLRUCache._iterate_itemsc
c sX | j �> | D ](}z| j| V W q ty2 Y q 0 q W d � n1 sJ0 Y d S r r? rA r r r �_iterate_valuesa s zLRUCache._iterate_valuesc C s4 | j � | j�� W d � S 1 s&0 Y d S r )r- r. �keysr% r r r �
_iterate_keysk s zLRUCache._iterate_keysr c C sN | j �4 t| j�|��| }t|�| |< |W d � S 1 s@0 Y d S r )r- �intr. r/ �str)r r1 �deltaZnewvalr r r �incrq s z
LRUCache.incrc C s t t| ��}|�d� |S )Nr- )�dict�varsr/ )r �dr r r � __getstate__y s
zLRUCache.__getstate__c C s || _ t�� | _d S r )�__dict__r+ r, r- )r �stater r r � __setstate__~ s zLRUCache.__setstate__)N)T)r )r' r( r) �__doc__r r2 r4 r7 r= r> rC � iteritemsrD �
itervaluesrF �iterkeysrJ rN rQ rE �values�itemsr r r r r , s&
r c s � ��fdd�}|S )z)Decorator to cache function return value.c sX t �� ���d��t��� ����fdd��� � �fdd�}d � _� _|� _�� _� S )N)r* c s� �r�| |�}n| t f tt|�� �� }z0�� �| }W d � n1 sN0 Y W nZ ty� �| i |��}� jd7 _�� |�|< W d � n1 s�0 Y Y n0 � jd7 _|S )Nr )� KEYWORD_MARK�tuple�sortedrW r@ �misses�hits)r8 r9 r1 r )�_M�cache�fun�keyfunr- r r r] � s * ,z%memoize.<locals>._memoize.<locals>._Mc s �� � d � _� _dS )z+Clear the cache and reset cache statistics.r N)�clearr\ r[ r )r] r^ r r ra � s z(memoize.<locals>._memoize.<locals>.clearr )r+ �Lockr r\ r[ ra Z
original_func)r_ ra ��Cacher` �maxsize)r] r^ r_ r- r �_memoize� s
zmemoize.<locals>._memoizer )re r` rd rf r rc r r � s r c @ sX e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dS )r a
Holds lazy evaluation.
Evaluated when called or if the :meth:`evaluate` method is called.
The function is re-evaluated on every call.
Overloaded operations that will evaluate the promise:
:meth:`__str__`, :meth:`__repr__`, :meth:`__cmp__`.
c O s || _ || _|| _d S r ��_fun�_args�_kwargs)r r_ r8 r9 r r r r � s z
lazy.__init__c C s | � � S r )�evaluater% r r r r � s z
lazy.__call__c C s | j | ji | j��S r rg r% r r r rk � s z
lazy.evaluatec C s
t | � �S r )rH r% r r r �__str__� s z lazy.__str__c C s
t | � �S r )r# r% r r r r& � s z
lazy.__repr__c C s
| � |kS r r �r �rhsr r r �__eq__� s z lazy.__eq__c C s
| � |kS r r rm r r r �__ne__� s z lazy.__ne__c C s | |t | �< | S r )r$ )r �memor r r � __deepcopy__� s zlazy.__deepcopy__c C s | j | jf| j| jd�fS )N)ri rj )� __class__rh ri rj r% r r r �
__reduce__� s �zlazy.__reduce__N)
r' r( r) rR r r rk rl r& ro rp rr rt r r r r r � s r c C s t | t�r| �� S | S )z9Evaluate value only if value is a :class:`lazy` instance.)�
isinstancer rk )r r r r r � s
r c C s t | |�ot | |pd� S )zwReturn true if the object is iterable.
Note:
----
Returns false if object is a mapping or string.
r )ru )�obj�scalarsZitersr r r r � s r c C s | du st | |�r| S | gS )z0Return list of one element if ``l`` is a scalar.N)r )rv rw r r r r � s r c K s6 | du r |n|r t | fi |��n| } dd� | �� D �S )z=Remove all keys from dict ``d`` whose value is :const:`None`.Nc S s i | ]\}}|d ur||�qS r r ��.0rB �vr r r �
<dictcomp>� � z dictfilter.<locals>.<dictcomp>)rK rW )rM �kwr r r r � s $r c c s2 t | �} tj}td �D ]}|| � | d V qd S )Nr )�list�random�shuffler )�itr� r: r r r � shufflecycle� s
r� � �?Fc c s: | d }|r||kr$|V ||7 }q|s*q6|| V qd S )Nr� r )�start�stop�step�
repeatlast�curr r r �fxrange� s
r� � Y@c c sH d| d }}||krqD|V |r2t || |�}n||7 }||7 }qd S )Nr r� )�min)r� r� r� �maxZsum_r� r r r �
fxrangemax s r� � � c C s |si n|}|sg n|}t ||| |dd�} |
r:t� |
nd} t� D ]�}
z| |i |��W S |�y } z�|dur�|
|kr�� | r�t� | kr�� | r�| � t|r�||| |
�nt| ��}|r�tt|��D ]}| r�| � td� q�ttt|�| �� W Y d}~qDd}~0 0 qDdS )a Retry the function over and over until max retries is exceeded.
For each retry we sleep a for a while before we try again, this interval
is increased for every retry until the max seconds is reached.
Arguments:
---------
fun (Callable): The function to try
catch (Tuple[BaseException]): Exceptions to catch, can be either
tuple or a single exception class.
Keyword Arguments:
-----------------
args (Tuple): Positional arguments passed on to the function.
kwargs (Dict): Keyword arguments passed on to the function.
errback (Callable): Callback for when an exception in ``catch``
is raised. The callback must take three arguments:
``exc``, ``interval_range`` and ``retries``, where ``exc``
is the exception instance, ``interval_range`` is an iterator
which return the time in seconds to sleep next, and ``retries``
is the number of previous retries.
max_retries (int): Maximum number of retries before we give up.
If neither of this and timeout is set, we will retry forever.
If one of this and timeout is reached, stop.
interval_start (float): How long (in seconds) we start sleeping
between retries.
interval_step (float): By how much the interval is increased for
each retry.
interval_max (float): Maximum number of seconds to sleep
between retries.
timeout (int): Maximum seconds waiting before we give up.
T)r� Nr� ) r� r
r �floatr; r6 rG r �abs)r_ Zcatchr8 r9 Zerrback� max_retriesZinterval_startZ
interval_stepZ interval_max�callback�timeoutZinterval_range�end�retries�excZttsr: r r r r s4 # �
�
r �, �{0}={1}c s |� � fdd�| �� D ��S )Nc 3 s" | ]\}}� � |t|��V qd S r )�format�
_safe_reprrx ��fmtr r � <genexpr>R r| z reprkwargs.<locals>.<genexpr>)�joinrW )r9 �sepr� r r� r �
reprkwargsQ s r� r c C s> |si n|}d� | |�tt|p d��|r0|r0|p2dt||��S )Nz
{}({}{}{})r � )r� r� �mapr� r� )�namer8 r9 r� r r r �reprcallU s �r� c C s t �| �}||jv p ||jv S r )�inspect�getfullargspecr8 �
kwonlyargs)�func�
argument_nameZ
argument_specr r r �accepts_argument^ s
�r� )N)r� Nr� F)r� Nr� r� ) NNNNr� r� r� NN)r� r� )r Nr� )+rR �
__future__r r� r r+ � collectionsr r �collections.abcr r � itertoolsr r r
r Z
vine.utilsr �encodingr
r� �__all__�objectrX r r r r r rH r r r r� r� r� r r� r� r� ZpromiseZ
maybe_promiser r r r �<module> s@ [%*
�
>