Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/tornado/__pycache__/queues.cpython-39.pyc
Ðазад
a _�h]1 � @ s d Z ddlZddlZddlZddlmZmZ ddlmZm Z ddl m Z ddl m Z mZmZmZ ddl Z e jr�ddl mZmZmZmZ ed�Zg d �ZG d d � d e�ZG d d � d e�Zee deej f dd�dd�Z G dd� dee �Z G dd� dee �Z G dd� de �Z G dd� de �Z!dS )a� Asynchronous queues for coroutines. These classes are very similar to those provided in the standard library's `asyncio package <https://docs.python.org/3/library/asyncio-queue.html>`_. .. 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. � N)�gen�ioloop)�Future�"future_set_result_unless_cancelled)�Event)�Union�TypeVar�Generic� Awaitable)�Deque�Tuple�List�Any�_T)�Queue� PriorityQueue� LifoQueue� QueueFull� QueueEmptyc @ s e Zd ZdZdS )r z:Raised by `.Queue.get_nowait` when the queue has no items.N��__name__� __module__� __qualname__�__doc__� r r �~/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/tornado/queues.pyr / s r c @ s e Zd ZdZdS )r zBRaised by `.Queue.put_nowait` when a queue is at its maximum size.Nr r r r r r 5 s r )�future�timeout�returnc sD |r@d d�� fdd� }t j�� ���||��� ���fdd�� d S )N�r c s � � � s� �t�� � d S �N)�doneZ set_exceptionr � TimeoutErrorr )r r r � on_timeout@ s z _set_timeout.<locals>.on_timeoutc s � � ��S r )Zremove_timeout)�_)�io_loop�timeout_handler r �<lambda>F � z _set_timeout.<locals>.<lambda>)r ZIOLoop�currentZ add_timeoutZadd_done_callback)r r r# r )r r% r& r � _set_timeout; s r* c @ s. e Zd Zddd�dd�Zee d�dd�ZdS ) �_QueueIteratorz Queue[_T]N)�qr c C s || _ d S r )r, )�selfr, r r r �__init__J s z_QueueIterator.__init__r c C s | j �� S r )r, �get�r- r r r � __anext__M s z_QueueIterator.__anext__)r r r r. r r r1 r r r r r+ I s r+ c @ sr e Zd ZdZdZd2edd�dd�Zeed�dd ��Zed�d d �Z e d�d d �Z e d�dd�Z d3e eeejf dd�dd�Ze dd�dd�Zd4eeejf ee d�dd�Ze d�dd�Zdd�d d �Zd5eeejf ed d�d d �Zee d�d d!�Zdd�d"d#�Ze d�d$d%�Z e dd�d&d'�Z e dd�d(d)�Z dd�d*d+�Z e d�d,d-�Z!e d�d.d/�Z"e d�d0d1�Z#dS )6r a� Coordinate producer and consumer coroutines. If maxsize is 0 (the default) the queue size is unbounded. .. testcode:: from tornado import gen from tornado.ioloop import IOLoop from tornado.queues import Queue q = Queue(maxsize=2) async def consumer(): async for item in q: try: print('Doing work on %s' % item) await gen.sleep(0.01) finally: q.task_done() async def producer(): for item in range(5): await q.put(item) print('Put %s' % item) async def main(): # Start consumer without waiting (since it never finishes). IOLoop.current().spawn_callback(consumer) await producer() # Wait for producer to put all tasks. await 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 versions of Python without native coroutines (before 3.5), ``consumer()`` could be written as:: @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() .. versionchanged:: 4.3 Added ``async for`` support in Python 3.5. Nr )�maxsizer c C sb |d u rt d��|dk r td��|| _| �� 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- r2 r r r r. � s zQueue.__init__r c C s | j S )z%Number of items allowed in the queue.)r5 r0 r r r r2 � s z Queue.maxsizec C s t | j�S )z Number of items in the queue.)�len�_queuer0 r r r �qsize� s z Queue.qsizec C s | j S r �r? r0 r r r �empty� s z Queue.emptyc C s | j dkrdS | �� | j kS d S )Nr F)r2 r@ r0 r r r �full� s z Queue.fullz Future[None])�itemr r c C sP t � }z| �|� W n, ty@ | j�||f� t||� Y n 0 |�d� |S )a� Put an item into the queue, perhaps waiting until there is room. Returns a Future, which raises `tornado.util.TimeoutError` after a timeout. ``timeout`` may be a number denoting a time (on the same scale as `tornado.ioloop.IOLoop.time`, normally `time.time`), or a `datetime.timedelta` object for a deadline relative to the current time. N)r � put_nowaitr r: �appendr* � set_result)r- rD r r r r r �put� s z Queue.put�rD r c C s^ | � � | jrB| �� s J d��| j�� }| �|� t|| �� � n| �� rPt�n | �|� 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_expiredr9 rB �popleft�_Queue__put_internalr �_getrC r )r- rD �getterr r r rE � s zQueue.put_nowait)r r c C sF t � }z|�| �� � W n( ty@ | j�|� t||� Y n0 |S )a. Remove and return an item from the queue. Returns an awaitable which resolves once an item is available, or raises `tornado.util.TimeoutError` after a timeout. ``timeout`` may be a number denoting a time (on the same scale as `tornado.ioloop.IOLoop.time`, normally `time.time`), or a `datetime.timedelta` object for a deadline relative to the current time. .. note:: The ``timeout`` argument of this method differs from that of the standard library's `queue.Queue.get`. That method interprets numeric values as relative timeouts; this one interprets them as absolute deadlines and requires ``timedelta`` objects for relative timeouts (consistent with other timeouts in Tornado). )r rG � get_nowaitr r9 rF r* )r- r r r r r r/ � s z Queue.getc C s` | � � | jrH| �� s J d��| j�� \}}| �|� t|d� | �� S | �� rX| �� S t�dS )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) rJ r: rC rK rL r rM r@ r )r- rD Zputterr r r rO � 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 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)r; r4 r< r= r0 r r r � task_done s zQueue.task_donec C s | j �|�S )z�Block until all items in the queue are processed. Returns an awaitable, which raises `tornado.util.TimeoutError` after a timeout. )r< �wait)r- r r r r �join" s z Queue.joinc C s t | �S r )r+ r0 r r r � __aiter__* s zQueue.__aiter__c C s t �� | _d S r )r7 r8 r? r0 r r r r6 . s z Queue._initc C s | j �� S r )r? rK r0 r r r rM 1 s z Queue._getc C s | j �|� d S r �r? rF �r- rD r r r �_put4 s z Queue._putc C s& | j d7 _ | j�� | �|� d S )NrP )r; r< �clearrW rV r r r Z__put_internal9 s zQueue.__put_internalc C sH | j r$| j d d �� r$| j �� q | jrD| jd �� rD| j�� q$d S )Nr rP )r: r! rK r9 r0 r r r rJ > s zQueue._consume_expiredc C s dt | �jtt| ��| �� f S )Nz <%s at %s %s>)�typer �hex�id�_formatr0 r r r �__repr__F s zQueue.__repr__c C s dt | �j| �� f S )Nz<%s %s>)rY r r\ r0 r r r �__str__I s z Queue.__str__c C sn d| j f }t| dd �r&|d| j 7 }| jr>|dt| j� 7 }| jrV|dt| j� 7 }| jrj|d| j 7 }|S )Nz maxsize=%rr? z queue=%rz getters[%s]z putters[%s]z tasks=%s)r2 �getattrr? r9 r> r: r; )r- �resultr r r r\ L s z Queue._format)r )N)N)N)$r r r r r? �intr. �propertyr2 r@ �boolrB rC r r �float�datetime� timedeltarH rE r r/ rO rQ rS r+ rT r6 rM rW rL rJ �strr] r^ r\ r r r r r Q s6 E �� r c @ s< e Zd ZdZdd�dd�Zedd�dd�Zed�d d �ZdS ) r aC A `.Queue` that retrieves entries in priority order, lowest first. Entries are typically tuples like ``(priority number, data)``. .. testcode:: from 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') Nr c C s g | _ d S r rA r0 r r r r6 r s zPriorityQueue._initrI c C s t �| j|� d S r )�heapq�heappushr? rV r r r rW u s zPriorityQueue._putc C s t �| j�S r )rh �heappopr? r0 r r r rM x s zPriorityQueue._get�r r r r r6 r rW rM r r r r r Y s r c @ s< e Zd ZdZdd�dd�Zedd�dd�Zed�d d �ZdS ) r a] A `.Queue` that retrieves the most recently put items first. .. testcode:: from 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 Nr c C s g | _ d S r rA r0 r r r r6 � s zLifoQueue._initrI c C s | j �|� d S r rU rV r r r rW � s zLifoQueue._putc C s | j �� S r )r? �popr0 r r r rM � s zLifoQueue._getrk r r r r r | s r )"r r7 re rh �tornador r Ztornado.concurrentr r Z tornado.locksr �typingr r r r � TYPE_CHECKINGr r r r r �__all__� Exceptionr r rd rf r* r+ r r r r r r r �<module> s. � #
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка