NG4R3P

Linux 4gvps.4gvps.com 3.10.0-1127.18.2.vz7.163.46 #1 SMP Fri Nov 20 21:47:55 MSK 2020 x86_64
SOFT : Apache PHP : 7.4.33
/proc/self/root/opt/alt/python35/lib64/python3.5/

38.135.39.45

[ NAME ]	[ SIZE ]	[ PERM ]	[ DATE ]	[ ACT ]
+FILE +DIR
__pycache__	dir	drwxr-xr-x	2024-08-13 01:15	R D
asyncio	dir	drwxr-xr-x	2024-08-13 01:15	R D
collections	dir	drwxr-xr-x	2024-08-13 01:15	R D
concurrent	dir	drwxr-xr-x	2024-08-13 01:15	R D
config-3.5m	dir	drwxr-xr-x	2024-08-13 01:15	R D
ctypes	dir	drwxr-xr-x	2024-08-13 01:15	R D
curses	dir	drwxr-xr-x	2024-08-13 01:15	R D
dbm	dir	drwxr-xr-x	2024-08-13 01:15	R D
distutils	dir	drwxr-xr-x	2024-08-13 01:15	R D
email	dir	drwxr-xr-x	2024-08-13 01:15	R D
encodings	dir	drwxr-xr-x	2024-08-13 01:15	R D
ensurepip	dir	drwxr-xr-x	2024-08-13 01:15	R D
html	dir	drwxr-xr-x	2024-08-13 01:15	R D
http	dir	drwxr-xr-x	2024-08-13 01:15	R D
idlelib	dir	drwxr-xr-x	2024-08-13 01:15	R D
importlib	dir	drwxr-xr-x	2024-08-13 01:15	R D
json	dir	drwxr-xr-x	2024-08-13 01:15	R D
lib-dynload	dir	drwxr-xr-x	2024-08-13 01:15	R D
lib2to3	dir	drwxr-xr-x	2024-08-13 01:16	R D
logging	dir	drwxr-xr-x	2024-08-13 01:15	R D
multiprocessing	dir	drwxr-xr-x	2024-08-13 01:15	R D
plat-linux	dir	drwxr-xr-x	2024-08-13 01:15	R D
pydoc_data	dir	drwxr-xr-x	2024-08-13 01:15	R D
site-packages	dir	drwxr-xr-x	2024-08-13 01:16	R D
sqlite3	dir	drwxr-xr-x	2024-08-13 01:15	R D
test	dir	drwxr-xr-x	2024-08-13 01:15	R D
unittest	dir	drwxr-xr-x	2024-08-13 01:15	R D
urllib	dir	drwxr-xr-x	2024-08-13 01:15	R D
venv	dir	drwxr-xr-x	2024-08-13 01:15	R D
wsgiref	dir	drwxr-xr-x	2024-08-13 01:15	R D
xml	dir	drwxr-xr-x	2024-08-13 01:15	R D
xmlrpc	dir	drwxr-xr-x	2024-08-13 01:15	R D
__future__.py	4.728 KB	-rw-r--r--	2024-05-31 13:50	R E G D
__phello__.foo.py	0.063 KB	-rw-r--r--	2024-05-31 13:50	R E G D
_bootlocale.py	1.271 KB	-rw-r--r--	2024-05-31 13:50	R E G D
_collections_abc.py	24.213 KB	-rw-r--r--	2024-05-31 13:50	R E G D
_compat_pickle.py	8.355 KB	-rw-r--r--	2024-05-31 13:50	R E G D
_compression.py	5.215 KB	-rw-r--r--	2024-05-31 13:50	R E G D
_dummy_thread.py	4.998 KB	-rw-r--r--	2024-05-31 13:50	R E G D
_markupbase.py	14.256 KB	-rw-r--r--	2024-05-31 13:50	R E G D
_osx_support.py	18.667 KB	-rw-r--r--	2024-05-31 13:50	R E G D
_pydecimal.py	223.27 KB	-rw-r--r--	2024-05-31 13:50	R E G D
_pyio.py	85.906 KB	-rw-r--r--	2024-05-31 13:50	R E G D
_sitebuiltins.py	3.042 KB	-rw-r--r--	2024-05-31 13:50	R E G D
_strptime.py	21.665 KB	-rw-r--r--	2024-05-31 13:50	R E G D
_sysconfigdata.py	22.783 KB	-rw-r--r--	2024-05-31 13:50	R E G D
_threading_local.py	7.236 KB	-rw-r--r--	2024-05-31 13:50	R E G D
_weakrefset.py	5.571 KB	-rw-r--r--	2024-05-31 13:50	R E G D
abc.py	8.426 KB	-rw-r--r--	2024-05-31 13:50	R E G D
aifc.py	31.218 KB	-rw-r--r--	2024-05-31 13:50	R E G D
antigravity.py	0.465 KB	-rw-r--r--	2024-05-31 13:50	R E G D
argparse.py	88.025 KB	-rw-r--r--	2024-05-31 13:50	R E G D
ast.py	11.72 KB	-rw-r--r--	2024-05-31 13:50	R E G D
asynchat.py	11.69 KB	-rw-r--r--	2024-05-31 13:50	R E G D
asyncore.py	19.633 KB	-rw-r--r--	2024-05-31 13:50	R E G D
base64.py	20.041 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
bdb.py	22.807 KB	-rw-r--r--	2024-05-31 13:50	R E G D
binhex.py	13.627 KB	-rw-r--r--	2024-05-31 13:50	R E G D
bisect.py	2.534 KB	-rw-r--r--	2024-05-31 13:50	R E G D
bz2.py	12.133 KB	-rw-r--r--	2024-05-31 13:50	R E G D
cProfile.py	5.199 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
calendar.py	22.459 KB	-rw-r--r--	2024-05-31 13:50	R E G D
cgi.py	35.201 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
cgitb.py	11.741 KB	-rw-r--r--	2024-05-31 13:50	R E G D
chunk.py	5.298 KB	-rw-r--r--	2024-05-31 13:50	R E G D
cmd.py	14.512 KB	-rw-r--r--	2024-05-31 13:50	R E G D
code.py	9.881 KB	-rw-r--r--	2024-05-31 13:50	R E G D
codecs.py	35.382 KB	-rw-r--r--	2024-05-31 13:50	R E G D
codeop.py	5.854 KB	-rw-r--r--	2024-05-31 13:50	R E G D
colorsys.py	3.969 KB	-rw-r--r--	2024-05-31 13:50	R E G D
compileall.py	11.437 KB	-rw-r--r--	2024-05-31 13:50	R E G D
configparser.py	52.199 KB	-rw-r--r--	2024-05-31 13:50	R E G D
contextlib.py	12.159 KB	-rw-r--r--	2024-05-31 13:50	R E G D
copy.py	8.736 KB	-rw-r--r--	2024-05-31 13:50	R E G D
copyreg.py	6.673 KB	-rw-r--r--	2024-05-31 13:50	R E G D
crypt.py	1.835 KB	-rw-r--r--	2024-05-31 13:50	R E G D
csv.py	15.75 KB	-rw-r--r--	2024-05-31 13:50	R E G D
datetime.py	74.12 KB	-rw-r--r--	2024-05-31 13:50	R E G D
decimal.py	0.313 KB	-rw-r--r--	2024-05-31 13:50	R E G D
difflib.py	82.23 KB	-rw-r--r--	2024-05-31 13:50	R E G D
dis.py	16.943 KB	-rw-r--r--	2024-05-31 13:50	R E G D
doctest.py	101.598 KB	-rw-r--r--	2024-05-31 13:50	R E G D
dummy_threading.py	2.749 KB	-rw-r--r--	2024-05-31 13:50	R E G D
enum.py	21.705 KB	-rw-r--r--	2024-05-31 13:50	R E G D
filecmp.py	9.6 KB	-rw-r--r--	2024-05-31 13:50	R E G D
fileinput.py	13.925 KB	-rw-r--r--	2024-05-31 13:50	R E G D
fnmatch.py	3.089 KB	-rw-r--r--	2024-05-31 13:50	R E G D
formatter.py	14.788 KB	-rw-r--r--	2024-05-31 13:50	R E G D
fractions.py	24.035 KB	-rw-r--r--	2024-05-31 13:50	R E G D
ftplib.py	34.132 KB	-rw-r--r--	2024-05-31 13:50	R E G D
functools.py	28.266 KB	-rw-r--r--	2024-05-31 13:50	R E G D
genericpath.py	4.262 KB	-rw-r--r--	2024-05-31 13:50	R E G D
getopt.py	7.313 KB	-rw-r--r--	2024-05-31 13:50	R E G D
getpass.py	5.854 KB	-rw-r--r--	2024-05-31 13:50	R E G D
gettext.py	21.025 KB	-rw-r--r--	2024-05-31 13:50	R E G D
glob.py	4.953 KB	-rw-r--r--	2024-05-31 13:50	R E G D
gzip.py	19.785 KB	-rw-r--r--	2024-05-31 13:50	R E G D
hashlib.py	7.792 KB	-rw-r--r--	2024-05-31 13:50	R E G D
heapq.py	22.392 KB	-rw-r--r--	2024-05-31 13:50	R E G D
hmac.py	4.944 KB	-rw-r--r--	2024-05-31 13:50	R E G D
imaplib.py	50.96 KB	-rw-r--r--	2024-05-31 13:50	R E G D
imghdr.py	3.67 KB	-rw-r--r--	2024-05-31 13:50	R E G D
imp.py	10.426 KB	-rw-r--r--	2024-05-31 13:50	R E G D
inspect.py	111.522 KB	-rw-r--r--	2024-05-31 13:50	R E G D
io.py	3.316 KB	-rw-r--r--	2024-05-31 13:50	R E G D
ipaddress.py	73.958 KB	-rw-r--r--	2024-05-31 13:50	R E G D
keyword.py	2.17 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
linecache.py	5.188 KB	-rw-r--r--	2024-05-31 13:50	R E G D
locale.py	72.962 KB	-rw-r--r--	2024-05-31 13:50	R E G D
lzma.py	12.622 KB	-rw-r--r--	2024-05-31 13:50	R E G D
macpath.py	5.769 KB	-rw-r--r--	2024-05-31 13:50	R E G D
macurl2path.py	2.668 KB	-rw-r--r--	2024-05-31 13:50	R E G D
mailbox.py	76.58 KB	-rw-r--r--	2024-05-31 13:50	R E G D
mailcap.py	7.914 KB	-rw-r--r--	2024-05-31 13:50	R E G D
mimetypes.py	20.358 KB	-rw-r--r--	2024-05-31 13:50	R E G D
modulefinder.py	22.544 KB	-rw-r--r--	2024-05-31 13:50	R E G D
netrc.py	5.613 KB	-rw-r--r--	2024-05-31 13:50	R E G D
nntplib.py	42.068 KB	-rw-r--r--	2024-05-31 13:50	R E G D
ntpath.py	22.259 KB	-rw-r--r--	2024-05-31 13:50	R E G D
nturl2path.py	2.387 KB	-rw-r--r--	2024-05-31 13:50	R E G D
numbers.py	10.003 KB	-rw-r--r--	2024-05-31 13:50	R E G D
opcode.py	5.747 KB	-rw-r--r--	2024-05-31 13:50	R E G D
operator.py	10.608 KB	-rw-r--r--	2024-05-31 13:50	R E G D
optparse.py	58.93 KB	-rw-r--r--	2024-05-31 13:50	R E G D
os.py	36.165 KB	-rw-r--r--	2024-05-31 13:50	R E G D
pathlib.py	45.899 KB	-rw-r--r--	2024-05-31 13:50	R E G D
pdb.py	59.716 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
pickle.py	54.859 KB	-rw-r--r--	2024-05-31 13:50	R E G D
pickletools.py	89.61 KB	-rw-r--r--	2024-05-31 13:50	R E G D
pipes.py	8.707 KB	-rw-r--r--	2024-05-31 13:50	R E G D
pkgutil.py	20.854 KB	-rw-r--r--	2024-05-31 13:50	R E G D
platform.py	45.065 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
plistlib.py	31.064 KB	-rw-r--r--	2024-05-31 13:50	R E G D
poplib.py	14.372 KB	-rw-r--r--	2024-05-31 13:50	R E G D
posixpath.py	14.562 KB	-rw-r--r--	2024-05-31 13:50	R E G D
pprint.py	20.371 KB	-rw-r--r--	2024-05-31 13:50	R E G D
profile.py	21.516 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
pstats.py	25.941 KB	-rw-r--r--	2024-05-31 13:50	R E G D
pty.py	4.651 KB	-rw-r--r--	2024-05-31 13:50	R E G D
py_compile.py	7.013 KB	-rw-r--r--	2024-05-31 13:50	R E G D
pyclbr.py	13.246 KB	-rw-r--r--	2024-05-31 13:50	R E G D
pydoc.py	101.223 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
queue.py	8.574 KB	-rw-r--r--	2024-05-31 13:50	R E G D
quopri.py	7.095 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
random.py	25.843 KB	-rw-r--r--	2024-05-31 13:50	R E G D
re.py	15.138 KB	-rw-r--r--	2024-05-31 13:50	R E G D
reprlib.py	5.211 KB	-rw-r--r--	2024-05-31 13:50	R E G D
rlcompleter.py	6.159 KB	-rw-r--r--	2024-05-31 13:50	R E G D
runpy.py	11.679 KB	-rw-r--r--	2024-05-31 13:50	R E G D
sched.py	6.07 KB	-rw-r--r--	2024-05-31 13:50	R E G D
selectors.py	18.982 KB	-rw-r--r--	2024-05-31 13:50	R E G D
shelve.py	8.328 KB	-rw-r--r--	2024-05-31 13:50	R E G D
shlex.py	11.18 KB	-rw-r--r--	2024-05-31 13:50	R E G D
shutil.py	39.109 KB	-rw-r--r--	2024-05-31 13:50	R E G D
signal.py	2.073 KB	-rw-r--r--	2024-05-31 13:50	R E G D
site.py	21.005 KB	-rw-r--r--	2024-05-31 13:50	R E G D
smtpd.py	34.544 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
smtplib.py	42.612 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
sndhdr.py	6.268 KB	-rw-r--r--	2024-05-31 13:50	R E G D
socket.py	26.499 KB	-rw-r--r--	2024-05-31 13:50	R E G D
socketserver.py	24.088 KB	-rw-r--r--	2024-05-31 13:50	R E G D
sre_compile.py	17.979 KB	-rw-r--r--	2024-05-31 13:50	R E G D
sre_constants.py	6.661 KB	-rw-r--r--	2024-05-31 13:50	R E G D
sre_parse.py	34.294 KB	-rw-r--r--	2024-05-31 13:50	R E G D
ssl.py	41.359 KB	-rw-r--r--	2024-05-31 13:50	R E G D
stat.py	4.92 KB	-rw-r--r--	2024-05-31 13:50	R E G D
statistics.py	19.075 KB	-rw-r--r--	2024-05-31 13:50	R E G D
string.py	11.576 KB	-rw-r--r--	2024-05-31 13:50	R E G D
stringprep.py	12.614 KB	-rw-r--r--	2024-05-31 13:50	R E G D
struct.py	0.251 KB	-rw-r--r--	2024-05-31 13:50	R E G D
subprocess.py	57.531 KB	-rw-r--r--	2024-05-31 13:50	R E G D
sunau.py	17.671 KB	-rw-r--r--	2024-05-31 13:50	R E G D
symbol.py	2.057 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
symtable.py	7.022 KB	-rw-r--r--	2024-05-31 13:50	R E G D
sysconfig.py	23.889 KB	-rw-r--r--	2024-05-31 13:50	R E G D
tabnanny.py	11.146 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
tarfile.py	90.889 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
telnetlib.py	22.477 KB	-rw-r--r--	2024-05-31 13:50	R E G D
tempfile.py	26.012 KB	-rw-r--r--	2024-05-31 13:50	R E G D
textwrap.py	19.1 KB	-rw-r--r--	2024-05-31 13:50	R E G D
this.py	0.979 KB	-rw-r--r--	2024-05-31 13:50	R E G D
threading.py	47.878 KB	-rw-r--r--	2024-05-31 13:50	R E G D
timeit.py	12.112 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
token.py	3.003 KB	-rw-r--r--	2024-05-31 13:50	R E G D
tokenize.py	27.139 KB	-rw-r--r--	2024-05-31 13:50	R E G D
trace.py	30.813 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
traceback.py	21.655 KB	-rw-r--r--	2024-05-31 13:50	R E G D
tracemalloc.py	15.274 KB	-rw-r--r--	2024-05-31 13:50	R E G D
tty.py	0.858 KB	-rw-r--r--	2024-05-31 13:50	R E G D
types.py	8.593 KB	-rw-r--r--	2024-05-31 13:50	R E G D
typing.py	78.257 KB	-rw-r--r--	2024-05-31 13:50	R E G D
uu.py	6.607 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
uuid.py	22.716 KB	-rw-r--r--	2024-05-31 13:50	R E G D
warnings.py	15.479 KB	-rw-r--r--	2024-05-31 13:50	R E G D
wave.py	17.268 KB	-rw-r--r--	2024-05-31 13:50	R E G D
weakref.py	19.986 KB	-rw-r--r--	2024-05-31 13:50	R E G D
webbrowser.py	21.316 KB	-rwxr-xr-x	2024-05-31 13:50	R E G D
xdrlib.py	5.774 KB	-rw-r--r--	2024-05-31 13:50	R E G D
zipapp.py	6.989 KB	-rw-r--r--	2024-05-31 13:50	R E G D
zipfile.py	71.945 KB	-rw-r--r--	2024-05-31 13:50	R E G D
REQUEST EXIT

# 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. """ from abc import ABCMeta, abstractmethod import sys __all__ = ["Awaitable", "Coroutine", "AsyncIterable", "AsyncIterator", "Hashable", "Iterable", "Iterator", "Generator", "Sized", "Container", "Callable", "Set", "MutableSet", "Mapping", "MutableMapping", "MappingView", "KeysView", "ItemsView", "ValuesView", "Sequence", "MutableSequence", "ByteString", ] # 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 ### ONE-TRICK PONIES ### class Hashable(metaclass=ABCMeta): __slots__ = () @abstractmethod def __hash__(self): return 0 @classmethod def __subclasshook__(cls, C): if cls is Hashable: for B in C.__mro__: if "__hash__" in B.__dict__: if B.__dict__["__hash__"]: return True break return NotImplemented class Awaitable(metaclass=ABCMeta): __slots__ = () @abstractmethod def __await__(self): yield @classmethod def __subclasshook__(cls, C): if cls is Awaitable: for B in C.__mro__: if "__await__" in B.__dict__: if B.__dict__["__await__"]: return True break return NotImplemented 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: mro = C.__mro__ for method in ('__await__', 'send', 'throw', 'close'): for base in mro: if method in base.__dict__: break else: return NotImplemented return True 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: if any("__aiter__" in B.__dict__ for B in C.__mro__): return True return NotImplemented 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: if (any("__anext__" in B.__dict__ for B in C.__mro__) and any("__aiter__" in B.__dict__ for B in C.__mro__)): return True return NotImplemented class Iterable(metaclass=ABCMeta): __slots__ = () @abstractmethod def __iter__(self): while False: yield None @classmethod def __subclasshook__(cls, C): if cls is Iterable: if any("__iter__" in B.__dict__ for B in C.__mro__): return True return NotImplemented 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: if (any("__next__" in B.__dict__ for B in C.__mro__) and any("__iter__" in B.__dict__ for B in C.__mro__)): return True 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 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: mro = C.__mro__ for method in ('__iter__', '__next__', 'send', 'throw', 'close'): for base in mro: if method in base.__dict__: break else: return NotImplemented return True 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: if any("__len__" in B.__dict__ for B in C.__mro__): return True return NotImplemented class Container(metaclass=ABCMeta): __slots__ = () @abstractmethod def __contains__(self, x): return False @classmethod def __subclasshook__(cls, C): if cls is Container: if any("__contains__" in B.__dict__ for B in C.__mro__): return True return NotImplemented class Callable(metaclass=ABCMeta): __slots__ = () @abstractmethod def __call__(self, *args, **kwds): return False @classmethod def __subclasshook__(cls, C): if cls is Callable: if any("__call__" in B.__dict__ for B in C.__mro__): return True return NotImplemented ### SETS ### class Set(Sized, Iterable, Container): """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 * 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 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(Sized, Iterable, Container): __slots__ = () """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__. """ @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()) 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 KeysView(MappingView, Set): __slots__ = () @classmethod def _from_iterable(self, 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(self, it): return set(it) def __contains__(self, item): key, value = item try: v = self._mapping[key] except KeyError: return False else: return v == value def __iter__(self): for key in self._mapping: yield (key, self._mapping[key]) ItemsView.register(dict_items) class ValuesView(MappingView): __slots__ = () def __contains__(self, value): for key in self._mapping: if value == self._mapping[key]: return True return False def __iter__(self): for key in self._mapping: yield self._mapping[key] ValuesView.register(dict_values) class MutableMapping(Mapping): __slots__ = () """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__. """ @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 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(*args, **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: 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 not args: raise TypeError("descriptor 'update' of 'MutableMapping' object " "needs an argument") self, *args = args if len(args) > 1: raise TypeError('update expected at most 1 arguments, got %d' % len(args)) if args: other = args[0] 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(Sized, Iterable, Container): """All the operations on a read-only sequence. Concrete subclasses must override __new__ or __init__, __getitem__, and __len__. """ __slots__ = () @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 == 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. ''' 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: if self[i] == value: return i except IndexError: break 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 == value) Sequence.register(tuple) Sequence.register(str) Sequence.register(range) Sequence.register(memoryview) class ByteString(Sequence): """This unifies bytes and bytearray. XXX Should add all their methods. """ __slots__ = () ByteString.register(bytes) ByteString.register(bytearray) class MutableSequence(Sequence): __slots__ = () """All the operations on a read-write sequence. Concrete subclasses must provide __new__ or __init__, __getitem__, __setitem__, __delitem__, __len__, and insert(). """ @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' 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