File manager - Edit - /opt/saltstack/salt/lib/python3.10/site-packages/salt/ext/tornado/__pycache__/queues.cpython-310.pyc
Back
o ;j�( � @ s� d Z ddlmZmZmZ ddlZddlZddlmZm Z ddl m Z ddl m Z g d�ZG dd � d e�ZG d d � d e�Zd d � ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZdS )a/ Asynchronous queues for coroutines. .. warning:: Unlike the standard library's `queue` module, the classes defined here are *not* thread-safe. To use these queues from another thread, use `.IOLoop.add_callback` to transfer control to the `.IOLoop` thread before calling any queue methods. � )�absolute_import�division�print_functionN)�gen�ioloop)�Future)�Event)�Queue� PriorityQueue� LifoQueue� QueueFull� QueueEmptyc @ � e Zd ZdZdS )r z:Raised by `.Queue.get_nowait` when the queue has no items.N��__name__� __module__� __qualname__�__doc__� r r �K/opt/saltstack/salt/lib/python3.10/site-packages/salt/ext/tornado/queues.pyr & � r c @ r )r zBRaised by `.Queue.put_nowait` when a queue is at its maximum size.Nr r r r r r + r r c sB |r � fdd�}t j�� ���||��� ���fdd�� d S d S )Nc s � � t�� � d S �N)Z set_exceptionr � TimeoutErrorr )�futurer r � on_timeout2 � z _set_timeout.<locals>.on_timeoutc s � � ��S r )Zremove_timeout)�_)�io_loop�timeout_handler r �<lambda>7 s z _set_timeout.<locals>.<lambda>)r ZIOLoop�currentZ add_timeoutZadd_done_callback)r �timeoutr r )r r r r � _set_timeout0 s ��r" c @ s e Zd Zdd� Zdd� ZdS )�_QueueIteratorc C s || _ d S r )�q)�selfr$ r r r �__init__; � z_QueueIterator.__init__c C � | j �� S r )r$ �get�r% r r r � __anext__> r' z_QueueIterator.__anext__N)r r r r& r+ r r r r r# : s r# c @ s� e Zd ZdZd,dd�Zedd� �Zdd� Zd d � Zd d � Z d-dd�Z dd� Z d-dd�Z dd� Z dd� Zd-dd�Zdd� Zd d � Zd d � Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd(d)� Zd*d+� Zd S ).r a� Coordinate producer and consumer coroutines. If maxsize is 0 (the default) the queue size is unbounded. .. testcode:: from salt.ext.tornado import gen from salt.ext.tornado.ioloop import IOLoop from salt.ext.tornado.queues import Queue q = Queue(maxsize=2) @gen.coroutine def consumer(): while True: item = yield q.get() try: print('Doing work on %s' % item) yield gen.sleep(0.01) finally: q.task_done() @gen.coroutine def producer(): for item in range(5): yield q.put(item) print('Put %s' % item) @gen.coroutine def main(): # Start consumer without waiting (since it never finishes). IOLoop.current().spawn_callback(consumer) yield producer() # Wait for producer to put all tasks. yield q.join() # Wait for consumer to finish all tasks. print('Done') IOLoop.current().run_sync(main) .. testoutput:: Put 0 Put 1 Doing work on 0 Put 2 Doing work on 1 Put 3 Doing work on 2 Put 4 Doing work on 3 Doing work on 4 Done In Python 3.5, `Queue` implements the async iterator protocol, so ``consumer()`` could be rewritten as:: async def consumer(): async for item in q: try: print('Doing work on %s' % item) yield gen.sleep(0.01) finally: q.task_done() .. versionchanged:: 4.3 Added ``async for`` support in Python 3.5. r c C sb |d u rt d��|dk rtd��|| _| �� t�g �| _t�g �| _d| _t � | _ | j � � d S )Nzmaxsize can't be Noner zmaxsize can't be negative) � TypeError� ValueError�_maxsize�_init� collections�deque�_getters�_putters�_unfinished_tasksr � _finished�set)r% �maxsizer r r r& � s zQueue.__init__c C s | j S )z%Number of items allowed in the queue.)r. r* r r r r7 � s z Queue.maxsizec C s t | j�S )z Number of items in the queue.)�len�_queuer* r r r �qsize� s z Queue.qsizec C s | j S r �r9 r* r r r �empty� � z Queue.emptyc C s | j dkrdS | �� | j kS )Nr F)r7 r: r* r r r �full� s z Queue.fullNc C sJ z | � |� W tjS ty$ t� }| j�||f� t||� | Y S w )z�Put an item into the queue, perhaps waiting until there is room. Returns a Future, which raises `tornado.gen.TimeoutError` after a timeout. )� put_nowaitr r r3 �appendr" r Z _null_future)r% �itemr! r r r r �put� s � �z Queue.putc C s^ | � � | jr"| �� sJ d��| j�� }| �|� |�| �� � dS | �� r(t�| �|� dS )z{Put an item into the queue without blocking. If no free slot is immediately available, raise `QueueFull`. z)queue non-empty, why are getters waiting?N) �_consume_expiredr2 r< �popleft�_Queue__put_internal� set_result�_getr> r )r% rA �getterr r r r? � s zQueue.put_nowaitc C sF t � }z |�| �� � W |S ty" | j�|� t||� Y |S w )z�Remove and return an item from the queue. Returns a Future which resolves once an item is available, or raises `tornado.gen.TimeoutError` after a timeout. )r rF � get_nowaitr r2 r@ r" )r% r! r r r r r) � s � �z Queue.getc C s\ | � � | jr$| �� sJ d��| j�� \}}| �|� |�d� | �� S | �� r,| �� S t�)z�Remove and return an item from the queue without blocking. Return an item if one is immediately available, else raise `QueueEmpty`. z(queue not full, why are putters waiting?N) rC r3 r> rD rE rF rG r: r )r% rA Zputterr r r rI � s zQueue.get_nowaitc C s< | j dkr td��| j d8 _ | j dkr | j�� dS 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 blocking, it resumes when all items have been processed; that is, when every `.put` is matched by a `.task_done`. Raises `ValueError` if called more times than `.put`. r z!task_done() called too many times� N)r4 r- r5 r6 r* r r r � task_done� s �zQueue.task_donec C s | j �|�S )z�Block until all items in the queue are processed. Returns a Future, which raises `tornado.gen.TimeoutError` after a timeout. )r5 �wait)r% r! r r r �join� s z Queue.joinc C s t | �S r )r# r* r r r � __aiter__ r= zQueue.__aiter__c C s t �� | _d S r )r0 r1 r9 r* r r r r/ s z Queue._initc C r( r )r9 rD r* r r r rG r' z Queue._getc C � | j �|� d S r �r9 r@ �r% rA r r r �_put � z Queue._putc C s& | j d7 _ | j�� | �|� d S )NrJ )r4 r5 �clearrR rQ r r r Z__put_internal s zQueue.__put_internalc C s| | j r | j d d �� r | j �� | j r | j d d �� s | jr8| jd �� r<| j�� | jr:| jd �� s'd S d S d S d S )Nr rJ )r3 ZdonerD r2 r* r r r rC s � $�zQueue._consume_expiredc C s dt | �jtt| ��| �� f S )Nz <%s at %s %s>)�typer �hex�id�_formatr* r r r �__repr__ s �zQueue.__repr__c C s dt | �j| �� f S )Nz<%s %s>)rU r rX r* r r r �__str__ s z Queue.__str__c C sn d| j f }t| dd �r|d| j 7 }| jr |dt| j� 7 }| jr+|dt| j� 7 }| jr5|d| j 7 }|S )Nz maxsize=%rr9 z queue=%rz getters[%s]z putters[%s]z tasks=%s)r7 �getattrr9 r2 r8 r3 r4 )r% �resultr r r rX # s z Queue._format)r r )r r r r r& �propertyr7 r: r< r> rB r? r) rI rK rM rN r/ rG rR rE rC rY rZ rX r r r r r B s. C r c @ �( e Zd ZdZdd� Zdd� Zdd� ZdS ) r aL A `.Queue` that retrieves entries in priority order, lowest first. Entries are typically tuples like ``(priority number, data)``. .. testcode:: from salt.ext.tornado.queues import PriorityQueue q = PriorityQueue() q.put((1, 'medium-priority item')) q.put((0, 'high-priority item')) q.put((10, 'low-priority item')) print(q.get_nowait()) print(q.get_nowait()) print(q.get_nowait()) .. testoutput:: (0, 'high-priority item') (1, 'medium-priority item') (10, 'low-priority item') c C � g | _ d S r r; r* r r r r/ H r' zPriorityQueue._initc C s t �| j|� d S r )�heapq�heappushr9 rQ r r r rR K r zPriorityQueue._putc C s t �| j�S r )r` �heappopr9 r* r r r rG N s zPriorityQueue._getN�r r r r r/ rR rG r r r r r 0 s r c @ r^ ) r af A `.Queue` that retrieves the most recently put items first. .. testcode:: from salt.ext.tornado.queues import LifoQueue q = LifoQueue() q.put(3) q.put(2) q.put(1) print(q.get_nowait()) print(q.get_nowait()) print(q.get_nowait()) .. testoutput:: 1 2 3 c C r_ r r; r* r r r r/ h r' zLifoQueue._initc C rO r rP rQ r r r rR k rS zLifoQueue._putc C r( r )r9 �popr* r r r rG n r' zLifoQueue._getNrc r r r r r R s r )r � __future__r r r r0 r` Zsalt.ext.tornador r Zsalt.ext.tornado.concurrentr Zsalt.ext.tornado.locksr �__all__� Exceptionr r r" �objectr# r r r r r r r �<module> s o"
| ver. 1.4 |
Github
|
.
| PHP 8.2.30 | Generation time: 0 |
proxy
|
phpinfo
|
Settings