Function _encode_chunks has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

    def _encode_chunks(self, newchunks, maxlinelen):
        # MIME-encode a header with many different charsets and/or encodings.
        #
        # Given a list of pairs (string, charset), return a MIME-encoded
        # string suitable for use in a header field.  Each pair may have

• Read up
  Read up

Function merge has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

• Read up
  Read up

Function _getcategory has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

def _getcategory(category):
    import re
    if not category:
        return Warning
    if re.match("^[a-zA-Z0-9_]+$", category):

• Read up
  Read up

Function offset_from_tz_string has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

def offset_from_tz_string(tz):
    offset = None
    if tz in UTC_ZONES:
        offset = 0
    else:

• Read up
  Read up

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

Open

    def write(self, s):
        """Write a string to the file.

        There is no return value.
        """

• Read up
  Read up

Function add_cookie_header has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

    def add_cookie_header(self, request):
        """Add correct Cookie: header to request (urllib2.Request object).

        The Cookie2 header is also added unless policy.hide_cookie2 is true.

• Read up
  Read up

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

Open

    def write(self, s):
        if self.closed:
            raise ValueError("write to closed file")
        if not isinstance(s, unicode):
            raise TypeError("can't write %s to text stream" %

• Read up
  Read up

Function getaddrlist has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

    def getaddrlist(self, name):
        """Get a list of addresses from a header.

        Retrieves a list of addresses from a header, where each address is a
        tuple as returned by getaddr().  Scans all named headers, so it works

• Read up
  Read up

Function __ixor__ has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

    def __ixor__(self, it):
        if it is self:
            self.clear()
        else:
            if not isinstance(it, Set):

• Read up
  Read up

Function assertDictContainsSubset has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

    def assertDictContainsSubset(self, expected, actual, msg=None):
        """Checks whether actual is a superset of expected."""
        missing = []
        mismatched = []
        for key, value in expected.iteritems():

• Read up
  Read up

Function _handleClassSetUp has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

    def _handleClassSetUp(self, test, result):
        previousClass = getattr(result, '_previousTestClass', None)
        currentClass = test.__class__
        if currentClass == previousClass:
            return

• Read up
  Read up

Function _get_elements_by_tagName_ns_helper has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

def _get_elements_by_tagName_ns_helper(parent, nsURI, localName, rc):
    for node in parent.childNodes:
        if node.nodeType == Node.ELEMENT_NODE:
            if ((localName == "*" or node.localName == localName) and
                (nsURI == "*" or node.namespaceURI == nsURI)):

• Read up
  Read up

Function _tearDownPreviousClass has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

    def _tearDownPreviousClass(self, test, result):
        previousClass = getattr(result, '_previousTestClass', None)
        currentClass = test.__class__
        if currentClass == previousClass:
            return

• Read up
  Read up

Function getProperty has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

    def getProperty(self, name):
        if name == handler.property_lexical_handler:
            return self._lex_handler_prop
        elif name == property_interning_dict:
            return self._interning

• Read up
  Read up

Function cloneNode has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

    def cloneNode(self, deep):
        if self.ownerDocument is None:
            # it's ok
            clone = DocumentType(None)
            clone.name = self.name

• Read up
  Read up

Function open_local_file has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

    def open_local_file(self, url):
        """Use local file."""
        import mimetypes, mimetools, email.utils
        try:
            from cStringIO import StringIO

• Read up
  Read up

Function find_strings has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

def find_strings(filename):
    """Return a dict of possible docstring positions.

    The dict maps line numbers to strings.  There is an entry for
    line that contains only a string or a part of a triple-quoted

• Read up
  Read up

Function skip has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

    def skip(self):
        """Skip the rest of the chunk.
        If you are not interested in the contents of the chunk,
        this method should be called so that the file points to
        the start of the next chunk.

• Read up
  Read up

Function _ipconfig_getnode has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

def _ipconfig_getnode():
    """Get the hardware address on Windows by running ipconfig.exe."""
    import os, re
    dirs = ['', r'c:\windows\system32', r'c:\winnt\system32']
    try:

• Read up
  Read up

Function match_seq has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring.

Open

    def match_seq(self, nodes, results=None):
        """Does this pattern exactly match a sequence of nodes?"""
        for c, r in self.generate_matches(nodes):
            if c == len(nodes):
                if results is not None:

• Read up
  Read up