Builds / serves multiple HTML files.

lib/src/server/dependency_graph.dart

 // Copyright (c) 2015, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 /// Tracks the shape of the import/export graph and dependencies between files.
 library dev_compiler.src.dependency_graph;
 
 import 'dart:collection' show HashSet, HashMap;
 
 import 'package:analyzer/analyzer.dart' show parseDirectives;
@@ skipping 139 matching lines @@
   void clearSummary() {}
 
   void saveUpdatedContents() {}
 
   String toString() {
     var simpleUri = uri.scheme == 'file' ? path.relative(uri.path) : "$uri";
     return '[$runtimeType: $simpleUri]';
   }
 }
 
+/// A unique node representing all entry points in the graph. This is just for
+/// graph algorthm convenience.
+class EntryNode extends SourceNode {
+  final Iterable<SourceNode> entryPoints;
+
+  @override
+  Iterable<SourceNode> get allDeps => entryPoints;
+
+  @override
+  Iterable<SourceNode> get depsWithoutParts => entryPoints;
+
+  EntryNode(SourceGraph graph, Uri uri, Iterable<SourceNode> nodes)
+      : entryPoints = nodes,
+        super(graph, uri, null);
+}
+
 /// A node representing an entry HTML source file.
 class HtmlSourceNode extends SourceNode {
   /// Resources included by default on any application.
   final runtimeDeps;
 
   /// Libraries referred to via script tags.
   Set<DartSourceNode> scripts = new Set<DartSourceNode>();
 
   /// Link-rel stylesheets, images, and other specified files.
   Set<SourceNode> resources = new Set<SourceNode>();
@@ skipping 290 matching lines @@
   // cases anways require using summaries to understand what parts of the public
   // API may be affected by transitive changes. The re-export case is just one
   // of those transitive cases, but is not sufficient. See
   // https://github.com/dart-lang/dev_compiler/issues/76
   var apiChangeDetected = new HashSet<SourceNode>();
   bool htmlNeedsRebuild = false;
 
   bool shouldBuildNode(SourceNode n) {
     if (n.needsRebuild) return true;
     if (n is HtmlSourceNode) return htmlNeedsRebuild;
-    if (n is ResourceSourceNode) return false;
+    if (n is ResourceSourceNode || n is EntryNode) return false;
     return (n as DartSourceNode)
         .imports
         .any((i) => apiChangeDetected.contains(i));
   }
 
   visitInPostOrder(start, (n) {
     if (n.structureChanged) htmlNeedsRebuild = true;
     if (shouldBuildNode(n)) {
       var oldHash = n.cachingHash;
       if (build(n)) apiChangeDetected.add(n);
@@ skipping 38 matching lines @@
     var deps = includeParts ? node.allDeps : node.depsWithoutParts;
     deps.forEach(helper);
     action(node);
   }
   helper(start);
 }
 
 bool _same(Set a, Set b) => a.length == b.length && a.containsAll(b);
 
 final _log = new Logger('dev_compiler.dependency_graph');