OXIESEC PANEL

Name	Size	Modified	Perms
📁 ..	-	03/31/2022 06:22:38 AM	rwxr-xr-x
📄 __init__.py	674 bytes	09/08/2017 10:38:35 AM	rw-r--r--
📁 __pycache__	-	03/31/2022 06:22:39 AM	rwxr-xr-x
📄 _appdirs.py	788 bytes	09/08/2017 10:38:35 AM	rw-r--r--
📄 _inotify.py	3.37 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 _oldstyle.py	2.53 KB	09/08/2017 10:38:35 AM	rw-r--r--
📁 _pydoctortemplates	-	03/31/2022 06:22:38 AM	rwxr-xr-x
📄 _release.py	18.03 KB	09/08/2017 10:38:35 AM	rw-r--r--
📄 _sendmsg.c	15.42 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 _setup.py	12.6 KB	09/23/2017 05:51:46 AM	rw-r--r--
📄 _shellcomp.py	23.76 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 _textattributes.py	8.87 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 _tzhelper.py	3.12 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 _url.py	253 bytes	09/08/2017 10:38:35 AM	rw-r--r--
📄 compat.py	21.91 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 components.py	13.96 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 constants.py	544 bytes	09/08/2017 10:38:35 AM	rw-r--r--
📄 context.py	3.93 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 deprecate.py	26.15 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 failure.py	23.38 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 fakepwd.py	5.99 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 filepath.py	57.51 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 formmethod.py	11.19 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 htmlizer.py	3.27 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 lockfile.py	7.54 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 log.py	21.95 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 logfile.py	9.85 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 modules.py	26.5 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 monkey.py	2.17 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 procutils.py	1.39 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 randbytes.py	3.87 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 rebuild.py	9.04 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 reflect.py	19.02 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 release.py	1.16 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 roots.py	7.23 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 runtime.py	6.13 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 sendmsg.py	3.34 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 shortcut.py	2.2 KB	09/08/2017 10:38:35 AM	rw-r--r--
📄 syslog.py	3.64 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 systemd.py	2.77 KB	09/08/2017 10:38:36 AM	rw-r--r--
📁 test	-	03/31/2022 06:22:38 AM	rwxr-xr-x
📄 text.py	5.35 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 threadable.py	3.22 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 threadpool.py	9.61 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 twisted-completion.zsh	1.33 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 url.py	244 bytes	09/08/2017 10:38:36 AM	rw-r--r--
📄 urlpath.py	8.87 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 usage.py	34.19 KB	03/22/2022 11:03:56 AM	rw-r--r--
📄 util.py	27.29 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 versions.py	322 bytes	09/08/2017 10:38:35 AM	rw-r--r--
📄 win32.py	5.42 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 zippath.py	9.02 KB	09/08/2017 10:38:36 AM	rw-r--r--
📄 zipstream.py	9.53 KB	09/08/2017 10:38:36 AM	rw-r--r--

Editing: text.py

# -*- test-case-name: twisted.test.test_text -*-
#
# Copyright (c) Twisted Matrix Laboratories.
# See LICENSE for details.

"""
Miscellany of text-munging functions.
"""

def stringyString(object, indentation=''):
    """
    Expansive string formatting for sequence types.

C{list.__str__} and C{dict.__str__} use C{repr()} to display their
    elements.  This function also turns these sequence types
    into strings, but uses C{str()} on their elements instead.

Sequence elements are also displayed on separate lines, and nested
    sequences have nested indentation.
    """
    braces = ''
    sl = []

if type(object) is dict:
        braces = '{}'
        for key, value in object.items():
            value = stringyString(value, indentation + '   ')
            if isMultiline(value):
                if endsInNewline(value):
                    value = value[:-len('\n')]
                sl.append("%s %s:\n%s" % (indentation, key, value))
            else:
                # Oops.  Will have to move that indentation.
                sl.append("%s %s: %s" % (indentation, key,
                                         value[len(indentation) + 3:]))

elif type(object) is tuple or type(object) is list:
        if type(object) is tuple:
            braces = '()'
        else:
            braces = '[]'

for element in object:
            element = stringyString(element, indentation + ' ')
            sl.append(element.rstrip() + ',')
    else:
        sl[:] = map(lambda s, i=indentation: i + s,
                   str(object).split('\n'))

if not sl:
        sl.append(indentation)

if braces:
        sl[0] = indentation + braces[0] + sl[0][len(indentation) + 1:]
        sl[-1] = sl[-1] + braces[-1]

s = "\n".join(sl)

if isMultiline(s) and not endsInNewline(s):
        s = s + '\n'

return s

def isMultiline(s):
    """
    Returns C{True} if this string has a newline in it.
    """
    return (s.find('\n') != -1)

def endsInNewline(s):
    """
    Returns C{True} if this string ends in a newline.
    """
    return (s[-len('\n'):] == '\n')

def greedyWrap(inString, width=80):
    """
    Given a string and a column width, return a list of lines.

Caveat: I'm use a stupid greedy word-wrapping
    algorythm.  I won't put two spaces at the end
    of a sentence.  I don't do full justification.
    And no, I've never even *heard* of hypenation.
    """

outLines = []

#eww, evil hacks to allow paragraphs delimited by two \ns :(
    if inString.find('\n\n') >= 0:
        paragraphs = inString.split('\n\n')
        for para in paragraphs:
            outLines.extend(greedyWrap(para, width) + [''])
        return outLines
    inWords = inString.split()

column = 0
    ptr_line = 0
    while inWords:
        column = column + len(inWords[ptr_line])
        ptr_line = ptr_line + 1

if (column > width):
            if ptr_line == 1:
                # This single word is too long, it will be the whole line.
                pass
            else:
                # We've gone too far, stop the line one word back.
                ptr_line = ptr_line - 1
            (l, inWords) = (inWords[0:ptr_line], inWords[ptr_line:])
            outLines.append(' '.join(l))

ptr_line = 0
            column = 0
        elif not (len(inWords) > ptr_line):
            # Clean up the last bit.
            outLines.append(' '.join(inWords))
            del inWords[:]
        else:
            # Space
            column = column + 1
    # next word

return outLines

wordWrap = greedyWrap

def removeLeadingBlanks(lines):
    ret = []
    for line in lines:
        if ret or line.strip():
            ret.append(line)
    return ret

def removeLeadingTrailingBlanks(s):
    lines = removeLeadingBlanks(s.split('\n'))
    lines.reverse()
    lines = removeLeadingBlanks(lines)
    lines.reverse()
    return '\n'.join(lines)+'\n'

def splitQuoted(s):
    """
    Like a string split, but don't break substrings inside quotes.

>>> splitQuoted('the "hairy monkey" likes pie')
    ['the', 'hairy monkey', 'likes', 'pie']

Another one of those "someone must have a better solution for
    this" things.  This implementation is a VERY DUMB hack done too
    quickly.
    """
    out = []
    quot = None
    phrase = None
    for word in s.split():
        if phrase is None:
            if word and (word[0] in ("\"", "'")):
                quot = word[0]
                word = word[1:]
                phrase = []

if phrase is None:
            out.append(word)
        else:
            if word and (word[-1] == quot):
                word = word[:-1]
                phrase.append(word)
                out.append(" ".join(phrase))
                phrase = None
            else:
                phrase.append(word)

return out

def strFile(p, f, caseSensitive=True):
    """
    Find whether string C{p} occurs in a read()able object C{f}.

@rtype: C{bool}
    """
    buf = type(p)()
    buf_len = max(len(p), 2**2**2**2)
    if not caseSensitive:
        p = p.lower()
    while 1:
        r = f.read(buf_len-len(p))
        if not caseSensitive:
            r = r.lower()
        bytes_read = len(r)
        if bytes_read == 0:
            return False
        l = len(buf)+bytes_read-buf_len
        if l <= 0:
            buf = buf + r
        else:
            buf = buf[l:] + r
        if buf.find(p) != -1:
            return True