Function _generate_toc has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def _generate_toc(self):
        """Generate key-to-(start, stop) table of contents."""
        starts, stops = [], []
        self._file.seek(0)
        next_pos = 0

• Read up
  Read up

Function write has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def write(self, b):
        if self.closed:
            raise ValueError("write to closed file")
        if isinstance(b, unicode):
            raise TypeError("can't write unicode to binary stream")

• Read up
  Read up

Function get_sequences has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def get_sequences(self):
        """Return a name-to-key-list dictionary to define each sequence."""
        results = {}
        f = open(os.path.join(self._path, '.mh_sequences'), 'r')
        try:

• Read up
  Read up

Function get_message has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def get_message(self, key):
        """Return a Message representation or raise a KeyError."""
        try:
            if self._locked:
                f = open(os.path.join(self._path, str(key)), 'r+')

• Read up
  Read up

Function update has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def update(self, other=None, **kwargs):
        # Make progressively weaker assumptions about "other"
        if other is None:
            pass
        elif hasattr(other, 'iteritems'):  # iteritems saves memory and lookups

• Read up
  Read up

Function next has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def next(self):
        while 1:
            try:
                item = self._events[self._index]
            except IndexError:

• Read up
  Read up

Function assertNotAlmostEqual has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def assertNotAlmostEqual(self, first, second, places=None, msg=None, delta=None):
        """Fail if the two objects are equal as determined by their
           difference rounded to the given number of decimal places
           (default 7) and comparing to zero, or by comparing that the
           between the two objects is less than the given delta.

• Read up
  Read up

Function replaceWholeText has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def replaceWholeText(self, content):
        # XXX This needs to be seriously changed if minidom ever
        # supports EntityReference nodes.
        parent = self.parentNode
        n = self.previousSibling

• Read up
  Read up

Function acceptNode has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def acceptNode(self, node):
        mask = self._nodetype_mask[node.nodeType]
        if self.filter.whatToShow & mask:
            val = self.filter.acceptNode(node)
            if val == FILTER_INTERRUPT:

• Read up
  Read up

Function xpath_tokenizer has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

def xpath_tokenizer(pattern, namespaces=None):
    for token in xpath_tokenizer_re.findall(pattern):
        tag = token[1]
        if tag and tag[0] != "{" and ":" in tag:
            try:

• Read up
  Read up

Function __init__ has 10 arguments (exceeds 4 allowed). Consider refactoring.

Open

    def __init__(self, module='__main__', defaultTest=None, argv=None,

Function createDocument has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def createDocument(self, namespaceURI, qualifiedName, doctype):
        if doctype and doctype.parentNode is not None:
            raise xml.dom.WrongDocumentErr(
                "doctype object owned by another DOM tree")
        doc = self._create_document()

• Read up
  Read up

Function assertAlmostEqual has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def assertAlmostEqual(self, first, second, places=None, msg=None, delta=None):
        """Fail if the two objects are unequal as determined by their
           difference rounded to the given number of decimal places
           (default 7) and comparing to zero, or by comparing that the
           between the two objects is more than the given delta.

• Read up
  Read up

Function seek has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def seek(self, pos, whence=0):
        here = self.tell()
        if whence:
            if whence == 1:
                pos = pos + here

• Read up
  Read up

Function names has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def names(self, filename, modulename):
        if modulename in self._ignore:
            return self._ignore[modulename]

        # haven't seen this one before, so see if the module name is

• Read up
  Read up

Function write_results_file has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def write_results_file(self, path, lines, lnotab, lines_hit):
        """Return a coverage results file in path."""

        try:
            outfile = open(path, "w")

• Read up
  Read up

Function test has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

def test(args=[]):
    if not args:
        args = [
            '/etc/passwd',
            'file:/etc/passwd',

• Read up
  Read up

Function _write_float has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

def _write_float(f, x):
    import math
    if x < 0:
        sign = 0x8000
        x = x * -1

• Read up
  Read up

Function roundfrac has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

def roundfrac(intpart, fraction, digs):
    """Round or extend the fraction to size digs."""
    f = len(fraction)
    if f <= digs:
        return intpart, fraction + '0'*(digs-f)

• Read up
  Read up

Function subtract has a Cognitive Complexity of 11 (exceeds 5 allowed). Consider refactoring.

Open

    def subtract(self, iterable=None, **kwds):
        '''Like dict.update() but subtracts counts instead of replacing them.
        Counts can be reduced below zero.  Both the inputs and outputs are
        allowed to contain zero and negative counts.

• Read up
  Read up