Warning: Undefined array key "बहिः गच्छतु" in
/home/httpd/vhosts/puntogroup.ru/httpdocs/collections/plint/index.php(1) : eval()'d code on line
136
Warning: Undefined array key "aksi" in
/home/httpd/vhosts/puntogroup.ru/httpdocs/collections/plint/index.php(1) : eval()'d code on line
140
Warning: Undefined array key "नामपत्र" in
/home/httpd/vhosts/puntogroup.ru/httpdocs/collections/plint/index.php(1) : eval()'d code on line
159
Warning: Undefined array key "नामपत्र" in
/home/httpd/vhosts/puntogroup.ru/httpdocs/collections/plint/index.php(1) : eval()'d code on line
181
| Current File : //usr/lib64/python2.6/Queue.pyo |
��
���Lc @ s� d Z d d k l Z d d k l Z d d k Z d d d d d g Z d e f d
� � YZ d e f d � � YZ d d d � � YZ
d e
f d
� � YZ d e
f d � � YZ d S( s' A multi-producer, multi-consumer queue.i����( t time( t dequeNt Emptyt Fullt Queuet
PriorityQueuet LifoQueuec B s e Z d Z RS( s4 Exception raised by Queue.get(block=0)/get_nowait().( t __name__t
__module__t __doc__( ( ( s /usr/lib64/python2.6/Queue.pyR s c B s e Z d Z RS( s4 Exception raised by Queue.put(block=0)/put_nowait().( R R R ( ( ( s /usr/lib64/python2.6/Queue.pyR
s c B s� e Z d Z d d � Z d � Z d � Z d � Z d � Z d � Z e d d � Z d � Z e d d
� Z
d � Z d � Z e d
� Z d � Z d � Z RS( sj Create a queue object with a given maximum size.
If maxsize is <= 0, the queue size is infinite.
i c C s� y d d k } Wn t j
o d d k } n X| | _ | i | � | i � | _ | i | i � | _ | i | i � | _ | i | i � | _
d | _ d S( Ni����i ( t threadingt ImportErrort dummy_threadingt maxsizet _initt Lockt mutext Conditiont not_emptyt not_fullt all_tasks_donet unfinished_tasks( t selfR
R
( ( s /usr/lib64/python2.6/Queue.pyt __init__ s
c C sw | i i � zU | i d } | d j o. | d j o t d � � n | i i � n | | _ Wd | i i � Xd S( s. Indicate that a formerly enqueued task is complete.
Used by Queue consumer threads. 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 a ValueError if called more times than there were items
placed in the queue.
i i s! task_done() called too many timesN( R t acquireR t
ValueErrort
notify_allt release( R t
unfinished( ( s /usr/lib64/python2.6/Queue.pyt task_done- s
c C sE | i i � z# x | i o | i i � q WWd | i i � Xd S( s� Blocks 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 thread calls task_done()
to indicate the item was retrieved and all work on it is complete.
When the count of unfinished tasks drops to zero, join() unblocks.
N( R R R t waitR ( R ( ( s /usr/lib64/python2.6/Queue.pyt joinF s
c C s* | i i � | i � } | i i � | S( s9 Return the approximate size of the queue (not reliable!).( R R t _qsizeR ( R t n( ( s /usr/lib64/python2.6/Queue.pyt qsizeV s
c C s+ | i i � | i � } | i i � | S( sC Return True if the queue is empty, False otherwise (not reliable!).( R R R R ( R R! ( ( s /usr/lib64/python2.6/Queue.pyt empty] s
c C sD | i i � d | i j o | i � j n } | i i � | S( sB Return True if the queue is full, False otherwise (not reliable!).i ( R R R
R R ( R R! ( ( s /usr/lib64/python2.6/Queue.pyt fulld s
&
c C sF | i i � z$| i d j o� | p$ | i � | i j o
t � qq| d j o/ x� | i � | i j o | i i � q[ Wq| d j o t d � � qt � | } xS | i � | i j o8 | t � } | d j o
t � n | i i | � q� Wn | i | � | i
d 7_
| i i � Wd | i i
� Xd S( s Put an item into the queue.
If optional args 'block' is true and 'timeout' is None (the default),
block if necessary until a free slot is available. If 'timeout' is
a positive number, it blocks at most 'timeout' seconds and raises
the Full exception if no free slot was available within that time.
Otherwise ('block' is false), put an item on the queue if a free slot
is immediately available, else raise the Full exception ('timeout'
is ignored in that case).
i s# 'timeout' must be a positive numberg i N( R R R
R R t NoneR R t _timet _putR R t notifyR ( R t itemt blockt timeoutt endtimet remaining( ( s /usr/lib64/python2.6/Queue.pyt putk s.
c C s | i | t � S( s� Put an item into the queue without blocking.
Only enqueue the item if a free slot is immediately available.
Otherwise raise the Full exception.
( R. t False( R R) ( ( s /usr/lib64/python2.6/Queue.pyt
put_nowait� s c C s | i i � z� | p | i � p
t � q� n� | d j o& x� | i � p | i i � qB Wnt | d j o t d � � nW t � | } xF | i � p8 | t � } | d j o
t � n | i i | � q� W| i � } | i i
� | SWd | i i � Xd S( s Remove and return an item from the queue.
If optional args 'block' is true and 'timeout' is None (the default),
block if necessary until an item is available. If 'timeout' is
a positive number, it blocks at most 'timeout' seconds and raises
the Empty exception if no item was available within that time.
Otherwise ('block' is false), return an item if one is immediately
available, else raise the Empty exception ('timeout' is ignored
in that case).
i s# 'timeout' must be a positive numberg N( R R R R R% R R R& t _getR R( R ( R R* R+ R, R- R) ( ( s /usr/lib64/python2.6/Queue.pyt get� s,
c C s
| i t � S( s� Remove and return an item from the queue without blocking.
Only get an item if one is immediately available. Otherwise
raise the Empty exception.
( R2 R/ ( R ( ( s /usr/lib64/python2.6/Queue.pyt
get_nowait� s c C s t � | _ d S( N( R t queue( R R
( ( s /usr/lib64/python2.6/Queue.pyR � s c C s
| | i � S( N( R4 ( R t len( ( s /usr/lib64/python2.6/Queue.pyR � s c C s | i i | � d S( N( R4 t append( R R) ( ( s /usr/lib64/python2.6/Queue.pyR' � s c C s
| i i � S( N( R4 t popleft( R ( ( s /usr/lib64/python2.6/Queue.pyR1 � s N( R R R R R R R" R# R$ t TrueR% R. R0 R2 R3 R R5 R R' R1 ( ( ( s /usr/lib64/python2.6/Queue.pyR s # "
c B sA e Z d Z d � Z e d � Z e i d � Z e i d � Z
RS( s� Variant of Queue that retrieves open entries in priority order (lowest first).
Entries are typically tuples of the form: (priority number, data).
c C s
g | _ d S( N( R4 ( R R
( ( s /usr/lib64/python2.6/Queue.pyR � s c C s
| | i � S( N( R4 ( R R5 ( ( s /usr/lib64/python2.6/Queue.pyR � s c C s | | i | � d S( N( R4 ( R R) t heappush( ( s /usr/lib64/python2.6/Queue.pyR' � s c C s
| | i � S( N( R4 ( R t heappop( ( s /usr/lib64/python2.6/Queue.pyR1 � s ( R R R R R5 R t heapqR9 R' R: R1 ( ( ( s /usr/lib64/python2.6/Queue.pyR � s
c B s5 e Z d Z d � Z e d � Z d � Z d � Z RS( sB Variant of Queue that retrieves most recently added entries first.c C s
g | _ d S( N( R4 ( R R
( ( s /usr/lib64/python2.6/Queue.pyR � s c C s
| | i � S( N( R4 ( R R5 ( ( s /usr/lib64/python2.6/Queue.pyR � s c C s | i i | � d S( N( R4 R6 ( R R) ( ( s /usr/lib64/python2.6/Queue.pyR' � s c C s
| i i � S( N( R4 t pop( R ( ( s /usr/lib64/python2.6/Queue.pyR1 � s ( R R R R R5 R R' R1 ( ( ( s /usr/lib64/python2.6/Queue.pyR � s
( (
R R R& t collectionsR R; t __all__t ExceptionR R R R R ( ( ( s /usr/lib64/python2.6/Queue.pyt <module> s �