⚝
One Hat Cyber Team
⚝
Your IP:
3.145.43.112
Server IP:
97.74.87.16
Server:
Linux 16.87.74.97.host.secureserver.net 5.14.0-503.38.1.el9_5.x86_64 #1 SMP PREEMPT_DYNAMIC Fri Apr 18 08:52:10 EDT 2025 x86_64
Server Software:
Apache
PHP Version:
8.2.28
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
lib64
/
python3.9
/
asyncio
/
__pycache__
/
View File Name :
queues.cpython-39.opt-1.pyc
a �DOgq � @ s� d Z ddlZddlZddlZddlmZ ddlmZ ddlmZ G dd� de �Z G d d � d e �Z G d d � d �Z G d d� de �Z G dd� de �ZdS ))�Queue� PriorityQueue� LifoQueue� QueueFull� QueueEmpty� N)� GenericAlias� )�events)�locksc @ s e Zd ZdZdS )r z;Raised when Queue.get_nowait() is called on an empty Queue.N��__name__� __module__� __qualname__�__doc__� r r �&/usr/lib64/python3.9/asyncio/queues.pyr s r c @ s e Zd ZdZdS )r zDRaised when the Queue.put_nowait() method is called on a full Queue.Nr r r r r r s r c @ s� e Zd ZdZd)dd�dd�Zdd� Zd d � Zd d � Zd d� Zdd� Z dd� Z e e �Z dd� Zdd� Zedd� �Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� ZdS )*r a A 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. r N��loopc C sp |d u rt �� | _n|| _tjdtdd� || _t�� | _ t�� | _ d| _ t j |d�| _| j�� | �|� d S )Nz[The loop argument is deprecated since Python 3.8, and scheduled for removal in Python 3.10.� )� stacklevelr r )r Zget_event_loop�_loop�warnings�warn�DeprecationWarning�_maxsize� collections�deque�_getters�_putters�_unfinished_tasksr �Event� _finished�set�_init)�self�maxsizer r r r �__init__" s � zQueue.__init__c C s t �� | _d S �N)r r �_queue�r$ r% r r r r# 7 s z Queue._initc C s | j �� S r' )r( �popleft�r$ r r r �_get: s z Queue._getc C s | j �|� d S r' �r( �append�r$ �itemr r r �_put= s z Queue._putc C s& |r"|� � }|�� s |�d � q"q d S r' )r* �done� set_result)r$ �waiters�waiterr r r � _wakeup_nextB s zQueue._wakeup_nextc C s( dt | �j� dt| �d�d| �� � d�S )N�<z at z#x� �>)�typer �id�_formatr+ r r r �__repr__J s zQueue.__repr__c C s dt | �j� d| �� � d�S )Nr7 r8 r9 )r: r r< r+ r r r �__str__M s z Queue.__str__c C s~ 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 �lenr r )r$ �resultr r r r< R s z Queue._formatc C s t | j�S )z Number of items in the queue.)rB r( r+ r r r �qsize^ s z Queue.qsizec C s | j S )z%Number of items allowed in the queue.)r r+ r r r r% b s z Queue.maxsizec C s | j S )z3Return True if the queue is empty, False otherwise.�r( r+ r r r �emptyg s z Queue.emptyc C s | j dkrdS | �� | j kS dS )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. r FN)r rD r+ r r r �fullk s z Queue.fullc � s� | � � r�| j�� }| j�|� z|I dH W q |�� z| j�|� W n ty^ Y n0 | � � s||�� s|| � | j� � Y q 0 q | � |�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) rG r � create_futurer r. �cancel�remove� ValueError� cancelledr6 � put_nowait)r$ r0 Zputterr r r �putv s z Queue.putc C s> | � � r t�| �|� | jd7 _| j�� | �| j� dS )zyPut an item into the queue without blocking. If no free slot is immediately available, raise QueueFull. r N)rG r r1 r r! �clearr6 r r/ r r r rM � s zQueue.put_nowaitc � s� | � � r�| j�� }| j�|� z|I dH W q |�� z| j�|� W n ty^ Y n0 | � � s||�� s|| � | j� � Y q 0 q | � � S )zoRemove and return an item from the queue. If queue is empty, wait until an item is available. N) rF r rH r r. rI rJ rK rL r6 � get_nowait)r$ �getterr r r �get� s z Queue.getc C s$ | � � r t�| �� }| �| j� |S )z�Remove and return an item from the queue. Return an item if one is immediately available, else raise QueueEmpty. )rF r r, r6 r r/ r r r rP � s zQueue.get_nowaitc C s8 | j dkrtd��| j d8 _ | j dkr4| 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. r z!task_done() called too many timesr N)r rK r! r" r+ r r r � task_done� s zQueue.task_donec � s | j dkr| j�� I dH 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. r N)r r! �waitr+ r r r �join� s z Queue.join)r )r r r r r& r# r, r1 r6 r= r> � classmethodr �__class_getitem__r< rD �propertyr% rF rG rN rM rR rP rS rU r r r r r s* r c @ s4 e Zd ZdZdd� Zejfdd�Zejfdd�Z dS ) r z�A subclass of Queue; retrieves entries in priority order (lowest first). Entries are typically tuples of the form: (priority number, data). c C s g | _ d S r' rE r) r r r r# � s zPriorityQueue._initc C s || j |� d S r' rE )r$ r0 �heappushr r r r1 � s zPriorityQueue._putc C s || j �S r' rE )r$ �heappopr r r r, � s zPriorityQueue._getN) r r r r r# �heapqrY r1 rZ r, r r r r r � s r c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) r zEA subclass of Queue that retrieves most recently added entries first.c C s g | _ d S r' rE r) r r r r# � s zLifoQueue._initc C s | j �|� d S r' r- r/ r r r r1 � s zLifoQueue._putc C s | j �� S r' )r( �popr+ r r r r, � s zLifoQueue._getN)r r r r r# r1 r, r r r r r � s r )�__all__r r[ r �typesr � r r � Exceptionr r r r r r r r r �<module> s M