o g'@s4dZddlmZddlZddlmZddlZddlmZddl Z ddl m Z ddl m Z ddl m Z dd l m Z dd l mZdd l mZd d lmZd dlmZd dlmZede dZgdZGdddeZGdddeZGddde eZGdddeeZGdddeeZGdddeeZdS)aAn adaptation of Py2.3/2.4's Queue module which supports reentrant behavior, using RLock instead of Lock for its mutex object. The Queue object is used exclusively by the sqlalchemy.pool.QueuePool class. This is to support the connection pool's usage of weakref callbacks to return connections to the underlying Queue, which can in extremely rare cases be invoked within the ``get()`` method of the Queue itself, producing a ``put()`` inside the ``get()`` and therefore a reentrant condition. ) annotationsN)deque)time)Any) Awaitable)Deque)Generic)Optional)TypeVar)await_fallback) await_only)memoized_property_T)bound)EmptyFullQueuec@eZdZdZdS)rz4Exception raised by Queue.get(block=0)/get_nowait().N__name__ __module__ __qualname____doc__rrW/var/www/html/ecg_monitoring/venv/lib/python3.10/site-packages/sqlalchemy/util/queue.pyr,rc@r)rz4Exception raised by Queue.put(block=0)/put_nowait().Nrrrrrr2rrc@sveZdZUded<ded<d d!ddZd"d d Zd"d d Zd#ddZd$ddZ d%d&ddZ d'ddZ d%d(ddZ dS)) QueueCommonintmaxsizebooluse_liforFcCdSNrselfrr!rrr__init__<szQueueCommon.__init__returncCtr#NotImplementedErrorr%rrrempty>zQueueCommon.emptycCr(r#r)r+rrrfullAr-zQueueCommon.fullcCr(r#r)r+rrrqsizeDr-zQueueCommon.qsizeitemrNonecCr(r#r)r%r0rrr put_nowaitGr-zQueueCommon.put_nowaitTNblocktimeoutOptional[float]cCr(r#r))r%r0r4r5rrrputJszQueueCommon.putcCr(r#r)r+rrr get_nowaitOr-zQueueCommon.get_nowaitcCr(r#r))r%r4r5rrrgetRr-zQueueCommon.getrFrrr!r r'r r'rr0rr'r1TNr0rr4r r5r6r'r1r'rr4r r5r6r'r) rrr__annotations__r&r,r.r/r3r7r8r9rrrrr8s       rc@seZdZUded<d.d/d d Zd0d d Zd1ddZd1ddZ d2d3ddZd4ddZ d2d5ddZ d6d d!Z d7d"d#Z d0d$d%Z d1d&d'Zd1d(d)Zd4d*d+Zd6d,d-ZdS)8rz Deque[_T]queuerFrrr!r cCs:||t|_t|j|_t|j|_||_dS)zInitialize a queue object with a given maximum size. If `maxsize` is <= 0, the queue size is infinite. If `use_lifo` is True, this Queue acts like a Stack (LIFO). N)_init threadingRLockmutex Condition not_emptynot_fullr!r$rrrr&Ys   zQueue.__init__r'cC2|j |WdS1swYdS)z9Return the approximate size of the queue (not reliable!).N)rH_qsizer+rrrr/ps$z Queue.qsizecCrL)zKReturn True if the queue is empty, False otherwise (not reliable!).N)rH_emptyr+rrrr,v$z Queue.emptycCrL)zJReturn True if the queue is full, False otherwise (not reliable!).N)rH_fullr+rrrr.}rOz Queue.fullTNr0rr4r5r6r1cCs|jT|s |r tn8|dur|r|j|sn&|dkr'tdt|}|rE|t}|dkr;t|j||s0|||jWddS1sZwYdS)aPut 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). Nr#'timeout' must be a positive number) rKrPrwait ValueError_time_putrJnotify)r%r0r4r5endtime remainingrrrr7s,      "z Queue.putcCs ||dS)zPut an item into the queue without blocking. Only enqueue the item if a free slot is immediately available. Otherwise raise the ``Full`` exception. F)r7r2rrrr3s zQueue.put_nowaitcCs|jT|s |r tn8|dur|r|j|sn&|dkr'tdt|}|rE|t}|dkr;t|j||s0|}|j|WdS1sZwYdS)a 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). NrrQrR) rJrNrrSrTrU_getrKrW)r%r4r5rXrYr0rrrr9s.      $z Queue.getcCs |dS)zRemove and return an item from the queue without blocking. Only get an item if one is immediately available. Otherwise raise the ``Empty`` exception. F)r9r+rrrr8s zQueue.get_nowaitcCs||_t|_dSr#)rrrD)r%rrrrrEs z Queue._initcCs t|jSr#)lenrDr+rrrrM z Queue._qsizecCs|j Sr#)rDr+rrrrNsz Queue._emptycCs|jdko t|j|jkS)Nr)rr[rDr+rrrrPsz Queue._fullcCs|j|dSr#)rDappendr2rrrrVsz Queue._putcCs|jr|jS|jSr#)r!rDpoppopleftr+rrrrZs  z Queue._getr:r;r=r<r?r@r>rBrA)rrr'r1)rrrrCr&r/r,r.r7r3r9r8rErMrNrPrVrZrrrrrVs"      "     rc@seZdZejred'ddZneeZd(d)d dZd*ddZ ddZ ddZ e d+ddZ d,ddZ d-d.d!d"Zd/d#d$Zd-d0d%d&ZdS)1AsyncAdaptedQueue coroutineAwaitable[Any]r'rcCr"r#r)rarrrawait_szAsyncAdaptedQueue.await_rFrrr!r cCs||_||_dSr#)r!rr$rrrr&s zAsyncAdaptedQueue.__init__cC |jSr#)_queuer,r+rrrr,r\zAsyncAdaptedQueue.emptycCrdr#)rer.r+rrrr.r\zAsyncAdaptedQueue.fullcCrdr#)rer/r+rrrr/r\zAsyncAdaptedQueue.qsizeasyncio.Queue[_T]cCs*|jr tj|jd}|Stj|jd}|S)N)r)r!asyncio LifoQueuerr)r%rDrrrres  zAsyncAdaptedQueue._queuer0r1c Cs6z |j|WdStjy}zt|d}~wwr#)rer3rg QueueFullr)r%r0errrrrr3s zAsyncAdaptedQueue.put_nowaitTNr4r5r6c Csx|s||Sz |dur|t|j||WdS||j|WdStjtjfy;}zt|d}~wwr#) r3rcrgwait_forrer7ri TimeoutErrorr)r%r0r4r5rjrrrr7s  zAsyncAdaptedQueue.putc Cs0z|jWStjy}zt|d}~wwr#)rer8rg QueueEmptyr)r%rjrrrr8+s  zAsyncAdaptedQueue.get_nowaitc Csj|s|Sz|dur|t|j|WS||jWStjtjfy4}zt|d}~wwr#) r8rcrgrkrer9rmrlr)r%r4r5rjrrrr91szAsyncAdaptedQueue.get)rarbr'rr:r;r<)r'rfr>r?r@rArB)rrrtyping TYPE_CHECKING staticmethodrcr r&r,r.r/rrer3r7r8r9rrrrr`s      r`c@seZdZejs eeZdSdS)FallbackAsyncAdaptedQueueN)rrrrnrorpr rcrrrrrq@s rq)r __future__rrg collectionsrrFrrUrnrrrrr r concurrencyr r langhelpersrr__all__ Exceptionrrrrr`rqrrrrs2             P