System
:
Linux server1.ontime-gulf.com 4.18.0-553.5.1.el8_10.x86_64 #1 SMP Wed Jun 5 09:12:13 EDT 2024 x86_64
Software
:
Apache
Server
:
162.0.230.206
Domains
:
40 Domain
Permission
:
[
drwxr-xr-x
]
:
/
lib64
/
python3.12
/
216.73.216.141
Select
Submit
Home
Add User
Mailer
About
DBName
DBUser
DBPass
DBHost
WpUser
WpPass
Input e-mail
ACUPOFTEA for accounting.gulfstore-gcc.com made by tabagkayu.
Folder Name
File Name
File Content
File
_collections_abc.py
# Copyright 2007 Google, Inc. All Rights Reserved. # Licensed to PSF under a Contributor Agreement. """Abstract Base Classes (ABCs) for collections, according to PEP 3119. Unit tests are in test_collections. """ ############ Maintenance notes ######################################### # # ABCs are different from other standard library modules in that they # specify compliance tests. In general, once an ABC has been published, # new methods (either abstract or concrete) cannot be added. # # Though classes that inherit from an ABC would automatically receive a # new mixin method, registered classes would become non-compliant and # violate the contract promised by ``isinstance(someobj, SomeABC)``. # # Though irritating, the correct procedure for adding new abstract or # mixin methods is to create a new ABC as a subclass of the previous # ABC. For example, union(), intersection(), and difference() cannot # be added to Set but could go into a new ABC that extends Set. # # Because they are so hard to change, new ABCs should have their APIs # carefully thought through prior to publication. # # Since ABCMeta only checks for the presence of methods, it is possible # to alter the signature of a method by adding optional arguments # or changing parameters names. This is still a bit dubious but at # least it won't cause isinstance() to return an incorrect result. # # ####################################################################### from abc import ABCMeta, abstractmethod import sys GenericAlias = type(list[int]) EllipsisType = type(...) def _f(): pass FunctionType = type(_f) del _f __all__ = ["Awaitable", "Coroutine", "AsyncIterable", "AsyncIterator", "AsyncGenerator", "Hashable", "Iterable", "Iterator", "Generator", "Reversible", "Sized", "Container", "Callable", "Collection", "Set", "MutableSet", "Mapping", "MutableMapping", "MappingView", "KeysView", "ItemsView", "ValuesView", "Sequence", "MutableSequence", "ByteString", "Buffer", ] # This module has been renamed from collections.abc to _collections_abc to # speed up interpreter startup. Some of the types such as MutableMapping are # required early but collections module imports a lot of other modules. # See issue #19218 __name__ = "collections.abc" # Private list of types that we want to register with the various ABCs # so that they will pass tests like: # it = iter(somebytearray) # assert isinstance(it, Iterable) # Note: in other implementations, these types might not be distinct # and they may have their own implementation specific types that # are not included on this list. bytes_iterator = type(iter(b'')) bytearray_iterator = type(iter(bytearray())) #callable_iterator = ??? dict_keyiterator = type(iter({}.keys())) dict_valueiterator = type(iter({}.values())) dict_itemiterator = type(iter({}.items())) list_iterator = type(iter([])) list_reverseiterator = type(iter(reversed([]))) range_iterator = type(iter(range(0))) longrange_iterator = type(iter(range(1 << 1000))) set_iterator = type(iter(set())) str_iterator = type(iter("")) tuple_iterator = type(iter(())) zip_iterator = type(iter(zip())) ## views ## dict_keys = type({}.keys()) dict_values = type({}.values()) dict_items = type({}.items()) ## misc ## mappingproxy = type(type.__dict__) generator = type((lambda: (yield))()) ## coroutine ## async def _coro(): pass _coro = _coro() coroutine = type(_coro) _coro.close() # Prevent ResourceWarning del _coro ## asynchronous generator ## async def _ag(): yield _ag = _ag() async_generator = type(_ag) del _ag ### ONE-TRICK PONIES ### def _check_methods(C, *methods): mro = C.__mro__ for method in methods: for B in mro: if method in B.__dict__: if B.__dict__[method] is None: return NotImplemented break else: return NotImplemented return True class Hashable(metaclass=ABCMeta): __slots__ = () @abstractmethod def __hash__(self): return 0 @classmethod def __subclasshook__(cls, C): if cls is Hashable: return _check_methods(C, "__hash__") return NotImplemented class Awaitable(metaclass=ABCMeta): __slots__ = () @abstractmethod def __await__(self): yield @classmethod def __subclasshook__(cls, C): if cls is Awaitable: return _check_methods(C, "__await__") return NotImplemented __class_getitem__ = classmethod(GenericAlias) class Coroutine(Awaitable): __slots__ = () @abstractmethod def send(self, value): """Send a value into the coroutine. Return next yielded value or raise StopIteration. """ raise StopIteration @abstractmethod def throw(self, typ, val=None, tb=None): """Raise an exception in the coroutine. Return next yielded value or raise StopIteration. """ if val is None: if tb is None: raise typ val = typ() if tb is not None: val = val.with_traceback(tb) raise val def close(self): """Raise GeneratorExit inside coroutine. """ try: self.throw(GeneratorExit) except (GeneratorExit, StopIteration): pass else: raise RuntimeError("coroutine ignored GeneratorExit") @classmethod def __subclasshook__(cls, C): if cls is Coroutine: return _check_methods(C, '__await__', 'send', 'throw', 'close') return NotImplemented Coroutine.register(coroutine) class AsyncIterable(metaclass=ABCMeta): __slots__ = () @abstractmethod def __aiter__(self): return AsyncIterator() @classmethod def __subclasshook__(cls, C): if cls is AsyncIterable: return _check_methods(C, "__aiter__") return NotImplemented __class_getitem__ = classmethod(GenericAlias) class AsyncIterator(AsyncIterable): __slots__ = () @abstractmethod async def __anext__(self): """Return the next item or raise StopAsyncIteration when exhausted.""" raise StopAsyncIteration def __aiter__(self): return self @classmethod def __subclasshook__(cls, C): if cls is AsyncIterator: return _check_methods(C, "__anext__", "__aiter__") return NotImplemented class AsyncGenerator(AsyncIterator): __slots__ = () async def __anext__(self): """Return the next item from the asynchronous generator. When exhausted, raise StopAsyncIteration. """ return await self.asend(None) @abstractmethod async def asend(self, value): """Send a value into the asynchronous generator. Return next yielded value or raise StopAsyncIteration. """ raise StopAsyncIteration @abstractmethod async def athrow(self, typ, val=None, tb=None): """Raise an exception in the asynchronous generator. Return next yielded value or raise StopAsyncIteration. """ if val is None: if tb is None: raise typ val = typ() if tb is not None: val = val.with_traceback(tb) raise val async def aclose(self): """Raise GeneratorExit inside coroutine. """ try: await self.athrow(GeneratorExit) except (GeneratorExit, StopAsyncIteration): pass else: raise RuntimeError("asynchronous generator ignored GeneratorExit") @classmethod def __subclasshook__(cls, C): if cls is AsyncGenerator: return _check_methods(C, '__aiter__', '__anext__', 'asend', 'athrow', 'aclose') return NotImplemented AsyncGenerator.register(async_generator) class Iterable(metaclass=ABCMeta): __slots__ = () @abstractmethod def __iter__(self): while False: yield None @classmethod def __subclasshook__(cls, C): if cls is Iterable: return _check_methods(C, "__iter__") return NotImplemented __class_getitem__ = classmethod(GenericAlias) class Iterator(Iterable): __slots__ = () @abstractmethod def __next__(self): 'Return the next item from the iterator. When exhausted, raise StopIteration' raise StopIteration def __iter__(self): return self @classmethod def __subclasshook__(cls, C): if cls is Iterator: return _check_methods(C, '__iter__', '__next__') return NotImplemented Iterator.register(bytes_iterator) Iterator.register(bytearray_iterator) #Iterator.register(callable_iterator) Iterator.register(dict_keyiterator) Iterator.register(dict_valueiterator) Iterator.register(dict_itemiterator) Iterator.register(list_iterator) Iterator.register(list_reverseiterator) Iterator.register(range_iterator) Iterator.register(longrange_iterator) Iterator.register(set_iterator) Iterator.register(str_iterator) Iterator.register(tuple_iterator) Iterator.register(zip_iterator) class Reversible(Iterable): __slots__ = () @abstractmethod def __reversed__(self): while False: yield None @classmethod def __subclasshook__(cls, C): if cls is Reversible: return _check_methods(C, "__reversed__", "__iter__") return NotImplemented class Generator(Iterator): __slots__ = () def __next__(self): """Return the next item from the generator. When exhausted, raise StopIteration. """ return self.send(None) @abstractmethod def send(self, value): """Send a value into the generator. Return next yielded value or raise StopIteration. """ raise StopIteration @abstractmethod def throw(self, typ, val=None, tb=None): """Raise an exception in the generator. Return next yielded value or raise StopIteration. """ if val is None: if tb is None: raise typ val = typ() if tb is not None: val = val.with_traceback(tb) raise val def close(self): """Raise GeneratorExit inside generator. """ try: self.throw(GeneratorExit) except (GeneratorExit, StopIteration): pass else: raise RuntimeError("generator ignored GeneratorExit") @classmethod def __subclasshook__(cls, C): if cls is Generator: return _check_methods(C, '__iter__', '__next__', 'send', 'throw', 'close') return NotImplemented Generator.register(generator) class Sized(metaclass=ABCMeta): __slots__ = () @abstractmethod def __len__(self): return 0 @classmethod def __subclasshook__(cls, C): if cls is Sized: return _check_methods(C, "__len__") return NotImplemented class Container(metaclass=ABCMeta): __slots__ = () @abstractmethod def __contains__(self, x): return False @classmethod def __subclasshook__(cls, C): if cls is Container: return _check_methods(C, "__contains__") return NotImplemented __class_getitem__ = classmethod(GenericAlias) class Collection(Sized, Iterable, Container): __slots__ = () @classmethod def __subclasshook__(cls, C): if cls is Collection: return _check_methods(C, "__len__", "__iter__", "__contains__") return NotImplemented class Buffer(metaclass=ABCMeta): __slots__ = () @abstractmethod def __buffer__(self, flags: int, /) -> memoryview: raise NotImplementedError @classmethod def __subclasshook__(cls, C): if cls is Buffer: return _check_methods(C, "__buffer__") return NotImplemented class _CallableGenericAlias(GenericAlias): """ Represent `Callable[argtypes, resulttype]`. This sets ``__args__`` to a tuple containing the flattened ``argtypes`` followed by ``resulttype``. Example: ``Callable[[int, str], float]`` sets ``__args__`` to ``(int, str, float)``. """ __slots__ = () def __new__(cls, origin, args): if not (isinstance(args, tuple) and len(args) == 2): raise TypeError( "Callable must be used as Callable[[arg, ...], result].") t_args, t_result = args if isinstance(t_args, (tuple, list)): args = (*t_args, t_result) elif not _is_param_expr(t_args): raise TypeError(f"Expected a list of types, an ellipsis, " f"ParamSpec, or Concatenate. Got {t_args}") return super().__new__(cls, origin, args) def __repr__(self): if len(self.__args__) == 2 and _is_param_expr(self.__args__[0]): return super().__repr__() return (f'collections.abc.Callable' f'[[{", ".join([_type_repr(a) for a in self.__args__[:-1]])}], ' f'{_type_repr(self.__args__[-1])}]') def __reduce__(self): args = self.__args__ if not (len(args) == 2 and _is_param_expr(args[0])): args = list(args[:-1]), args[-1] return _CallableGenericAlias, (Callable, args) def __getitem__(self, item): # Called during TypeVar substitution, returns the custom subclass # rather than the default types.GenericAlias object. Most of the # code is copied from typing's _GenericAlias and the builtin # types.GenericAlias. if not isinstance(item, tuple): item = (item,) new_args = super().__getitem__(item).__args__ # args[0] occurs due to things like Z[[int, str, bool]] from PEP 612 if not isinstance(new_args[0], (tuple, list)): t_result = new_args[-1] t_args = new_args[:-1] new_args = (t_args, t_result) return _CallableGenericAlias(Callable, tuple(new_args)) def _is_param_expr(obj): """Checks if obj matches either a list of types, ``...``, ``ParamSpec`` or ``_ConcatenateGenericAlias`` from typing.py """ if obj is Ellipsis: return True if isinstance(obj, list): return True obj = type(obj) names = ('ParamSpec', '_ConcatenateGenericAlias') return obj.__module__ == 'typing' and any(obj.__name__ == name for name in names) def _type_repr(obj): """Return the repr() of an object, special-casing types (internal helper). Copied from :mod:`typing` since collections.abc shouldn't depend on that module. (Keep this roughly in sync with the typing version.) """ if isinstance(obj, type): if obj.__module__ == 'builtins': return obj.__qualname__ return f'{obj.__module__}.{obj.__qualname__}' if obj is Ellipsis: return '...' if isinstance(obj, FunctionType): return obj.__name__ return repr(obj) class Callable(metaclass=ABCMeta): __slots__ = () @abstractmethod def __call__(self, *args, **kwds): return False @classmethod def __subclasshook__(cls, C): if cls is Callable: return _check_methods(C, "__call__") return NotImplemented __class_getitem__ = classmethod(_CallableGenericAlias) ### SETS ### class Set(Collection): """A set is a finite, iterable container. This class provides concrete generic implementations of all methods except for __contains__, __iter__ and __len__. To override the comparisons (presumably for speed, as the semantics are fixed), redefine __le__ and __ge__, then the other operations will automatically follow suit. """ __slots__ = () def __le__(self, other): if not isinstance(other, Set): return NotImplemented if len(self) > len(other): return False for elem in self: if elem not in other: return False return True def __lt__(self, other): if not isinstance(other, Set): return NotImplemented return len(self) < len(other) and self.__le__(other) def __gt__(self, other): if not isinstance(other, Set): return NotImplemented return len(self) > len(other) and self.__ge__(other) def __ge__(self, other): if not isinstance(other, Set): return NotImplemented if len(self) < len(other): return False for elem in other: if elem not in self: return False return True def __eq__(self, other): if not isinstance(other, Set): return NotImplemented return len(self) == len(other) and self.__le__(other) @classmethod def _from_iterable(cls, it): '''Construct an instance of the class from any iterable input. Must override this method if the class constructor signature does not accept an iterable for an input. ''' return cls(it) def __and__(self, other): if not isinstance(other, Iterable): return NotImplemented return self._from_iterable(value for value in other if value in self) __rand__ = __and__ def isdisjoint(self, other): 'Return True if two sets have a null intersection.' for value in other: if value in self: return False return True def __or__(self, other): if not isinstance(other, Iterable): return NotImplemented chain = (e for s in (self, other) for e in s) return self._from_iterable(chain) __ror__ = __or__ def __sub__(self, other): if not isinstance(other, Set): if not isinstance(other, Iterable): return NotImplemented other = self._from_iterable(other) return self._from_iterable(value for value in self if value not in other) def __rsub__(self, other): if not isinstance(other, Set): if not isinstance(other, Iterable): return NotImplemented other = self._from_iterable(other) return self._from_iterable(value for value in other if value not in self) def __xor__(self, other): if not isinstance(other, Set): if not isinstance(other, Iterable): return NotImplemented other = self._from_iterable(other) return (self - other) | (other - self) __rxor__ = __xor__ def _hash(self): """Compute the hash value of a set. Note that we don't define __hash__: not all sets are hashable. But if you define a hashable set type, its __hash__ should call this function. This must be compatible __eq__. All sets ought to compare equal if they contain the same elements, regardless of how they are implemented, and regardless of the order of the elements; so there's not much freedom for __eq__ or __hash__. We match the algorithm used by the built-in frozenset type. """ MAX = sys.maxsize MASK = 2 * MAX + 1 n = len(self) h = 1927868237 * (n + 1) h &= MASK for x in self: hx = hash(x) h ^= (hx ^ (hx << 16) ^ 89869747) * 3644798167 h &= MASK h ^= (h >> 11) ^ (h >> 25) h = h * 69069 + 907133923 h &= MASK if h > MAX: h -= MASK + 1 if h == -1: h = 590923713 return h Set.register(frozenset) class MutableSet(Set): """A mutable set is a finite, iterable container. This class provides concrete generic implementations of all methods except for __contains__, __iter__, __len__, add(), and discard(). To override the comparisons (presumably for speed, as the semantics are fixed), all you have to do is redefine __le__ and then the other operations will automatically follow suit. """ __slots__ = () @abstractmethod def add(self, value): """Add an element.""" raise NotImplementedError @abstractmethod def discard(self, value): """Remove an element. Do not raise an exception if absent.""" raise NotImplementedError def remove(self, value): """Remove an element. If not a member, raise a KeyError.""" if value not in self: raise KeyError(value) self.discard(value) def pop(self): """Return the popped value. Raise KeyError if empty.""" it = iter(self) try: value = next(it) except StopIteration: raise KeyError from None self.discard(value) return value def clear(self): """This is slow (creates N new iterators!) but effective.""" try: while True: self.pop() except KeyError: pass def __ior__(self, it): for value in it: self.add(value) return self def __iand__(self, it): for value in (self - it): self.discard(value) return self def __ixor__(self, it): if it is self: self.clear() else: if not isinstance(it, Set): it = self._from_iterable(it) for value in it: if value in self: self.discard(value) else: self.add(value) return self def __isub__(self, it): if it is self: self.clear() else: for value in it: self.discard(value) return self MutableSet.register(set) ### MAPPINGS ### class Mapping(Collection): """A Mapping is a generic container for associating key/value pairs. This class provides concrete generic implementations of all methods except for __getitem__, __iter__, and __len__. """ __slots__ = () # Tell ABCMeta.__new__ that this class should have TPFLAGS_MAPPING set. __abc_tpflags__ = 1 << 6 # Py_TPFLAGS_MAPPING @abstractmethod def __getitem__(self, key): raise KeyError def get(self, key, default=None): 'D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.' try: return self[key] except KeyError: return default def __contains__(self, key): try: self[key] except KeyError: return False else: return True def keys(self): "D.keys() -> a set-like object providing a view on D's keys" return KeysView(self) def items(self): "D.items() -> a set-like object providing a view on D's items" return ItemsView(self) def values(self): "D.values() -> an object providing a view on D's values" return ValuesView(self) def __eq__(self, other): if not isinstance(other, Mapping): return NotImplemented return dict(self.items()) == dict(other.items()) __reversed__ = None Mapping.register(mappingproxy) class MappingView(Sized): __slots__ = '_mapping', def __init__(self, mapping): self._mapping = mapping def __len__(self): return len(self._mapping) def __repr__(self): return '{0.__class__.__name__}({0._mapping!r})'.format(self) __class_getitem__ = classmethod(GenericAlias) class KeysView(MappingView, Set): __slots__ = () @classmethod def _from_iterable(cls, it): return set(it) def __contains__(self, key): return key in self._mapping def __iter__(self): yield from self._mapping KeysView.register(dict_keys) class ItemsView(MappingView, Set): __slots__ = () @classmethod def _from_iterable(cls, it): return set(it) def __contains__(self, item): key, value = item try: v = self._mapping[key] except KeyError: return False else: return v is value or v == value def __iter__(self): for key in self._mapping: yield (key, self._mapping[key]) ItemsView.register(dict_items) class ValuesView(MappingView, Collection): __slots__ = () def __contains__(self, value): for key in self._mapping: v = self._mapping[key] if v is value or v == value: return True return False def __iter__(self): for key in self._mapping: yield self._mapping[key] ValuesView.register(dict_values) class MutableMapping(Mapping): """A MutableMapping is a generic container for associating key/value pairs. This class provides concrete generic implementations of all methods except for __getitem__, __setitem__, __delitem__, __iter__, and __len__. """ __slots__ = () @abstractmethod def __setitem__(self, key, value): raise KeyError @abstractmethod def __delitem__(self, key): raise KeyError __marker = object() def pop(self, key, default=__marker): '''D.pop(k[,d]) -> v, remove specified key and return the corresponding value. If key is not found, d is returned if given, otherwise KeyError is raised. ''' try: value = self[key] except KeyError: if default is self.__marker: raise return default else: del self[key] return value def popitem(self): '''D.popitem() -> (k, v), remove and return some (key, value) pair as a 2-tuple; but raise KeyError if D is empty. ''' try: key = next(iter(self)) except StopIteration: raise KeyError from None value = self[key] del self[key] return key, value def clear(self): 'D.clear() -> None. Remove all items from D.' try: while True: self.popitem() except KeyError: pass def update(self, other=(), /, **kwds): ''' D.update([E, ]**F) -> None. Update D from mapping/iterable E and F. If E present and has a .keys() method, does: for k in E.keys(): D[k] = E[k] If E present and lacks .keys() method, does: for (k, v) in E: D[k] = v In either case, this is followed by: for k, v in F.items(): D[k] = v ''' if isinstance(other, Mapping): for key in other: self[key] = other[key] elif hasattr(other, "keys"): for key in other.keys(): self[key] = other[key] else: for key, value in other: self[key] = value for key, value in kwds.items(): self[key] = value def setdefault(self, key, default=None): 'D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in D' try: return self[key] except KeyError: self[key] = default return default MutableMapping.register(dict) ### SEQUENCES ### class Sequence(Reversible, Collection): """All the operations on a read-only sequence. Concrete subclasses must override __new__ or __init__, __getitem__, and __len__. """ __slots__ = () # Tell ABCMeta.__new__ that this class should have TPFLAGS_SEQUENCE set. __abc_tpflags__ = 1 << 5 # Py_TPFLAGS_SEQUENCE @abstractmethod def __getitem__(self, index): raise IndexError def __iter__(self): i = 0 try: while True: v = self[i] yield v i += 1 except IndexError: return def __contains__(self, value): for v in self: if v is value or v == value: return True return False def __reversed__(self): for i in reversed(range(len(self))): yield self[i] def index(self, value, start=0, stop=None): '''S.index(value, [start, [stop]]) -> integer -- return first index of value. Raises ValueError if the value is not present. Supporting start and stop arguments is optional, but recommended. ''' if start is not None and start < 0: start = max(len(self) + start, 0) if stop is not None and stop < 0: stop += len(self) i = start while stop is None or i < stop: try: v = self[i] except IndexError: break if v is value or v == value: return i i += 1 raise ValueError def count(self, value): 'S.count(value) -> integer -- return number of occurrences of value' return sum(1 for v in self if v is value or v == value) Sequence.register(tuple) Sequence.register(str) Sequence.register(range) Sequence.register(memoryview) class _DeprecateByteStringMeta(ABCMeta): def __new__(cls, name, bases, namespace, **kwargs): if name != "ByteString": import warnings warnings._deprecated( "collections.abc.ByteString", remove=(3, 14), ) return super().__new__(cls, name, bases, namespace, **kwargs) def __instancecheck__(cls, instance): import warnings warnings._deprecated( "collections.abc.ByteString", remove=(3, 14), ) return super().__instancecheck__(instance) class ByteString(Sequence, metaclass=_DeprecateByteStringMeta): """This unifies bytes and bytearray. XXX Should add all their methods. """ __slots__ = () ByteString.register(bytes) ByteString.register(bytearray) class MutableSequence(Sequence): """All the operations on a read-write sequence. Concrete subclasses must provide __new__ or __init__, __getitem__, __setitem__, __delitem__, __len__, and insert(). """ __slots__ = () @abstractmethod def __setitem__(self, index, value): raise IndexError @abstractmethod def __delitem__(self, index): raise IndexError @abstractmethod def insert(self, index, value): 'S.insert(index, value) -- insert value before index' raise IndexError def append(self, value): 'S.append(value) -- append value to the end of the sequence' self.insert(len(self), value) def clear(self): 'S.clear() -> None -- remove all items from S' try: while True: self.pop() except IndexError: pass def reverse(self): 'S.reverse() -- reverse *IN PLACE*' n = len(self) for i in range(n//2): self[i], self[n-i-1] = self[n-i-1], self[i] def extend(self, values): 'S.extend(iterable) -- extend sequence by appending elements from the iterable' if values is self: values = list(values) for v in values: self.append(v) def pop(self, index=-1): '''S.pop([index]) -> item -- remove and return item at index (default last). Raise IndexError if list is empty or index is out of range. ''' v = self[index] del self[index] return v def remove(self, value): '''S.remove(value) -- remove first occurrence of value. Raise ValueError if the value is not present. ''' del self[self.index(value)] def __iadd__(self, values): self.extend(values) return self MutableSequence.register(list) MutableSequence.register(bytearray) # Multiply inheriting, see ByteString
New name for
Are you sure will delete
?
New date for
New perm for
Name
Type
Size
Permission
Last Modified
Actions
.
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
..
DIR
-
dr-xr-xr-x
2025-12-09 11:00:27
__pycache__
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
asyncio
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
collections
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
concurrent
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
config-3.12-x86_64-linux-gnu
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
ctypes
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
curses
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
dbm
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
email
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
encodings
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
ensurepip
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
html
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
http
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
importlib
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
json
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
lib-dynload
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
lib2to3
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
logging
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
multiprocessing
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
pydoc_data
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
re
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
site-packages
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
sqlite3
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
tkinter
DIR
-
drwxr-xr-x
2025-12-09 10:58:05
tomllib
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
turtledemo
DIR
-
drwxr-xr-x
2025-12-09 10:58:05
unittest
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
urllib
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
venv
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
wsgiref
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
xml
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
xmlrpc
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
zipfile
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
zoneinfo
DIR
-
drwxr-xr-x
2025-12-09 10:58:06
LICENSE.txt
text/plain
13.61 KB
-rw-r--r--
2025-06-03 03:41:47
__future__.py
text/plain
5.1 KB
-rw-r--r--
2025-06-03 03:41:47
__hello__.py
text/plain
227 B
-rw-r--r--
2025-06-03 03:41:47
_aix_support.py
text/plain
3.93 KB
-rw-r--r--
2025-06-03 03:41:47
_collections_abc.py
text/x-script.python
31.34 KB
-rw-r--r--
2025-06-03 03:41:47
_compat_pickle.py
text/plain
8.56 KB
-rw-r--r--
2025-06-03 03:41:47
_compression.py
text/plain
5.55 KB
-rw-r--r--
2025-06-03 03:41:47
_markupbase.py
text/plain
14.31 KB
-rw-r--r--
2025-06-03 03:41:47
_osx_support.py
text/plain
21.51 KB
-rw-r--r--
2025-06-03 03:41:47
_py_abc.py
text/x-script.python
6.04 KB
-rw-r--r--
2025-06-03 03:41:47
_pydatetime.py
text/plain
89.93 KB
-rw-r--r--
2025-06-03 03:41:47
_pydecimal.py
text/x-script.python
221.96 KB
-rw-r--r--
2025-06-03 03:41:47
_pyio.py
text/plain
91.4 KB
-rw-r--r--
2025-06-03 03:41:47
_pylong.py
text/plain
10.54 KB
-rw-r--r--
2025-06-03 03:41:47
_sitebuiltins.py
text/plain
3.05 KB
-rw-r--r--
2025-06-03 03:41:47
_strptime.py
text/plain
27.73 KB
-rw-r--r--
2025-06-03 03:41:47
_sysconfigdata__linux_x86_64-linux-gnu.py
text/plain
70.44 KB
-rw-r--r--
2025-08-26 09:03:49
_threading_local.py
text/plain
7.05 KB
-rw-r--r--
2025-06-03 03:41:47
_weakrefset.py
text/x-script.python
5.75 KB
-rw-r--r--
2025-06-03 03:41:47
abc.py
text/x-script.python
6.38 KB
-rw-r--r--
2025-06-03 03:41:47
aifc.py
text/plain
33.41 KB
-rw-r--r--
2025-06-03 03:41:47
antigravity.py
text/x-script.python
500 B
-rw-r--r--
2025-06-03 03:41:47
argparse.py
text/x-script.python
98.78 KB
-rw-r--r--
2025-06-03 03:41:47
ast.py
text/plain
62.94 KB
-rw-r--r--
2025-06-03 03:41:47
base64.py
text/x-script.python
20.15 KB
-rwxr-xr-x
2025-06-03 03:41:47
bdb.py
text/plain
32.79 KB
-rw-r--r--
2025-06-03 03:41:47
bisect.py
text/plain
3.34 KB
-rw-r--r--
2025-06-03 03:41:47
bz2.py
text/plain
11.57 KB
-rw-r--r--
2025-06-03 03:41:47
cProfile.py
text/x-script.python
6.4 KB
-rwxr-xr-x
2025-06-03 03:41:47
calendar.py
text/plain
25.26 KB
-rw-r--r--
2025-06-03 03:41:47
cgi.py
text/x-script.python
33.61 KB
-rwxr-xr-x
2025-06-03 03:41:47
cgitb.py
text/plain
12.13 KB
-rw-r--r--
2025-06-03 03:41:47
chunk.py
text/plain
5.37 KB
-rw-r--r--
2025-06-03 03:41:47
cmd.py
text/plain
14.52 KB
-rw-r--r--
2025-06-03 03:41:47
code.py
text/plain
10.71 KB
-rw-r--r--
2025-06-03 03:41:47
codecs.py
text/plain
36.01 KB
-rw-r--r--
2025-06-03 03:41:47
codeop.py
text/x-script.python
5.77 KB
-rw-r--r--
2025-06-03 03:41:47
colorsys.py
text/plain
3.97 KB
-rw-r--r--
2025-06-03 03:41:47
compileall.py
text/plain
20.03 KB
-rw-r--r--
2025-06-03 03:41:47
configparser.py
text/plain
52.53 KB
-rw-r--r--
2025-06-03 03:41:47
contextlib.py
text/plain
26.99 KB
-rw-r--r--
2025-06-03 03:41:47
contextvars.py
text/x-script.python
129 B
-rw-r--r--
2025-06-03 03:41:47
copy.py
text/plain
8.21 KB
-rw-r--r--
2025-06-03 03:41:47
copyreg.py
text/plain
7.44 KB
-rw-r--r--
2025-06-03 03:41:47
crypt.py
text/plain
3.82 KB
-rw-r--r--
2025-06-03 03:41:47
csv.py
text/x-script.python
16 KB
-rw-r--r--
2025-06-03 03:41:47
dataclasses.py
text/x-script.python
60.63 KB
-rw-r--r--
2025-06-03 03:41:47
datetime.py
text/x-script.python
268 B
-rw-r--r--
2025-06-03 03:41:47
decimal.py
text/plain
2.74 KB
-rw-r--r--
2025-06-03 03:41:47
difflib.py
text/plain
81.41 KB
-rw-r--r--
2025-06-03 03:41:47
dis.py
text/plain
29.52 KB
-rw-r--r--
2025-06-03 03:41:47
doctest.py
text/x-script.python
104.25 KB
-rw-r--r--
2025-06-03 03:41:47
enum.py
text/x-script.python
79.63 KB
-rw-r--r--
2025-06-03 03:41:47
filecmp.py
text/plain
10.14 KB
-rw-r--r--
2025-06-03 03:41:47
fileinput.py
text/plain
15.35 KB
-rw-r--r--
2025-06-03 03:41:47
fnmatch.py
text/plain
5.86 KB
-rw-r--r--
2025-06-03 03:41:47
fractions.py
text/x-script.python
37.25 KB
-rw-r--r--
2025-06-03 03:41:47
ftplib.py
text/plain
33.92 KB
-rw-r--r--
2025-06-03 03:41:47
functools.py
text/plain
37.05 KB
-rw-r--r--
2025-06-03 03:41:47
genericpath.py
text/plain
5.44 KB
-rw-r--r--
2025-06-03 03:41:47
getopt.py
text/plain
7.31 KB
-rw-r--r--
2025-06-03 03:41:47
getpass.py
text/plain
5.85 KB
-rw-r--r--
2025-06-03 03:41:47
gettext.py
text/plain
20.82 KB
-rw-r--r--
2025-06-03 03:41:47
glob.py
text/plain
8.53 KB
-rw-r--r--
2025-06-03 03:41:47
graphlib.py
text/x-script.python
9.42 KB
-rw-r--r--
2025-06-03 03:41:47
gzip.py
text/plain
24.81 KB
-rw-r--r--
2025-06-03 03:41:47
hashlib.py
text/x-script.python
9.46 KB
-rw-r--r--
2025-08-26 08:53:31
heapq.py
text/plain
22.48 KB
-rw-r--r--
2025-06-03 03:41:47
hmac.py
text/plain
7.85 KB
-rw-r--r--
2025-08-26 08:53:31
imaplib.py
text/plain
52.77 KB
-rw-r--r--
2025-06-03 03:41:47
imghdr.py
text/plain
4.29 KB
-rw-r--r--
2025-06-03 03:41:47
inspect.py
text/plain
124.15 KB
-rw-r--r--
2025-06-03 03:41:47
io.py
text/plain
3.5 KB
-rw-r--r--
2025-06-03 03:41:47
ipaddress.py
text/x-script.python
79.51 KB
-rw-r--r--
2025-06-03 03:41:47
keyword.py
text/plain
1.05 KB
-rw-r--r--
2025-06-03 03:41:47
linecache.py
text/plain
5.66 KB
-rw-r--r--
2025-06-03 03:41:47
locale.py
text/plain
76.76 KB
-rw-r--r--
2025-06-03 03:41:47
lzma.py
text/plain
12.97 KB
-rw-r--r--
2025-06-03 03:41:47
mailbox.py
text/plain
77.06 KB
-rw-r--r--
2025-06-03 03:41:47
mailcap.py
text/plain
9.11 KB
-rw-r--r--
2025-06-03 03:41:47
mimetypes.py
text/plain
22.5 KB
-rw-r--r--
2025-06-03 03:41:47
modulefinder.py
text/plain
23.14 KB
-rw-r--r--
2025-06-03 03:41:47
netrc.py
text/plain
6.76 KB
-rw-r--r--
2025-06-03 03:41:47
nntplib.py
text/plain
40.12 KB
-rw-r--r--
2025-06-03 03:41:47
ntpath.py
text/x-script.python
31.57 KB
-rw-r--r--
2025-06-03 03:41:47
nturl2path.py
text/plain
2.32 KB
-rw-r--r--
2025-06-03 03:41:47
numbers.py
text/x-script.python
11.2 KB
-rw-r--r--
2025-06-03 03:41:47
opcode.py
text/x-script.python
12.87 KB
-rw-r--r--
2025-06-03 03:41:47
operator.py
text/plain
10.71 KB
-rw-r--r--
2025-06-03 03:41:47
optparse.py
text/plain
58.95 KB
-rw-r--r--
2025-06-03 03:41:47
os.py
text/x-script.python
39.86 KB
-rw-r--r--
2025-06-03 03:41:47
pathlib.py
text/plain
49.86 KB
-rw-r--r--
2025-06-03 03:41:47
pdb.py
text/x-script.python
68.65 KB
-rwxr-xr-x
2025-06-03 03:41:47
pickle.py
text/plain
65.34 KB
-rw-r--r--
2025-06-03 03:41:47
pickletools.py
text/plain
91.85 KB
-rw-r--r--
2025-06-03 03:41:47
pipes.py
text/plain
8.77 KB
-rw-r--r--
2025-06-03 03:41:47
pkgutil.py
text/plain
17.85 KB
-rw-r--r--
2025-06-03 03:41:47
platform.py
text/x-script.python
42.37 KB
-rwxr-xr-x
2025-06-03 03:41:47
plistlib.py
text/x-script.python
27.68 KB
-rw-r--r--
2025-06-03 03:41:47
poplib.py
text/plain
14.28 KB
-rw-r--r--
2025-06-03 03:41:47
posixpath.py
text/plain
17.07 KB
-rw-r--r--
2025-06-03 03:41:47
pprint.py
text/x-script.python
23.59 KB
-rw-r--r--
2025-06-03 03:41:47
profile.py
text/x-script.python
22.55 KB
-rwxr-xr-x
2025-06-03 03:41:47
pstats.py
text/plain
28.6 KB
-rw-r--r--
2025-06-03 03:41:47
pty.py
text/plain
5.99 KB
-rw-r--r--
2025-06-03 03:41:47
py_compile.py
text/plain
7.65 KB
-rw-r--r--
2025-06-03 03:41:47
pyclbr.py
text/plain
11.13 KB
-rw-r--r--
2025-06-03 03:41:47
pydoc.py
text/x-script.python
110.85 KB
-rwxr-xr-x
2025-06-03 03:41:47
queue.py
text/x-script.python
11.23 KB
-rw-r--r--
2025-06-03 03:41:47
quopri.py
text/x-script.python
7.01 KB
-rwxr-xr-x
2025-06-03 03:41:47
random.py
text/plain
33.88 KB
-rw-r--r--
2025-06-03 03:41:47
reprlib.py
text/plain
6.98 KB
-rw-r--r--
2025-06-03 03:41:47
rlcompleter.py
text/plain
7.64 KB
-rw-r--r--
2025-06-03 03:41:47
runpy.py
text/plain
12.58 KB
-rw-r--r--
2025-06-03 03:41:47
sched.py
text/plain
6.2 KB
-rw-r--r--
2025-06-03 03:41:47
secrets.py
text/plain
1.94 KB
-rw-r--r--
2025-06-03 03:41:47
selectors.py
text/plain
19.21 KB
-rw-r--r--
2025-06-03 03:41:47
shelve.py
text/plain
8.36 KB
-rw-r--r--
2025-06-03 03:41:47
shlex.py
text/plain
13.04 KB
-rw-r--r--
2025-06-03 03:41:47
shutil.py
text/plain
55.43 KB
-rw-r--r--
2025-06-03 03:41:47
signal.py
text/x-script.python
2.44 KB
-rw-r--r--
2025-06-03 03:41:47
site.py
text/plain
22.89 KB
-rw-r--r--
2025-08-26 08:53:31
smtplib.py
text/x-script.python
42.51 KB
-rwxr-xr-x
2025-06-03 03:41:47
sndhdr.py
text/plain
7.27 KB
-rw-r--r--
2025-06-03 03:41:47
socket.py
text/x-script.python
36.93 KB
-rw-r--r--
2025-06-03 03:41:47
socketserver.py
text/plain
27.41 KB
-rw-r--r--
2025-06-03 03:41:47
sre_compile.py
text/x-script.python
231 B
-rw-r--r--
2025-06-03 03:41:47
sre_constants.py
text/x-script.python
232 B
-rw-r--r--
2025-06-03 03:41:47
sre_parse.py
text/x-script.python
229 B
-rw-r--r--
2025-06-03 03:41:47
ssl.py
text/x-script.python
49.71 KB
-rw-r--r--
2025-06-03 03:41:47
stat.py
text/plain
5.36 KB
-rw-r--r--
2025-06-03 03:41:47
statistics.py
text/plain
49.05 KB
-rw-r--r--
2025-06-03 03:41:47
string.py
text/plain
11.51 KB
-rw-r--r--
2025-06-03 03:41:47
stringprep.py
text/x-script.python
12.61 KB
-rw-r--r--
2025-06-03 03:41:47
struct.py
text/x-script.python
257 B
-rw-r--r--
2025-06-03 03:41:47
subprocess.py
text/x-script.python
86.67 KB
-rw-r--r--
2025-06-03 03:41:47
sunau.py
text/plain
18.04 KB
-rw-r--r--
2025-06-03 03:41:47
symtable.py
text/plain
12.18 KB
-rw-r--r--
2025-06-03 03:41:47
sysconfig.py
text/plain
32.98 KB
-rw-r--r--
2025-08-26 09:04:06
tabnanny.py
text/x-script.python
11.26 KB
-rwxr-xr-x
2025-06-03 03:41:47
tarfile.py
text/x-script.python
111.57 KB
-rwxr-xr-x
2025-08-26 08:53:31
telnetlib.py
text/x-script.python
22.79 KB
-rw-r--r--
2025-06-03 03:41:47
tempfile.py
text/plain
31.63 KB
-rw-r--r--
2025-06-03 03:41:47
textwrap.py
text/plain
19.26 KB
-rw-r--r--
2025-06-03 03:41:47
this.py
text/plain
1003 B
-rw-r--r--
2025-06-03 03:41:47
threading.py
text/plain
58.34 KB
-rw-r--r--
2025-08-26 08:53:31
timeit.py
text/x-script.python
13.15 KB
-rwxr-xr-x
2025-06-03 03:41:47
token.py
text/plain
2.45 KB
-rw-r--r--
2025-06-03 03:41:47
tokenize.py
text/plain
21.06 KB
-rw-r--r--
2025-06-03 03:41:47
trace.py
text/x-script.python
28.66 KB
-rwxr-xr-x
2025-06-03 03:41:47
traceback.py
text/plain
45.31 KB
-rw-r--r--
2025-06-03 03:41:47
tracemalloc.py
text/x-script.python
17.62 KB
-rw-r--r--
2025-06-03 03:41:47
tty.py
text/plain
1.99 KB
-rw-r--r--
2025-06-03 03:41:47
turtle.py
text/x-script.python
142.93 KB
-rw-r--r--
2025-06-03 03:41:47
types.py
text/plain
10.74 KB
-rw-r--r--
2025-06-03 03:41:47
typing.py
text/plain
116.05 KB
-rw-r--r--
2025-06-03 03:41:47
uu.py
text/x-script.python
7.17 KB
-rw-r--r--
2025-08-26 09:04:07
uuid.py
text/x-script.python
28.96 KB
-rw-r--r--
2025-06-03 03:41:47
warnings.py
text/plain
21.4 KB
-rw-r--r--
2025-06-03 03:41:47
wave.py
text/plain
22.24 KB
-rw-r--r--
2025-06-03 03:41:47
weakref.py
text/plain
21.01 KB
-rw-r--r--
2025-06-03 03:41:47
webbrowser.py
text/x-script.python
23.18 KB
-rwxr-xr-x
2025-06-03 03:41:47
xdrlib.py
text/plain
5.8 KB
-rw-r--r--
2025-06-03 03:41:47
zipapp.py
text/x-script.python
7.37 KB
-rw-r--r--
2025-06-03 03:41:47
zipimport.py
text/plain
27.19 KB
-rw-r--r--
2025-06-03 03:41:47
~ ACUPOFTEA - accounting.gulfstore-gcc.com