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

test/cctest/test-closemap.cc

+// Copyright 2014 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
+//       with the distribution.
+//     * Neither the name of Google Inc. nor the names of its
+//       contributors may be used to endorse or promote products derived
+//       from this software without specific prior written permission.
+//
+// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+#include <stdlib.h>
+
+#include "v8.h"
+
+#include "cctest.h"
+#include "factory.h"
+
+#include "close-table.h"
+
+using namespace v8::internal;
+
+TEST(CloseMap) {
+  LocalContext context;
+  Isolate* isolate = CcTest::i_isolate();
+  Factory* factory = isolate->factory();
+  HandleScope scope(isolate);
+  Handle<CloseTableSet> close_set = factory->NewCloseTableSet();
+  CHECK_EQ(2, close_set->NumberOfBuckets());
+  CHECK_EQ(0, close_set->NumberOfElements());
+  CHECK_EQ(0, close_set->NumberOfDeletedElements());
+
+  Handle<Map> map = factory->NewMap(JS_OBJECT_TYPE, JSObject::kHeaderSize);
+  Handle<JSObject> obj = factory->NewJSObjectFromMap(map);
+  CHECK(!close_set->Contains(*obj));
+  close_set = CloseTableSet::Add(close_set, obj);
+  CHECK_EQ(1, close_set->NumberOfElements());
+  CHECK(close_set->Contains(*obj));
+  close_set = CloseTableSet::Remove(close_set, obj);
+  CHECK_EQ(0, close_set->NumberOfElements());
+  CHECK_EQ(1, close_set->NumberOfDeletedElements());
+  CHECK(!close_set->Contains(*obj));
+
+  // Test for collisions/chaining
+  Handle<JSObject> obj1 = factory->NewJSObjectFromMap(map);
+  close_set = CloseTableSet::Add(close_set, obj1);
+  Handle<JSObject> obj2 = factory->NewJSObjectFromMap(map);
+  close_set = CloseTableSet::Add(close_set, obj2);
+  Handle<JSObject> obj3 = factory->NewJSObjectFromMap(map);
+  close_set = CloseTableSet::Add(close_set, obj3);
+  CHECK_EQ(3, close_set->NumberOfElements());
+  CHECK_EQ(1, close_set->NumberOfDeletedElements());
+  CHECK(close_set->Contains(*obj1));
+  CHECK(close_set->Contains(*obj2));
+  CHECK(close_set->Contains(*obj3));
+
+  close_set = CloseTableSet::Add(close_set, obj);
+  CHECK(close_set->Contains(*obj));
+  CHECK_EQ(4, close_set->NumberOfElements());
+  CHECK_EQ(0, close_set->NumberOfDeletedElements());
+}