X7ROOT File Manager
Current Path:
/opt/alt/python35/lib64/python3.5
opt
/
alt
/
python35
/
lib64
/
python3.5
/
ðŸ“
..
📄
__future__.py
(4.73 KB)
📄
__phello__.foo.py
(64 B)
ðŸ“
__pycache__
📄
_bootlocale.py
(1.27 KB)
📄
_collections_abc.py
(24.21 KB)
📄
_compat_pickle.py
(8.36 KB)
📄
_compression.py
(5.21 KB)
📄
_dummy_thread.py
(5 KB)
📄
_markupbase.py
(14.26 KB)
📄
_osx_support.py
(18.67 KB)
📄
_pydecimal.py
(223.27 KB)
📄
_pyio.py
(85.91 KB)
📄
_sitebuiltins.py
(3.04 KB)
📄
_strptime.py
(21.67 KB)
📄
_sysconfigdata.py
(26.32 KB)
📄
_threading_local.py
(7.24 KB)
📄
_weakrefset.py
(5.57 KB)
📄
abc.py
(8.43 KB)
📄
aifc.py
(31.22 KB)
📄
antigravity.py
(476 B)
📄
argparse.py
(88.03 KB)
📄
ast.py
(11.72 KB)
📄
asynchat.py
(11.69 KB)
ðŸ“
asyncio
📄
asyncore.py
(19.63 KB)
📄
base64.py
(20.04 KB)
📄
bdb.py
(22.81 KB)
📄
binhex.py
(13.63 KB)
📄
bisect.py
(2.53 KB)
📄
bz2.py
(12.13 KB)
📄
cProfile.py
(5.2 KB)
📄
calendar.py
(22.46 KB)
📄
cgi.py
(35.2 KB)
📄
cgitb.py
(11.74 KB)
📄
chunk.py
(5.3 KB)
📄
cmd.py
(14.51 KB)
📄
code.py
(9.88 KB)
📄
codecs.py
(35.38 KB)
📄
codeop.py
(5.85 KB)
ðŸ“
collections
📄
colorsys.py
(3.97 KB)
📄
compileall.py
(11.44 KB)
ðŸ“
concurrent
ðŸ“
config-3.5m
📄
configparser.py
(52.2 KB)
📄
contextlib.py
(12.16 KB)
📄
copy.py
(8.74 KB)
📄
copyreg.py
(6.67 KB)
📄
crypt.py
(1.83 KB)
📄
csv.py
(15.75 KB)
ðŸ“
ctypes
ðŸ“
curses
📄
datetime.py
(74.12 KB)
ðŸ“
dbm
📄
decimal.py
(320 B)
📄
difflib.py
(82.23 KB)
📄
dis.py
(16.94 KB)
ðŸ“
distutils
📄
doctest.py
(101.6 KB)
📄
dummy_threading.py
(2.75 KB)
ðŸ“
email
ðŸ“
encodings
ðŸ“
ensurepip
📄
enum.py
(21.71 KB)
📄
filecmp.py
(9.6 KB)
📄
fileinput.py
(13.92 KB)
📄
fnmatch.py
(3.09 KB)
📄
formatter.py
(14.79 KB)
📄
fractions.py
(24.04 KB)
📄
ftplib.py
(34.13 KB)
📄
functools.py
(28.27 KB)
📄
genericpath.py
(4.26 KB)
📄
getopt.py
(7.31 KB)
📄
getpass.py
(5.85 KB)
📄
gettext.py
(21.03 KB)
📄
glob.py
(4.95 KB)
📄
gzip.py
(19.79 KB)
📄
hashlib.py
(7.79 KB)
📄
heapq.py
(22.39 KB)
📄
hmac.py
(4.94 KB)
ðŸ“
html
ðŸ“
http
ðŸ“
idlelib
📄
imaplib.py
(50.96 KB)
📄
imghdr.py
(3.67 KB)
📄
imp.py
(10.43 KB)
ðŸ“
importlib
📄
inspect.py
(111.52 KB)
📄
io.py
(3.32 KB)
📄
ipaddress.py
(73.96 KB)
ðŸ“
json
📄
keyword.py
(2.17 KB)
ðŸ“
lib-dynload
ðŸ“
lib2to3
📄
linecache.py
(5.19 KB)
📄
locale.py
(72.96 KB)
ðŸ“
logging
📄
lzma.py
(12.62 KB)
📄
macpath.py
(5.77 KB)
📄
macurl2path.py
(2.67 KB)
📄
mailbox.py
(76.58 KB)
📄
mailcap.py
(7.91 KB)
📄
mimetypes.py
(20.36 KB)
📄
modulefinder.py
(22.54 KB)
ðŸ“
multiprocessing
📄
netrc.py
(5.61 KB)
📄
nntplib.py
(42.07 KB)
📄
ntpath.py
(22.26 KB)
📄
nturl2path.py
(2.39 KB)
📄
numbers.py
(10 KB)
📄
opcode.py
(5.75 KB)
📄
operator.py
(10.61 KB)
📄
optparse.py
(58.93 KB)
📄
os.py
(36.17 KB)
📄
pathlib.py
(45.9 KB)
📄
pdb.py
(59.72 KB)
📄
pickle.py
(54.86 KB)
📄
pickletools.py
(89.61 KB)
📄
pipes.py
(8.71 KB)
📄
pkgutil.py
(20.85 KB)
ðŸ“
plat-linux
📄
platform.py
(45.07 KB)
📄
plistlib.py
(31.06 KB)
📄
poplib.py
(14.37 KB)
📄
posixpath.py
(14.56 KB)
📄
pprint.py
(20.37 KB)
📄
profile.py
(21.52 KB)
📄
pstats.py
(25.94 KB)
📄
pty.py
(4.65 KB)
📄
py_compile.py
(7.01 KB)
📄
pyclbr.py
(13.25 KB)
📄
pydoc.py
(101.22 KB)
ðŸ“
pydoc_data
📄
queue.py
(8.57 KB)
📄
quopri.py
(7.09 KB)
📄
random.py
(25.84 KB)
📄
re.py
(15.14 KB)
📄
reprlib.py
(5.21 KB)
📄
rlcompleter.py
(6.16 KB)
📄
runpy.py
(11.68 KB)
📄
sched.py
(6.07 KB)
📄
selectors.py
(18.98 KB)
📄
shelve.py
(8.33 KB)
📄
shlex.py
(11.18 KB)
📄
shutil.py
(39.11 KB)
📄
signal.py
(2.07 KB)
ðŸ“
site-packages
📄
site.py
(21 KB)
📄
smtpd.py
(34.54 KB)
📄
smtplib.py
(42.61 KB)
📄
sndhdr.py
(6.27 KB)
📄
socket.py
(26.5 KB)
📄
socketserver.py
(24.09 KB)
ðŸ“
sqlite3
📄
sre_compile.py
(17.98 KB)
📄
sre_constants.py
(6.66 KB)
📄
sre_parse.py
(34.29 KB)
📄
ssl.py
(41.36 KB)
📄
stat.py
(4.92 KB)
📄
statistics.py
(19.08 KB)
📄
string.py
(11.58 KB)
📄
stringprep.py
(12.61 KB)
📄
struct.py
(257 B)
📄
subprocess.py
(57.53 KB)
📄
sunau.py
(17.67 KB)
📄
symbol.py
(2.06 KB)
📄
symtable.py
(7.02 KB)
📄
sysconfig.py
(23.89 KB)
📄
tabnanny.py
(11.15 KB)
📄
tarfile.py
(90.89 KB)
📄
telnetlib.py
(22.48 KB)
📄
tempfile.py
(26.01 KB)
ðŸ“
test
📄
textwrap.py
(19.1 KB)
📄
this.py
(1003 B)
📄
threading.py
(47.88 KB)
📄
timeit.py
(12.11 KB)
📄
token.py
(3 KB)
📄
tokenize.py
(27.14 KB)
📄
trace.py
(30.81 KB)
📄
traceback.py
(21.66 KB)
📄
tracemalloc.py
(15.27 KB)
📄
tty.py
(879 B)
📄
types.py
(8.59 KB)
📄
typing.py
(78.26 KB)
ðŸ“
unittest
ðŸ“
urllib
📄
uu.py
(6.61 KB)
📄
uuid.py
(22.72 KB)
ðŸ“
venv
📄
warnings.py
(15.48 KB)
📄
wave.py
(17.27 KB)
📄
weakref.py
(19.99 KB)
📄
webbrowser.py
(21.32 KB)
ðŸ“
wsgiref
📄
xdrlib.py
(5.77 KB)
ðŸ“
xml
ðŸ“
xmlrpc
📄
zipapp.py
(6.99 KB)
📄
zipfile.py
(71.95 KB)
Editing: asynchat.py
# -*- Mode: Python; tab-width: 4 -*- # Id: asynchat.py,v 2.26 2000/09/07 22:29:26 rushing Exp # Author: Sam Rushing <rushing@nightmare.com> # ====================================================================== # Copyright 1996 by Sam Rushing # # All Rights Reserved # # Permission to use, copy, modify, and distribute this software and # its documentation for any purpose and without fee is hereby # granted, provided that the above copyright notice appear in all # copies and that both that copyright notice and this permission # notice appear in supporting documentation, and that the name of Sam # Rushing not be used in advertising or publicity pertaining to # distribution of the software without specific, written prior # permission. # # SAM RUSHING DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, # INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN # NO EVENT SHALL SAM RUSHING BE LIABLE FOR ANY SPECIAL, INDIRECT OR # CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS # OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, # NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN # CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. # ====================================================================== r"""A class supporting chat-style (command/response) protocols. This class adds support for 'chat' style protocols - where one side sends a 'command', and the other sends a response (examples would be the common internet protocols - smtp, nntp, ftp, etc..). The handle_read() method looks at the input stream for the current 'terminator' (usually '\r\n' for single-line responses, '\r\n.\r\n' for multi-line output), calling self.found_terminator() on its receipt. for example: Say you build an async nntp client using this class. At the start of the connection, you'll have self.terminator set to '\r\n', in order to process the single-line greeting. Just before issuing a 'LIST' command you'll set it to '\r\n.\r\n'. The output of the LIST command will be accumulated (using your own 'collect_incoming_data' method) up to the terminator, and then control will be returned to you - by calling your self.found_terminator() method. """ import asyncore from collections import deque class async_chat(asyncore.dispatcher): """This is an abstract class. You must derive from this class, and add the two methods collect_incoming_data() and found_terminator()""" # these are overridable defaults ac_in_buffer_size = 65536 ac_out_buffer_size = 65536 # we don't want to enable the use of encoding by default, because that is a # sign of an application bug that we don't want to pass silently use_encoding = 0 encoding = 'latin-1' def __init__(self, sock=None, map=None): # for string terminator matching self.ac_in_buffer = b'' # we use a list here rather than io.BytesIO for a few reasons... # del lst[:] is faster than bio.truncate(0) # lst = [] is faster than bio.truncate(0) self.incoming = [] # we toss the use of the "simple producer" and replace it with # a pure deque, which the original fifo was a wrapping of self.producer_fifo = deque() asyncore.dispatcher.__init__(self, sock, map) def collect_incoming_data(self, data): raise NotImplementedError("must be implemented in subclass") def _collect_incoming_data(self, data): self.incoming.append(data) def _get_data(self): d = b''.join(self.incoming) del self.incoming[:] return d def found_terminator(self): raise NotImplementedError("must be implemented in subclass") def set_terminator(self, term): """Set the input delimiter. Can be a fixed string of any length, an integer, or None. """ if isinstance(term, str) and self.use_encoding: term = bytes(term, self.encoding) elif isinstance(term, int) and term < 0: raise ValueError('the number of received bytes must be positive') self.terminator = term def get_terminator(self): return self.terminator # grab some more data from the socket, # throw it to the collector method, # check for the terminator, # if found, transition to the next state. def handle_read(self): try: data = self.recv(self.ac_in_buffer_size) except BlockingIOError: return except OSError as why: self.handle_error() return if isinstance(data, str) and self.use_encoding: data = bytes(str, self.encoding) self.ac_in_buffer = self.ac_in_buffer + data # Continue to search for self.terminator in self.ac_in_buffer, # while calling self.collect_incoming_data. The while loop # is necessary because we might read several data+terminator # combos with a single recv(4096). while self.ac_in_buffer: lb = len(self.ac_in_buffer) terminator = self.get_terminator() if not terminator: # no terminator, collect it all self.collect_incoming_data(self.ac_in_buffer) self.ac_in_buffer = b'' elif isinstance(terminator, int): # numeric terminator n = terminator if lb < n: self.collect_incoming_data(self.ac_in_buffer) self.ac_in_buffer = b'' self.terminator = self.terminator - lb else: self.collect_incoming_data(self.ac_in_buffer[:n]) self.ac_in_buffer = self.ac_in_buffer[n:] self.terminator = 0 self.found_terminator() else: # 3 cases: # 1) end of buffer matches terminator exactly: # collect data, transition # 2) end of buffer matches some prefix: # collect data to the prefix # 3) end of buffer does not match any prefix: # collect data terminator_len = len(terminator) index = self.ac_in_buffer.find(terminator) if index != -1: # we found the terminator if index > 0: # don't bother reporting the empty string # (source of subtle bugs) self.collect_incoming_data(self.ac_in_buffer[:index]) self.ac_in_buffer = self.ac_in_buffer[index+terminator_len:] # This does the Right Thing if the terminator # is changed here. self.found_terminator() else: # check for a prefix of the terminator index = find_prefix_at_end(self.ac_in_buffer, terminator) if index: if index != lb: # we found a prefix, collect up to the prefix self.collect_incoming_data(self.ac_in_buffer[:-index]) self.ac_in_buffer = self.ac_in_buffer[-index:] break else: # no prefix, collect it all self.collect_incoming_data(self.ac_in_buffer) self.ac_in_buffer = b'' def handle_write(self): self.initiate_send() def handle_close(self): self.close() def push(self, data): if not isinstance(data, (bytes, bytearray, memoryview)): raise TypeError('data argument must be byte-ish (%r)', type(data)) sabs = self.ac_out_buffer_size if len(data) > sabs: for i in range(0, len(data), sabs): self.producer_fifo.append(data[i:i+sabs]) else: self.producer_fifo.append(data) self.initiate_send() def push_with_producer(self, producer): self.producer_fifo.append(producer) self.initiate_send() def readable(self): "predicate for inclusion in the readable for select()" # cannot use the old predicate, it violates the claim of the # set_terminator method. # return (len(self.ac_in_buffer) <= self.ac_in_buffer_size) return 1 def writable(self): "predicate for inclusion in the writable for select()" return self.producer_fifo or (not self.connected) def close_when_done(self): "automatically close this channel once the outgoing queue is empty" self.producer_fifo.append(None) def initiate_send(self): while self.producer_fifo and self.connected: first = self.producer_fifo[0] # handle empty string/buffer or None entry if not first: del self.producer_fifo[0] if first is None: self.handle_close() return # handle classic producer behavior obs = self.ac_out_buffer_size try: data = first[:obs] except TypeError: data = first.more() if data: self.producer_fifo.appendleft(data) else: del self.producer_fifo[0] continue if isinstance(data, str) and self.use_encoding: data = bytes(data, self.encoding) # send the data try: num_sent = self.send(data) except OSError: self.handle_error() return if num_sent: if num_sent < len(data) or obs < len(first): self.producer_fifo[0] = first[num_sent:] else: del self.producer_fifo[0] # we tried to send some actual data return def discard_buffers(self): # Emergencies only! self.ac_in_buffer = b'' del self.incoming[:] self.producer_fifo.clear() class simple_producer: def __init__(self, data, buffer_size=512): self.data = data self.buffer_size = buffer_size def more(self): if len(self.data) > self.buffer_size: result = self.data[:self.buffer_size] self.data = self.data[self.buffer_size:] return result else: result = self.data self.data = b'' return result class fifo: def __init__(self, list=None): import warnings warnings.warn('fifo class will be removed in Python 3.6', DeprecationWarning, stacklevel=2) if not list: self.list = deque() else: self.list = deque(list) def __len__(self): return len(self.list) def is_empty(self): return not self.list def first(self): return self.list[0] def push(self, data): self.list.append(data) def pop(self): if self.list: return (1, self.list.popleft()) else: return (0, None) # Given 'haystack', see if any prefix of 'needle' is at its end. This # assumes an exact match has already been checked. Return the number of # characters matched. # for example: # f_p_a_e("qwerty\r", "\r\n") => 1 # f_p_a_e("qwertydkjf", "\r\n") => 0 # f_p_a_e("qwerty\r\n", "\r\n") => <undefined> # this could maybe be made faster with a computed regex? # [answer: no; circa Python-2.0, Jan 2001] # new python: 28961/s # old python: 18307/s # re: 12820/s # regex: 14035/s def find_prefix_at_end(haystack, needle): l = len(needle) - 1 while l and not haystack.endswith(needle[:l]): l -= 1 return l
Upload File
Create Folder