FM / __pycache_

/opt/imh-python/lib/python3.9/asyncio/__pycache__/

/opt/imh-python/lib/python3.9/asyncio/__pycache__

Name	Size	Mode	Actions
base_events.cpython-39.opt-1.pyc	51838	0644	edit dl rm
base_events.cpython-39.opt-2.pyc	42809	0644	edit dl rm
base_events.cpython-39.pyc	52033	0644	edit dl rm
base_futures.cpython-39.opt-1.pyc	1919	0644	edit dl rm
base_futures.cpython-39.opt-2.pyc	1665	0644	edit dl rm
base_futures.cpython-39.pyc	1919	0644	edit dl rm
base_subprocess.cpython-39.opt-1.pyc	9351	0644	edit dl rm
base_subprocess.cpython-39.opt-2.pyc	9251	0644	edit dl rm
base_subprocess.cpython-39.pyc	9421	0644	edit dl rm
base_tasks.cpython-39.opt-1.pyc	1955	0644	edit dl rm
base_tasks.cpython-39.opt-2.pyc	1955	0644	edit dl rm
base_tasks.cpython-39.pyc	1955	0644	edit dl rm
constants.cpython-39.opt-1.pyc	592	0644	edit dl rm
constants.cpython-39.opt-2.pyc	592	0644	edit dl rm
constants.cpython-39.pyc	592	0644	edit dl rm
coroutines.cpython-39.opt-1.pyc	6584	0644	edit dl rm
coroutines.cpython-39.opt-2.pyc	6352	0644	edit dl rm
coroutines.cpython-39.pyc	6648	0644	edit dl rm
events.cpython-39.opt-1.pyc	28030	0644	edit dl rm
events.cpython-39.opt-2.pyc	18933	0644	edit dl rm
events.cpython-39.pyc	28112	0644	edit dl rm
exceptions.cpython-39.opt-1.pyc	2564	0644	edit dl rm
exceptions.cpython-39.opt-2.pyc	1920	0644	edit dl rm
exceptions.cpython-39.pyc	2564	0644	edit dl rm
format_helpers.cpython-39.opt-1.pyc	2335	0644	edit dl rm
format_helpers.cpython-39.opt-2.pyc	2091	0644	edit dl rm
format_helpers.cpython-39.pyc	2335	0644	edit dl rm
futures.cpython-39.opt-1.pyc	11689	0644	edit dl rm
futures.cpython-39.opt-2.pyc	8183	0644	edit dl rm
futures.cpython-39.pyc	11840	0644	edit dl rm
locks.cpython-39.opt-1.pyc	14440	0644	edit dl rm
locks.cpython-39.opt-2.pyc	8202	0644	edit dl rm
locks.cpython-39.pyc	14440	0644	edit dl rm
log.cpython-39.opt-1.pyc	237	0644	edit dl rm
log.cpython-39.opt-2.pyc	198	0644	edit dl rm
log.cpython-39.pyc	237	0644	edit dl rm
proactor_events.cpython-39.opt-1.pyc	24130	0644	edit dl rm
proactor_events.cpython-39.opt-2.pyc	23730	0644	edit dl rm
proactor_events.cpython-39.pyc	24360	0644	edit dl rm
protocols.cpython-39.opt-1.pyc	8625	0644	edit dl rm
protocols.cpython-39.opt-2.pyc	3366	0644	edit dl rm
protocols.cpython-39.pyc	8625	0644	edit dl rm
queues.cpython-39.opt-1.pyc	8527	0644	edit dl rm
queues.cpython-39.opt-2.pyc	5848	0644	edit dl rm
queues.cpython-39.pyc	8527	0644	edit dl rm
runners.cpython-39.opt-1.pyc	2217	0644	edit dl rm
runners.cpython-39.opt-2.pyc	1535	0644	edit dl rm
runners.cpython-39.pyc	2217	0644	edit dl rm
selector_events.cpython-39.opt-1.pyc	29798	0644	edit dl rm
selector_events.cpython-39.opt-2.pyc	28152	0644	edit dl rm
selector_events.cpython-39.pyc	29842	0644	edit dl rm
sslproto.cpython-39.opt-1.pyc	21403	0644	edit dl rm
sslproto.cpython-39.opt-2.pyc	14600	0644	edit dl rm
sslproto.cpython-39.pyc	21567	0644	edit dl rm
staggered.cpython-39.opt-1.pyc	4018	0644	edit dl rm
staggered.cpython-39.opt-2.pyc	1885	0644	edit dl rm
staggered.cpython-39.pyc	4171	0644	edit dl rm
streams.cpython-39.opt-1.pyc	20370	0644	edit dl rm
streams.cpython-39.opt-2.pyc	14476	0644	edit dl rm
streams.cpython-39.pyc	20597	0644	edit dl rm
subprocess.cpython-39.opt-1.pyc	7331	0644	edit dl rm
subprocess.cpython-39.opt-2.pyc	7203	0644	edit dl rm
subprocess.cpython-39.pyc	7345	0644	edit dl rm
tasks.cpython-39.opt-1.pyc	24160	0644	edit dl rm
tasks.cpython-39.opt-2.pyc	16909	0644	edit dl rm
tasks.cpython-39.pyc	24200	0644	edit dl rm
threads.cpython-39.opt-1.pyc	989	0644	edit dl rm
threads.cpython-39.opt-2.pyc	523	0644	edit dl rm
threads.cpython-39.pyc	989	0644	edit dl rm
transports.cpython-39.opt-1.pyc	12243	0644	edit dl rm
transports.cpython-39.opt-2.pyc	6842	0644	edit dl rm
transports.cpython-39.pyc	12257	0644	edit dl rm
trsock.cpython-39.opt-1.pyc	8580	0644	edit dl rm
trsock.cpython-39.opt-2.pyc	8324	0644	edit dl rm
trsock.cpython-39.pyc	8580	0644	edit dl rm
unix_events.cpython-39.opt-1.pyc	41746	0644	edit dl rm
unix_events.cpython-39.opt-2.pyc	36523	0644	edit dl rm
unix_events.cpython-39.pyc	42066	0644	edit dl rm
windows_events.cpython-39.opt-1.pyc	24630	0644	edit dl rm
windows_events.cpython-39.opt-2.pyc	23523	0644	edit dl rm
windows_events.cpython-39.pyc	24646	0644	edit dl rm
windows_utils.cpython-39.opt-1.pyc	4446	0644	edit dl rm
windows_utils.cpython-39.opt-2.pyc	4012	0644	edit dl rm
windows_utils.cpython-39.pyc	4514	0644	edit dl rm
__init__.cpython-39.opt-1.pyc	790	0644	edit dl rm
__init__.cpython-39.opt-2.pyc	734	0644	edit dl rm
__init__.cpython-39.pyc	790	0644	edit dl rm
__main__.cpython-39.opt-1.pyc	3179	0644	edit dl rm
__main__.cpython-39.opt-2.pyc	3179	0644	edit dl rm
__main__.cpython-39.pyc	3179	0644	edit dl rm

Edit: /opt/imh-python/lib/python3.9/asyncio/__pycache__/queues.cpython-39.pyc (8527B)

a b�hY �@s�dZddlZddlZddlZddlmZddlmZGdd�de�ZGdd �d e�Z Gd d�d�Z Gdd �d e �ZGdd�de �ZdS))�Queue� PriorityQueue� LifoQueue� QueueFull� QueueEmpty�N�)�events)�locksc@seZdZdZdS)rz;Raised when Queue.get_nowait() is called on an empty Queue.N��__name__� __module__�__qualname__�__doc__�rr�//opt/imh-python/lib/python3.9/asyncio/queues.pyrsrc@seZdZdZdS)rzDRaised when the Queue.put_nowait() method is called on a full Queue.Nr rrrrrsrc@s�eZdZdZd+dd�dd�Zdd�Zd d �Zdd�Zd d�Zdd�Z dd�Z dd�Zdd�Zdd�Z edd��Zdd�Zdd�Zdd �Zd!d"�Zd#d$�Zd%d&�Zd'd(�Zd)d*�ZdS),raA 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��loopcCsp|durt��|_n||_tjdtdd�||_t��|_ t��|_ d|_tj |d�|_|j��|�|�dS)Nz[The loop argument is deprecated since Python 3.8, and scheduled for removal in Python 3.10.�)� stacklevelrr)rZget_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"6szQueue._initcCs |j��Sr&)r'�popleft�r#rrr�_get9sz Queue._getcCs|j�|�dSr&�r'�append�r#�itemrrr�_put<sz Queue._putcCs&|r"|��}|��s|�d�q"qdSr&)r)�done� set_result)r#�waiters�waiterrrr�_wakeup_nextAs zQueue._wakeup_nextcCs(dt|�j�dt|�d�d|��d�S)N�)�typer�id�_formatr*rrr�__repr__IszQueue.__repr__cCsdt|�j�d|��d�S)Nr6r7r8)r9rr;r*rrr�__str__Lsz Queue.__str__cCs|Sr&r)�clsr9rrr�__class_getitem__OszQueue.__class_getitem__cCs~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;Rsz Queue._formatcCs t|j�S)zNumber of items in the queue.)rCr'r*rrr�qsize^szQueue.qsizecCs|jS)z%Number of items allowed in the queue.)rr*rrrr$bsz Queue.maxsizecCs|jS)z3Return True if the queue is empty, False otherwise.�r'r*rrr�emptygszQueue.emptycCs |jdkrdS|��|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)rrEr*rrr�fullks z Queue.fullc�s�|��r�|j��}|j�|�z|IdHWq|��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)rHr� create_futurerr-�cancel�remove� ValueError� cancelledr5� put_nowait)r#r/Zputterrrr�putvs z Queue.putcCs>|��rt�|�|�|jd7_|j��|�|j�dS)zyPut an item into the queue without blocking. If no free slot is immediately available, raise QueueFull. rN)rHrr0rr �clearr5rr.rrrrN�s zQueue.put_nowaitc�s�|��r�|j��}|j�|�z|IdHWq|��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)rGrrIrr-rJrKrLrMr5� get_nowait)r#�getterrrr�get�s z Queue.getcCs$|��rt�|��}|�|j�|S)z�Remove and return an item from the queue. Return an item if one is immediately available, else raise QueueEmpty. )rGrr+r5rr.rrrrQ�s zQueue.get_nowaitcCs8|jdkrtd��|jd8_|jdkr4|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)rrLr r!r*rrr� task_done�s zQueue.task_donec�s|jdkr|j��IdHdS)aBlock 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)rrr rr%r"r+r0r5r<r=r?r;rE�propertyr$rGrHrOrNrSrQrTrVrrrrrs* rc@s4eZdZdZdd�Zejfdd�Zejfdd�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&rFr(rrrr"�szPriorityQueue._initcCs||j|�dSr&rF)r#r/�heappushrrrr0�szPriorityQueue._putcCs ||j�Sr&rF)r#�heappoprrrr+�szPriorityQueue._getN) rrr rr"�heapqrXr0rYr+rrrrr�src@s(eZdZdZdd�Zdd�Zdd�ZdS) rzEA subclass of Queue that retrieves most recently added entries first.cCs g|_dSr&rFr(rrrr"�szLifoQueue._initcCs|j�|�dSr&r,r.rrrr0�szLifoQueue._putcCs |j��Sr&)r'�popr*rrrr+�szLifoQueue._getN)rrr rr"r0r+rrrrr�sr) �__all__rrZr�rr � Exceptionrrrrrrrrr�sN