gyp: use a set() in DeepDependencies for less O(n^2).

pylib/gyp/input.py

Index: pylib/gyp/input.py
diff --git a/pylib/gyp/input.py b/pylib/gyp/input.py
index f694e57b9fe455197bcd5eb423c48b66a8f0376e..6ce5ba250d4f4f2d0cbaf2f6b2423820a4535ad3 100644
--- a/pylib/gyp/input.py
+++ b/pylib/gyp/input.py
@@ -1602,12 +1602,12 @@ class DependencyGraphNode(object):
   def DeepDependencies(self, dependencies=None):
     """Returns a list of all of a target's dependencies, recursively."""
     if dependencies == None:
-      dependencies = []
+      dependencies = set()
 
     for dependency in self.dependencies:
       # Check for None, corresponding to the root node.
       if dependency.ref != None and dependency.ref not in dependencies:
-        dependencies.append(dependency.ref)
+        dependencies.add(dependency.ref)
         dependency.DeepDependencies(dependencies)
 
     return dependencies

[Nico, 2014/04/11 16:11:01]

DeepDependencies() now won't return results in deterministic order. Does that
matter?