⚝
One Hat Cyber Team
⚝
Your IP:
216.73.216.144
Server IP:
157.245.143.252
Server:
Linux www 6.11.0-9-generic #9-Ubuntu SMP PREEMPT_DYNAMIC Mon Oct 14 13:19:59 UTC 2024 x86_64
Server Software:
nginx/1.26.0
PHP Version:
8.3.11
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
lib
/
python3.12
/
__pycache__
/
View File Name :
queue.cpython-312.pyc
CRh, d Z ddlZddlZddlmZ ddlmZmZ ddlm Z ddl m Z g dZ 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)heappushheappop) monotonic) SimpleQueue)EmptyFullQueue PriorityQueue LifoQueuer )r c e Zd ZdZy)r z4Exception raised by Queue.get(block=0)/get_nowait().N__name__ __module__ __qualname____doc__ /usr/lib/python3.12/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 ZdZddZd 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 threadingLockmutex Condition not_emptynot_fullall_tasks_doneunfinished_tasksselfr s r __init__zQueue.__init__" sv 7 ^^% #,,TZZ8 "++DJJ7 ( 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 s] ..2JQ >$%HII##..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# waitr% s r joinz Queue.joinO s? ''##((* '' ! s 3A Ac f | j 5 | j cddd S # 1 sw Y yxY w)9Return the approximate size of the queue (not reliable!).Nr _qsizer/ s r qsizez Queue.qsize\ s ZZ;;= ZZs '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! ZZ{{}$ ZZs (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 s, ZZt||4t{{}4 ZZs (?ANc | j 5 | j dkD r|s#| j | j k\ rt |V| j | j k\ r| j j | j | j k\ r8n|dk r t d t |z }| j | j k\ rQ|t z }|dk rt | j j | | j | j k\ rQ| 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% itemblocktimeoutendtime remainings r putz Queue.putz s ]]||a {{} 4 " _ ++-4<<7 **, ++-4<<7 q[$%NOO "fw .G ++-4<<7$+df$4 $+"&J **95 ++-4<<7 IIdO ! !Q & ! NN ! ! #' ]]s B E/B E/&A E//E8c , | j 5 |s| j st |<| j s| j j | j s+nq|dk r t d t |z }| j sD|t z }|dk rt | j j | | j sD| 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 ++-NN'') ++-1 !JKK &7* ++- '$& 0I C' # NN'' 2 ++- 99;D MM "% ^^s AD #A1D +D Dc ( | j |d S )zPut an item into the queue without blocking. Only enqueue the item if a free slot is immediately available. Otherwise raise the Full exception. FrA rE r% r@ s r put_nowaitzQueue.put_nowait xxEx**r c & | j d S zRemove 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 xxex$$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 zz!!##r )r TN)r r r r r& r, r0 r5 r7 r9 rE rI rN rS r r4 r> rH classmethodtypes GenericAlias__class_getitem__r r r r r sa "./, +! % 5 $@ >+% $ $E$6$67r r c ( e Zd ZdZd Zd Zd Zd Zy)r zVariant of Queue that retrieves open entries in priority order (lowest first). Entries are typically tuples of the form: (priority number, data). c g | _ y rV rW r$ s r r zPriorityQueue._init r c , t | j S rV rY r/ s r r4 zPriorityQueue._qsize r[ r c 0 t | j | y rV )r rW rM s r r> zPriorityQueue._put s T"r c , t | j S rV )r rW r/ s r rH zPriorityQueue._get s tzz""r Nr r r r r r4 r> rH r r r r r s ##r r c ( e Zd ZdZd Zd Zd Zd Zy)r zBVariant of Queue that retrieves most recently added entries first.c g | _ y rV ri r$ s r r zLifoQueue._init rj r c , t | j S rV rY r/ s r r4 zLifoQueue._qsize r[ r c : | j j | y rV r] rM s r r> zLifoQueue._put r_ r c 6 | j j S rV )rW popr/ s r rH zLifoQueue._get s zz~~ r Nrn r r r r r s L r r c b e Zd ZdZd Zd dZd dZd Zd Zd Z d Z e e j Zy) _PySimpleQueuezYSimple, unbounded FIFO queue. This pure Python implementation is not reentrant. c V t | _ t j d | _ y r )r _queuer Semaphore_countr/ s r r& z_PySimpleQueue.__init__ s g ))!, r Nc n | j j | | j j y)zPut the item on the queue. The optional 'block' and 'timeout' arguments are ignored, as this method never blocks. They are provided for compatibility with the Queue class. N)rx r^ rz release)r% r@ rA rB s r rE z_PySimpleQueue.put s& 4 r c ||dk r t d | j j || st | j j S )rG r r; )r) rz acquirer rx ra )r% rA rB s r rI z_PySimpleQueue.get sH 7Q; FG G{{""5'2K{{""$$r c ( | j |d S )zPut an item into the queue without blocking. This is exactly equivalent to `put(item, block=False)` and is only provided for compatibility with the Queue class. FrK rL rM s r rN z_PySimpleQueue.put_nowait* rO r c & | j d S rQ rR r/ s r rS z_PySimpleQueue.get_nowait2 rT r c 2 t | j dk( S )zCReturn True if the queue is empty, False otherwise (not reliable!).r rZ rx r/ s r r7 z_PySimpleQueue.empty: s 4;; 1$$r c , t | j S )r2 r r/ s r r5 z_PySimpleQueue.qsize> s 4;; r rb )r r r r r& rE rI rN rS r7 r5 rc rd re rf r r r rv rv s= - %"+%% $E$6$67r rv )r r rd collectionsr heapqr r r= r rx r ImportError__all__r Exceptionr r r r rv r r r <module>r s - # "" R 9 @8 @8F#E #& @8 @8F K w K s" A, A9 ,A65A69B B