Enable Try Dart to run on IE11.

site/try/src/shadow_root.dart

 // Copyright (c) 2014, 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.
 
 library trydart.shadow_root;
 
 import 'dart:html';
 
 import 'selection.dart' show
     TrySelection;
@@ skipping 31 matching lines @@
 }
 
 String getText(Element node) {
   if (ShadowRoot.supported) return node.text;
   StringBuffer buffer = new StringBuffer();
   htmlToText(
       node, buffer, new TrySelection.empty(node), treatRootAsInline: true);
   return '$buffer';
 }
 
+/// Element.contains(n) doesn't work when n is node(Text) in IE,
+/// so this is brute-force implementation of contains.
+bool containsNode(parent, child) {
+    var p = child;
+    while (p != null && p != parent) {
+      p = p.parentNode;
+    }
+    return p != null;
+}
+
 /// Position [walker] at the last predecessor (that is, child of child of
 /// child...) of [node]. The next call to walker.nextNode will return the first
 /// node after [node].
 void skip(Node node, TreeWalker walker) {
   if (walker.nextSibling() != null) {
     walker.previousNode();
     return;
   }
   for (Node current = walker.nextNode();
        current != null;
        current = walker.nextNode()) {
-    if (!node.contains(current)) {
+    if (!containsNode(node, current)) {
       walker.previousNode();
       return;
     }
   }
 }
 
 /// Call [f] on each node in [root] in same order as [TreeWalker].  Skip any
 /// nodes used to implement shadow root polyfill.
 void walkNodes(Node root, int f(Node node)) {
   TreeWalker walker = new TreeWalker(root, NodeFilter.SHOW_ALL);
@@ skipping 11 matching lines @@
       case WALKER_SKIP_NODE:
         skip(node, walker);
         break;
       case WALKER_NEXT:
         break;
       default:
         throw 'Unexpected action returned from [f]: $action';
     }
   }
 }
+

[ahe, 2014/07/21 08:16:00]

Extra line.

[aam-me, 2014/07/21 12:20:38]

Done.