Big merge from experimental to bleeding edge.

editor/tools/plugins/com.google.dart.tools.core_test/src/com/google/dart/tools/core/formatter/testsource/test004$A_in.dart

 // Copyright (c) 2011, the Dart project authors.
 // All Rights Reserved.
 
 /**
  * Class CFG
  *
  * A simple class simulating the concept of
  * a control flow graph.
  *
  * CFG maintains a list of nodes, plus a start node.
@@ skipping 449 matching lines @@
             return;
           }
           nonBackPreds[x.getDfsNumber()].forEach(function f(int iter) {
             UnionFindNode y = nodes[iter];
             UnionFindNode ydash = y.findSet();
             if (!isAncestor(w. ydash.getDfsNumber(), last)) {
               type[w] = BB.IRREDUCIBLE;
               nonBackPreds[w].add(ydash.getDfsnumber());
             } else {
               if (ydash.getDfsNumber() != w) {
-                if (!nodePool.some(function f(UnionFindNode x) {return x == ydash;})) {
+                if (!nodePool.any(function f(UnionFindNode x) {return x == ydash;})) {
                   workList.addLast(ydash);
                   nodePool.addLast(ydash);
                 }
               }
             }
           });
         }
           // Collapse/Unionize nodes in a SCC to a single node
           // For every SCC found, create a loop descriptor and link it in.
           if ((nodePool.length > 0) || (type[w] == BB.SELF)) {
@@ skipping 328 matching lines @@
 class Out {
 
     static void write(String str) {
         Havlak.window.document.write(str);
     }
 
     static void writeln(String str) {
         Havlak.window.document.writeln(str);
     }
 }