Cleanup pylint errors

pylib/gyp/common.py

 # Copyright (c) 2012 Google Inc. All rights reserved.
 # Use of this source code is governed by a BSD-style license that can be
 # found in the LICENSE file.
 
 from __future__ import with_statement
 
 import collections
 import errno
 import filecmp
 import os.path
@@ skipping 311 matching lines @@
 def WriteOnDiff(filename):
   """Write to a file only if the new contents differ.
 
   Arguments:
     filename: name of the file to potentially write to.
   Returns:
     A file like object which will write to temporary file and only overwrite
     the target if it differs (on close).
   """
 
-  class Writer:
+  class Writer(object):
     """Wrapper around file which only covers the target if it differs."""
     def __init__(self):
       # Pick temporary file.
       tmp_fd, self.tmp_path = tempfile.mkstemp(
           suffix='.tmp',
           prefix=os.path.split(filename)[1] + '.gyp.',
           dir=os.path.split(filename)[0])
       try:
         self.tmp_file = os.fdopen(tmp_fd, 'wb')
       except Exception:
@@ skipping 198 matching lines @@
 
 class CycleError(Exception):
   """An exception raised when an unexpected cycle is detected."""
   def __init__(self, nodes):
     self.nodes = nodes
   def __str__(self):
     return 'CycleError: cycle involving: ' + str(self.nodes)
 
 
 def TopologicallySorted(graph, get_edges):
-  """Topologically sort based on a user provided edge definition.
+  r"""Topologically sort based on a user provided edge definition.
 
   Args:
     graph: A list of node names.
     get_edges: A function mapping from node name to a hashable collection
                of node names which this node has outgoing edges to.
   Returns:
     A list containing all of the node in graph in topological order.
     It is assumed that calling get_edges once for each node and caching is
     cheaper than repeatedly calling get_edges.
   Raises:
@@ skipping 17 matching lines @@
       return
     visited.add(node)
     visiting.add(node)
     for neighbor in get_edges(node):
       Visit(neighbor)
     visiting.remove(node)
     ordered_nodes.insert(0, node)
   for node in sorted(graph):
     Visit(node)
   return ordered_nodes