mirror of
https://github.com/CCOSTAN/Home-AssistantConfig.git
synced 2026-02-15 07:50:29 +00:00
63 lines
6.0 KiB
Plaintext
63 lines
6.0 KiB
Plaintext
|
<EFBFBD>
|
|||
|
|
}<7D><>W<EFBFBD> <00> @ s<> d Z d d l m Z d d l m Z d d l m Z d d d g Z Gd d <00> d e <00> Z Gd
|
|||
|
|
d <00> d e <00> Z
|
|||
|
|
Gd d <00> d <00> Z d S)
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.
|
|||
|
|
|
|||
|
|
<EFBFBD> )<01>deque)<01>time<6D> )<01> threading<6E>Empty<74>Full<6C>Queuec @ s e Z d Z d Z d S)r z4Exception raised by Queue.get(block=0)/get_nowait().N)<04>__name__<5F>
|
|||
|
|
__module__<EFBFBD> __qualname__<5F>__doc__<5F> r
r
<00>;/tmp/pip-build-zkr322cu/sqlalchemy/sqlalchemy/util/queue.pyr s c @ s e Z d Z d Z d S)r z4Exception raised by Queue.put(block=0)/put_nowait().N)r r
|
|||
|
|
r r r
r
r
r r # s c @ s<> e Z d Z d d d <00> Z d d <00> Z d d <00> Z d d <00> Z d
|
|||
|
|
d d d
<00> Z d d <00> Z d
|
|||
|
|
d d d <00> Z d d <00> Z
|
|||
|
|
d d <00> Z d d <00> Z d d <00> Z
d d <00> Z d d <00> Z d d <00> Z d S) r r c C sJ | j | <00> t j <00> | _ t j | j <00> | _ t j | j <00> | _ d S)zxInitialize a queue object with a given maximum size.
|
|||
|
|
|
|||
|
|
If `maxsize` is <= 0, the queue size is infinite.
|
|||
|
|
N)<07>_initr <00>RLock<63>mutex<65> Condition<6F> not_empty<74>not_full)<02>self<6C>maxsizer
r
r <00>__init__* s
zQueue.__init__c C s* | j j <00> | j <00> } | j j <00> | S)z9Return the approximate size of the queue (not reliable!).)r <00>acquire<72>_qsize<7A>release)r <00>nr
r
r <00>qsize= s
z Queue.qsizec C s* | j j <00> | j <00> } | j j <00> | S)zKReturn True if the queue is empty, False otherwise (not
|
|||
|
|
reliable!).)r r <00>_emptyr )r r r
r
r <00>emptyE s
z Queue.emptyc C s* | j j <00> | j <00> } | j j <00> | S)zJReturn True if the queue is full, False otherwise (not
|
|||
|
|
reliable!).)r r <00>_fullr )r r r
r
r <00>fullN s
z
|
|||
|
|
Queue.fullTNc
|
|||
|
|
C s<> | j j <00> z<> | s. | j <00> r<> t <00> q<> n<> | d k r] x<> | j <00> rY | j j <00> q= Wnm | d k rx t d <00> <00> n t <00> | } xB | j <00> r<> | t <00> } | d k r<> t <00> n | j j | <00> q<> W| j | <00> | j j <00> Wd | j j
|
|||
|
|
<00> Xd S)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 z#'timeout' must be a positive numberg ) r r r r <00>wait<69>
|
|||
|
|
ValueError<EFBFBD>_time<6D>_putr <00>notifyr )r <00>item<65>block<63>timeout<75>endtime<6D> remainingr
r
r <00>putW s&
z Queue.putc C s | j | d <00> S)z<>Put an item into the queue without blocking.
|
|||
|
|
|
|||
|
|
Only enqueue the item if a free slot is immediately available.
|
|||
|
|
Otherwise raise the ``Full`` exception.
|
|||
|
|
F)r+ )r r& r
r
r <00>
|
|||
|
|
put_nowaitz s zQueue.put_nowaitc
|
|||
|
|
C s<> | j j <00> z<> | s. | j <00> r<> t <00> q<> n<> | d k r] x<> | j <00> rY | j j <00> q= Wnm | d k rx t d <00> <00> n t <00> | } xB | j <00> r<> | t <00> } | d k r<> t <00> n | j j | <00> q<> W| j <00> } | j j <00> | SWd | j j
|
|||
|
|
<00> Xd S)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 z#'timeout' must be a positive numberg ) r r r r r! r" r# <00>_getr r% r )r r' r( r) r* r& r
r
r <00>get<65> s(
z Queue.getc C s
| j d <00> 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)r. )r r
r
r <00>
|
|||
|
|
get_nowait<EFBFBD> s zQueue.get_nowaitc C s | | _ t <00> | _ d S)N)r r <00>queue)r r r
r
r r <00> s z Queue._initc C s
t | j <00> S)N)<02>lenr0 )r r
r
r r <00> s z Queue._qsizec C s | j S)N)r0 )r r
r
r r <00> s z Queue._emptyc C s% | j d k o$ t | j <00> | j k S)Nr )r r1 r0 )r r
r
r r <00> s z Queue._fullc C s | j j | <00> d S)N)r0 <00>append)r r& r
r
r r$ <00> s z
|
|||
|
|
Queue._putc C s
| j j <00> S)N)r0 <00>popleft)r r
r
r r- <00> s z
|
|||
|
|
Queue._get)r r
|
|||
|
|
r r r r r r+ r, r. r/ r r r r r$ r- r
r
r
r r ) s # " N) r <00> collectionsr r r# <00>compatr <00>__all__<5F> Exceptionr r r r
r
r
r <00><module> s
|