�
h 0i�+ � � � d Z ddlZddlmZ ddlmZ ddlmZ erddlmZ g d�Z G d� d e � Z
G d
� d e � Z G d � d
� Z y)a�
A fork of Python 3.6's stdlib queue (found in Pythons 'cpython/Lib/queue.py')
with Lock swapped out for RLock to avoid a deadlock while garbage collecting.
https://github.com/python/cpython/blob/v3.6.12/Lib/queue.py
See also
https://codewithoutrules.com/2017/08/16/concurrency-python/
https://bugs.python.org/issue14976
https://github.com/sqlalchemy/sqlalchemy/blob/4eb747b61f0c1b1c25bdee3856d7195d10a0c227/lib/sqlalchemy/queue.py#L1
We also vendor the code to evade eventlet's broken monkeypatching, see
https://github.com/getsentry/sentry-python/pull/484
Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020 Python Software Foundation;
All Rights Reserved
PYTHON SOFTWARE FOUNDATION LICENSE VERSION 2
--------------------------------------------
1. This LICENSE AGREEMENT is between the Python Software Foundation
("PSF"), and the Individual or Organization ("Licensee") accessing and
otherwise using this software ("Python") in source or binary form and
its associated documentation.
2. Subject to the terms and conditions of this License Agreement, PSF hereby
grants Licensee a nonexclusive, royalty-free, world-wide license to reproduce,
analyze, test, perform and/or display publicly, prepare derivative works,
distribute, and otherwise use Python alone or in any derivative version,
provided, however, that PSF's License Agreement and PSF's notice of copyright,
i.e., "Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020 Python Software Foundation;
All Rights Reserved" are retained in Python alone or in any derivative version
prepared by Licensee.
3. In the event Licensee prepares a derivative work that is based on
or incorporates Python or any part thereof, and wants to make
the derivative work available to others as provided herein, then
Licensee hereby agrees to include in any such work a brief summary of
the changes made to Python.
4. PSF is making Python available to Licensee on an "AS IS"
basis. PSF MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR
IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, PSF MAKES NO AND
DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS
FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF PYTHON WILL NOT
INFRINGE ANY THIRD PARTY RIGHTS.
5. PSF SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON
FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS
A RESULT OF MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON,
OR ANY DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF.
6. This License Agreement will automatically terminate upon a material
breach of its terms and conditions.
7. Nothing in this License Agreement shall be deemed to create any
relationship of agency, partnership, or joint venture between PSF and
Licensee. This License Agreement does not grant permission to use PSF
trademarks or trade name in a trademark sense to endorse or promote
products or services of Licensee, or any third party.
8. By copying, installing or otherwise using Python, Licensee
agrees to be bound by the terms and conditions of this License
Agreement.
� N)�deque)�time)�
TYPE_CHECKING)�Any)�
EmptyError� FullError�Queuec � � e Zd ZdZy)r z4Exception raised by Queue.get(block=0)/get_nowait().N��__name__�
__module__� __qualname__�__doc__� � �@/opt/hc_python/lib/python3.12/site-packages/sentry_sdk/_queue.pyr r W � � �:�r r c � � e Zd ZdZy)r z4Exception raised by Queue.put(block=0)/put_nowait().Nr r r r r r ] r r r c �j � e Zd ZdZdd�Zd� Zd� Zd� Zd� Zd� Z dd �Z
dd
�Z d � Z d � Z
d
� Zd� Zd� Zd� Zy)r zjCreate a queue object with a given maximum size.
If maxsize is <= 0, the queue size is infinite.
c �L � || _ | j |� t j � | _ t j
| j � | _ t j
| j � | _ t j
| j � | _ d| _ y )Nr )
�maxsize�_init� threading�RLock�mutex� Condition� not_empty�not_full�all_tasks_done�unfinished_tasks��selfr s r �__init__zQueue.__init__i sv � � �� � �
�
�7�� �_�_�&��
� #�,�,�T�Z�Z�8��� "�+�+�D�J�J�7��
� (� 1� 1�$�*�*� =��� !�� r c �� � | j 5 | j dz
}|dk r*|dk r t d� �| j j � || _ ddd� y# 1 sw Y yxY w)a. Indicate that a formerly enqueued task is complete.
Used by Queue consumer threads. For each get() used to fetch a task,
a subsequent call to task_done() tells the queue that the processing
on the task is complete.
If a join() is currently blocking, it will resume when all items
have been processed (meaning that a task_done() call was received
for every item that had been put() into the queue).
Raises a ValueError if called more times than there were items
placed in the queue.
� r z!task_done() called too many timesN)r r �
ValueError�
notify_all)r" �
unfinisheds r � task_donezQueue.task_done� s] � � �
�
� �.�.��2�J��Q�� ��>�$�%H�I�I��#�#�.�.�0�$.�D� !�
!�
�
�s �AA � A%c � � | j 5 | j r'| j j � | j r�'ddd� y# 1 sw Y yxY w)a� Blocks 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 task_done()
to indicate the item was retrieved and all work on it is complete.
When the count of unfinished tasks drops to zero, join() unblocks.
N)r r �wait�r" s r �joinz
Queue.join� s? � � �
�
��'�'��#�#�(�(�*� �'�'� !�
�
�s �3A
�
Ac �f � | j 5 | j � cddd� S # 1 sw Y yxY w)z9Return the approximate size of the queue (not reliable!).N�r �_qsizer, s r �qsizez Queue.qsize� s � �
�Z�Z��;�;�=� �Z�Z�s �'�0c �h � | j 5 | j � cddd� S # 1 sw Y yxY w)a� Return True if the queue is empty, False otherwise (not reliable!).
This method is likely to be removed at some point. Use qsize() == 0
as a direct substitute, but be aware that either approach risks a race
condition where a queue can grow before the result of empty() or
qsize() can be used.
To create code that needs to wait for all queued tasks to be
completed, the preferred technique is to use the join() method.
Nr/ r, s r �emptyz Queue.empty� s! � � �Z�Z��{�{�}�$� �Z�Z�s �(�1c � � | j 5 d| j cxk xr | j � k nc cddd� S # 1 sw Y yxY w)aO Return True if the queue is full, False otherwise (not reliable!).
This method is likely to be removed at some point. Use qsize() >= n
as a direct substitute, but be aware that either approach risks a race
condition where a queue can shrink before the result of full() or
qsize() can be used.
r N)r r r0 r, s r �fullz
Queue.full� s, � � �Z�Z��t�|�|�4�t�{�{�}�4� �Z�Z�s �(?�ANc � � | j 5 | j dkD �r|s'| j � | j k\ r�t � �|�V| j � | j k\ r�| j j � | j � | j k\ r�8n�|dk r t d� �t
� |z }| j � | j k\ rU|t
� z
}|dk r
t � �| j j |� | j � | j k\ r�U| j |� | xj dz
c_ | j j � ddd� y# 1 sw Y yxY w)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 non-negative number, it blocks at most 'timeout' seconds and raises
the FullError 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 FullError exception ('timeout'
is ignored in that case).
r N�''timeout' must be a non-negative number� r% ) r r r0 r r+ r& r �_putr r �notify)r" �item�block�timeout�endtime� remainings r �putz Queue.put� s � � �]�]��|�|�a� � ��{�{�}�� � �4� '�k�)� �_� �+�+�-�4�<�<�7� �
�
�*�*�,� �+�+�-�4�<�<�7� �q�[�$�%N�O�O� "�f�w� .�G� �+�+�-�4�<�<�7�$+�d�f�$4� �$��+�"+�+� -� �
�
�*�*�9�5� �+�+�-�4�<�<�7�
�I�I�d�O� � !� !�Q� &� !� �N�N� !� !� #�' �]�]�s �BE7� BE7�.A E7�7F c �< � | j 5 |s| j � s�t � �|�<| j � s�| j j � | j � s�+nu|dk r t d� �t � |z }| j � sH|t � z
}|dk r
t � �| j j |� | j � s�H| j
� }| j j � |cddd� S # 1 sw Y yxY w)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 non-negative number, it blocks at most 'timeout' seconds and raises
the EmptyError exception if no item was available within that time.
Otherwise ('block' is false), return an item if one is immediately
available, else raise the EmptyError exception ('timeout' is ignored
in that case).
Nr r7 r8 ) r r0 r r+ r& r �_getr r: )r" r< r= r> r? r; s r �getz Queue.get� s� � � �^�^���{�{�}�$�,�&�� � �+�+�-��N�N�'�'�)� �+�+�-��1�� �!J�K�K� �&�7�*�� �+�+�-� '�$�&� 0�I� �C�'� (�l�*��N�N�'�'� �2� �+�+�-�
�9�9�;�D� �M�M� � � "��% �^�^�s �AD�'A5D� +D�Dc �( � | j |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 FullError exception.
F�r< )r@ �r" r; s r �
put_nowaitzQueue.put_nowait s � � �x�x��E�x�*�*r c �& � | j 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 EmptyError exception.
FrE )rC r, s r �
get_nowaitzQueue.get_nowait s � � �x�x�e�x�$�$r c �" � t � | _ y �N)r �queuer! s r r z Queue._init s � ��W��
r c �, � t | j � S rK )�lenrL r, s r r0 z Queue._qsize s � ��4�:�:�� r c �: � | j j |� y rK )rL �appendrF s r r9 z
Queue._put s � � �
�
���$� r c �6 � | j j � S rK )rL �popleftr, s r rB z
Queue._get s � ��z�z�!�!�#�#r )r )TN)r r
r r r# r) r- r1 r3 r5 r@ rC rG rI r r0 r9 rB r r r r r c sN � ��
"�./�, +�!�
%� 5� $�@ �>+�%� � � �$r r )
r r � collectionsr r �typingr r �__all__� Exceptionr r r r r r �<module>rW sI ��G�R � � � ���
.�� �� � � � � ~$� ~$r