Function __init__ has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.

Open

    def __init__(self, fixer_names, options=None, explicit=None):
        """Initializer.

        Args:
            fixer_names: a list of fixers to import

• Read up
  Read up

Avoid deeply nested control flow statements.

Open

                        for c1, r1 in generate_matches(alt, nodes[c0:]):
                            if c1 > 0:
                                r = {}
                                r.update(r0)
                                r.update(r1)

Function is_probably_builtin has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.

Open

def is_probably_builtin(node):
    """
    Check that something isn't an attribute or function name etc.
    """
    prev = node.prev_sibling

• Read up
  Read up

Avoid deeply nested control flow statements.

Open

                        if optval is not None:
                            if vi in ('=', ':') and ';' in optval:
                                # ';' is a comment delimiter only if it follows
                                # a spacing character
                                pos = optval.find(';')

Function refactor_stdin has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.

Open

    def refactor_stdin(self, doctests_only=False):
        input = sys.stdin.read()
        if doctests_only:
            self.log_debug("Refactoring doctests in stdin")
            output = self.refactor_docstring(input, "<stdin>")

• Read up
  Read up

Avoid deeply nested control flow statements.

Open

                        if not fixer in results:
                            results[fixer] = []
                        results[fixer].append(current_ast_node)

Avoid deeply nested control flow statements.

Open

                        if member_name in change[1]:
                            if change[0] not in mod_dict:
                                modules.append(change[0])
                            mod_dict.setdefault(change[0], []).append(member)

Function fixup_parse_tree has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.

Open

def fixup_parse_tree(cls_node):
    """ one-line classes don't get a suite in the parse tree so we add
        one to normalize the tree
    """
    for node in cls_node.children:

• Read up
  Read up

Function transform has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.

Open

    def transform(self, node, results):
        head = results["head"]
        method = results["method"][0] # Extract node for method name
        tail = results["tail"]
        syms = self.syms

• Read up
  Read up

Function _extract_member has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.

Open

    def _extract_member(self, member, targetpath, pwd):
        """Extract the ZipInfo object 'member' to a physical
           file on the path targetpath.
        """
        # build the destination pathname, replacing

• Read up
  Read up

Avoid deeply nested control flow statements.

Open

                        if self.debug:
                            print "Adding", arcname
                        self.write(fname, arcname)

Avoid deeply nested control flow statements.

Open

                    if reductor:
                        rv = reductor(2)
                    else:
                        reductor = getattr(x, "__reduce__", None)
                        if reductor:

Function rec_test has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.

Open

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)):

• Read up
  Read up

Avoid deeply nested control flow statements.

Open

                        for fixer in current_ac_node.fixers:
                            if not fixer in results.keys():
                                results[fixer] = []
                            results[fixer].append(current_ast_node)

Avoid deeply nested control flow statements.

Open

                        if os.path.isfile(os.path.join(path, "__init__.py")):
                            # This is a package directory, add it
                            self.writepy(path, basename)  # Recursive call
                    elif ext == ".py":

Function insertion_sort has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.

Open

• Read up
  Read up

Function read has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.

Open

    def read(self, n=-1):
        """Read and return up to n bytes.
        If the argument is omitted, None, or negative, data is read and returned until EOF is reached..
        """
        buf = ''

• Read up
  Read up

Function ToASCII has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.

Open

def ToASCII(label):
    try:
        # Step 1: try ASCII
        label = label.encode("ascii")
    except UnicodeError:

• Read up
  Read up

Avoid deeply nested control flow statements.

Open

                        if isinstance(stmt, pytree.Node):
                            break

                    # The assignment is different if old_N is a tuple or list
                    # In that case, the assignment is old_N = new_N.args

Avoid deeply nested control flow statements.

Open

                        if self.debug:
                            print "Adding", arcname
                        self.write(fname, arcname)