U
|
¸ý°d!) ã @ s6 d Z ddlmZ ddlZddlmZ ddlZddlmZ ddl Z ddl m
|
Z
|
ddl m Z ddl m Z dd l m Z dd
|
l mZ dd l mZ d d lmZ d dlmZ d dlmZ ede
|
dZdddgZG dd deZG dd deZG dd de e ZG dd dee ZG dd dee Z G d d d e e Z dS ) að An 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ÚEmptyÚFullÚQueuec @ s e Zd ZdZdS )r z4Exception raised by Queue.get(block=0)/get_nowait().N©Ú__name__Ú
|
__module__Ú __qualname__Ú__doc__© r r úLd:\z\workplace\vscode\pyvenv\venv\Lib\site-packages\sqlalchemy/util/queue.pyr , s c @ s e Zd ZdZdS )r z4Exception raised by Queue.put(block=0)/put_nowait().Nr r r r r r 2 s c @ s¢ e Zd ZU ded< ded< d!ddddd Zdd
|
d d Zdd
|
d dZdd
|
ddZdddddZd"dddddddZ dd
|
d d Z
|
d#dddd d d Z dS )$Ú QueueCommonÚintÚmaxsizeÚboolÚuse_lifor F©r r c C s d S ©Nr ©Úselfr r r r r Ú__init__< s zQueueCommon.__init__©Úreturnc C s
|
t d S r! ©ÚNotImplementedError©r# r r r Úempty? s zQueueCommon.emptyc C s
|
t d S r! r' r) r r r ÚfullB s zQueueCommon.fullc C s
|
t d S r! r' r) r r r ÚqsizeE s zQueueCommon.qsizer ÚNone©Úitemr& c C s
|
t d S r! r' ©r# r/ r r r Ú
|
put_nowaitH s zQueueCommon.put_nowaitTNúOptional[float]©r/ ÚblockÚtimeoutr& c C s
|
t d S r! r' )r# r/ r4 r5 r r r ÚputK s zQueueCommon.putc C s
|
t d S r! r' r) r r r Ú
|
get_nowaitP s zQueueCommon.get_nowait©r4 r5 r& c C s
|
t d S r! r' )r# r4 r5 r r r ÚgetS s zQueueCommon.get)r F)TN)TN) r r r Ú__annotations__r$ r* r+ r, r1 r6 r7 r9 r r r r r 8 s
|
ÿr c @ sò e Zd ZU ded< d.ddddd Zdd
|
d d Zdd
|
d dZdd
|
ddZd/dddddddZdddddZ d0dddd d d Z
|
dd
|
d d Z ddd!d"d#Z dd
|
d$d%Z dd
|
d&d'Zdd
|
d(d)Zdddd*d+Zdd
|
d,d-ZdS )1r z Deque[_T]Úqueuer Fr r r c C s: | |¡ t ¡ | _t | j¡| _t | j¡| _|| _dS )z½Initialize 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Ú threadingÚRLockÚmutexÚ ConditionÚ not_emptyÚnot_fullr r" r r r r$ Z s
|
|
|
zQueue.__init__r% c
|
C s& | j | ¡ W 5 Q R £ S Q R X dS )z9Return the approximate size of the queue (not reliable!).N)r? Ú_qsizer) r r r r, q s z Queue.qsizec
|
C s& | j | ¡ W 5 Q R £ S Q R X dS )zKReturn True if the queue is empty, False otherwise (not
|
reliable!).N)r? Ú_emptyr) r r r r* w s z Queue.emptyc
|
C s& | j | ¡ W 5 Q R £ S Q R X dS )zJReturn True if the queue is full, False otherwise (not
|
reliable!).N)r? Ú_fullr) r r r r+ ~ s z
|
Queue.fullTNr r2 r- r3 c C s | j |s| ¡ r~tnd|dkr8| ¡ r~| j ¡ q"nF|dk rHtdt | }| ¡ r~|t }|dkrpt| j |¡ qR| |¡ | j ¡ W 5 Q R X dS )a 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).
|
Nr ú#'timeout' must be a positive numberç ) rB rE r ÚwaitÚ
|
ValueErrorÚ_timeÚ_putrA Únotify)r# r/ r4 r5 ÚendtimeÚ remainingr r r r6
s"
|
|
|
z Queue.putr. c C s | |d¡S )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)r6 r0 r r r r1 § s zQueue.put_nowaitr8 c
|
C sª | j |s| ¡ r~tnd|dkr8| ¡ r~| j ¡ q"nF|dk rHtdt | }| ¡ r~|t }|dkrpt| j |¡ qR| ¡ }| j ¡ |W 5 Q R £ S Q R X dS )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).
|
|
Nr rF rG ) rA rD r rH rI rJ Ú_getrB rL )r# r4 r5 rM rN r/ r r r r9 ¯ s$
|
|
|
z Queue.getc C s
|
| d¡S )z¯Remove and return an item from the queue without blocking.
|
|
Only get an item if one is immediately available. Otherwise
|
raise the ``Empty`` exception.
|
F)r9 r) r r r r7 Ï s zQueue.get_nowait)r r& c C s || _ t | _d S r! )r r r; )r# r r r r r< Ø s z Queue._initc C s
|
t | jS r! )Úlenr; r) r r r rC Ü s z Queue._qsizec C s | j S r! )r; r) r r r rD ß s z Queue._emptyc C s | j dkot| j| j kS )Nr )r rP r; r) r r r rE â s z Queue._fullc C s | j |¡ d S r! )r; Úappendr0 r r r rK å s z
|
Queue._putc C s | j r| j ¡ S | j ¡ S d S r! )r r; ÚpopÚpopleftr) r r r rO è s
|
z
|
Queue._get)r F)TN)TN)r r r r: r$ r, r* r+ r6 r1 r9 r7 r< rC rD rE rK rO r r r r r W s"
|
ÿ" c @ sº e Zd Zejr$edddddZneeZd&dd d
|
d d Zd d ddZ dd Z
|
dd Z e dd ddZ dddddZd'dd d dd d d Zdd d!d"Zd(d d dd#d$d%Zd S ))ÚAsyncAdaptedQueuezAwaitable[Any]r )Ú coroutiner& c C s d S r! r )rU r r r Úawait_ô s zAsyncAdaptedQueue.await_r Fr r r c C s || _ || _d S r! )r r r" r r r r$ û s zAsyncAdaptedQueue.__init__r% c C s
|
| j ¡ S r! )Ú_queuer* r) r r r r* ÿ s zAsyncAdaptedQueue.emptyc C s
|
| j ¡ S r! )rW r+ r) r r r r+ s zAsyncAdaptedQueue.fullc C s
|
| j ¡ S r! )rW r, r) r r r r, s zAsyncAdaptedQueue.qsizezasyncio.Queue[_T]c C s( | j rtj| jd}ntj| jd}|S )N)r )r ÚasyncioÚ LifoQueuer r )r# r; r r r rW s zAsyncAdaptedQueue._queuer- r. c
|
C sB z| j |¡ W n, tjk
|
r< } z t |W 5 d }~X Y nX d S r! )rW r1 rX Ú QueueFullr )r# r/ Úerrr r r r1 s z AsyncAdaptedQueue.put_nowaitTNr2 r3 c
|
C s |s| |¡S z:|d k r4| t | j |¡|¡¡ n| | j |¡¡ W n2 tjtjfk
|
rz } z t |W 5 d }~X Y nX d S r! ) r1 rV rX Úwait_forrW r6 rZ Ú TimeoutErrorr )r# r/ r4 r5 r[ r r r r6 s
|
zAsyncAdaptedQueue.putc
|
C s> z | j ¡ W S tjk
|
r8 } z t |W 5 d }~X Y nX d S r! )rW r7 rX Ú
|
QueueEmptyr )r# r[ r r r r7 - s z AsyncAdaptedQueue.get_nowaitr8 c
|
C s| |s | ¡ S z8|d k r0| t | j ¡ |¡¡W S | | j ¡ ¡W S W n2 tjtjfk
|
rv } z t |W 5 d }~X Y nX d S r! ) r7 rV rX r\ rW r9 r^ r] r )r# r4 r5 r[ r r r r9 3 s ÿzAsyncAdaptedQueue.get)r F)TN)TN)r r r ÚtypingÚ TYPE_CHECKINGÚ staticmethodrV r r$ r* r+ r, r rW r1 r6 r7 r9 r r r r rT ñ s ÿrT c @ s e Zd ZejseeZdS )ÚFallbackAsyncAdaptedQueueN)r r r r_ r` ra r rV r r r r rb B s rb ) r Ú
|
__future__r rX Ú collectionsr r= r rJ r_ r r r r r r
|
Z concurrencyr r Z langhelpersr r Ú__all__Ú Exceptionr r r r rT rb r r r r Ú<module> s0
|
Q
|
