FM / python3.9

/usr/lib64/python3.9

Name	Size	Mode	Actions
asyncio/	-	0755	rm
collections/	-	0755	rm
concurrent/	-	0755	rm
config-3.9-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
site-packages/	-	0755	rm
sqlite3/	-	0755	rm
unittest/	-	0755	rm
urllib/	-	0755	rm
venv/	-	0755	rm
wsgiref/	-	0755	rm
xml/	-	0755	rm
xmlrpc/	-	0755	rm
zoneinfo/	-	0755	rm
__pycache__/	-	0755	rm
abc.py	4920	0644	edit dl rm
aifc.py	32605	0644	edit dl rm
antigravity.py	500	0644	edit dl rm
argparse.py	98119	0644	edit dl rm
ast.py	56256	0644	edit dl rm
asynchat.py	11321	0644	edit dl rm
asyncore.py	20102	0644	edit dl rm
base64.py	19859	0755	edit dl rm
bdb.py	31389	0644	edit dl rm
binhex.py	14784	0644	edit dl rm
bisect.py	2350	0644	edit dl rm
bz2.py	12447	0644	edit dl rm
calendar.py	24832	0644	edit dl rm
cgi.py	33932	0755	edit dl rm
cgitb.py	12096	0644	edit dl rm
chunk.py	5435	0644	edit dl rm
cmd.py	14860	0644	edit dl rm
code.py	10622	0644	edit dl rm
codecs.py	36673	0644	edit dl rm
codeop.py	6326	0644	edit dl rm
colorsys.py	4064	0644	edit dl rm
compileall.py	20105	0644	edit dl rm
configparser.py	54584	0644	edit dl rm
contextlib.py	24624	0644	edit dl rm
contextvars.py	129	0644	edit dl rm
copy.py	8650	0644	edit dl rm
copyreg.py	7274	0644	edit dl rm
cProfile.py	6345	0755	edit dl rm
crypt.py	3819	0644	edit dl rm
csv.py	16144	0644	edit dl rm
dataclasses.py	49586	0644	edit dl rm
datetime.py	89177	0644	edit dl rm
decimal.py	320	0644	edit dl rm
difflib.py	83307	0644	edit dl rm
dis.py	20570	0644	edit dl rm
doctest.py	104568	0644	edit dl rm
enum.py	39440	0644	edit dl rm
filecmp.py	10024	0644	edit dl rm
fileinput.py	14791	0644	edit dl rm
fnmatch.py	6004	0644	edit dl rm
formatter.py	15143	0644	edit dl rm
fractions.py	24323	0644	edit dl rm
ftplib.py	35496	0644	edit dl rm
functools.py	38881	0644	edit dl rm
genericpath.py	5246	0644	edit dl rm
getopt.py	7489	0644	edit dl rm
getpass.py	5990	0644	edit dl rm
gettext.py	27266	0644	edit dl rm
glob.py	5823	0644	edit dl rm
graphlib.py	9573	0644	edit dl rm
gzip.py	21772	0644	edit dl rm
hashlib.py	8069	0644	edit dl rm
heapq.py	22877	0644	edit dl rm
hmac.py	8043	0644	edit dl rm
imaplib.py	55256	0644	edit dl rm
imghdr.py	3808	0644	edit dl rm
imp.py	10536	0644	edit dl rm
inspect.py	118235	0644	edit dl rm
io.py	3541	0644	edit dl rm
ipaddress.py	80924	0644	edit dl rm
keyword.py	1047	0644	edit dl rm
LICENSE.txt	13937	0644	edit dl rm
linecache.py	5461	0644	edit dl rm
locale.py	78271	0644	edit dl rm
lzma.py	13231	0644	edit dl rm
mailbox.py	78794	0644	edit dl rm
mailcap.py	9116	0644	edit dl rm
mimetypes.py	21564	0644	edit dl rm
modulefinder.py	24401	0644	edit dl rm
netrc.py	5566	0644	edit dl rm
nntplib.py	41023	0644	edit dl rm
ntpath.py	26460	0644	edit dl rm
nturl2path.py	2887	0644	edit dl rm
numbers.py	10338	0644	edit dl rm
opcode.py	5660	0644	edit dl rm
operator.py	10751	0644	edit dl rm
optparse.py	60369	0644	edit dl rm
os.py	39065	0644	edit dl rm
pathlib.py	51134	0644	edit dl rm
pdb.py	63237	0755	edit dl rm
pickle.py	64920	0644	edit dl rm
pickletools.py	93486	0644	edit dl rm
pipes.py	8916	0644	edit dl rm
pkgutil.py	24276	0644	edit dl rm
platform.py	40601	0755	edit dl rm
plistlib.py	28248	0644	edit dl rm
poplib.py	15198	0644	edit dl rm
posixpath.py	16146	0644	edit dl rm
pprint.py	22527	0644	edit dl rm
profile.py	22881	0755	edit dl rm
pstats.py	29326	0644	edit dl rm
pty.py	4807	0644	edit dl rm
pyclbr.py	15255	0644	edit dl rm
pydoc.py	109599	0755	edit dl rm
py_compile.py	8203	0644	edit dl rm
queue.py	11496	0644	edit dl rm
quopri.py	7266	0755	edit dl rm
random.py	31484	0644	edit dl rm
re.py	15861	0644	edit dl rm
reprlib.py	5267	0644	edit dl rm
rlcompleter.py	7648	0644	edit dl rm
runpy.py	13084	0644	edit dl rm
sched.py	6442	0644	edit dl rm
secrets.py	2036	0644	edit dl rm
selectors.py	19536	0644	edit dl rm
shelve.py	8527	0644	edit dl rm
shlex.py	13501	0644	edit dl rm
shutil.py	53030	0644	edit dl rm
signal.py	2438	0644	edit dl rm
site.py	22085	0644	edit dl rm
smtpd.py	34821	0755	edit dl rm
smtplib.py	45405	0755	edit dl rm
sndhdr.py	7099	0644	edit dl rm
socket.py	36915	0644	edit dl rm
socketserver.py	27296	0644	edit dl rm
sre_compile.py	27973	0644	edit dl rm
sre_constants.py	7177	0644	edit dl rm
sre_parse.py	40779	0644	edit dl rm
ssl.py	52622	0644	edit dl rm
stat.py	5485	0644	edit dl rm
statistics.py	38067	0644	edit dl rm
string.py	10566	0644	edit dl rm
stringprep.py	12917	0644	edit dl rm
struct.py	257	0644	edit dl rm
subprocess.py	83564	0644	edit dl rm
sunau.py	18158	0644	edit dl rm
symbol.py	2281	0644	edit dl rm
symtable.py	7905	0644	edit dl rm
sysconfig.py	25557	0644	edit dl rm
tabnanny.py	11406	0755	edit dl rm
tarfile.py	112939	0755	edit dl rm
telnetlib.py	23254	0644	edit dl rm
tempfile.py	27963	0644	edit dl rm
textwrap.py	19407	0644	edit dl rm
this.py	1003	0644	edit dl rm
threading.py	54176	0644	edit dl rm
timeit.py	13480	0755	edit dl rm
token.py	2368	0644	edit dl rm
tokenize.py	25883	0644	edit dl rm
trace.py	29207	0755	edit dl rm
traceback.py	24660	0644	edit dl rm
tracemalloc.py	18047	0644	edit dl rm
tty.py	879	0644	edit dl rm
types.py	9785	0644	edit dl rm
typing.py	77044	0644	edit dl rm
uu.py	7277	0644	edit dl rm
uuid.py	27324	0644	edit dl rm
warnings.py	19688	0644	edit dl rm
wave.py	18004	0644	edit dl rm
weakref.py	21560	0644	edit dl rm
webbrowser.py	24083	0755	edit dl rm
xdrlib.py	5913	0644	edit dl rm
zipapp.py	7535	0644	edit dl rm
zipfile.py	88899	0644	edit dl rm
zipimport.py	30765	0644	edit dl rm
_aix_support.py	3389	0644	edit dl rm
_bootlocale.py	1801	0644	edit dl rm
_bootsubprocess.py	2675	0644	edit dl rm
_collections_abc.py	29374	0644	edit dl rm
_compat_pickle.py	8749	0644	edit dl rm
_compression.py	5340	0644	edit dl rm
_markupbase.py	14623	0644	edit dl rm
_osx_support.py	21773	0644	edit dl rm
_pydecimal.py	228666	0644	edit dl rm
_pyio.py	93316	0644	edit dl rm
_py_abc.py	6189	0644	edit dl rm
_sitebuiltins.py	3115	0644	edit dl rm
_strptime.py	25277	0644	edit dl rm
_sysconfigdata__linux_x86_64-linux-gnu.py	41236	0644	edit dl rm
_threading_local.py	7220	0644	edit dl rm
_weakrefset.py	5923	0644	edit dl rm
__future__.py	5147	0644	edit dl rm
__phello__.foo.py	64	0644	edit dl rm

Edit: /usr/lib64/python3.9/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: