Na}{

Path: ~//proc/thread-self/root/opt/alt/python313/lib64/python3.13/

File Content: `queue.py`

'''A multi-producer, multi-consumer queue.'''

import threading
import types
from collections import deque
from heapq import heappush, heappop
from time import monotonic as time
try:
    from _queue import SimpleQueue
except ImportError:
    SimpleQueue = None

__all__ = [
    'Empty',
    'Full',
    'ShutDown',
    'Queue',
    'PriorityQueue',
    'LifoQueue',
    'SimpleQueue',
]


try:
    from _queue import Empty
except ImportError:
    class Empty(Exception):
        'Exception raised by Queue.get(block=0)/get_nowait().'
        pass

class Full(Exception):
    'Exception raised by Queue.put(block=0)/put_nowait().'
    pass


class ShutDown(Exception):
    '''Raised when put/get with shut-down queue.'''


class Queue:
    '''Create a queue object with a given maximum size.

    If maxsize is <= 0, the queue size is infinite.
    '''

    def __init__(self, maxsize=0):
        self.maxsize = maxsize
        self._init(maxsize)

        # mutex must be held whenever the queue is mutating.  All methods
        # that acquire mutex must release it before returning.  mutex
        # is shared between the three conditions, so acquiring and
        # releasing the conditions also acquires and releases mutex.
        self.mutex = threading.Lock()

        # Notify not_empty whenever an item is added to the queue; a
        # thread waiting to get is notified then.
        self.not_empty = threading.Condition(self.mutex)

        # Notify not_full whenever an item is removed from the queue;
        # a thread waiting to put is notified then.
        self.not_full = threading.Condition(self.mutex)

        # Notify all_tasks_done whenever the number of unfinished tasks
        # drops to zero; thread waiting to join() is notified to resume
        self.all_tasks_done = threading.Condition(self.mutex)
        self.unfinished_tasks = 0

        # Queue shutdown state
        self.is_shutdown = False

    def task_done(self):
        '''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).

        shutdown(immediate=True) calls task_done() for each remaining item in
        the queue.

        Raises a ValueError if called more times than there were items
        placed in the queue.
        '''
        with self.all_tasks_done:
            unfinished = self.unfinished_tasks - 1
            if unfinished <= 0:
                if unfinished < 0:
                    raise ValueError('task_done() called too many times')
                self.all_tasks_done.notify_all()
            self.unfinished_tasks = unfinished

    def join(self):
        '''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.
        '''
        with self.all_tasks_done:
            while self.unfinished_tasks:
                self.all_tasks_done.wait()

    def qsize(self):
        '''Return the approximate size of the queue (not reliable!).'''
        with self.mutex:
            return self._qsize()

    def empty(self):
        '''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.
        '''
        with self.mutex:
            return not self._qsize()

    def full(self):
        '''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.
        '''
        with self.mutex:
            return 0 < self.maxsize <= self._qsize()

    def put(self, item, block=True, timeout=None):
        '''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).

        Raises ShutDown if the queue has been shut down.
        '''
        with self.not_full:
            if self.is_shutdown:
                raise ShutDown
            if self.maxsize > 0:
                if not block:
                    if self._qsize() >= self.maxsize:
                        raise Full
                elif timeout is None:
                    while self._qsize() >= self.maxsize:
                        self.not_full.wait()
                        if self.is_shutdown:
                            raise ShutDown
                elif timeout < 0:
                    raise ValueError("'timeout' must be a non-negative number")
                else:
                    endtime = time() + timeout
                    while self._qsize() >= self.maxsize:
                        remaining = endtime - time()
                        if remaining <= 0.0:
                            raise Full
                        self.not_full.wait(remaining)
                        if self.is_shutdown:
                            raise ShutDown
            self._put(item)
            self.unfinished_tasks += 1
            self.not_empty.notify()

    def get(self, block=True, timeout=None):
        '''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).

        Raises ShutDown if the queue has been shut down and is empty,
        or if the queue has been shut down immediately.
        '''
        with self.not_empty:
            if self.is_shutdown and not self._qsize():
                raise ShutDown
            if not block:
                if not self._qsize():
                    raise Empty
            elif timeout is None:
                while not self._qsize():
                    self.not_empty.wait()
                    if self.is_shutdown and not self._qsize():
                        raise ShutDown
            elif timeout < 0:
                raise ValueError("'timeout' must be a non-negative number")
            else:
                endtime = time() + timeout
                while not self._qsize():
                    remaining = endtime - time()
                    if remaining <= 0.0:
                        raise Empty
                    self.not_empty.wait(remaining)
                    if self.is_shutdown and not self._qsize():
                        raise ShutDown
            item = self._get()
            self.not_full.notify()
            return item

    def put_nowait(self, item):
        '''Put an item into the queue without blocking.

        Only enqueue the item if a free slot is immediately available.
        Otherwise raise the Full exception.
        '''
        return self.put(item, block=False)

    def get_nowait(self):
        '''Remove and return an item from the queue without blocking.

        Only get an item if one is immediately available. Otherwise
        raise the Empty exception.
        '''
        return self.get(block=False)

    def shutdown(self, immediate=False):
        '''Shut-down the queue, making queue gets and puts raise ShutDown.

        By default, gets will only raise once the queue is empty. Set
        'immediate' to True to make gets raise immediately instead.

        All blocked callers of put() and get() will be unblocked. If
        'immediate', a task is marked as done for each item remaining in
        the queue, which may unblock callers of join().
        '''
        with self.mutex:
            self.is_shutdown = True
            if immediate:
                while self._qsize():
                    self._get()
                    if self.unfinished_tasks > 0:
                        self.unfinished_tasks -= 1
                # release all blocked threads in `join()`
                self.all_tasks_done.notify_all()
            # All getters need to re-check queue-empty to raise ShutDown
            self.not_empty.notify_all()
            self.not_full.notify_all()

    # Override these methods to implement other queue organizations
    # (e.g. stack or priority queue).
    # These will only be called with appropriate locks held

    # Initialize the queue representation
    def _init(self, maxsize):
        self.queue = deque()

    def _qsize(self):
        return len(self.queue)

    # Put a new item in the queue
    def _put(self, item):
        self.queue.append(item)

    # Get an item from the queue
    def _get(self):
        return self.queue.popleft()

    __class_getitem__ = classmethod(types.GenericAlias)


class PriorityQueue(Queue):
    '''Variant of Queue that retrieves open entries in priority order (lowest first).

    Entries are typically tuples of the form:  (priority number, data).
    '''

    def _init(self, maxsize):
        self.queue = []

    def _qsize(self):
        return len(self.queue)

    def _put(self, item):
        heappush(self.queue, item)

    def _get(self):
        return heappop(self.queue)


class LifoQueue(Queue):
    '''Variant of Queue that retrieves most recently added entries first.'''

    def _init(self, maxsize):
        self.queue = []

    def _qsize(self):
        return len(self.queue)

    def _put(self, item):
        self.queue.append(item)

    def _get(self):
        return self.queue.pop()


class _PySimpleQueue:
    '''Simple, unbounded FIFO queue.

    This pure Python implementation is not reentrant.
    '''
    # Note: while this pure Python version provides fairness
    # (by using a threading.Semaphore which is itself fair, being based
    #  on threading.Condition), fairness is not part of the API contract.
    # This allows the C version to use a different implementation.

    def __init__(self):
        self._queue = deque()
        self._count = threading.Semaphore(0)

    def put(self, item, block=True, timeout=None):
        '''Put 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.
        '''
        self._queue.append(item)
        self._count.release()

    def get(self, block=True, timeout=None):
        '''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).
        '''
        if timeout is not None and timeout < 0:
            raise ValueError("'timeout' must be a non-negative number")
        if not self._count.acquire(block, timeout):
            raise Empty
        return self._queue.popleft()

    def put_nowait(self, item):
        '''Put 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.
        '''
        return self.put(item, block=False)

    def get_nowait(self):
        '''Remove and return an item from the queue without blocking.

        Only get an item if one is immediately available. Otherwise
        raise the Empty exception.
        '''
        return self.get(block=False)

    def empty(self):
        '''Return True if the queue is empty, False otherwise (not reliable!).'''
        return len(self._queue) == 0

    def qsize(self):
        '''Return the approximate size of the queue (not reliable!).'''
        return len(self._queue)

    __class_getitem__ = classmethod(types.GenericAlias)


if SimpleQueue is None:
    SimpleQueue = _PySimpleQueue

Edit Rename Chmod Delete

FILE FOLDER

Name	Size	Permission
__pycache__	---	0755
_pyrepl	---	0755
asyncio	---	0755
collections	---	0755
concurrent	---	0755
config-3.13-x86_64-linux-gnu	---	0755
ctypes	---	0755
curses	---	0755
dbm	---	0755
email	---	0755
encodings	---	0755
ensurepip	---	0755
html	---	0755
http	---	0755
importlib	---	0755
json	---	0755
lib-dynload	---	0755
logging	---	0755
multiprocessing	---	0755
pathlib	---	0755
pydoc_data	---	0755
re	---	0755
site-packages	---	0755
sqlite3	---	0755
sysconfig	---	0755
tomllib	---	0755
unittest	---	0755
urllib	---	0755
venv	---	0755
wsgiref	---	0755
xml	---	0755
xmlrpc	---	0755
zipfile	---	0755
zoneinfo	---	0755
LICENSE.txt	13809 bytes	0644
__future__.py	5218 bytes	0644
__hello__.py	227 bytes	0644
_aix_support.py	4021 bytes	0644
_android_support.py	6895 bytes	0644
_apple_support.py	2256 bytes	0644
_collections_abc.py	32264 bytes	0644
_colorize.py	2848 bytes	0644
_compat_pickle.py	8735 bytes	0644
_compression.py	5681 bytes	0644
_ios_support.py	2672 bytes	0644
_markupbase.py	14653 bytes	0644
_opcode_metadata.py	9265 bytes	0644
_osx_support.py	22023 bytes	0644
_py_abc.py	6189 bytes	0644
_pydatetime.py	91990 bytes	0644
_pydecimal.py	227283 bytes	0644
_pyio.py	93693 bytes	0644
_pylong.py	11830 bytes	0644
_sitebuiltins.py	3128 bytes	0644
_strptime.py	29383 bytes	0644
_sysconfigdata__linux_x86_64-linux-gnu.py	67303 bytes	0644
_sysconfigdata_d_linux_x86_64-linux-gnu.py	67285 bytes	0644
_threading_local.py	4363 bytes	0644
_weakrefset.py	5893 bytes	0644
abc.py	6538 bytes	0644
antigravity.py	500 bytes	0644
argparse.py	101661 bytes	0644
ast.py	65339 bytes	0644
base64.py	21643 bytes	0755
bdb.py	35343 bytes	0644
bisect.py	3423 bytes	0644
bz2.py	11969 bytes	0644
cProfile.py	6637 bytes	0755
calendar.py	26077 bytes	0644
cmd.py	15316 bytes	0644
code.py	13170 bytes	0644
codecs.py	36928 bytes	0644
codeop.py	5828 bytes	0644
colorsys.py	4062 bytes	0644
compileall.py	20665 bytes	0644
configparser.py	53831 bytes	0644
contextlib.py	27801 bytes	0644
contextvars.py	129 bytes	0644
copy.py	8975 bytes	0644
copyreg.py	7614 bytes	0644
csv.py	19178 bytes	0644
dataclasses.py	64545 bytes	0644
datetime.py	268 bytes	0644
decimal.py	2798 bytes	0644
difflib.py	83368 bytes	0644
dis.py	40962 bytes	0644
doctest.py	109333 bytes	0644
enum.py	85578 bytes	0644
filecmp.py	10652 bytes	0644
fileinput.py	15717 bytes	0644
fnmatch.py	6180 bytes	0644
fractions.py	40021 bytes	0644
ftplib.py	34735 bytes	0644
functools.py	39123 bytes	0644
genericpath.py	6247 bytes	0644
getopt.py	7488 bytes	0644
getpass.py	6233 bytes	0644
gettext.py	21534 bytes	0644
glob.py	19720 bytes	0644
graphlib.py	9648 bytes	0644
gzip.py	24633 bytes	0644
hashlib.py	9446 bytes	0644
heapq.py	23024 bytes	0644
hmac.py	7716 bytes	0644
imaplib.py	54040 bytes	0644
inspect.py	128276 bytes	0644
io.py	3582 bytes	0644
ipaddress.py	81635 bytes	0644
keyword.py	1073 bytes	0644
linecache.py	7284 bytes	0644
locale.py	79033 bytes	0644
lzma.py	13399 bytes	0644
mailbox.py	81644 bytes	0644
mimetypes.py	23851 bytes	0644
modulefinder.py	23792 bytes	0644
netrc.py	6922 bytes	0644
ntpath.py	32806 bytes	0644
nturl2path.py	2374 bytes	0644
numbers.py	11467 bytes	0644
opcode.py	2825 bytes	0644
operator.py	10980 bytes	0644
optparse.py	60369 bytes	0644
os.py	41635 bytes	0644
pdb.py	90938 bytes	0755
pickle.py	66957 bytes	0644
pickletools.py	94052 bytes	0644
pkgutil.py	18281 bytes	0644
platform.py	47359 bytes	0755
plistlib.py	29794 bytes	0644
poplib.py	14604 bytes	0644
posixpath.py	18360 bytes	0644
pprint.py	24158 bytes	0644
profile.py	23153 bytes	0755
pstats.py	29296 bytes	0644
pty.py	6137 bytes	0644
py_compile.py	7837 bytes	0644
pyclbr.py	11396 bytes	0644
pydoc.py	110078 bytes	0755
queue.py	13481 bytes	0644
quopri.py	7197 bytes	0755
random.py	37006 bytes	0644
reprlib.py	7192 bytes	0644
rlcompleter.py	7918 bytes	0644
runpy.py	12885 bytes	0644
sched.py	6351 bytes	0644
secrets.py	1984 bytes	0644
selectors.py	19457 bytes	0644
shelve.py	8810 bytes	0644
shlex.py	13353 bytes	0644
shutil.py	57463 bytes	0644
signal.py	2495 bytes	0644
site.py	25568 bytes	0644
smtplib.py	43545 bytes	0755
socket.py	37759 bytes	0644
socketserver.py	28065 bytes	0644
sre_compile.py	231 bytes	0644
sre_constants.py	232 bytes	0644
sre_parse.py	229 bytes	0644
ssl.py	52706 bytes	0644
stat.py	6147 bytes	0644
statistics.py	61831 bytes	0644
string.py	11786 bytes	0644
stringprep.py	12917 bytes	0644
struct.py	257 bytes	0644
subprocess.py	89486 bytes	0644
symtable.py	14207 bytes	0644
tabnanny.py	11545 bytes	0755
tarfile.py	114095 bytes	0755
tempfile.py	32366 bytes	0644
textwrap.py	19939 bytes	0644
this.py	1003 bytes	0644
threading.py	55244 bytes	0644
timeit.py	13477 bytes	0755
token.py	2489 bytes	0644
tokenize.py	21568 bytes	0644
trace.py	29728 bytes	0755
traceback.py	66524 bytes	0644
tracemalloc.py	18047 bytes	0644
tty.py	2035 bytes	0644
types.py	11207 bytes	0644
typing.py	132718 bytes	0644
uuid.py	29141 bytes	0644
warnings.py	26948 bytes	0644
wave.py	23236 bytes	0644
weakref.py	21513 bytes	0644
webbrowser.py	24298 bytes	0755
zipapp.py	8618 bytes	0644
zipimport.py	32890 bytes	0644

File Content: queue.py

File Content: `queue.py`