관리-도구
편집 파일: queue.cpython-38.pyc
U -?�f�' � @ 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 d�ZdddgZG dd� de�ZG dd� de�ZG 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 �E/opt/hc_python/lib64/python3.8/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!ddd�dd �Zdd �d d �Zdd �d d�Zdd �dd�Zddd�dd�Zd"ddddd�dd�Z 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__< � 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 �fullA s zQueueCommon.fullc C s t � �d S r! r( r* r r r �qsizeD s zQueueCommon.qsizer �None��itemr' c C s t � �d S r! r( �r# r0 r r r � put_nowaitG s zQueueCommon.put_nowaitTN�Optional[float]�r0 �block�timeoutr' c C s t � �d S r! r( )r# r0 r5 r6 r r r �putJ s zQueueCommon.putc C s t � �d S r! r( r* r r r � get_nowaitO s zQueueCommon.get_nowait�r5 r6 r' c C s t � �d S r! r( )r# r5 r6 r r r �getR s zQueueCommon.get)r F)TN)TN) r r r �__annotations__r$ r+ r, r- r2 r7 r8 r: r r r r r 8 s �r c @ s� e Zd ZU ded< d.ddd�dd �Zdd �d d �Zdd �d d�Zdd �dd�Zd/ddddd�dd�Zddd�dd�Z d0dddd �d d �Z dd �d d �Z ddd!�d"d#�Z dd �d$d%�Z dd �d&d'�Zdd �d(d)�Zddd�d*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$ Y 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- p 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+ v 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 r3 r. r4 c C s� | j �� |s| �� r~t�nd|dkr8| �� r~| j �� q"nF|dk rHtd��t� | }| �� 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� ) rC rF r �wait� ValueError�_time�_putrB �notify)r# r0 r5 r6 �endtime� remainingr r r r7 � s" z Queue.putr/ c C s | � |d�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)r7 r1 r r r r2 � s zQueue.put_nowaitr9 c C s� | j �� |s| �� r~t�nd|dkr8| �� r~| j �� q"nF|dk rHtd��t� | }| �� 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 rG rH ) rB rE r rI rJ rK �_getrC rM )r# r5 r6 rN rO r0 r r r r: � 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)r: r* r r r r8 � 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 | j�S r! )�lenr< r* r r r rD � s z Queue._qsizec C s | j S r! )r< r* r r r rE � s z Queue._emptyc C s | j dkot| j�| j kS )Nr )r rQ r< r* r r r rF � s z Queue._fullc C s | j �|� d S r! )r< �appendr1 r r r rL � s z Queue._putc C s | j r| j�� S | j�� S d S r! )r r< �pop�popleftr* r r r rP � s z Queue._get)r F)TN)TN)r r r r; r$ r- r+ r, r7 r2 r: r8 r= rD rE rF rL rP r r r r r V s" �" c @ s� e Zd Zejr$eddd�dd��Znee�Zd&dd d �d d �Zd d �dd�Z dd� Z dd� Z e dd �dd��Z ddd�dd�Zd'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 )rV 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! )rX r, r* r r r r, s zAsyncAdaptedQueue.fullc C s | j �� S r! )rX 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 rX s zAsyncAdaptedQueue._queuer. r/ c C sB z| j �|� W n, tjk r< } z t� |�W 5 d }~X Y nX d S r! )rX r2 rY � QueueFullr )r# r0 �errr r r r2 s z AsyncAdaptedQueue.put_nowaitTNr3 r4 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! ) r2 rW rY �wait_forrX r7 r[ � TimeoutErrorr )r# r0 r5 r6 r\ r r r r7 s zAsyncAdaptedQueue.putc C s> z | j �� W S tjk r8 } z t� |�W 5 d }~X Y nX d S r! )rX r8 rY � QueueEmptyr )r# r\ r r r r8 + s z AsyncAdaptedQueue.get_nowaitr9 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! ) r8 rW rY r] rX r: r_ r^ r )r# r5 r6 r\ r r r r: 1 s �zAsyncAdaptedQueue.get)r F)TN)TN)r r r �typing� TYPE_CHECKING� staticmethodrW r r$ r+ r, r- r rX r2 r7 r8 r: r r r r rU � s �rU c @ s e Zd Zejsee�ZdS )�FallbackAsyncAdaptedQueueN)r r r r` ra rb r rW r r r r rc @ s rc ) r � __future__r rY � collectionsr r> r rK r` r r r r r r Z concurrencyr r Z langhelpersr r �__all__� Exceptionr r r r rU rc r r r r �<module> s0 P