U @fG@sdZddlZddlZddlZddlZddlmZddlmZddl m Z ddl Z ddl mZddd d d d gZeZe jZe jZGd ddZGdd d ZGdddeZGdddeZGdddeZGdd d eZdS)aSynchronized queues. The :mod:`eventlet.queue` module implements multi-producer, multi-consumer queues that work across greenlets, with the API similar to the classes found in the standard :mod:`Queue` and :class:`multiprocessing ` modules. A major difference is that queues in this module operate as channels when initialized with *maxsize* of zero. In such case, both :meth:`Queue.empty` and :meth:`Queue.full` return ``True`` and :meth:`Queue.put` always blocks until a call to :meth:`Queue.get` retrieves the item. An interesting difference, made possible because of greenthreads, is that :meth:`Queue.qsize`, :meth:`Queue.empty`, and :meth:`Queue.full` *can* be used as indicators of whether the subsequent :meth:`Queue.get` or :meth:`Queue.put` will not block. The new methods :meth:`Queue.getting` and :meth:`Queue.putting` report on the number of greenthreads blocking in :meth:`put ` or :meth:`get ` respectively. N)Event) getcurrent)get_hub)TimeoutQueue PriorityQueue LifoQueue LightQueueFullEmptyc@s`eZdZdZdgZddZddZddZd d ZeZ e d d Z dddZ ddZ ddZd S)Waitera6A low level synchronization class. Wrapper around greenlet's ``switch()`` and ``throw()`` calls that makes them safe: * switching will occur only if the waiting greenlet is executing :meth:`wait` method currently. Otherwise, :meth:`switch` and :meth:`throw` are no-ops. * any error raised in the greenlet is handled inside :meth:`switch` and :meth:`throw` The :meth:`switch` and :meth:`throw` methods must only be called from the :class:`Hub` greenlet. The :meth:`wait` method must be called from a greenlet other than :class:`Hub`. greenletcCs d|_dSNr selfrH/var/www/html/chatgpt/venv/lib/python3.8/site-packages/eventlet/queue.py__init__LszWaiter.__init__cCs0|jr d}nd}dt|jtt|||jfS)N waitingz<%s at %s%s greenlet=%r>)waitingtype__name__hexidr rrrrr__repr__Os zWaiter.__repr__cCs&|jr d}nd}dt|j||jfS)zD >>> print(Waiter()) rrz<%s%s greenlet=%s>)rrrr rrrr__str__XszWaiter.__str__cCs |jdk Srrrrrr __nonzero__cszWaiter.__nonzero__cCs |jdk SrrrrrrrhszWaiter.waitingNcCsRttjkstd|jdk rNz|j|Wntk rLtYnXdS)zWake up the greenlet that is calling wait() currently (if there is one). Can only be called from Hub's greenlet. 3Can only use Waiter.switch method from the mainloopN)rrr AssertionErrorswitch Exception traceback print_exc)rvaluerrrr"ls z Waiter.switchcGsRttjkstd|jdk rNz|jj|Wntk rLtYnXdS)zuMake greenlet calling wait() wake up (if there is a wait()). Can only be called from Hub's greenlet. r N)rrr r!throwr#r$r%)rZ throw_argsrrrr'xs z Waiter.throwcCs>|jdkstd|jft|_ztWSd|_XdS)z2Wait until switch() or throw() is called. Nz!This Waiter is already used by %r)r r!rrr"rrrrwaits z Waiter.wait)N)r __module__ __qualname____doc__ __slots__rrrr__bool__propertyrr"r'r(rrrrr >s      r c@seZdZdZd*ddZddZddZd d Zd d Zd dZ ddZ ddZ ddZ ddZ ddZddZddZd+ddZd d!Zd,d"d#Zd$d%Zd&d'Zd(d)ZdS)-r a  This is a variant of Queue that behaves mostly like the standard :class:`Stdlib_Queue`. It differs by not supporting the :meth:`task_done ` or :meth:`join ` methods, and is a little faster for not having that overhead. NcCsB|dks|dkrd|_n||_t|_t|_d|_||dSNr)maxsizesetgettersputters _event_unlock_initrr0rrrrszLightQueue.__init__cCst|_dSr) collectionsdequequeuer6rrrr5szLightQueue._initcCs |jSr)r9popleftrrrr_getszLightQueue._getcCs|j|dSr)r9appendritemrrr_putszLightQueue._putcCs dt|jtt||fS)Nz <%s at %s %s>)rrrr_formatrrrrrszLightQueue.__repr__cCsdt|j|fS)Nz<%s %s>)rrr@rrrrrszLightQueue.__str__cCsld|jf}t|ddr&|d|j7}|jr>|dt|j7}|jrV|dt|j7}|jdk rh|d7}|S)Nz maxsize=%rr9z queue=%rz getters[%s]z putters[%s]z unlocking)r0getattrr9r2lenr3r4rresultrrrr@s   zLightQueue._formatcCs t|jS)zReturn the size of the queue.)rBr9rrrrqsizeszLightQueue.qsizecCs.|jdk r$|dks||jkr$|||_dS)zyResizes the queue's maximum size. If the size is increased, and there are putters waiting, they may be woken up.N)r0_schedule_unlock)rsizerrrresizeszLightQueue.resizecCs t|jS)z`Returns the number of greenthreads that are blocked waiting to put items into the queue.)rBr3rrrrputtingszLightQueue.puttingcCs t|jS)zVReturns the number of greenthreads that are blocked waiting on an empty queue.)rBr2rrrrgettingszLightQueue.gettingcCs | S)z;Return ``True`` if the queue is empty, ``False`` otherwise.)rErrrremptyszLightQueue.emptycCs|jdk o||jkS)zkReturn ``True`` if the queue is full, ``False`` otherwise. ``Queue(None)`` is never full. N)r0rErrrrfullszLightQueue.fullTc Csf|jdks||jkr4|||jr0|n.|stjtkr|jr||j}|rF||| }| |dSqFt n|rt ||}|j |t|t }zD|jr||}||kstd|f|jtk r||W5||j |Xn\|jr^t ||}|j |||}||ksLtd|f|jtk rbt nt dS)a#Put an item into the queue. If optional arg *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 :class:`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 :class:`Full` exception (*timeout* is ignored in that case). Nz!Invalid switch into Queue.put: %r)r0rEr?r2rFrr rpopr;r"r ItemWaiterr3addrcanceldiscardr(r!r>_NONE)rr>blocktimeoutgetterwaiterrDrrrputsF             zLightQueue.putcCs||ddS)zPut an item into the queue without blocking. Only enqueue the item if a free slot is immediately available. Otherwise raise the :class:`Full` exception. FN)rWr=rrr put_nowaitszLightQueue.put_nowaitc Cs|r|jr||S|sftjtkrf|jr`|j}|r0|||r0|Sq0t nv|rt }t |t }zD|j ||jr|z|WWS|YnXW5|j ||Xnt dS)aRemove 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 :class:`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 :class:`Empty` exception (*timeout* is ignored in that case). N)rEr3rFr;rr rrMr"r r rr2rQrPrOr()rrSrTputterrVrrrget s6         zLightQueue.getcCs |dS)zRemove and return an item from the queue without blocking. Only get an item if one is immediately available. Otherwise raise the :class:`Empty` exception. F)rZrrrr get_nowaitJszLightQueue.get_nowaitcCsfzV|rT|jrT|j}|rRz |}Wn|jtYn X||q|j r|jr|j }|r|j}|r|j }t |_ | ||}||||n |j |q|j r|js|jdks||jkr|j }||q|j rV|jsVdd|j D}|s"qV|D]&}|j |td|jjtq&qqVqW5d|_XdS)NcSsg|]}|js|qSr)rS).0prrr rsz&LightQueue._unlock..r)r4rEr2rMr;r'sysexc_infor"r3r>rRr?rOr0rQrschedule_call_globalr r )rrUr>rYrLrrr_unlockRsR                zLightQueue._unlockcCs |jdkrtd|j|_dSr/)r4rrarbrrrrrFs zLightQueue._schedule_unlock)N)TN)TN)rr)r*r+rr5r;r?rrr@rErHrIrJrKrLrWrXrZr[rbrFrrrrr s(    4 */c@seZdZddgZddZdS)rNr>rScCst|||_||_dSr)r rr>rS)rr>rSrrrrs zItemWaiter.__init__N)rr)r*r,rrrrrrNsrNc@sBeZdZdZdddZddZddZd d Zd d Zd dZ dS)raCreate a queue object with a given maximum size. If *maxsize* is less than zero or ``None``, the queue size is infinite. ``Queue(0)`` is a channel, that is, its :meth:`put` method always blocks until the item is delivered. (This is unlike the standard :class:`Stdlib_Queue`, where 0 means infinite size). In all other respects, this Queue class resembles the standard library, :class:`Stdlib_Queue`. NcCst||d|_t|_dSr/)r runfinished_tasksr_condr6rrrrs zQueue.__init__cCs(t|}|jr$|d|j|jf7}|S)Nz tasks=%s _cond=%s)r r@rcrdrCrrrr@s z Queue._formatcCst|||dSr)r r?_put_bookkeepingr=rrrr?s z Queue._putcCs&|jd7_|jr"|jdS)N)rcrdreadyresetrrrrres zQueue._put_bookkeepingcCs:|jdkrtd|jd8_|jdkr6|jddS)aYIndicate that a formerly enqueued task is complete. Used by queue consumer threads. For each :meth:`get ` used to fetch a task, a subsequent call to :meth:`task_done` tells the queue that the processing on the task is complete. If a :meth:`join` is currently blocking, it will resume when all items have been processed (meaning that a :meth:`task_done` call was received for every item that had been :meth:`put ` into the queue). Raises a :exc:`ValueError` if called more times than there were items placed in the queue. rz!task_done() called too many timesrfN)rc ValueErrorrdsendrrrr task_dones  zQueue.task_donecCs|jdkr|jdS)aBlock 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 :meth:`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, :meth:`join` unblocks. rN)rcrdr(rrrrjoins z Queue.join)N) rr)r*r+rr@r?rerkrlrrrrrs c@s4eZdZdZddZejfddZejfddZ dS) rzA subclass of :class:`Queue` that retrieves entries in priority order (lowest first). Entries are typically tuples of the form: ``(priority number, data)``. cCs g|_dSrr9r6rrrr5szPriorityQueue._initcCs||j||dSr)r9re)rr>heappushrrrr?s zPriorityQueue._putcCs ||jSrrm)rheappoprrrr;szPriorityQueue._getN) rr)r*r+r5heapqrnr?ror;rrrrrsc@s(eZdZdZddZddZddZdS) rzNA subclass of :class:`Queue` that retrieves most recently added entries first.cCs g|_dSrrmr6rrrr5szLifoQueue._initcCs|j||dSr)r9r<rer=rrrr?s zLifoQueue._putcCs |jSr)r9rMrrrrr;szLifoQueue._getN)rr)r*r+r5r?r;rrrrrs)r+r_rpr7r$Zeventlet.eventrZeventlet.greenthreadrZ eventlet.hubsrr9Z Stdlib_QueueZeventlet.timeoutr__all__objectrRr r r r rNrrrrrrrs(    Rw ?