codekingpro/portable-devtools
114k
1�
2 ��j�2 � � � S r SSKrSSKrSSKrSSKJrJr SSKJrJ r SSK3J r SSK J
r
JrJrJrJr SSK r \ R$ ( a4 SSK JrJrJr \" S5 r/ S Qr " S5 S \5 r " S S
\5 rS\S\
S\\R8 4 SS4S jr " S S\\ 5 r " S S\\ 5 r " S S\ 5 r " S S\ 5 r!g)a� Asynchronous queues for coroutines. These classes are very similar6to those provided in the standard library's `asyncio package7<https://docs.python.org/3/library/asyncio-queue.html>`_.8 9.. warning::10 11 Unlike the standard library's `queue` module, the classes defined here12 are *not* thread-safe. To use these queues from another thread,13 use `.IOLoop.add_callback` to transfer control to the `.IOLoop` thread14 before calling any queue methods.15 16� N)�gen�ioloop)�Future�"future_set_result_unless_cancelled)�Event)�Union�TypeVar�Generic� Awaitable�Optional)�Deque�Tuple�Any�_T)�Queue�
PriorityQueue� LifoQueue� QueueFull�17QueueEmptyc � � \ rS rSrSrSrg)r �/ z:Raised by `.Queue.get_nowait` when the queue has no items.� N��__name__�18__module__� __qualname__�__firstlineno__�__doc__�__static_attributes__r � �TD:\code\apps\devtools\python\user_packages\Python313\site-packages\tornado/queues.pyr r / s � �D�r r c � � \ rS rSrSrSrg)r �5 zBRaised by `.Queue.put_nowait` when a queue is at its maximum size.r Nr r r r! r r 5 s � �L�r r �future�timeout�returnc � ^ ^^� U( aN SU 4S jjn[ R R 5 mTR X5 mT R UU4S j5 g g )Nc �z >� T R 5 ( d% T R [ R " 5 5 g g �N)�done�
set_exceptionr � TimeoutError)r$ s �r! �19on_timeout� _set_timeout.<locals>.on_timeout@ s* �� ��;�;�=�=��$�$�S�%5�%5�%7�8� !r c �& >� TR T5 $ r) )�remove_timeout)�_�io_loop�timeout_handles ��r! �<lambda>� _set_timeout.<locals>.<lambda>F s �� �7�+A�+A�.�+Qr �r& N)r �IOLoop�current� add_timeout�add_done_callback)r$ r% r- r2 r3 s ` @@r! � _set_timeoutr; ; sE �� � � 9� �-�-�'�'�)�� �,�,�W�A��� � �!Q�R� r c �2 � \ rS rSrSS jrS\\ 4S jrSrg)�_QueueIterator�I r& Nc � � Xl g r) ��q)�selfrA s r! �__init__�_QueueIterator.__init__J s � ��r c �6 � U R R 5 $ r) )rA �get�rB s r! � __anext__�_QueueIterator.__anext__M s � ��v�v�z�z�|�r r@ )rA z Queue[_T]r& N) r r r r rC r r rH r r r r! r= r= I s � �� �9�R�=� r r= c �� � \ rS rSrSrSrS S\SS4S jjr\S\4S j5 r S\4S jr20S\ 4S jr S\ 4S21 jr
S S \S \\\\R& 4 SS
4S jjrS \SS4S jr S S \\\\R& 4 S\\ 4S jjrS\4S jrS S jr S S \\\\R& 4 S\S 4S jjrS\\ 4S jr S S jr S\4S jr S \SS4S jr S \SS4S jr S S jr!S\"4S jr#S\"4S jr$S\"4S jr%S r&g)!r �Q a� Coordinate producer and consumer coroutines.22 23If maxsize is 0 (the default) the queue size is unbounded.24 25.. testcode::26 27 import asyncio28 from tornado.ioloop import IOLoop29 from tornado.queues import Queue30 31 q = Queue(maxsize=2)32 33 async def consumer():34 async for item in q:35 try:36 print('Doing work on %s' % item)37 await asyncio.sleep(0.01)38 finally:39 q.task_done()40 41 async def producer():42 for item in range(5):43 await q.put(item)44 print('Put %s' % item)45 46 async def main():47 # Start consumer without waiting (since it never finishes).48 IOLoop.current().spawn_callback(consumer)49 await producer() # Wait for producer to put all tasks.50 await q.join() # Wait for consumer to finish all tasks.51 print('Done')52 53 asyncio.run(main())54 55.. testoutput::56 57 Put 058 Put 159 Doing work on 060 Put 261 Doing work on 162 Put 363 Doing work on 264 Put 465 Doing work on 366 Doing work on 467 Done68 69 70In versions of Python without native coroutines (before 3.5),71``consumer()`` could be written as::72 73 @gen.coroutine74 def consumer():75 while True:76 item = yield q.get()77 try:78 print('Doing work on %s' % item)79 yield gen.sleep(0.01)80 finally:81 q.task_done()82 83.. versionchanged:: 4.384 Added ``async for`` support in Python 3.5.85 86N�maxsizer& c �: � Uc [ S5 eUS: a [ S5 eXl U R 5 [ R87 " / 5 U l [ R88 " / 5 U l SU l [ 5 U l89 U R R 5 g )Nzmaxsize can't be Noner zmaxsize can't be negative) � TypeError�90ValueError�_maxsize�_init� collections�deque�_getters�_putters�_unfinished_tasksr � _finished�set)rB rL s r! rC �Queue.__init__� sy � � �?�� 3�4� 4� �Q�;� � 8�9� 9� �
� �91�92� �#�)�)�"�-��
�#�)�)�"�-��
�!"�� � ���� ����� r c � � U R $ )z%Number of items allowed in the queue.)rP rG s r! rL �
Queue.maxsize� s � � �}�}� r c �, � [ U R 5 $ )z Number of items in the queue.)�len�_queuerG s r! �qsize� Queue.qsize� s � ��4�;�;� � r c �$ � U R ( + $ r) �r^ rG s r! �empty� Queue.empty� s � ��;�;�� r c �^ � U R S:X a gU R 5 U R :� $ )Nr F)rL r_ rG s r! �full�93Queue.full� s& � � �<�<�1� ���:�:�<�4�<�<�/� /r �itemr% z Future[None]c �� � [ 5 n U R U5 UR S5 U$ ! [ a+ U R R X45 [
X25 U$ f = f)aT Put an item into the queue, perhaps waiting until there is room.94 95Returns a Future, which raises `tornado.util.TimeoutError` after a96timeout.97 98``timeout`` may be a number denoting a time (on the same99scale as `tornado.ioloop.IOLoop.time`, normally `time.time`), or a100`datetime.timedelta` object for a deadline relative to the101current time.102N)r �103put_nowait�104set_resultr rU �appendr; )rB rh r% r$ s r! �put� Queue.put� se � � ��� $� �O�O�D� !�105
� � �d� #��
�� � *� �M�M� � �$� � 0� �� )� �
� *�s �0 �1A%�$A%c �` � U R 5 U R ( aa U R 5 ( d S5 eU R R 5 nU R U5 [ X R
5 5 gU R 5 ( a [ eU R U5 g)zkPut an item into the queue without blocking.106 107If no free slot is immediately available, raise `QueueFull`.108z)queue non-empty, why are getters waiting?N) �_consume_expiredrT rc �popleft�_Queue__put_internalr �_getrf r )rB rh �getters r! rj �Queue.put_nowait� sy � �109
� � � � �=�=��:�:�<�<� L�!L� L�<��]�]�*�*�,�F� � � �� %� .�v�y�y�{� C�
�Y�Y�[�[��O� � � �� %r c �� � [ 5 n UR U R 5 5 U$ ! [ a* U R R U5 [
X!5 U$ f = f)a� Remove and return an item from the queue.110 111Returns an awaitable which resolves once an item is available, or raises112`tornado.util.TimeoutError` after a timeout.113 114``timeout`` may be a number denoting a time (on the same115scale as `tornado.ioloop.IOLoop.time`, normally `time.time`), or a116`datetime.timedelta` object for a deadline relative to the117current time.118 119.. note::120 121 The ``timeout`` argument of this method differs from that122 of the standard library's `queue.Queue.get`. That method123 interprets numeric values as relative timeouts; this one124 interprets them as absolute deadlines and requires125 ``timedelta`` objects for relative timeouts (consistent126 with other timeouts in Tornado).127 128)r rk �129get_nowaitr rT rl r; )rB r% r$ s r! rF � Queue.get� s\ � �. ��� *� � � �d�o�o� /� 0� �
�� � *� �M�M� � �� (� �� )��
� *�s � - �0A!� A!c �d � U R 5 U R ( ae U R 5 ( d S5 eU R R 5 u pU R U5 [ US5 U R
5 $ U R 5 ( a U R
5 $ [ e)z�Remove and return an item from the queue without blocking.130 131Return an item if one is immediately available, else raise132`QueueEmpty`.133z(queue not full, why are putters waiting?N) rp rU rf rq rr r rs r_ r )rB rh �putters r! rw �Queue.get_nowait s� � �
� � � � �=�=��9�9�;�;� J� J� J�;� �=�=�0�0�2�L�D� � � �� %� .�v�t� <��9�9�;� �
�Z�Z�\�\��9�9�;� � � r c � � U R S:: a [ S5 eU =R S- sl U R S:X a U R R 5 gg)a� Indicate that a formerly enqueued task is complete.134 135Used by queue consumers. For each `.get` used to fetch a task, a136subsequent call to `.task_done` tells the queue that the processing137on the task is complete.138 139If a `.join` is blocking, it resumes when all items have been140processed; that is, when every `.put` is matched by a `.task_done`.141 142Raises `ValueError` if called more times than `.put`.143r z!task_done() called too many times� N)rV rO rW rX rG s r! � task_done�Queue.task_done sR � � � !� !�Q� &� � @�A� A� � � �!�#� � � !� !�Q� &� �N�N� � � � 'r c �8 � U R R U5 $ )z�Block until all items in the queue are processed.144 145Returns an awaitable, which raises `tornado.util.TimeoutError` after a146timeout.147)rW �wait)rB r% s r! �join�148Queue.join$ s � � �~�~�"�"�7�+�+r c � � [ U 5 $ r) )r= rG s r! � __aiter__�Queue.__aiter__. s
� � �d�#�#r c �8 � [ R " 5 U l g r) )rR rS r^ rG s r! rQ � Queue._init2 s � �!�'�'�)�� r c �6 � U R R 5 $ r) )r^ rq rG s r! rs �149Queue._get5 s � ��{�{�"�"�$�$r c �: � U R R U5 g r) �r^ rl �rB rh s r! �_put�150Queue._put8 � � � � � ���4� r c � � U =R S-
sl U R R 5 U R U5 g )Nr} )rV rW �clearr� r� s r! �__put_internal�Queue.__put_internal= s. � � � � �!�#� � ��� � � � � � �$�r c � � U R ( aw U R S S R 5 ( aR U R R 5 U R ( a' U R S S R 5 ( a MR U R ( at U R S R 5 ( aQ U R R 5 U R ( a% U R S R 5 ( a MO g g g g )Nr r} )rU r* rq rT rG s r! rp �Queue._consume_expiredB s� � ��m�m��
�
�a� 0�� 3� 8� 8� :� :� �M�M� !� !� #� �m�m��
�
�a� 0�� 3� 8� 8� :� :� �m�m��
�
�a� 0� 5� 5� 7� 7� �M�M� !� !� #� �m�m��
�
�a� 0� 5� 5� 7� 7�m� 7�mr c � � S[ U 5 R S[ [ U 5 5 SU R 5 S3$ )N�<z at � �>)�typer �hex�id�_formatrG s r! �__repr__�Queue.__repr__J s7 � ��4��:�&�&�'�t�C��4��M�?�!�D�L�L�N�;K�1�M�Mr c �V � S[ U 5 R SU R 5 S3$ )Nr� r� r� )r� r r� rG s r! �__str__�
Queue.__str__M s) � ��4��:�&�&�'�q�� � � �(8��:�:r c �d � SU R < 3n[ U SS 5 ( a USU R - -
nU R ( a US[ U R 5 - -
nU R151 ( a US[ U R152 5 - -
nU R ( a USU R - -
nU$ )Nzmaxsize=r^ z queue=%rz getters[%s]z putters[%s]z tasks=%s)rL �getattrr^ rT r] rU rV )rB �results r! r� �
Queue._formatP s� � ��D�L�L�+�,�� �4��4� (� (� �k�D�K�K�/� /�F� �=�=� �n�s�4�=�=�'9�9� 9�F� �=�=� �n�s�4�=�=�'9�9� 9�F� � !� !� �k�D�$:�$:�:� :�F��
r )rW rT rP rU r^ rV )r r) r6 )'r r r r r r^ �intrC �propertyrL r_ �boolrc rf r r r �float�datetime� timedeltarm rj r rF rw r~ r� r= r� rQ rs r� rr rp �strr� r� r� r r r r! r r Q s� � �A�J �F�
��
�D�
� � �� � � � �s� � �t� �0�d� 0� OS����!)�%��x�7I�7I�0I�*J�!K�� ��.&�r� &�d� &�" EI� � ��e�X�-?�-?�&?� @�A� � �2� � �> �B� �$!�& EI�,� ��e�X�-?�-?�&?� @�A�,� �4� �,�$�>�"�-� $�*�%�b� %�!�� !�� !�153�2� �$� �154$�N�#� N�;�� ;�155�� 156r r c �B � \ rS rSrSrS157S jrS\SS4S jrS\4S jrS r g) r i] ab A `.Queue` that retrieves entries in priority order, lowest first.158 159Entries are typically tuples like ``(priority number, data)``.160 161.. testcode::162 163 import asyncio164 from tornado.queues import PriorityQueue165 166 async def main():167 q = PriorityQueue()168 q.put((1, 'medium-priority item'))169 q.put((0, 'high-priority item'))170 q.put((10, 'low-priority item'))171 172 print(await q.get())173 print(await q.get())174 print(await q.get())175 176 asyncio.run(main())177 178.. testoutput::179 180 (0, 'high-priority item')181 (1, 'medium-priority item')182 (10, 'low-priority item')183r& Nc � � / U l g r) rb rG s r! rQ �PriorityQueue._initz � � ��� r rh c �F � [ R " U R U5 g r) )�heapq�heappushr^ r� s r! r� �PriorityQueue._put} s � �
���t�{�{�D�)r c �B � [ R " U R 5 $ r) )r� �heappopr^ rG s r! rs �PriorityQueue._get� s � ��}�}�T�[�[�)�)r rb r6 �184r r r r r rQ r r� rs r r r r! r r ] s+ � ��8�*�� *�� *�*�b� *r r c �B � \ rS rSrSrS185S jrS\SS4S jrS\4S jrS r g) r i� a� A `.Queue` that retrieves the most recently put items first.186 187.. testcode::188 189 import asyncio190 from tornado.queues import LifoQueue191 192 async def main():193 q = LifoQueue()194 q.put(3)195 q.put(2)196 q.put(1)197 198 print(await q.get())199 print(await q.get())200 print(await q.get())201 202 asyncio.run(main())203 204.. testoutput::205 206 1207 2208 3209r& Nc � � / U l g r) rb rG s r! rQ �LifoQueue._init� r� r rh c �: � U R R U5 g r) r� r� s r! r� �LifoQueue._put� r� r c �6 � U R R 5 $ r) )r^ �poprG s r! rs �LifoQueue._get� s � ��{�{��� � r rb r6 r� r r r! r r � s+ � ��4�!�� !�� !�!�b� !r r )"r rR r� r� �tornador r �tornado.concurrentr r �
tornado.locksr �typingr r r210 r r �
TYPE_CHECKINGr
r r r �__all__� Exceptionr r r� r� r; r= r r r r r r! �<module>r� s� �� � � � � � I� � ?� ?�
� ���(�(� �T�]��211L�� �� � � � � S� � S� "�4���0B�0B�#B� C� S� � S� �W�R�[� �I�G�B�K� I�X$*�E� $*�N"!�� "!r