SILENT KILLERPanel

Current Path: > > opt > > alt > python310 > lib64 > python3.10


Operation   : Linux premium131.web-hosting.com 4.18.0-553.44.1.lve.el8.x86_64 #1 SMP Thu Mar 13 14:29:12 UTC 2025 x86_64
Software     : Apache
Server IP    : 162.0.232.56 | Your IP: 216.73.216.111
Domains      : 1034 Domain(s)
Permission   : [ 0755 ]

Files and Folders in: //opt//alt/python310/lib64/python3.10

NameTypeSizeLast ModifiedActions
__pycache__ Directory - -
asyncio Directory - -
collections Directory - -
concurrent Directory - -
config-3.10-x86_64-linux-gnu Directory - -
ctypes Directory - -
curses Directory - -
dbm Directory - -
distutils Directory - -
email Directory - -
encodings Directory - -
ensurepip Directory - -
html Directory - -
http Directory - -
importlib Directory - -
json Directory - -
lib-dynload Directory - -
lib2to3 Directory - -
logging Directory - -
multiprocessing Directory - -
pydoc_data Directory - -
site-packages Directory - -
sqlite3 Directory - -
unittest Directory - -
urllib Directory - -
venv Directory - -
wsgiref Directory - -
xml Directory - -
xmlrpc Directory - -
zoneinfo Directory - -
LICENSE.txt File 13936 bytes June 03 2025 18:23:41.
__future__.py File 5155 bytes June 03 2025 18:23:41.
__phello__.foo.py File 64 bytes June 03 2025 18:23:41.
_aix_support.py File 3270 bytes June 03 2025 18:23:41.
_bootsubprocess.py File 2675 bytes June 03 2025 18:23:41.
_collections_abc.py File 32284 bytes June 03 2025 18:23:41.
_compat_pickle.py File 8749 bytes June 03 2025 18:23:41.
_compression.py File 5681 bytes June 03 2025 18:23:41.
_markupbase.py File 14653 bytes June 03 2025 18:23:41.
_osx_support.py File 21787 bytes June 03 2025 18:23:41.
_py_abc.py File 6189 bytes June 03 2025 18:23:41.
_pydecimal.py File 228676 bytes June 03 2025 18:23:41.
_pyio.py File 94467 bytes June 03 2025 18:23:41.
_sitebuiltins.py File 3128 bytes June 03 2025 18:23:41.
_strptime.py File 25277 bytes June 03 2025 18:23:41.
_sysconfigdata__linux_x86_64-linux-gnu.py File 41345 bytes June 18 2025 15:53:46.
_sysconfigdata_d_linux_x86_64-linux-gnu.py File 40763 bytes June 18 2025 15:42:57.
_threading_local.py File 7220 bytes June 03 2025 18:23:41.
_weakrefset.py File 5923 bytes June 03 2025 18:23:41.
abc.py File 6522 bytes June 03 2025 18:23:41.
aifc.py File 32605 bytes June 03 2025 18:23:41.
antigravity.py File 500 bytes June 03 2025 18:23:41.
argparse.py File 98543 bytes June 03 2025 18:23:41.
ast.py File 59900 bytes June 03 2025 18:23:41.
asynchat.py File 11520 bytes June 03 2025 18:23:41.
asyncore.py File 20268 bytes June 03 2025 18:23:41.
base64.py File 20860 bytes June 03 2025 18:23:41.
bdb.py File 32396 bytes June 03 2025 18:23:41.
binhex.py File 14784 bytes June 03 2025 18:23:41.
bisect.py File 3135 bytes June 03 2025 18:23:41.
bz2.py File 11847 bytes June 03 2025 18:23:41.
cProfile.py File 6360 bytes June 03 2025 18:23:41.
calendar.py File 24575 bytes June 03 2025 18:23:41.
cgi.py File 34111 bytes June 03 2025 18:23:41.
cgitb.py File 12096 bytes June 03 2025 18:23:41.
chunk.py File 5435 bytes June 03 2025 18:23:41.
cmd.py File 14860 bytes June 03 2025 18:23:41.
code.py File 10622 bytes June 03 2025 18:23:41.
codecs.py File 36714 bytes June 03 2025 18:23:41.
codeop.py File 5609 bytes June 03 2025 18:23:41.
colorsys.py File 4017 bytes June 03 2025 18:23:41.
compileall.py File 20252 bytes June 03 2025 18:23:41.
configparser.py File 54612 bytes June 03 2025 18:23:41.
contextlib.py File 25882 bytes June 03 2025 18:23:41.
contextvars.py File 129 bytes June 03 2025 18:23:41.
copy.py File 8681 bytes June 03 2025 18:23:41.
copyreg.py File 7426 bytes June 03 2025 18:23:41.
crypt.py File 3848 bytes June 03 2025 18:23:41.
csv.py File 16030 bytes June 03 2025 18:23:41.
dataclasses.py File 56390 bytes June 03 2025 18:23:41.
datetime.py File 88086 bytes June 03 2025 18:23:41.
decimal.py File 320 bytes June 03 2025 18:23:41.
difflib.py File 83308 bytes June 03 2025 18:23:41.
dis.py File 20020 bytes June 03 2025 18:23:41.
doctest.py File 105143 bytes June 03 2025 18:23:41.
enum.py File 39831 bytes June 03 2025 18:23:41.
filecmp.py File 10178 bytes June 03 2025 18:23:41.
fileinput.py File 16442 bytes June 03 2025 18:23:41.
fnmatch.py File 6713 bytes June 03 2025 18:23:41.
fractions.py File 28242 bytes June 03 2025 18:23:41.
ftplib.py File 35496 bytes June 03 2025 18:23:41.
functools.py File 38076 bytes June 03 2025 18:23:41.
genericpath.py File 5246 bytes June 03 2025 18:23:41.
getopt.py File 7489 bytes June 03 2025 18:23:41.
getpass.py File 5990 bytes June 03 2025 18:23:41.
gettext.py File 27266 bytes June 03 2025 18:23:41.
glob.py File 7888 bytes June 03 2025 18:23:41.
graphlib.py File 9573 bytes June 03 2025 18:23:41.
gzip.py File 21849 bytes June 03 2025 18:23:41.
hashlib.py File 10229 bytes June 03 2025 18:23:41.
heapq.py File 22877 bytes June 03 2025 18:23:41.
hmac.py File 7717 bytes June 03 2025 18:23:41.
imaplib.py File 55218 bytes June 03 2025 18:23:41.
imghdr.py File 3808 bytes June 03 2025 18:23:41.
imp.py File 10591 bytes June 03 2025 18:23:41.
inspect.py File 124378 bytes June 03 2025 18:23:41.
io.py File 4196 bytes June 03 2025 18:23:41.
ipaddress.py File 80837 bytes June 03 2025 18:23:41.
keyword.py File 1061 bytes June 03 2025 18:23:41.
linecache.py File 5690 bytes June 03 2025 18:23:41.
locale.py File 78124 bytes June 03 2025 18:23:41.
lzma.py File 13277 bytes June 03 2025 18:23:41.
mailbox.py File 78794 bytes June 03 2025 18:23:41.
mailcap.py File 9116 bytes June 03 2025 18:23:41.
mimetypes.py File 22539 bytes June 03 2025 18:23:41.
modulefinder.py File 24401 bytes June 03 2025 18:23:41.
netrc.py File 5747 bytes June 03 2025 18:23:41.
nntplib.py File 41023 bytes June 03 2025 18:23:41.
ntpath.py File 29944 bytes June 03 2025 18:23:41.
nturl2path.py File 2887 bytes June 03 2025 18:23:41.
numbers.py File 10348 bytes June 03 2025 18:23:41.
opcode.py File 5902 bytes June 03 2025 18:23:41.
operator.py File 10751 bytes June 03 2025 18:23:41.
optparse.py File 60369 bytes June 03 2025 18:23:41.
os.py File 39557 bytes June 03 2025 18:23:41.
pathlib.py File 49575 bytes June 03 2025 18:23:41.
pdb.py File 63238 bytes June 03 2025 18:23:41.
pickle.py File 64949 bytes June 03 2025 18:23:41.
pickletools.py File 93486 bytes June 03 2025 18:23:41.
pipes.py File 8914 bytes June 03 2025 18:23:41.
pkgutil.py File 24576 bytes June 03 2025 18:23:41.
platform.py File 42036 bytes June 03 2025 18:23:41.
plistlib.py File 28352 bytes June 03 2025 18:23:41.
poplib.py File 15198 bytes June 03 2025 18:23:41.
posixpath.py File 16436 bytes June 03 2025 18:23:41.
pprint.py File 24444 bytes June 03 2025 18:23:41.
profile.py File 22896 bytes June 03 2025 18:23:41.
pstats.py File 29326 bytes June 03 2025 18:23:41.
pty.py File 5213 bytes June 03 2025 18:23:41.
py_compile.py File 7892 bytes June 18 2025 15:40:22.
pyclbr.py File 11396 bytes June 03 2025 18:23:41.
pydoc.py File 109603 bytes June 03 2025 18:23:41.
queue.py File 11496 bytes June 03 2025 18:23:41.
quopri.py File 7281 bytes June 03 2025 18:23:41.
random.py File 33221 bytes June 03 2025 18:23:41.
re.py File 15860 bytes June 03 2025 18:23:41.
reprlib.py File 5267 bytes June 03 2025 18:23:41.
rlcompleter.py File 7817 bytes June 03 2025 18:23:41.
runpy.py File 13111 bytes June 03 2025 18:23:41.
sched.py File 6351 bytes June 03 2025 18:23:41.
secrets.py File 2036 bytes June 03 2025 18:23:41.
selectors.py File 19536 bytes June 03 2025 18:23:41.
shelve.py File 8560 bytes June 03 2025 18:23:41.
shlex.py File 13501 bytes June 03 2025 18:23:41.
shutil.py File 54572 bytes June 03 2025 18:23:41.
signal.py File 2438 bytes June 03 2025 18:23:41.
site.py File 22926 bytes June 03 2025 18:23:41.
smtpd.py File 35178 bytes June 03 2025 18:23:41.
smtplib.py File 45431 bytes June 03 2025 18:23:41.
sndhdr.py File 7099 bytes June 03 2025 18:23:41.
socket.py File 37006 bytes June 03 2025 18:23:41.
socketserver.py File 27296 bytes June 03 2025 18:23:41.
sre_compile.py File 27973 bytes June 03 2025 18:23:41.
sre_constants.py File 7177 bytes June 03 2025 18:23:41.
sre_parse.py File 40779 bytes June 03 2025 18:23:41.
ssl.py File 53895 bytes June 03 2025 18:23:41.
stat.py File 5485 bytes June 03 2025 18:23:41.
statistics.py File 43205 bytes June 03 2025 18:23:41.
string.py File 10566 bytes June 03 2025 18:23:41.
stringprep.py File 12917 bytes June 03 2025 18:23:41.
struct.py File 257 bytes June 03 2025 18:23:41.
subprocess.py File 84917 bytes June 03 2025 18:23:41.
sunau.py File 18158 bytes June 03 2025 18:23:41.
symtable.py File 10217 bytes June 03 2025 18:23:41.
sysconfig.py File 27609 bytes June 03 2025 18:23:41.
tabnanny.py File 11312 bytes June 03 2025 18:23:41.
tarfile.py File 111609 bytes June 03 2025 18:23:41.
telnetlib.py File 23254 bytes June 03 2025 18:23:41.
tempfile.py File 29469 bytes June 03 2025 18:23:41.
textwrap.py File 19772 bytes June 03 2025 18:23:41.
this.py File 1003 bytes June 03 2025 18:23:41.
threading.py File 56742 bytes June 18 2025 15:40:22.
timeit.py File 13508 bytes June 03 2025 18:23:41.
token.py File 2386 bytes June 03 2025 18:23:41.
tokenize.py File 25921 bytes June 03 2025 18:23:41.
trace.py File 29229 bytes June 03 2025 18:23:41.
traceback.py File 26222 bytes June 03 2025 18:23:41.
tracemalloc.py File 18047 bytes June 03 2025 18:23:41.
tty.py File 879 bytes June 03 2025 18:23:41.
types.py File 10117 bytes June 03 2025 18:23:41.
typing.py File 92557 bytes June 03 2025 18:23:41.
uu.py File 7277 bytes June 18 2025 15:55:11.
uuid.py File 27500 bytes June 03 2025 18:23:41.
warnings.py File 19688 bytes June 03 2025 18:23:41.
wave.py File 18004 bytes June 03 2025 18:23:41.
weakref.py File 21560 bytes June 03 2025 18:23:41.
webbrowser.py File 24258 bytes June 03 2025 18:23:41.
xdrlib.py File 5913 bytes June 03 2025 18:23:41.
zipapp.py File 7535 bytes June 03 2025 18:23:41.
zipfile.py File 90201 bytes June 03 2025 18:23:41.
zipimport.py File 30891 bytes June 03 2025 18:23:41.

Reading File: //opt//alt/python310/lib64/python3.10/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', '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.

        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

SILENT KILLER Tool