OLD | NEW |
(Empty) | |
| 1 // Copyright 2014 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are |
| 4 // met: |
| 5 // |
| 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided |
| 11 // with the distribution. |
| 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. |
| 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 |
| 28 #include <stdlib.h> |
| 29 |
| 30 #include "v8.h" |
| 31 |
| 32 #include "cctest.h" |
| 33 #include "factory.h" |
| 34 |
| 35 namespace { |
| 36 |
| 37 using namespace v8::internal; |
| 38 |
| 39 TEST(Set) { |
| 40 LocalContext context; |
| 41 Isolate* isolate = CcTest::i_isolate(); |
| 42 Factory* factory = isolate->factory(); |
| 43 HandleScope scope(isolate); |
| 44 Handle<OrderedHashSet> ordered_set = factory->NewOrderedHashSet(); |
| 45 CHECK_EQ(2, ordered_set->NumberOfBuckets()); |
| 46 CHECK_EQ(0, ordered_set->NumberOfElements()); |
| 47 CHECK_EQ(0, ordered_set->NumberOfDeletedElements()); |
| 48 |
| 49 Handle<Map> map = factory->NewMap(JS_OBJECT_TYPE, JSObject::kHeaderSize); |
| 50 Handle<JSObject> obj = factory->NewJSObjectFromMap(map); |
| 51 CHECK(!ordered_set->Contains(*obj)); |
| 52 ordered_set = OrderedHashSet::Add(ordered_set, obj); |
| 53 CHECK_EQ(1, ordered_set->NumberOfElements()); |
| 54 CHECK(ordered_set->Contains(*obj)); |
| 55 ordered_set = OrderedHashSet::Remove(ordered_set, obj); |
| 56 CHECK_EQ(0, ordered_set->NumberOfElements()); |
| 57 CHECK(!ordered_set->Contains(*obj)); |
| 58 |
| 59 // Test for collisions/chaining |
| 60 Handle<JSObject> obj1 = factory->NewJSObjectFromMap(map); |
| 61 ordered_set = OrderedHashSet::Add(ordered_set, obj1); |
| 62 Handle<JSObject> obj2 = factory->NewJSObjectFromMap(map); |
| 63 ordered_set = OrderedHashSet::Add(ordered_set, obj2); |
| 64 Handle<JSObject> obj3 = factory->NewJSObjectFromMap(map); |
| 65 ordered_set = OrderedHashSet::Add(ordered_set, obj3); |
| 66 CHECK_EQ(3, ordered_set->NumberOfElements()); |
| 67 CHECK(ordered_set->Contains(*obj1)); |
| 68 CHECK(ordered_set->Contains(*obj2)); |
| 69 CHECK(ordered_set->Contains(*obj3)); |
| 70 |
| 71 // Test growth |
| 72 ordered_set = OrderedHashSet::Add(ordered_set, obj); |
| 73 Handle<JSObject> obj4 = factory->NewJSObjectFromMap(map); |
| 74 ordered_set = OrderedHashSet::Add(ordered_set, obj4); |
| 75 CHECK(ordered_set->Contains(*obj)); |
| 76 CHECK(ordered_set->Contains(*obj1)); |
| 77 CHECK(ordered_set->Contains(*obj2)); |
| 78 CHECK(ordered_set->Contains(*obj3)); |
| 79 CHECK(ordered_set->Contains(*obj4)); |
| 80 CHECK_EQ(5, ordered_set->NumberOfElements()); |
| 81 CHECK_EQ(0, ordered_set->NumberOfDeletedElements()); |
| 82 CHECK_EQ(4, ordered_set->NumberOfBuckets()); |
| 83 |
| 84 // Test shrinking |
| 85 ordered_set = OrderedHashSet::Remove(ordered_set, obj); |
| 86 ordered_set = OrderedHashSet::Remove(ordered_set, obj1); |
| 87 ordered_set = OrderedHashSet::Remove(ordered_set, obj2); |
| 88 ordered_set = OrderedHashSet::Remove(ordered_set, obj3); |
| 89 CHECK_EQ(1, ordered_set->NumberOfElements()); |
| 90 CHECK_EQ(2, ordered_set->NumberOfBuckets()); |
| 91 } |
| 92 |
| 93 |
| 94 TEST(Map) { |
| 95 LocalContext context; |
| 96 Isolate* isolate = CcTest::i_isolate(); |
| 97 Factory* factory = isolate->factory(); |
| 98 HandleScope scope(isolate); |
| 99 Handle<OrderedHashMap> ordered_map = factory->NewOrderedHashMap(); |
| 100 CHECK_EQ(2, ordered_map->NumberOfBuckets()); |
| 101 CHECK_EQ(0, ordered_map->NumberOfElements()); |
| 102 CHECK_EQ(0, ordered_map->NumberOfDeletedElements()); |
| 103 |
| 104 Handle<Map> map = factory->NewMap(JS_OBJECT_TYPE, JSObject::kHeaderSize); |
| 105 Handle<JSObject> obj = factory->NewJSObjectFromMap(map); |
| 106 Handle<JSObject> val = factory->NewJSObjectFromMap(map); |
| 107 CHECK(ordered_map->Lookup(*obj)->IsTheHole()); |
| 108 ordered_map = OrderedHashMap::Put(ordered_map, obj, val); |
| 109 CHECK_EQ(1, ordered_map->NumberOfElements()); |
| 110 CHECK(ordered_map->Lookup(*obj)->SameValue(*val)); |
| 111 ordered_map = OrderedHashMap::Put( |
| 112 ordered_map, obj, factory->the_hole_value()); |
| 113 CHECK_EQ(0, ordered_map->NumberOfElements()); |
| 114 CHECK(ordered_map->Lookup(*obj)->IsTheHole()); |
| 115 |
| 116 // Test for collisions/chaining |
| 117 Handle<JSObject> obj1 = factory->NewJSObjectFromMap(map); |
| 118 Handle<JSObject> obj2 = factory->NewJSObjectFromMap(map); |
| 119 Handle<JSObject> obj3 = factory->NewJSObjectFromMap(map); |
| 120 Handle<JSObject> val1 = factory->NewJSObjectFromMap(map); |
| 121 Handle<JSObject> val2 = factory->NewJSObjectFromMap(map); |
| 122 Handle<JSObject> val3 = factory->NewJSObjectFromMap(map); |
| 123 ordered_map = OrderedHashMap::Put(ordered_map, obj1, val1); |
| 124 ordered_map = OrderedHashMap::Put(ordered_map, obj2, val2); |
| 125 ordered_map = OrderedHashMap::Put(ordered_map, obj3, val3); |
| 126 CHECK_EQ(3, ordered_map->NumberOfElements()); |
| 127 CHECK(ordered_map->Lookup(*obj1)->SameValue(*val1)); |
| 128 CHECK(ordered_map->Lookup(*obj2)->SameValue(*val2)); |
| 129 CHECK(ordered_map->Lookup(*obj3)->SameValue(*val3)); |
| 130 |
| 131 // Test growth |
| 132 ordered_map = OrderedHashMap::Put(ordered_map, obj, val); |
| 133 Handle<JSObject> obj4 = factory->NewJSObjectFromMap(map); |
| 134 Handle<JSObject> val4 = factory->NewJSObjectFromMap(map); |
| 135 ordered_map = OrderedHashMap::Put(ordered_map, obj4, val4); |
| 136 CHECK(ordered_map->Lookup(*obj)->SameValue(*val)); |
| 137 CHECK(ordered_map->Lookup(*obj1)->SameValue(*val1)); |
| 138 CHECK(ordered_map->Lookup(*obj2)->SameValue(*val2)); |
| 139 CHECK(ordered_map->Lookup(*obj3)->SameValue(*val3)); |
| 140 CHECK(ordered_map->Lookup(*obj4)->SameValue(*val4)); |
| 141 CHECK_EQ(5, ordered_map->NumberOfElements()); |
| 142 CHECK_EQ(4, ordered_map->NumberOfBuckets()); |
| 143 |
| 144 // Test shrinking |
| 145 ordered_map = OrderedHashMap::Put( |
| 146 ordered_map, obj, factory->the_hole_value()); |
| 147 ordered_map = OrderedHashMap::Put( |
| 148 ordered_map, obj1, factory->the_hole_value()); |
| 149 ordered_map = OrderedHashMap::Put( |
| 150 ordered_map, obj2, factory->the_hole_value()); |
| 151 ordered_map = OrderedHashMap::Put( |
| 152 ordered_map, obj3, factory->the_hole_value()); |
| 153 CHECK_EQ(1, ordered_map->NumberOfElements()); |
| 154 CHECK_EQ(2, ordered_map->NumberOfBuckets()); |
| 155 } |
| 156 |
| 157 |
| 158 } |
OLD | NEW |