- Add a new constructor to the hash table classes that allow handles to be passed in instead of cre…

runtime/vm/hash_table_test.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 <algorithm>
 #include <cstring>
 #include <map>
 #include <set>
 #include <string>
 #include <utility>
@@ skipping 45 matching lines @@
     num_deleted -= table.IsDeleted(i);
   }
   EXPECT_EQ(0, num_unused);
   EXPECT_EQ(0, num_occupied);
   EXPECT_EQ(0, num_deleted);
 }
 
 
 TEST_CASE(HashTable) {
   typedef HashTable<TestTraits, 2, 1> Table;
-  Table table(HashTables::New<Table>(5));
+  Table table(Thread::Current()->zone(), HashTables::New<Table>(5));
   // Ensure that we did get at least 5 entries.
   EXPECT_LE(5, table.NumEntries());
   EXPECT_EQ(0, table.NumOccupied());
   Validate(table);
   EXPECT_EQ(-1, table.FindKey("a"));
 
   // Insertion and lookup.
   intptr_t a_entry = -1;
   EXPECT(!table.FindKeyOrDeletedOrUnused("a", &a_entry));
   EXPECT_NE(-1, a_entry);
@@ skipping 221 matching lines @@
 TEST_CASE(Maps) {
   for (intptr_t initial_capacity = 0;
        initial_capacity < 32;
        ++initial_capacity) {
     TestMap<UnorderedHashMap<TestTraits> >(initial_capacity, false);
     TestMap<EnumIndexHashMap<TestTraits> >(initial_capacity, true);
   }
 }
 
 }  // namespace dart