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_out.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. That's it.
  */
 class CFG {
@@ skipping 449 matching lines @@
         }
         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(
+                if (!nodePool.any(
                   function f(UnionFindNode x) {
                     return x == ydash;
                   })) {
                   workList.addLast(ydash);
                   nodePool.addLast(ydash);
                 }
               }
             }
           });
       }
@@ skipping 334 matching lines @@
 
 class Out {
   static void write(String str) {
     Havlak.window.document.write(str);
   }
 
   static void writeln(String str) {
     Havlak.window.document.writeln(str);
   }
 }