✘✘ GRAYBYTE WORDPRESS FILE MANAGER ✘✘

a

�iq �@s�dZd
dl
Z
d
dlZd
dlZd
dlmZ
ddlmZ
ddlmZ
Gdd�de	�Z
Gd	d
�d
e	�ZGdd�d�ZGd
d�de�Z
Gdd�de�ZdS))�Queue�
PriorityQueue�	LifoQueue�	QueueFull�
QueueEmpty�N)
�GenericAlias�
)
�events)
�locksc
@seZ
dZd
ZdS)rz;Raised when Queue.get_nowait() is called on an empty Queue.N��__name__�
__module__�__qualname__�__doc__�rr�&/usr/lib64/python3.9/asyncio/queues.pyrs

rc
@seZ
dZd
ZdS)rzDRaised when the Queue.put_nowait() method is called on a full Queue.Nrrrrrrs

rc@s�eZ
dZd
Zd)dd�
dd�Zdd�Zd	d
�Zdd�Zd
d�Zdd�Z	dd�Z
ee�
Z
dd�Zdd�Zedd��
Zdd�Zdd�Zdd�Zdd �Zd!d"�Zd#d$�Zd%d&�Zd'd(�ZdS)*r
aA queue, useful for coordinating producer and consumer coroutines.

    If maxsize is less than or equal to zero, the queue size is infinite. If it
    is an integer greater than 0, then "await put()" will block when the
    queue reaches maxsize, until an item is removed by get().

    Unlike the standard library Queue, you can reliably know this Queue's size
    with qsize(), since your single-threaded asyncio application won't be
    interrupted between calling qsize() and doing an operation on the Queue.
    rN�
�loopc
Csp|durt�
�|_n||_tjd
tdd�
|
|_t��|_	t��|_
d|_tj
|d�
|_|j��
|�|
�

dS)Nz[The loop argument is deprecated since Python 3.8, and scheduled for removal in Python 3.10.�)
�
stacklevelrr)r	Zget_event_loop�_loop�warnings�warn�DeprecationWarning�_maxsize�collections�deque�_getters�_putters�_unfinished_tasksr
�Event�	_finished�set�_init)�self�maxsizerrrr�__init__"s


�






zQueue.__init__cCst�
�|_dS�
N)rr�_queue�r$r%rrrr#7s
zQueue._initc

Cs
|j�
�Sr')r(�popleft�
r$rrr�_get:s
z
Queue._getcCs|j�
|
�

dSr'�r(�append�r$�itemrrr�_put=s
z
Queue._putcCs&|
r"|
��}|�
�s|�d�

q"qdSr')r*�done�
set_result)r$�waiters�waiterrrr�_wakeup_nextBs





zQueue._wakeup_nextc

Cs(d
t|�
j
�dt|�
d�d|���d�S)N�
<z at z#x�
 �
>)�typer�id�_formatr+rrr�__repr__Js
zQueue.__repr__c

Csd
t|�
j
�d|���d�S)Nr7r8r9)r:rr<r+rrr�__str__Ms
z
Queue.__str__c
Cs~d
|j��}
t
|dd�r,|
dt|j�
��7}
|jrH|
dt|j�
�d�7}
|jrd|
dt|j�
�d�7}
|jrz|
d|j��7}
|
S)Nzmaxsize=r(z _queue=z
 _getters[�
]z
 _putters[z tasks=)r�getattr�listr(r�lenrr)r$�resultrrrr<Rs









z
Queue._formatc

Cs
t|j
�
S)
zNumber of items in the queue.)rBr(r+rrr�qsize^szQueue.qsizec


Cs|jS)
z%Number of items allowed in the queue.)
rr+rrrr%bsz
Queue.maxsizec


Cs|jS)
z3Return True if the queue is empty, False otherwise.�
r(r+rrr�emptygszQueue.emptyc

Cs |jd
k
rdS|�
�|jkSdS)z�Return True if there are maxsize items in the queue.

        Note: if the Queue was initialized with maxsize=0 (the default),
        then full() is never True.
        rFN)rrDr+rrr�fullks

z
Queue.fullc�s�|��r�|j
��}|j�|�

z|Id
H
Wq


|��
z|j�|�

Wnty^


Yn0|��s||��s||�	|j�

�Yq0q|�
|
�
S)z�Put an item into the queue.

        Put an item into the queue. If the queue is full, wait until a free
        slot is available before adding item.
        N)rGr�
create_futurerr.�cancel�remove�
ValueError�	cancelledr6�
put_nowait)r$r0Zputterrrr�putvs












z	Queue.putcCs>|��rt
�
|�|
�

|jd
7_|j��
|�|j�

dS)zyPut an item into the queue without blocking.

        If no free slot is immediately available, raise QueueFull.
        rN)rGrr1rr!�clearr6rr/rrrrM�s






zQueue.put_nowaitc
�s�|��r�|j
��}
|j�|
�

z|
Id
H
Wq


|
��
z|j�|
�

Wnty^


Yn0|��s||
��s||�	|j�

�Yq0q|�
�S)zoRemove and return an item from the queue.

        If queue is empty, wait until an item is available.
        N)rFrrHrr.rIrJrKrLr6�
get_nowait)r$�getterrrr�get�s












z	Queue.getc
Cs$|��rt
�
|��}
|�|j�

|
S)
z�Remove and return an item from the queue.

        Return an item if one is immediately available, else raise QueueEmpty.
        )rFrr,r6rr/rrrrP�s




zQueue.get_nowaitc

Cs8|jd
k
rt
d�
�
|jd8_|jd
kr4|j��
dS)a$Indicate that a formerly enqueued task is complete.

        Used by queue consumers. For each get() used to fetch a task,
        a subsequent call to task_done() tells the queue that the processing
        on the task is complete.

        If a join() is currently blocking, it will resume when all items have
        been processed (meaning that a task_done() call was received for every
        item that had been put() into the queue).

        Raises ValueError if called more times than there were items placed in
        the queue.
        rz!task_done() called too many timesrN)rrKr!r"r+rrr�	task_done�s






zQueue.task_donec

�s|jd
kr|j
��IdH
dS)a
Block until all items in the queue have been gotten and processed.

        The count of unfinished tasks goes up whenever an item is added to the
        queue. The count goes down whenever a consumer calls task_done() to
        indicate that the item was retrieved and all work on it is complete.
        When the count of unfinished tasks drops to zero, join() unblocks.
        rN)rr!�waitr+rrr�join�s

z
Queue.join)
r)rr
rrr&r#r,r1r6r=r>�classmethodr�__class_getitem__r<rD�propertyr%rFrGrNrMrRrPrSrUrrrrr
s*


r
c@s4eZ
dZd
Zdd�Zejf
dd�
Zejf
dd�
Z	dS)	rz�A subclass of Queue; retrieves entries in priority order (lowest first).

    Entries are typically tuples of the form: (priority number, data).
    cCs
g|_dSr'rEr)rrrr#�s
zPriorityQueue._initcCs||j|
�
dSr'rE)r$r0�heappushrrrr1�s
zPriorityQueue._putcCs
|
|j�
Sr'rE)r$�heappoprrrr,�s
zPriorityQueue._getN)
rr
rrr#�heapqrYr1rZr,rrrrr�s
rc@s(eZ
dZd
Zdd�Zdd�Zdd�ZdS)	rzEA subclass of Queue that retrieves most recently added entries first.cCs
g|_dSr'rEr)rrrr#�s
zLifoQueue._initcCs|j�
|
�

dSr'r-r/rrrr1�s
zLifoQueue._putc

Cs
|j�
�Sr')r(�popr+rrrr,�s
zLifoQueue._getN)rr
rrr#r1r,rrrrr�s
r)�__all__rr[r�typesr�r	r
�	Exceptionrrr
rrrrrr�<module>
s



M