HiGFdZddlZddlZddlZddlZddlZddlmZddlm Z ddl m Z ddl Z ddlmZgdZeZe jZe jZGdd ZGd d ZGd d eZGddeZGddeZGddeZdS)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)Timeout)Queue PriorityQueue LifoQueue LightQueueFullEmptyc^eZdZdZdgZdZdZdZdZeZ e dZ d d Z d Z d ZdS) 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`. greenletcd|_dSNrselfs S/home/mmwave/public_html/mmwave/venv/lib/python3.11/site-packages/eventlet/queue.py__init__zWaiter.__init__Ms  c|jrd}nd}dt|jdtt ||d|jdS)N waiting< at greenlet=>)waitingtype__name__hexidrrrs r__repr__zWaiter.__repr__PsS <  GGG JJ   RXX  rc^|jrd}nd}dt|j|d|jdS)zD >>> print(Waiter()) rrrrr)rr r!rr$s r__str__zWaiter.__str__Ys> <  GGG'+Dzz':':GGGT]]]SSrc|jduSrrrs r __nonzero__zWaiter.__nonzero__ds}D((rc|jduSrrrs rrzWaiter.waitingis}D((rNcttjus Jd|jA |j|dS#t$rt jYdSwxYwdS)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)rrrswitch Exception traceback print_exc)rvalues rr-z Waiter.switchms||w  I = $ & $$U+++++ & & &#%%%%%% & % $sAA10A1cttjus Jd|j6 |jj|dS#t$rt jYdSwxYwdS)zuMake greenlet calling wait() wake up (if there is a wait()). Can only be called from Hub's greenlet. r,N)rrrthrowr.r/r0)r throw_argss rr3z Waiter.throwys||w  I = $ &# #Z0000 & & &#%%%%%% & % $sAA&%A&c|jJd|jt|_ td|_S#d|_wxYw)z2Wait until switch() or throw() is called. NzThis Waiter is already used by )rrrr-rs rwaitz Waiter.waitsc}$$$T]]&]$$$"   !99##%% DMMDDM s A Ar)r! __module__ __qualname____doc__ __slots__rr%r'r)__bool__propertyrr-r3r6rrrr?s   I    T T T)))H ))X) & & & & & & &!!!!!rrceZdZdZddZdZdZdZdZdZ d Z d Z d Z d Z d ZdZdZddZdZddZdZdZdZejdkreejZdSdS)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. Nc||dkrd|_n||_t|_t|_d|_||dSNr)maxsizesetgettersputters _event_unlock_initrrAs rrzLightQueue.__init__sU ?gkkDLL"DLuu uu ! 7rc6tj|_dSr) collectionsdequequeuerGs rrFzLightQueue._inits &(( rc4|jSr)rKpopleftrs r_getzLightQueue._getsz!!###rc:|j|dSr)rKappendritems r_putzLightQueue._puts $rcdt|jdtt|d|dS)Nrr r)r r!r"r#_formatrs rr%zLightQueue.__repr__s<"&t**"5"5"5s2d88}}}}dllnnnnUUrc\dt|jd|dS)NrrUr)r r!rVrs rr'zLightQueue.__str__s* JJ///@@rcd|j}t|ddr |d|jzz }|jr|dt |jzz }|jr|dt |jzz }|j|dz }|S)Nzmaxsize=rKz queue=%rz getters[%s]z putters[%s]z unlocking)rAgetattrrKrClenrDrErresults rrVzLightQueue._formats!%0 4$ ' ' / kDJ. .F < 9 ns4<'8'88 8F < 9 ns4<'8'88 8F   ) l "F rc*t|jS)zReturn the size of the queue.)rZrKrs rqsizezLightQueue.qsizes4:rcd|j!| ||jkr|||_dS)zyResizes the queue's maximum size. If the size is increased, and there are putters waiting, they may be woken up.N)rA_schedule_unlock)rsizes rresizezLightQueue.resizes9 < # 9L9L  ! ! # # # rc*t|jS)z`Returns the number of greenthreads that are blocked waiting to put items into the queue.)rZrDrs rputtingzLightQueue.putting4<   rc*t|jS)zVReturns the number of greenthreads that are blocked waiting on an empty queue.)rZrCrs rgettingzLightQueue.gettingrerc,| S)z;Return ``True`` if the queue is empty, ``False`` otherwise.)r^rs remptyzLightQueue.emptys::<<rcN|jduo||jkS)zkReturn ``True`` if the queue is full, ``False`` otherwise. ``Queue(None)`` is never full. N)rAr^rs rfullzLightQueue.fulls% |4'HDJJLLDL,HHrTc|j||jkr4|||jr|dSdS|st jturp|jrb|j}|r@||| }| |dS|jbt|rt||}|j |t|t} |jr||}||us Jd||jt$ur||||j |dS#||j |wxYw|jrzt||}|j |||}||us Jd||jt$urtdSt)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). NzInvalid switch into Queue.put: )rAr^rSrCr`rrrpoprNr-r ItemWaiterrDaddrr6rR_NONEcanceldiscard)rrRblocktimeoutgetterwaiterr\s rputzLightQueue.putsy < 4::<<$,#>#> IIdOOO| (%%''''' ( (" 799-==, ))++IIdOOO99;;DMM$'''F , J  e,,F L  V $ $ $gt,,G -<,))+++''''PVPV)Y''';e++IIdOOO    $$V,,,,,    $$V,,,, \ e,,F L  V $ $ $  ! ! # # #[[]]FV####FF%U###{%'' ('Js /A#G0G2c2||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)rwrQs r put_nowaitzLightQueue.put_nowaits urc|r/|jr||S|st jt urm|jr_|j}|r=|||r|S|j_t|rt}t|t} |j ||jr| ||j ||S#|xYw#|j ||wxYwt)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). )r^rDr`rNrrrrmr-r rrrCror6rrrq)rrsrtputterrvs rgetzLightQueue.get!s ::<< | (%%'''99;;  799-==, +))+++MM&)))zz||+#yy{{* , + K  XXFgu--G !   (((<,))+++!;;==  $$V,,,    ))+++ $$V,,,    Ks:5F 0E22F  F 0F<c,|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)r|rs r get_nowaitzLightQueue.get_nowaitKs xxrcz |rs|jrl|j}|rO |}||n#|jt jYnxYwn|jr|jr|j}|r|j}|rg|j }t|_ | ||}||||n|j |n|jrZ|js$|j ||j kr/|j}||nu|jrm|jsfd|jD}|snU|D]N}|j|td|jjt$Onn%d|_dS#d|_wxYw)NTc g|] }|j | Sr=)rs).0ps r z&LightQueue._unlock..ssCCC!17CACCCrr)r^rCrmrNr-r3sysexc_inforDrRrprSrorArrrschedule_call_globalrr rE)rrurRr{rks r_unlockzLightQueue._unlockSsW) && ::<<%DL%!\--//F00#'99;;D#MM$////:(FL#,..9999 0\dl!\--//F 5!%!1!1!3!3! 5#);D*/FK IIdOOO#'99;;D"MM$///"MM&1111 L,,V444\t|'+|';'+zz||dl'B'B!\--//FMM&))))\ $, CCt|CCCD"&<< ,,V444 66v4d<<<<< M& P"&D   D  % % % %s#7H1A%H1%BF&H11 H:cp|j.td|j|_dSdSr@)rErrrrs rr`zLightQueue._schedule_unlocks7   %!(!?!?4` 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 timesrN)r ValueErrorrsendrs r task_donezQueue.task_donese  A % %@AA A "  A % % JOOD ! ! ! ! ! & %rcR|jdkr|jdSdS)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)rrr6rs rjoinz Queue.joins2  1 $ $ JOO      % $rr) r!r7r8r9rrVrSrrrr=rrrrs}        """$     rrc@eZdZdZdZejfdZejfdZ dS)rzA subclass of :class:`Queue` that retrieves entries in priority order (lowest first). Entries are typically tuples of the form: ``(priority number, data)``. cg|_dSrrKrGs rrFzPriorityQueue._init  rcP||j||dSr)rKr)rrRheappushs rrSzPriorityQueue._puts.T""" rc"||jSrr)rheappops rrNzPriorityQueue._getswtz"""rN) r!r7r8r9rFheapqrrSrrNr=rrrrsc #(.    !=######rrc$eZdZdZdZdZdZdS)r zNA subclass of :class:`Queue` that retrieves most recently added entries first.cg|_dSrrrGs rrFzLifoQueue._initrrcb|j||dSr)rKrPrrQs rrSzLifoQueue._puts0 $ rc4|jSr)rKrmrs rrNzLifoQueue._getsz~~rN)r!r7r8r9rFrSrNr=rrr r sGXX        rr )r9rIrrr/reventlet.eventreventlet.greenthreadr eventlet.hubsrrK Stdlib_Queueeventlet.timeoutr__all__objectrpr r rr rnrrr r=rrrs.(  ++++++!!!!!!$$$$$$ Q P PO!O!O!O!O!O!O!O!dx<x<x<x<x<x<x<x