Current File : //lib64/python2.7/site-packages/tornado/queues.pyc
�
��L]c @� s d d l m Z m Z m Z m Z d d d d d g Z d d l Z d d l Z d d l m Z m
Z
d d l m Z d d
l
m Z d e f d � � YZ d e f d � � YZ d
� Z d e f d � � YZ d e f d � � YZ d e f d � � YZ d S( i ( t absolute_importt divisiont print_functiont with_statementt Queuet
PriorityQueuet LifoQueuet QueueFullt
QueueEmptyN( t gent ioloop( t Future( t Eventc B� s e Z d Z RS( s: Raised by `.Queue.get_nowait` when the queue has no items.( t __name__t
__module__t __doc__( ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyR s c B� s e Z d Z RS( sB Raised by `.Queue.put_nowait` when a queue is at its maximum size.( R
R R ( ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyR s c � sV | rR � f d � } t j j � � � j | | � � � j � � f d � � n d S( Nc � s � j t j � � d S( N( t
set_exceptionR t TimeoutError( ( t future( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyt
on_timeout' s c � s
� j � � S( N( t remove_timeout( t _( t io_loopt timeout_handle( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyt <lambda>, s ( R
t IOLoopt currentt add_timeoutt add_done_callback( R t timeoutR ( ( R R R s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyt _set_timeout% s c B� s� e Z d Z d d � Z e d � � Z d � Z d � Z d � Z d d � Z
d � Z d d � Z d
� Z
d � Z d d � Z d
� Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z RS( sk Coordinate producer and consumer coroutines.
If maxsize is 0 (the default) the queue size is unbounded.
.. testcode::
q = queues.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():
consumer() # Start consumer.
yield producer() # Wait for producer to put all tasks.
yield q.join() # Wait for consumer to finish all tasks.
print('Done')
io_loop.run_sync(main)
.. testoutput::
Put 0
Put 1
Put 2
Doing work on 0
Doing work on 1
Put 3
Doing work on 2
Put 4
Doing work on 3
Doing work on 4
Done
i c C� s� | d k r t d � � n | d k r6 t d � � n | | _ | j � t j g � | _ t j g � | _ d | _ t
� | _ | j j � d S( Ns maxsize can't be Nonei s maxsize can't be negative(
t Nonet TypeErrort
ValueErrort _maxsizet _initt collectionst dequet _getterst _putterst _unfinished_tasksR t _finishedt set( t selft maxsize( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyt __init___ s
c C� s | j S( s% Number of items allowed in the queue.( R" ( R+ ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyR, n s c C� s
t | j � S( s Number of items in the queue.( t lent _queue( R+ ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyt qsizes s c C� s | j S( N( R/ ( R+ ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyt emptyw s c C� s* | j d k r t S| j � | j k Sd S( Ni ( R, t FalseR0 ( R+ ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyt fullz s c C� s] y | j | � Wn> t k
rQ t � } | j j | | f � t | | � | SXt j Sd S( s� Put an item into the queue, perhaps waiting until there is room.
Returns a Future, which raises `tornado.gen.TimeoutError` after a
timeout.
N( t
put_nowaitR R R' t appendR R t _null_future( R+ t itemR R ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyt put� s
c C� s� | j � | j r] | j � s+ t d � � | j j � } | j | � | j | j � � n" | j � rr t � n
| j | � d S( s{ Put an item into the queue without blocking.
If no free slot is immediately available, raise `QueueFull`.
s) queue non-empty, why are getters waiting?N(
t _consume_expiredR& R1 t AssertionErrort popleftt _Queue__put_internalt
set_resultt _getR3 R ( R+ R7 t getter( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyR4 � s
c C� sU t � } y | j | j � � Wn. t k
rP | j j | � t | | � n X| S( s� 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 R= t
get_nowaitR R& R5 R ( R+ R R ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyt get� s
c C� s� | j � | j rd | j � s+ t d � � | j j � \ } } | j | � | j d � | j � S| j � rz | j � St
� d S( s� Remove and return an item from the queue without blocking.
Return an item if one is immediately available, else raise
`QueueEmpty`.
s( queue not full, why are putters waiting?N( R9 R' R3 R: R; R< R= R R> R0 R ( R+ R7 t putter( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyR@ � s
c C� sP | j d k r t d � � n | j d 8_ | j d k rL | j j � n d S( s� 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`.
i s! task_done() called too many timesi N( R( R! R) R* ( R+ ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyt task_done� s
c C� s | j j | � S( s� Block until all items in the queue are processed.
Returns a Future, which raises `tornado.gen.TimeoutError` after a
timeout.
( R) t wait( R+ R ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyt join� s c C� s t j � | _ d S( N( R$ R% R/ ( R+ ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyR# � s c C� s
| j j � S( N( R/ R; ( R+ ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyR> � s c C� s | j j | � d S( N( R/ R5 ( R+ R7 ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyt _put� s c C� s- | j d 7_ | j j � | j | � d S( Ni ( R( R) t clearRF ( R+ R7 ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyt __put_internal� s
c C� sh x1 | j r3 | j d d j � r3 | j j � q Wx- | j rc | j d j � rc | j j � q7 Wd S( Ni i ( R' t doneR; R& ( R+ ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyR9 � s # c C� s, d t | � j t t | � � | j � f S( Ns
<%s at %s %s>( t typeR
t hext idt _format( R+ ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyt __repr__� s c C� s d t | � j | j � f S( Ns <%s %s>( RJ R
RM ( R+ ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyt __str__� s c C� s� d | j f } t | d d � r6 | d | j 7} n | j rY | d t | j � 7} n | j r| | d t | j � 7} n | j r� | d | j 7} n | S( Ns
maxsize=%rR/ s queue=%rs getters[%s]s putters[%s]s tasks=%s( R, t getattrR R/ R& R. R' R( ( R+ t result( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyRM � s N( R
R R R- t propertyR, R0 R1 R3 R R8 R4 RA R@ RC RE R# R> RF R< R9 RN RO RM ( ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyR / s( / c B� s) e Z d Z d � Z d � Z d � Z RS( s A `.Queue` that retrieves entries in priority order, lowest first.
Entries are typically tuples like ``(priority number, data)``.
.. testcode::
q = queues.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� s
g | _ d S( N( R/ ( R+ ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyR# s c C� s t j | j | � d S( N( t heapqt heappushR/ ( R+ R7 ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyRF s c C� s t j | j � S( N( RS t heappopR/ ( R+ ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyR> " s ( R
R R R# RF R> ( ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyR s c B� s) e Z d Z d � Z d � Z d � Z RS( s6 A `.Queue` that retrieves the most recently put items first.
.. testcode::
q = queues.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� s
g | _ d S( N( R/ ( R+ ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyR# : s c C� s | j j | � d S( N( R/ R5 ( R+ R7 ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyRF = s c C� s
| j j � S( N( R/ t pop( R+ ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyR> @ s ( R
R R R# RF R> ( ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyR & s ( t
__future__R R R R t __all__R$ RS t tornadoR R
t tornado.concurrentR t
tornado.locksR t ExceptionR R R t objectR R R ( ( ( s4 /usr/lib64/python2.7/site-packages/tornado/queues.pyt <module> s "
�
Mini Shell