Add VM class for Map/LinkedHashMap.

runtime/vm/hash_table.h

 // 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.
 
 #ifndef VM_HASH_TABLE_H_
 #define VM_HASH_TABLE_H_
 
 // Temporarily used when sorting the indices in EnumIndexHashTable.
 // TODO(koda): Remove these dependencies before using in production.
 #include <map>
@@ skipping 365 matching lines @@
   }
 
   // No extra book-keeping needed for DeleteEntry.
 };
 
 
 class HashTables : public AllStatic {
  public:
   // Allocates and initializes a table.
   template<typename Table>
-  static RawArray* New(intptr_t initial_capacity) {
+  static RawArray* New(intptr_t initial_capacity,
+                       Heap::Space space = Heap::kNew) {
     Table table(Array::Handle(Array::New(
-        Table::ArrayLengthForNumOccupied(initial_capacity))));
+        Table::ArrayLengthForNumOccupied(initial_capacity), space)));
     table.Initialize();
     return table.Release();
   }
 
   // Clears 'to' and inserts all elements from 'from', in iteration order.
   // The tables must have the same user payload size.
   template<typename From, typename To>
   static void Copy(const From& from, const To& to) {
     COMPILE_ASSERT(From::kPayloadSize == To::kPayloadSize);
     to.Initialize();
@@ skipping 149 matching lines @@
 template<typename KeyTraits>
 class EnumIndexHashSet : public HashSet<EnumIndexHashTable<KeyTraits, 0> > {
  public:
   typedef HashSet<EnumIndexHashTable<KeyTraits, 0> > BaseSet;
   explicit EnumIndexHashSet(Array& data) : BaseSet(data) {}
 };
 
 }  // namespace dart
 
 #endif  // VM_HASH_TABLE_H_