Work in progress: ES6 Maps and Sets with deterministic iteration support

src/factory.cc

 // Copyright 2013 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 20 matching lines @@
 #include "debug.h"
 #include "execution.h"
 #include "factory.h"
 #include "isolate-inl.h"
 #include "macro-assembler.h"
 #include "objects.h"
 #include "objects-visiting.h"
 #include "platform.h"
 #include "scopeinfo.h"
 
+#include "close-table.h"
+
 namespace v8 {
 namespace internal {
 
 
 Handle<Box> Factory::NewBox(Handle<Object> value, PretenureFlag pretenure) {
   CALL_HEAP_FUNCTION(
       isolate(),
       isolate()->heap()->AllocateBox(*value, pretenure),
       Box);
 }
@@ skipping 84 matching lines @@
 
 Handle<ObjectHashSet> Factory::NewObjectHashSet(int at_least_space_for) {
   ASSERT(0 <= at_least_space_for);
   CALL_HEAP_FUNCTION(isolate(),
                      ObjectHashSet::Allocate(isolate()->heap(),
                                              at_least_space_for),
                      ObjectHashSet);
 }
 
 
+Handle<CloseTableSet> Factory::NewCloseTableSet() {
+  CALL_HEAP_FUNCTION(isolate(),
+                     CloseTableSet::Allocate(isolate()->heap(), 4),
+                     CloseTableSet);
+}
+
+
 Handle<ObjectHashTable> Factory::NewObjectHashTable(
     int at_least_space_for,
     MinimumCapacity capacity_option) {
   ASSERT(0 <= at_least_space_for);
   CALL_HEAP_FUNCTION(isolate(),
                      ObjectHashTable::Allocate(isolate()->heap(),
                                                at_least_space_for,
                                                capacity_option),
                      ObjectHashTable);
 }
@@ skipping 1879 matching lines @@
   return Handle<Object>::null();
 }
 
 
 Handle<Object> Factory::ToBoolean(bool value) {
   return value ? true_value() : false_value();
 }
 
 
 } }  // namespace v8::internal