OwlCyberSecurity - MANAGER
Edit File: queue.cpython-33.pyc
� �� f�" c @ s d Z y d d l Z Wn e k r6 d d l Z Yn Xd d l m Z d d l m Z m Z y d d l m Z Wn" e k r� d d l m Z Yn Xd d d d d g 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 d S( u' A multi-producer, multi-consumer queue.i N( u deque( u heappushu heappop( u monotonic( u timeu Emptyu Fullu Queueu PriorityQueueu LifoQueuec B s | Ee Z d Z d Z d S( u Emptyu4 Exception raised by Queue.get(block=0)/get_nowait().N( u __name__u __module__u __qualname__u __doc__( u __locals__( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu Empty s c B s | Ee Z d Z d Z d S( u Fullu4 Exception raised by Queue.put(block=0)/put_nowait().N( u __name__u __module__u __qualname__u __doc__( u __locals__( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu Full s c B s� | Ee Z d Z d Z d d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d d d � Z d d d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d S(! u Queueuj Create a queue object with a given maximum size. If maxsize is <= 0, the queue size is infinite. i c C sq | | _ | j | � t j � | _ t j | j � | _ t j | j � | _ t j | j � | _ d | _ d S( Ni ( u maxsizeu _initu threadingu Locku mutexu Conditionu not_emptyu not_fullu all_tasks_doneu unfinished_tasks( u selfu maxsize( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu __init__ s u Queue.__init__c C sa | j �R | j d } | d k rN | d k r> t d � � n | j j � n | | _ Wd QXd S( u. 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 u! task_done() called too many timesN( u all_tasks_doneu unfinished_tasksu ValueErroru notify_all( u selfu unfinished( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu task_done5 s u Queue.task_donec C s1 | j �" x | j r& | j j � q WWd QXd S( u� 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( u all_tasks_doneu unfinished_tasksu wait( u self( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu joinK s u Queue.joinc C s | j � | j � SWd QXd S( u9 Return the approximate size of the queue (not reliable!).N( u mutexu _qsize( u self( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu qsizeX s u Queue.qsizec C s | j � | j � SWd QXd S( u� Return True if the queue is empty, False otherwise (not reliable!). This method is likely to be removed at some point. Use qsize() == 0 as a direct substitute, but be aware that either approach risks a race condition where a queue can grow before the result of empty() or qsize() can be used. To create code that needs to wait for all queued tasks to be completed, the preferred technique is to use the join() method. N( u mutexu _qsize( u self( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu empty] s u Queue.emptyc C s5 | j �& d | j k o( | j � k SSWd QXd S( uO Return True if the queue is full, False otherwise (not reliable!). This method is likely to be removed at some point. Use qsize() >= n as a direct substitute, but be aware that either approach risks a race condition where a queue can shrink before the result of full() or qsize() can be used. i N( u mutexu maxsizeu _qsize( u self( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu fullk s u Queue.fullc C s$ | j �| j d k r� | s@ | j � | j k r� t � q� q� | d k rx x� | j � | j k rt | j j � qO Wq� | d k r� t d � � q� t � | } xN | j � | j k r� | t � } | d k r� t � n | j j | � q� Wn | j | � | j d 7_ | j j � Wd QXd S( u 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 non-negative 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 u' 'timeout' must be a non-negative numberg i N( u not_fullu maxsizeu _qsizeu Fullu Noneu waitu ValueErroru timeu _putu unfinished_tasksu not_emptyu notify( u selfu itemu blocku timeoutu endtimeu remaining( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu putv s& u Queue.putc C s� | j �� | s( | j � s� t � q� n� | d k rW x� | j � sS | j j � q7 Wnm | d k rr t d � � nR t � | } xB | j � s� | t � } | d k r� t � n | j j | � q� W| j � } | j j � | SWd QXd S( u 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 non-negative 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 u' 'timeout' must be a non-negative numberg N( u not_emptyu _qsizeu Emptyu Noneu waitu ValueErroru timeu _getu not_fullu notify( u selfu blocku timeoutu endtimeu remainingu item( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu get� s$ u Queue.getc C s | j | d d �S( u� Put an item into the queue without blocking. Only enqueue the item if a free slot is immediately available. Otherwise raise the Full exception. u blockF( u putu False( u selfu item( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu put_nowait� s u Queue.put_nowaitc C s | j d d � S( u� Remove and return an item from the queue without blocking. Only get an item if one is immediately available. Otherwise raise the Empty exception. u blockF( u getu False( u self( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu get_nowait� s u Queue.get_nowaitc C s t � | _ d S( N( u dequeu queue( u selfu maxsize( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu _init� s u Queue._initc C s t | j � S( N( u lenu queue( u self( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu _qsize� s u Queue._qsizec C s | j j | � d S( N( u queueu append( u selfu item( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu _put� s u Queue._putc C s | j j � S( N( u queueu popleft( u self( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu _get� s u Queue._getNT( u __name__u __module__u __qualname__u __doc__u __init__u task_doneu joinu qsizeu emptyu fullu Trueu Noneu putu getu put_nowaitu get_nowaitu _initu _qsizeu _putu _get( u __locals__( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu Queue s c B sJ | Ee Z d Z d Z d d � Z d d � Z d d � Z d d � Z d S( u PriorityQueueu� 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( u queue( u selfu maxsize( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu _init� s u PriorityQueue._initc C s t | j � S( N( u lenu queue( u self( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu _qsize� s u PriorityQueue._qsizec C s t | j | � d S( N( u heappushu queue( u selfu item( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu _put� s u PriorityQueue._putc C s t | j � S( N( u heappopu queue( u self( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu _get� s u PriorityQueue._getN( u __name__u __module__u __qualname__u __doc__u _initu _qsizeu _putu _get( u __locals__( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu PriorityQueue� s c B sJ | Ee Z d Z d Z d d � Z d d � Z d d � Z d d � Z d S( u LifoQueueuB Variant of Queue that retrieves most recently added entries first.c C s g | _ d S( N( u queue( u selfu maxsize( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu _init� s u LifoQueue._initc C s t | j � S( N( u lenu queue( u self( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu _qsize� s u LifoQueue._qsizec C s | j j | � d S( N( u queueu append( u selfu item( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu _put� s u LifoQueue._putc C s | j j � S( N( u queueu pop( u self( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu _get� s u LifoQueue._getN( u __name__u __module__u __qualname__u __doc__u _initu _qsizeu _putu _get( u __locals__( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu LifoQueue� s ( u __doc__u threadingu ImportErroru dummy_threadingu collectionsu dequeu heapqu heappushu heappopu timeu monotonicu __all__u Exceptionu Emptyu Fullu Queueu PriorityQueueu LifoQueue( ( ( u* /opt/alt/python33/lib64/python3.3/queue.pyu <module> s �