FM / python3.13

/opt/imh/python3.13/lib/python3.13

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

Edit: /opt/imh/python3.13/lib/python3.13/queue.py (13455B)

'''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).

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.

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', the queue is drained and unfinished tasks
        is reduced by the number of drained tasks.  If unfinished tasks
        is reduced to zero, callers of Queue.join are unblocked.
        '''
        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

cmd: