Remove some uses of STL map.

runtime/vm/flow_graph_range_analysis.cc

 // 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.
 
 #include "vm/flow_graph_range_analysis.h"
 
 #include "vm/bit_vector.h"
 #include "vm/il_printer.h"
 
 namespace dart {
@@ skipping 892 matching lines @@
         }
         instruction->InputAt(i)->set_definition(scheduled);
       } else if (defn->IsConstraint()) {
         instruction->InputAt(i)->set_definition(UnwrapConstraint(defn));
       }
     }
 
     // Attempt to find equivalent instruction that was already scheduled.
     // If the instruction is still in the graph (it could have been
     // un-scheduled by a rollback action) and it dominates the sink - use it.
-    Instruction* emitted = map_.Lookup(instruction);
+    Instruction* emitted = map_.LookupValue(instruction);
     if (emitted != NULL &&
         !emitted->WasEliminated() &&
         sink->IsDominatedBy(emitted)) {
       return emitted;
     }
 
     // Attempt to find suitable pre-header. Iterate loop headers backwards to
     // attempt scheduling into the outermost loop first.
     for (intptr_t i = loop_headers_.length() - 1; i >= 0; i--) {
       BlockEntryInstr* header = loop_headers_[i];
@@ skipping 2235 matching lines @@
     }
   } while (CanonicalizeMaxBoundary(&max) ||
            CanonicalizeMinBoundary(&canonical_length));
 
   // Failed to prove that maximum is bounded with array length.
   return false;
 }
 
 
 }  // namespace dart