129 lines
14 KiB
Plaintext
129 lines
14 KiB
Plaintext
|
Ë
|
|||
|
|
*åf.. ã ó — d Z ddlZddlZddlmZ ddlmZmZ ddlm Z ddl
|
|||
|
|
m Z g d¢Z
|
|||
|
|
ddl
|
|||
|
|
mZ G d „ d e« Z G d
|
|||
|
|
„ d« Z G d„ de« Z G d„ de« Z G d„ d« Ze €eZ yy# e $ r dZ Y ŒOw xY w# e $ r G d „ d
|
|||
|
|
e« ZY ŒZw xY w)z'A multi-producer, multi-consumer queue.é N)Údeque)ÚheappushÚheappop)Ú monotonic)Ú SimpleQueue)ÚEmptyÚFullÚQueueÚ
|
|||
|
|
PriorityQueueÚ LifoQueuer )r c ó — e Zd ZdZy)r z4Exception raised by Queue.get(block=0)/get_nowait().N©Ú__name__Ú
|
|||
|
|
__module__Ú __qualname__Ú__doc__© ó úAC:\Users\RCi\AppData\Local\Programs\Python\Python312\Lib\queue.pyr r s „ Ù>Ø r r c ó — e Zd ZdZy)r z4Exception raised by Queue.put(block=0)/put_nowait().Nr r r r r r s „ Ù:Ør r c óŽ — e Zd ZdZdd„Zd„ Zd„ Zd„ Zd„ Zd„ Z dd „Z
|
|||
|
|
dd
|
|||
|
|
„Z d „ Z d „ Z
|
|||
|
|
d
|
|||
|
|
„ Zd„ Zd„ Zd„ Z eej( « 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ÚLockÚmutexÚ ConditionÚ not_emptyÚnot_fullÚall_tasks_doneÚunfinished_tasks©Úselfr s r Ú__init__zQueue.__init__" 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_done9 sf € ð ×
|
|||
|
|
Ñ
|
|||
|
|
ñ /Ø ×.Ñ.°Ñ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.joinO sH € ð ×
|
|||
|
|
Ñ
|
|||
|
|
ñ +Ø×'Ò'Ø×#Ñ#×(Ñ(Ô*ð ×'Ó'÷ +÷ +ñ +ús �3A
|
|||
|
|
Á
|
|||
|
|
Ac óf — | j 5 | j « cddd« S # 1 sw Y yxY w)ú9Return the approximate size of the queue (not reliable!).N©r Ú_qsizer/ s r Úqsizez Queue.qsize\ s' € à
|
|||
|
|
�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.
|
|||
|
|
Nr3 r/ s r Úemptyz Queue.emptya s, € ð �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 r4 r/ s r Úfullz
|
|||
|
|
Queue.fullo s7 € ð �Z‰Zñ 5Ø�t—|‘|Ö4 t§{¡{£}Ô4÷ 5÷ 5ò 5ú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\ rQ|t
|
|||
|
|
« z
|
|||
|
|
}|dk rt ‚| j j |« | j « | j k\ rŒQ| 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 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).
|
|||
|
|
r Nú''timeout' must be a non-negative numberç r( ) r! r r4 r r. r) ÚtimeÚ_putr# r Únotify)r% ÚitemÚblockÚtimeoutÚendtimeÚ remainings r Úputz Queue.putz s € ð �]‰]ñ $Ø�|‰|˜aÓ Ù Ø—{‘{“}¨¯ © Ò4Ü "˜
|
|||
|
|
Ø �_Ø Ÿ+™+›-¨4¯<©<Ò7Ø Ÿ
|
|||
|
|
™
|
|||
|
|
×*Ñ*Ô,ð Ÿ+™+›-¨4¯<©<Ô7à ˜q’[Ü$Ð%NÓOÐOä "›f wÑ .�GØ Ÿ+™+›-¨4¯<©<Ò7Ø$+¬d«fÑ$4˜ Ø$¨Ò+Ü"&˜JØ Ÿ
|
|||
|
|
™
|
|||
|
|
×*Ñ*¨9Ô5ð Ÿ+™+›-¨4¯<©<Ó7ð
|
|||
|
|
|
|||
|
|
�I‰I�dŒOØ × !Ò ! QÑ &Õ !Ø �N‰N× !Ñ !Ô #÷' $÷ $ñ $ús �B E/ÂB E/Ä&A E/Å/E8c ó, — | j 5 |s| j « sµt ‚|€<| j « s�| j j « | j « sŒ+nq|dk r t d« ‚t « |z }| j « sD|t « z
|
|||
|
|
}|dk rt ‚| j j |« | j « sŒD| j
|
|||
|
|
« }| j j « |cddd« S # 1 sw Y yxY w)á 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 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 r; r< ) r r4 r r. r) r= Ú_getr! r? )r% rA rB rC rD r@ s r Úgetz Queue.getš sØ € ð �^‰^ñ ÙØ—{‘{”}Ü �KØ� Ø Ÿ+™+œ-Ø—N‘N×'Ñ'Ô)ð Ÿ+™+ž-à˜1’Ü Ð!JÓKÐKä ›& 7Ñ*�Ø Ÿ+™+œ-Ø '¬$«&Ñ 0�IØ CÒ'Ü #˜ Ø—N‘N×'Ñ'¨ Ô2ð Ÿ+™+�-ð
|
|||
|
|
—9‘9“;ˆDØ �M‰M× Ñ Ô "Ø÷% ÷ ò ús �AD
|
|||
|
|
Á#A1D
|
|||
|
|
Ã+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 Full exception.
|
|||
|
|
F©rA ©rE ©r% r@ s r Ú
|
|||
|
|
put_nowaitzQueue.put_nowait¹ ó € ð �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 Empty exception.
|
|||
|
|
FrK ©rI r/ s r Ú
|
|||
|
|
get_nowaitzQueue.get_nowaitÁ ó € ð �x‰x˜eˆxÓ$Ð$r c ó" — t « | _ y ©N)r Úqueuer$ s r r z Queue._initÎ s € Ü“Wˆ�
|
|||
|
|
r c ó, — t | j « S rV ©ÚlenrW r/ s r r4 z Queue._qsizeÑ ó € Ü�4—:‘:‹Ð r c ó: — | j j |« y rV ©rW ÚappendrM s r r> z
|
|||
|
|
Queue._putÕ ó € Ø �
|
|||
|
|
‰
|
|||
|
|
×ј$Õ r c ó6 — | j j « S rV )rW Úpopleftr/ s r rH z
|
|||
|
|
Queue._getÙ s € Ø�z‰z×!Ñ!Ó#Ð#r )r ©TN)r r r r r& r, r0 r5 r7 r9 rE rI rN rS r r4 r> rH Ú classmethodÚtypesÚ GenericAliasÚ__class_getitem__r r r r
|
|||
|
|
r
|
|||
|
|
sa „ ñó
|
|||
|
|
"ò./ò, +ò!ò
|
|||
|
|
%ò 5ó $ó@ ò>+ò%ò ò ò ò$ñ $ E×$6Ñ$6Ó7Ñr r
|
|||
|
|
c ó( — e Zd ZdZd„ Zd„ Zd„ Zd„ Zy)r zœVariant of Queue that retrieves open entries in priority order (lowest first).
|