Current File : /opt/alt/python34/lib64/python3.4/asyncio/__pycache__//queues.cpython-34.pyc
�
j f� � @ s d Z d d d d d g Z d d l Z d d l Z d d l m Z d d
l m Z d d l m Z d d l m Z d d
l m
Z
Gd d � d e � Z Gd d � d e � Z
Gd d � d � Z Gd d � d e � Z Gd d � d e � Z e j s
e Z e j d � n d S)ZQueues�Queue�
PriorityQueue� LifoQueue� QueueFull�
QueueEmpty� N� )�compat)�events)�futures)�locks)� coroutinec @ s e Z d Z d Z d S)r z]Exception raised when Queue.get_nowait() is called on a Queue object
which is empty.
N)�__name__�
__module__� __qualname__�__doc__� r r �3/opt/alt/python34/lib64/python3.4/asyncio/queues.pyr s c @ s e Z d Z d Z d S)r zgException raised when the Queue.put_nowait() method is called on a Queue
object which is full.
N)r
r r r r r r r r s c @ s e Z d Z d Z d d d d d �Z d d � Z d d
� Z d d � Z d
d � Z d d � Z d d � Z
d d � Z d d � Z e
d d � � Z d d � Z d d � Z e d d � � Z d d � Z e d! d" � � Z d# d$ � Z d% d& � Z e d' d( � � Z d S))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 "yield from 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 �loopNc C s� | d k r t j � | _ n | | _ | | _ t j � | _ t j � | _ d | _ t j
d | j � | _ | j j � | j
| � d S)Nr r )r Zget_event_loop�_loop�_maxsize� collections�deque�_getters�_putters�_unfinished_tasksr ZEvent� _finished�set�_init)�self�maxsizer r r r �__init__) s
zQueue.__init__c C s t j � | _ d S)N)r r �_queue)r r r r r r ; s z Queue._initc C s
| j j � S)N)r! �popleft)r r r r �_get> s z
Queue._getc C s | j j | � d S)N)r! �append)r �itemr r r �_putA s z
Queue._putc C s: x3 | r5 | j � } | j � s | j d � Pq q Wd S)N)r" �doneZ
set_result)r �waitersZwaiterr r r � _wakeup_nextF s
zQueue._wakeup_nextc C s( d j t | � j t | � | j � � S)Nz<{} at {:#x} {}>)�format�typer
�id�_format)r r r r �__repr__N s zQueue.__repr__c C s d j t | � j | j � � S)Nz<{} {}>)r* r+ r
r- )r r r r �__str__R s z
Queue.__str__c C s� d j | j � } t | d d � rC | d j t | j � � 7} n | j rk | d j t | j � � 7} n | j r� | d j t | j � � 7} n | j r� | d j | j � 7} n | S)Nz maxsize={!r}r! z _queue={!r}z
_getters[{}]z
_putters[{}]z tasks={}) r* r �getattr�listr! r �lenr r )r �resultr r r r- U s z
Queue._formatc C s
t | j � S)z Number of items in the queue.)r2 r! )r r r r �qsizea s z Queue.qsizec C s | j S)z%Number of items allowed in the queue.)r )r r r r r e s z
Queue.maxsizec C s | j S)z3Return True if the queue is empty, False otherwise.)r! )r r r r �emptyj s z Queue.emptyc C s* | j d k r d S| j � | j k Sd S)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 r4 )r r r r �fulln s z
Queue.fullc c s� x� | j � r� t j d | j � } | j j | � y
| Dd HWq | j � | j � r~ | j � r~ | j | j � n � Yq Xq W| j | � 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.
This method is a coroutine.
r N)
r6 r
�Futurer r r$ �cancel� cancelledr) �
put_nowait)r r% Zputterr r r �puty s
z Queue.putc C sR | j � r t � n | j | � | j d 7_ | j j � | j | j � d S)zyPut an item into the queue without blocking.
If no free slot is immediately available, raise QueueFull.
r N)r6 r r& r r �clearr) r )r r% r r r r: � s
zQueue.put_nowaitc c s� x� | j � r� t j d | j � } | j j | � y
| Dd HWq | j � | j � r~ | j � r~ | j | j � n � Yq Xq W| j � S)z�Remove and return an item from the queue.
If queue is empty, wait until an item is available.
This method is a coroutine.
r N)
r5 r
r7 r r r$ r8 r9 r) �
get_nowait)r �getterr r r �get� s
z Queue.getc C s5 | j � r t � n | j � } | j | j � | S)z�Remove and return an item from the queue.
Return an item if one is immediately available, else raise QueueEmpty.
)r5 r r# r) r )r r% r r r r= � s
zQueue.get_nowaitc C sP | j d k r t d � � n | j d 8_ | j d k rL | j j � n d S)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 �
ValueErrorr r )r r r r � task_done� s
zQueue.task_donec c s( | j d k r$ | j j � Dd Hn d S)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 �wait)r r r r �join� s z
Queue.join)r
r r r r r r# r& r) r. r/ r- r4 �propertyr r5 r6 r r; r: r? r= rA rC r r r r r s&
c @ sF e Z d Z d Z d d � Z e j d d � Z e j d d � Z d S) 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)N)r! )r r r r r r � s zPriorityQueue._initc C s | | j | � d S)N)r! )r r% �heappushr r r r& � s zPriorityQueue._putc C s
| | j � S)N)r! )r �heappopr r r r# � s zPriorityQueue._getN)
r
r r r r �heapqrE r& rF r# r r r r r � s c @ s: e Z d Z d Z d d � Z d d � Z d d � Z d S) r zEA subclass of Queue that retrieves most recently added entries first.c C s
g | _ d S)N)r! )r r r r r r � s zLifoQueue._initc C s | j j | � d S)N)r! r$ )r r% r r r r& � s zLifoQueue._putc C s
| j j � S)N)r! �pop)r r r r r# � s zLifoQueue._getN)r
r r r r r& r# r r r r r � s �
JoinableQueue)r �__all__r rG � r r r
r Z
coroutinesr � Exceptionr r r r r ZPY35rI r$ r r r r �<module> s �
