Remove insertRange.

sdk/lib/_internal/compiler/implementation/ssa/nodes.dart

 // Copyright (c) 2012, 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.
 
 part of ssa;
 
 abstract class HVisitor<R> {
   R visitAdd(HAdd node);
   R visitBailoutTarget(HBailoutTarget node);
   R visitBitAnd(HBitAnd node);
@@ skipping 641 matching lines @@
     // Keep the list of dominated blocks sorted such that if there are two
     // succeeding blocks in the list, the predecessor is before the successor.
     // Assume that we add the dominated blocks in the right order.
     int index = dominatedBlocks.length;
     while (index > 0 && dominatedBlocks[index - 1].id > block.id) {
       index--;
     }
     if (index == dominatedBlocks.length) {
       dominatedBlocks.add(block);
     } else {
-      dominatedBlocks.insertRange(index, 1, block);
+      dominatedBlocks.insert(index, block);
     }
     assert(block.dominator == null);
     block.dominator = this;
   }
 
   void removeDominatedBlock(HBasicBlock block) {
     assert(isClosed());
     assert(id != null && block.id != null);
     int index = dominatedBlocks.indexOf(block);
     assert(index >= 0);
@@ skipping 1974 matching lines @@
   HBasicBlock get start => expression.start;
   HBasicBlock get end {
     // We don't create a switch block if there are no cases.
     assert(!statements.isEmpty);
     return statements.last.end;
   }
 
   bool accept(HStatementInformationVisitor visitor) =>
       visitor.visitSwitchInfo(this);
 }