FM / python3.11

/opt/alt/python311/lib64/python3.11

Name	Size	Mode	Actions
asyncio/	-	0755	rm
collections/	-	0755	rm
concurrent/	-	0755	rm
config-3.11-x86_64-linux-gnu/	-	0755	rm
ctypes/	-	0755	rm
curses/	-	0755	rm
dbm/	-	0755	rm
distutils/	-	0755	rm
email/	-	0755	rm
encodings/	-	0755	rm
ensurepip/	-	0755	rm
html/	-	0755	rm
http/	-	0755	rm
importlib/	-	0755	rm
json/	-	0755	rm
lib-dynload/	-	0755	rm
lib2to3/	-	0755	rm
logging/	-	0755	rm
multiprocessing/	-	0755	rm
pydoc_data/	-	0755	rm
re/	-	0755	rm
site-packages/	-	0755	rm
sqlite3/	-	0755	rm
tomllib/	-	0755	rm
unittest/	-	0755	rm
urllib/	-	0755	rm
venv/	-	0755	rm
wsgiref/	-	0755	rm
xml/	-	0755	rm
xmlrpc/	-	0755	rm
zoneinfo/	-	0755	rm
__phello__/	-	0755	rm
__pycache__/	-	0755	rm
abc.py	6538	0644	edit dl rm
aifc.py	34211	0644	edit dl rm
antigravity.py	500	0644	edit dl rm
argparse.py	100283	0644	edit dl rm
ast.py	61444	0644	edit dl rm
asynchat.py	11570	0644	edit dl rm
asyncore.py	20310	0644	edit dl rm
base64.py	21041	0755	edit dl rm
bdb.py	32463	0644	edit dl rm
bisect.py	3135	0644	edit dl rm
bz2.py	11847	0644	edit dl rm
calendar.py	24731	0644	edit dl rm
cgi.py	34432	0755	edit dl rm
cgitb.py	12421	0644	edit dl rm
chunk.py	5500	0644	edit dl rm
cmd.py	14873	0644	edit dl rm
code.py	10622	0644	edit dl rm
codecs.py	37150	0644	edit dl rm
codeop.py	5907	0644	edit dl rm
colorsys.py	4062	0644	edit dl rm
compileall.py	20252	0644	edit dl rm
configparser.py	55660	0644	edit dl rm
contextlib.py	27414	0644	edit dl rm
contextvars.py	129	0644	edit dl rm
copy.py	8681	0644	edit dl rm
copyreg.py	7677	0644	edit dl rm
cProfile.py	6359	0755	edit dl rm
crypt.py	3913	0644	edit dl rm
csv.py	16030	0644	edit dl rm
dataclasses.py	58472	0644	edit dl rm
datetime.py	91832	0644	edit dl rm
decimal.py	320	0644	edit dl rm
difflib.py	83308	0644	edit dl rm
dis.py	28906	0644	edit dl rm
doctest.py	106297	0644	edit dl rm
enum.py	79583	0644	edit dl rm
filecmp.py	10178	0644	edit dl rm
fileinput.py	15714	0644	edit dl rm
fnmatch.py	5999	0644	edit dl rm
fractions.py	28677	0644	edit dl rm
ftplib.py	35815	0644	edit dl rm
functools.py	38413	0644	edit dl rm
genericpath.py	4975	0644	edit dl rm
getopt.py	7489	0644	edit dl rm
getpass.py	5990	0644	edit dl rm
gettext.py	21320	0644	edit dl rm
glob.py	8732	0644	edit dl rm
graphlib.py	9656	0644	edit dl rm
gzip.py	24074	0644	edit dl rm
hashlib.py	11765	0644	edit dl rm
heapq.py	23024	0644	edit dl rm
hmac.py	7716	0644	edit dl rm
imaplib.py	55217	0644	edit dl rm
imghdr.py	3952	0644	edit dl rm
imp.py	10606	0644	edit dl rm
inspect.py	123419	0644	edit dl rm
io.py	4320	0644	edit dl rm
ipaddress.py	79124	0644	edit dl rm
keyword.py	1061	0644	edit dl rm
LICENSE.txt	13936	0644	edit dl rm
linecache.py	5649	0644	edit dl rm
locale.py	79095	0644	edit dl rm
lzma.py	13277	0644	edit dl rm
mailbox.py	78830	0644	edit dl rm
mailcap.py	9369	0644	edit dl rm
mimetypes.py	22962	0644	edit dl rm
modulefinder.py	23699	0644	edit dl rm
netrc.py	6929	0644	edit dl rm
nntplib.py	41087	0644	edit dl rm
ntpath.py	30222	0644	edit dl rm
nturl2path.py	2887	0644	edit dl rm
numbers.py	10348	0644	edit dl rm
opcode.py	10447	0644	edit dl rm
operator.py	10965	0644	edit dl rm
optparse.py	60369	0644	edit dl rm
os.py	39530	0644	edit dl rm
pathlib.py	48566	0644	edit dl rm
pdb.py	64186	0755	edit dl rm
pickle.py	65132	0644	edit dl rm
pickletools.py	93861	0644	edit dl rm
pipes.py	8978	0644	edit dl rm
pkgutil.py	24638	0644	edit dl rm
platform.py	42287	0755	edit dl rm
plistlib.py	28354	0644	edit dl rm
poplib.py	15198	0644	edit dl rm
posixpath.py	17013	0644	edit dl rm
pprint.py	24583	0644	edit dl rm
profile.py	22896	0755	edit dl rm
pstats.py	29356	0644	edit dl rm
pty.py	6317	0644	edit dl rm
pyclbr.py	11396	0644	edit dl rm
pydoc.py	112664	0755	edit dl rm
py_compile.py	7837	0644	edit dl rm
queue.py	11496	0644	edit dl rm
quopri.py	7281	0755	edit dl rm
random.py	32162	0644	edit dl rm
reprlib.py	5437	0644	edit dl rm
rlcompleter.py	7827	0644	edit dl rm
runpy.py	13159	0644	edit dl rm
sched.py	6351	0644	edit dl rm
secrets.py	2028	0644	edit dl rm
selectors.py	19671	0644	edit dl rm
shelve.py	8560	0644	edit dl rm
shlex.py	13501	0644	edit dl rm
shutil.py	56517	0644	edit dl rm
signal.py	2495	0644	edit dl rm
site.py	22987	0644	edit dl rm
smtpd.py	31175	0755	edit dl rm
smtplib.py	45431	0755	edit dl rm
sndhdr.py	7448	0644	edit dl rm
socket.py	37557	0644	edit dl rm
socketserver.py	27586	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	54305	0644	edit dl rm
stat.py	5485	0644	edit dl rm
statistics.py	47705	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	88725	0644	edit dl rm
sunau.py	18480	0644	edit dl rm
symtable.py	10368	0644	edit dl rm
sysconfig.py	30315	0644	edit dl rm
tabnanny.py	11312	0755	edit dl rm
tarfile.py	107876	0755	edit dl rm
telnetlib.py	23301	0644	edit dl rm
tempfile.py	31873	0644	edit dl rm
textwrap.py	19718	0644	edit dl rm
this.py	1003	0644	edit dl rm
threading.py	58231	0644	edit dl rm
timeit.py	13532	0755	edit dl rm
token.py	2386	0644	edit dl rm
tokenize.py	26336	0644	edit dl rm
trace.py	29196	0755	edit dl rm
traceback.py	40547	0644	edit dl rm
tracemalloc.py	18047	0644	edit dl rm
tty.py	879	0644	edit dl rm
types.py	10067	0644	edit dl rm
typing.py	120951	0644	edit dl rm
uu.py	7341	0644	edit dl rm
uuid.py	27597	0644	edit dl rm
warnings.py	21110	0644	edit dl rm
wave.py	21818	0644	edit dl rm
weakref.py	21513	0644	edit dl rm
webbrowser.py	25149	0755	edit dl rm
xdrlib.py	5977	0644	edit dl rm
zipapp.py	7535	0644	edit dl rm
zipfile.py	93788	0644	edit dl rm
zipimport.py	30897	0644	edit dl rm
_aix_support.py	3389	0644	edit dl rm
_bootsubprocess.py	2675	0644	edit dl rm
_collections_abc.py	30193	0644	edit dl rm
_compat_pickle.py	8761	0644	edit dl rm
_compression.py	5681	0644	edit dl rm
_markupbase.py	14653	0644	edit dl rm
_osx_support.py	22023	0644	edit dl rm
_pydecimal.py	229202	0644	edit dl rm
_pyio.py	94193	0644	edit dl rm
_py_abc.py	6189	0644	edit dl rm
_sitebuiltins.py	3128	0644	edit dl rm
_strptime.py	25175	0644	edit dl rm
_sysconfigdata_d_linux_x86_64-linux-gnu.py	58878	0644	edit dl rm
_sysconfigdata__linux_x86_64-linux-gnu.py	59645	0644	edit dl rm
_threading_local.py	7220	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/alt/python311/lib64/python3.11/queue.py (11496B)

'''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', '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 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

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).
        '''
        with self.not_full:
            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()
                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)
            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).
        '''
        with self.not_empty:
            if not block:
                if not self._qsize():
                    raise Empty
            elif timeout is None:
                while not self._qsize():
                    self.not_empty.wait()
            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)
            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)

# 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.

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: