Fixing leftover from prior reveiew, plus more lint.

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 errno
 import filecmp
 import os.path
 import re
@@ skipping 374 matching lines @@
 
 
 # From Alex Martelli,
 # http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/52560
 # ASPN: Python Cookbook: Remove duplicates from a sequence
 # First comment, dated 2001/10/13.
 # (Also in the printed Python Cookbook.)
 
 def uniquer(seq, idfun=None):
     if idfun is None:
-        def idfun(x): return x
+        idfun = lambda x: x
     seen = {}
     result = []
     for item in seq:
         marker = idfun(item)
         if marker in seen: continue
         seen[marker] = 1
         result.append(item)
     return result
 
 
@@ skipping 37 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