File Manager

X7ROOT File Manager

Current Path: /opt/cloudlinux/venv/lib/python3.11/site-packages

opt / cloudlinux / venv / lib / python3.11 / site-packages /

ðŸ“ ..
ðŸ“ GitPython-3.1.32.dist-info
ðŸ“ Jinja2-3.0.3.dist-info
ðŸ“ Mako-1.2.4.dist-info
ðŸ“ MarkupSafe-2.1.3.dist-info
ðŸ“ PyJWT-2.8.0.dist-info
ðŸ“ PyMySQL-1.1.0.dist-info
ðŸ“ PyVirtualDisplay-3.0.dist-info
ðŸ“ PyYAML-6.0.1.dist-info
ðŸ“ __pycache__
ðŸ“„ _cffi_backend.cpython-311-x86_64-linux-gnu.so(267.63 KB)
ðŸ“ _distutils_hack
ðŸ“„ _pyrsistent_version.py(23 B)
ðŸ“ _pytest
ðŸ“ _yaml
ðŸ“ aiohttp
ðŸ“ aiohttp-3.9.2.dist-info
ðŸ“ aiohttp_jinja2
ðŸ“ aiohttp_jinja2-1.5.dist-info
ðŸ“ aiohttp_security
ðŸ“ aiohttp_security-0.4.0.dist-info
ðŸ“ aiohttp_session
ðŸ“ aiohttp_session-2.9.0.dist-info
ðŸ“ aiosignal
ðŸ“ aiosignal-1.3.1.dist-info
ðŸ“ alembic
ðŸ“ alembic-1.11.1.dist-info
ðŸ“ annotated_types
ðŸ“ annotated_types-0.6.0.dist-info
ðŸ“ astroid
ðŸ“ astroid-2.15.6.dist-info
ðŸ“ attr
ðŸ“ attrs
ðŸ“ attrs-23.1.0.dist-info
ðŸ“ backports
ðŸ“ certifi
ðŸ“ certifi-2023.7.22.dist-info
ðŸ“ cffi
ðŸ“ cffi-1.15.1.dist-info
ðŸ“ chardet
ðŸ“ chardet-5.2.0.dist-info
ðŸ“ charset_normalizer
ðŸ“ charset_normalizer-2.1.1.dist-info
ðŸ“ cl_dom_collector
ðŸ“„ cl_proc_hidepid.py(4.53 KB)
ðŸ“ clcagefslib
ðŸ“ clcommon
ðŸ“ clconfig
ðŸ“ clconfigure
ðŸ“„ clcontrollib.py(51.73 KB)
ðŸ“ cldashboard
ðŸ“„ cldetectlib.py(18.13 KB)
ðŸ“„ cldiaglib.py(45.84 KB)
ðŸ“ clevents
ðŸ“ clflags
ðŸ“„ clhooklib.py(1.27 KB)
ðŸ“„ cli_utils.py(1.66 KB)
ðŸ“ cllicense
ðŸ“„ cllicenselib.py(9.1 KB)
ðŸ“ cllimits
ðŸ“ cllimits_validator
ðŸ“ cllimitslib_v2
ðŸ“ cllvectl
ðŸ“ clpackages
ðŸ“ clquota
ðŸ“ clselect
ðŸ“ clselector
ðŸ“ clsentry
ðŸ“„ clsetuplib.py(4.35 KB)
ðŸ“„ clsudo.py(14.42 KB)
ðŸ“ clsummary
ðŸ“ clveconfig
ðŸ“ clwizard
ðŸ“ configparser-5.0.2.dist-info
ðŸ“„ configparser.py(1.51 KB)
ðŸ“ contextlib2
ðŸ“ contextlib2-21.6.0.dist-info
ðŸ“ coverage
ðŸ“ coverage-7.2.7.dist-info
ðŸ“ cryptography
ðŸ“ cryptography-41.0.2.dist-info
ðŸ“ ddt-1.4.4.dist-info
ðŸ“„ ddt.py(12.43 KB)
ðŸ“ dill
ðŸ“ dill-0.3.7.dist-info
ðŸ“ distlib
ðŸ“ distlib-0.3.8.dist-info
ðŸ“„ distutils-precedence.pth(151 B)
ðŸ“ docopt-0.6.2.dist-info
ðŸ“„ docopt.py(19.48 KB)
ðŸ“ dodgy
ðŸ“ dodgy-0.2.1.dist-info
ðŸ“ filelock
ðŸ“ filelock-3.13.1.dist-info
ðŸ“ flake8
ðŸ“ flake8-5.0.4.dist-info
ðŸ“ flake8_polyfill
ðŸ“ flake8_polyfill-1.0.2.dist-info
ðŸ“ frozenlist
ðŸ“ frozenlist-1.4.0.dist-info
ðŸ“ future
ðŸ“ future-0.18.3.dist-info
ðŸ“ git
ðŸ“ gitdb
ðŸ“ gitdb-4.0.10.dist-info
ðŸ“ guppy
ðŸ“ guppy3-3.1.3.dist-info
ðŸ“ idna
ðŸ“ idna-3.4.dist-info
ðŸ“ iniconfig
ðŸ“ iniconfig-2.0.0.dist-info
ðŸ“ isort
ðŸ“ isort-5.12.0.dist-info
ðŸ“ jinja2
ðŸ“ jsonschema
ðŸ“ jsonschema-3.2.0.dist-info
ðŸ“ jwt
ðŸ“ lazy_object_proxy
ðŸ“ lazy_object_proxy-1.9.0.dist-info
ðŸ“ libfuturize
ðŸ“ libpasteurize
ðŸ“ lve_stats-2.0.dist-info
ðŸ“ lve_utils
ðŸ“„ lveapi.py(19.53 KB)
ðŸ“„ lvectllib.py(102.55 KB)
ðŸ“ lvemanager
ðŸ“„ lvestat.py(6.83 KB)
ðŸ“ lvestats
ðŸ“ lxml
ðŸ“ lxml-4.9.2.dist-info
ðŸ“ mako
ðŸ“ markupsafe
ðŸ“ mccabe-0.7.0.dist-info
ðŸ“„ mccabe.py(10.4 KB)
ðŸ“ mock
ðŸ“ mock-5.1.0.dist-info
ðŸ“ multidict
ðŸ“ multidict-6.0.4.dist-info
ðŸ“ numpy
ðŸ“ numpy-1.25.1.dist-info
ðŸ“ numpy.libs
ðŸ“ packaging
ðŸ“ packaging-23.1.dist-info
ðŸ“„ pam.py(7.38 KB)
ðŸ“ past
ðŸ“ pep8_naming-0.10.0.dist-info
ðŸ“„ pep8ext_naming.py(18.61 KB)
ðŸ“ pip
ðŸ“ pip-25.0.1.dist-info
ðŸ“ pkg_resources
ðŸ“ platformdirs
ðŸ“ platformdirs-3.11.0.dist-info
ðŸ“ pluggy
ðŸ“ pluggy-1.2.0.dist-info
ðŸ“ prettytable
ðŸ“ prettytable-3.8.0.dist-info
ðŸ“ prometheus_client
ðŸ“ prometheus_client-0.8.0.dist-info
ðŸ“ prospector
ðŸ“ prospector-1.10.2.dist-info
ðŸ“ psutil
ðŸ“ psutil-5.9.5.dist-info
ðŸ“ psycopg2
ðŸ“ psycopg2_binary-2.9.6.dist-info
ðŸ“ psycopg2_binary.libs
ðŸ“„ py.py(263 B)
ðŸ“ pycodestyle-2.9.1.dist-info
ðŸ“„ pycodestyle.py(101.08 KB)
ðŸ“ pycparser
ðŸ“ pycparser-2.21.dist-info
ðŸ“ pydantic
ðŸ“ pydantic-2.4.2.dist-info
ðŸ“ pydantic_core
ðŸ“ pydantic_core-2.10.1.dist-info
ðŸ“ pydocstyle
ðŸ“ pydocstyle-6.3.0.dist-info
ðŸ“ pyfakefs
ðŸ“ pyfakefs-5.2.3.dist-info
ðŸ“ pyflakes
ðŸ“ pyflakes-2.5.0.dist-info
ðŸ“ pylint
ðŸ“ pylint-2.17.4.dist-info
ðŸ“ pylint_celery
ðŸ“ pylint_celery-0.3.dist-info
ðŸ“ pylint_django
ðŸ“ pylint_django-2.5.3.dist-info
ðŸ“ pylint_flask
ðŸ“ pylint_flask-0.6.dist-info
ðŸ“ pylint_plugin_utils
ðŸ“ pylint_plugin_utils-0.7.dist-info
ðŸ“ pylve-2.1-py3.11.egg-info
ðŸ“„ pylve.cpython-311-x86_64-linux-gnu.so(25.48 KB)
ðŸ“ pymysql
ðŸ“ pyparsing
ðŸ“ pyparsing-3.0.9.dist-info
ðŸ“ pyrsistent
ðŸ“ pyrsistent-0.19.3.dist-info
ðŸ“ pytest
ðŸ“ pytest-7.4.0.dist-info
ðŸ“ pytest_check
ðŸ“ pytest_check-2.5.3.dist-info
ðŸ“ pytest_snapshot
ðŸ“ pytest_snapshot-0.9.0.dist-info
ðŸ“ pytest_subprocess
ðŸ“ pytest_subprocess-1.5.0.dist-info
ðŸ“ pytest_tap
ðŸ“ pytest_tap-3.5.dist-info
ðŸ“ python_pam-1.8.4.dist-info
ðŸ“ pyvirtualdisplay
ðŸ“ raven
ðŸ“ raven-6.10.0.dist-info
ðŸ“„ remove_ubc.py(5.73 KB)
ðŸ“ requests
ðŸ“ requests-2.31.0.dist-info
ðŸ“ requirements_detector
ðŸ“ requirements_detector-1.2.2.dist-info
ðŸ“ schema-0.7.5.dist-info
ðŸ“„ schema.py(29.51 KB)
ðŸ“„ secureio.py(18.83 KB)
ðŸ“ semver
ðŸ“ semver-3.0.1.dist-info
ðŸ“ sentry_sdk
ðŸ“ sentry_sdk-1.29.2.dist-info
ðŸ“ setoptconf
ðŸ“ setoptconf_tmp-0.3.1.dist-info
ðŸ“ setuptools
ðŸ“ setuptools-78.1.0.dist-info
ðŸ“„ simple_rpm.so(11.29 KB)
ðŸ“ simplejson
ðŸ“ simplejson-3.19.1.dist-info
ðŸ“ six-1.16.0.dist-info
ðŸ“„ six.py(33.74 KB)
ðŸ“ smmap
ðŸ“ smmap-5.0.0.dist-info
ðŸ“ snowballstemmer
ðŸ“ snowballstemmer-2.2.0.dist-info
ðŸ“ sqlalchemy
ðŸ“ sqlalchemy-1.3.24.dist-info
ðŸ“ ssa
ðŸ“ svgwrite
ðŸ“ svgwrite-1.4.3.dist-info
ðŸ“ tap
ðŸ“ tap_py-3.2.1.dist-info
ðŸ“ testfixtures
ðŸ“ testfixtures-7.1.0.dist-info
ðŸ“ toml
ðŸ“ toml-0.10.2.dist-info
ðŸ“ tomlkit
ðŸ“ tomlkit-0.11.8.dist-info
ðŸ“ typing_extensions-4.7.1.dist-info
ðŸ“ typing_extensions-4.8.0.dist-info
ðŸ“„ typing_extensions.py(108.48 KB)
ðŸ“ unshare-0.22.dist-info
ðŸ“„ unshare.cpython-311-x86_64-linux-gnu.so(8.17 KB)
ðŸ“ urllib3
ðŸ“ urllib3-2.0.4.dist-info
ðŸ“ vendors_api
ðŸ“ virtualenv
ðŸ“ virtualenv-20.21.1.dist-info
ðŸ“ wcwidth
ðŸ“ wcwidth-0.2.6.dist-info
ðŸ“ wmt
ðŸ“ wrapt
ðŸ“ wrapt-1.15.0.dist-info
ðŸ“ yaml
ðŸ“ yarl
ðŸ“ yarl-1.9.2.dist-info

Editing: mccabe.py

""" Meager code path measurement tool.
    Ned Batchelder
    http://nedbatchelder.com/blog/200803/python_code_complexity_microtool.html
    MIT License.
"""
from __future__ import with_statement

import optparse
import sys
import tokenize

from collections import defaultdict
try:
    import ast
    from ast import iter_child_nodes
except ImportError:   # Python 2.5
    from flake8.util import ast, iter_child_nodes

__version__ = '0.7.0'

class ASTVisitor(object):
    """Performs a depth-first walk of the AST."""

def __init__(self):
        self.node = None
        self._cache = {}

def default(self, node, *args):
        for child in iter_child_nodes(node):
            self.dispatch(child, *args)

def dispatch(self, node, *args):
        self.node = node
        klass = node.__class__
        meth = self._cache.get(klass)
        if meth is None:
            className = klass.__name__
            meth = getattr(self.visitor, 'visit' + className, self.default)
            self._cache[klass] = meth
        return meth(node, *args)

def preorder(self, tree, visitor, *args):
        """Do preorder walk of tree using visitor"""
        self.visitor = visitor
        visitor.visit = self.dispatch
        self.dispatch(tree, *args)  # XXX *args make sense?

class PathNode(object):
    def __init__(self, name, look="circle"):
        self.name = name
        self.look = look

def to_dot(self):
        print('node [shape=%s,label="%s"] %d;' % (
            self.look, self.name, self.dot_id()))

def dot_id(self):
        return id(self)

class PathGraph(object):
    def __init__(self, name, entity, lineno, column=0):
        self.name = name
        self.entity = entity
        self.lineno = lineno
        self.column = column
        self.nodes = defaultdict(list)

def connect(self, n1, n2):
        self.nodes[n1].append(n2)
        # Ensure that the destination node is always counted.
        self.nodes[n2] = []

def to_dot(self):
        print('subgraph {')
        for node in self.nodes:
            node.to_dot()
        for node, nexts in self.nodes.items():
            for next in nexts:
                print('%s -- %s;' % (node.dot_id(), next.dot_id()))
        print('}')

def complexity(self):
        """ Return the McCabe complexity for the graph.
            V-E+2
        """
        num_edges = sum([len(n) for n in self.nodes.values()])
        num_nodes = len(self.nodes)
        return num_edges - num_nodes + 2

class PathGraphingAstVisitor(ASTVisitor):
    """ A visitor for a parsed Abstract Syntax Tree which finds executable
        statements.
    """

def __init__(self):
        super(PathGraphingAstVisitor, self).__init__()
        self.classname = ""
        self.graphs = {}
        self.reset()

def reset(self):
        self.graph = None
        self.tail = None

def dispatch_list(self, node_list):
        for node in node_list:
            self.dispatch(node)

def visitFunctionDef(self, node):

if self.classname:
            entity = '%s%s' % (self.classname, node.name)
        else:
            entity = node.name

name = '%d:%d: %r' % (node.lineno, node.col_offset, entity)

if self.graph is not None:
            # closure
            pathnode = self.appendPathNode(name)
            self.tail = pathnode
            self.dispatch_list(node.body)
            bottom = PathNode("", look='point')
            self.graph.connect(self.tail, bottom)
            self.graph.connect(pathnode, bottom)
            self.tail = bottom
        else:
            self.graph = PathGraph(name, entity, node.lineno, node.col_offset)
            pathnode = PathNode(name)
            self.tail = pathnode
            self.dispatch_list(node.body)
            self.graphs["%s%s" % (self.classname, node.name)] = self.graph
            self.reset()

visitAsyncFunctionDef = visitFunctionDef

def visitClassDef(self, node):
        old_classname = self.classname
        self.classname += node.name + "."
        self.dispatch_list(node.body)
        self.classname = old_classname

def appendPathNode(self, name):
        if not self.tail:
            return
        pathnode = PathNode(name)
        self.graph.connect(self.tail, pathnode)
        self.tail = pathnode
        return pathnode

def visitSimpleStatement(self, node):
        if node.lineno is None:
            lineno = 0
        else:
            lineno = node.lineno
        name = "Stmt %d" % lineno
        self.appendPathNode(name)

def default(self, node, *args):
        if isinstance(node, ast.stmt):
            self.visitSimpleStatement(node)
        else:
            super(PathGraphingAstVisitor, self).default(node, *args)

def visitLoop(self, node):
        name = "Loop %d" % node.lineno
        self._subgraph(node, name)

visitAsyncFor = visitFor = visitWhile = visitLoop

def visitIf(self, node):
        name = "If %d" % node.lineno
        self._subgraph(node, name)

def _subgraph(self, node, name, extra_blocks=()):
        """create the subgraphs representing any `if` and `for` statements"""
        if self.graph is None:
            # global loop
            self.graph = PathGraph(name, name, node.lineno, node.col_offset)
            pathnode = PathNode(name)
            self._subgraph_parse(node, pathnode, extra_blocks)
            self.graphs["%s%s" % (self.classname, name)] = self.graph
            self.reset()
        else:
            pathnode = self.appendPathNode(name)
            self._subgraph_parse(node, pathnode, extra_blocks)

def _subgraph_parse(self, node, pathnode, extra_blocks):
        """parse the body and any `else` block of `if` and `for` statements"""
        loose_ends = []
        self.tail = pathnode
        self.dispatch_list(node.body)
        loose_ends.append(self.tail)
        for extra in extra_blocks:
            self.tail = pathnode
            self.dispatch_list(extra.body)
            loose_ends.append(self.tail)
        if node.orelse:
            self.tail = pathnode
            self.dispatch_list(node.orelse)
            loose_ends.append(self.tail)
        else:
            loose_ends.append(pathnode)
        if pathnode:
            bottom = PathNode("", look='point')
            for le in loose_ends:
                self.graph.connect(le, bottom)
            self.tail = bottom

def visitTryExcept(self, node):
        name = "TryExcept %d" % node.lineno
        self._subgraph(node, name, extra_blocks=node.handlers)

visitTry = visitTryExcept

def visitWith(self, node):
        name = "With %d" % node.lineno
        self.appendPathNode(name)
        self.dispatch_list(node.body)

visitAsyncWith = visitWith

class McCabeChecker(object):
    """McCabe cyclomatic complexity checker."""
    name = 'mccabe'
    version = __version__
    _code = 'C901'
    _error_tmpl = "C901 %r is too complex (%d)"
    max_complexity = -1

def __init__(self, tree, filename):
        self.tree = tree

@classmethod
    def add_options(cls, parser):
        flag = '--max-complexity'
        kwargs = {
            'default': -1,
            'action': 'store',
            'type': int,
            'help': 'McCabe complexity threshold',
            'parse_from_config': 'True',
        }
        config_opts = getattr(parser, 'config_options', None)
        if isinstance(config_opts, list):
            # Flake8 2.x
            kwargs.pop('parse_from_config')
            parser.add_option(flag, **kwargs)
            parser.config_options.append('max-complexity')
        else:
            parser.add_option(flag, **kwargs)

@classmethod
    def parse_options(cls, options):
        cls.max_complexity = int(options.max_complexity)

def run(self):
        if self.max_complexity < 0:
            return
        visitor = PathGraphingAstVisitor()
        visitor.preorder(self.tree, visitor)
        for graph in visitor.graphs.values():
            if graph.complexity() > self.max_complexity:
                text = self._error_tmpl % (graph.entity, graph.complexity())
                yield graph.lineno, graph.column, text, type(self)

def get_code_complexity(code, threshold=7, filename='stdin'):
    try:
        tree = compile(code, filename, "exec", ast.PyCF_ONLY_AST)
    except SyntaxError:
        e = sys.exc_info()[1]
        sys.stderr.write("Unable to parse %s: %s\n" % (filename, e))
        return 0

complx = []
    McCabeChecker.max_complexity = threshold
    for lineno, offset, text, check in McCabeChecker(tree, filename).run():
        complx.append('%s:%d:1: %s' % (filename, lineno, text))

if len(complx) == 0:
        return 0
    print('\n'.join(complx))
    return len(complx)

def get_module_complexity(module_path, threshold=7):
    """Returns the complexity of a module"""
    code = _read(module_path)
    return get_code_complexity(code, threshold, filename=module_path)

def _read(filename):
    if (2, 5) < sys.version_info < (3, 0):
        with open(filename, 'rU') as f:
            return f.read()
    elif (3, 0) <= sys.version_info < (4, 0):
        """Read the source code."""
        try:
            with open(filename, 'rb') as f:
                (encoding, _) = tokenize.detect_encoding(f.readline)
        except (LookupError, SyntaxError, UnicodeError):
            # Fall back if file encoding is improperly declared
            with open(filename, encoding='latin-1') as f:
                return f.read()
        with open(filename, 'r', encoding=encoding) as f:
            return f.read()

def main(argv=None):
    if argv is None:
        argv = sys.argv[1:]
    opar = optparse.OptionParser()
    opar.add_option("-d", "--dot", dest="dot",
                    help="output a graphviz dot file", action="store_true")
    opar.add_option("-m", "--min", dest="threshold",
                    help="minimum complexity for output", type="int",
                    default=1)

options, args = opar.parse_args(argv)

code = _read(args[0])
    tree = compile(code, args[0], "exec", ast.PyCF_ONLY_AST)
    visitor = PathGraphingAstVisitor()
    visitor.preorder(tree, visitor)

if options.dot:
        print('graph {')
        for graph in visitor.graphs.values():
            if (not options.threshold or
                    graph.complexity() >= options.threshold):
                graph.to_dot()
        print('}')
    else:
        for graph in visitor.graphs.values():
            if graph.complexity() >= options.threshold:
                print(graph.name, graph.complexity())

if __name__ == '__main__':
    main(sys.argv[1:])

X7ROOT File Manager

Editing: mccabe.py

Upload File

Create Folder