| OLD | NEW |
| (Empty) |
| 1 // Copyright 2013 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 // Flags: --harmony-iteration --allow-natives-syntax | |
| 29 | |
| 30 | |
| 31 var NONE = 0; | |
| 32 var READ_ONLY = 1; | |
| 33 var DONT_ENUM = 2; | |
| 34 var DONT_DELETE = 4; | |
| 35 | |
| 36 | |
| 37 function assertHasOwnProperty(object, name, attrs) { | |
| 38 assertTrue(object.hasOwnProperty(name)); | |
| 39 var desc = Object.getOwnPropertyDescriptor(object, name); | |
| 40 assertEquals(desc.writable, !(attrs & READ_ONLY)); | |
| 41 assertEquals(desc.enumerable, !(attrs & DONT_ENUM)); | |
| 42 assertEquals(desc.configurable, !(attrs & DONT_DELETE)); | |
| 43 } | |
| 44 | |
| 45 | |
| 46 function TestArrayPrototype() { | |
| 47 assertHasOwnProperty(Array.prototype, 'entries', DONT_ENUM); | |
| 48 assertHasOwnProperty(Array.prototype, 'values', DONT_ENUM); | |
| 49 assertHasOwnProperty(Array.prototype, 'keys', DONT_ENUM); | |
| 50 assertHasOwnProperty(Array.prototype, Symbol.iterator, DONT_ENUM); | |
| 51 | |
| 52 assertEquals(Array.prototype.values, Array.prototype[Symbol.iterator]); | |
| 53 } | |
| 54 TestArrayPrototype(); | |
| 55 | |
| 56 | |
| 57 function assertIteratorResult(value, done, result) { | |
| 58 assertEquals({value: value, done: done}, result); | |
| 59 } | |
| 60 | |
| 61 | |
| 62 function TestValues() { | |
| 63 var array = ['a', 'b', 'c']; | |
| 64 var iterator = array.values(); | |
| 65 assertIteratorResult('a', false, iterator.next()); | |
| 66 assertIteratorResult('b', false, iterator.next()); | |
| 67 assertIteratorResult('c', false, iterator.next()); | |
| 68 assertIteratorResult(void 0, true, iterator.next()); | |
| 69 | |
| 70 array.push('d'); | |
| 71 assertIteratorResult(void 0, true, iterator.next()); | |
| 72 } | |
| 73 TestValues(); | |
| 74 | |
| 75 | |
| 76 function TestValuesMutate() { | |
| 77 var array = ['a', 'b', 'c']; | |
| 78 var iterator = array.values(); | |
| 79 assertIteratorResult('a', false, iterator.next()); | |
| 80 assertIteratorResult('b', false, iterator.next()); | |
| 81 assertIteratorResult('c', false, iterator.next()); | |
| 82 array.push('d'); | |
| 83 assertIteratorResult('d', false, iterator.next()); | |
| 84 assertIteratorResult(void 0, true, iterator.next()); | |
| 85 } | |
| 86 TestValuesMutate(); | |
| 87 | |
| 88 | |
| 89 function TestKeys() { | |
| 90 var array = ['a', 'b', 'c']; | |
| 91 var iterator = array.keys(); | |
| 92 assertIteratorResult(0, false, iterator.next()); | |
| 93 assertIteratorResult(1, false, iterator.next()); | |
| 94 assertIteratorResult(2, false, iterator.next()); | |
| 95 assertIteratorResult(void 0, true, iterator.next()); | |
| 96 | |
| 97 array.push('d'); | |
| 98 assertIteratorResult(void 0, true, iterator.next()); | |
| 99 } | |
| 100 TestKeys(); | |
| 101 | |
| 102 | |
| 103 function TestKeysMutate() { | |
| 104 var array = ['a', 'b', 'c']; | |
| 105 var iterator = array.keys(); | |
| 106 assertIteratorResult(0, false, iterator.next()); | |
| 107 assertIteratorResult(1, false, iterator.next()); | |
| 108 assertIteratorResult(2, false, iterator.next()); | |
| 109 array.push('d'); | |
| 110 assertIteratorResult(3, false, iterator.next()); | |
| 111 assertIteratorResult(void 0, true, iterator.next()); | |
| 112 } | |
| 113 TestKeysMutate(); | |
| 114 | |
| 115 | |
| 116 function TestEntries() { | |
| 117 var array = ['a', 'b', 'c']; | |
| 118 var iterator = array.entries(); | |
| 119 assertIteratorResult([0, 'a'], false, iterator.next()); | |
| 120 assertIteratorResult([1, 'b'], false, iterator.next()); | |
| 121 assertIteratorResult([2, 'c'], false, iterator.next()); | |
| 122 assertIteratorResult(void 0, true, iterator.next()); | |
| 123 | |
| 124 array.push('d'); | |
| 125 assertIteratorResult(void 0, true, iterator.next()); | |
| 126 } | |
| 127 TestEntries(); | |
| 128 | |
| 129 | |
| 130 function TestEntriesMutate() { | |
| 131 var array = ['a', 'b', 'c']; | |
| 132 var iterator = array.entries(); | |
| 133 assertIteratorResult([0, 'a'], false, iterator.next()); | |
| 134 assertIteratorResult([1, 'b'], false, iterator.next()); | |
| 135 assertIteratorResult([2, 'c'], false, iterator.next()); | |
| 136 array.push('d'); | |
| 137 assertIteratorResult([3, 'd'], false, iterator.next()); | |
| 138 assertIteratorResult(void 0, true, iterator.next()); | |
| 139 } | |
| 140 TestEntriesMutate(); | |
| 141 | |
| 142 | |
| 143 function TestArrayIteratorPrototype() { | |
| 144 var array = []; | |
| 145 var iterator = array.values(); | |
| 146 | |
| 147 var ArrayIteratorPrototype = iterator.__proto__; | |
| 148 | |
| 149 assertEquals(ArrayIteratorPrototype, array.values().__proto__); | |
| 150 assertEquals(ArrayIteratorPrototype, array.keys().__proto__); | |
| 151 assertEquals(ArrayIteratorPrototype, array.entries().__proto__); | |
| 152 | |
| 153 assertEquals(Object.prototype, ArrayIteratorPrototype.__proto__); | |
| 154 | |
| 155 assertEquals('Array Iterator', %_ClassOf(array.values())); | |
| 156 assertEquals('Array Iterator', %_ClassOf(array.keys())); | |
| 157 assertEquals('Array Iterator', %_ClassOf(array.entries())); | |
| 158 | |
| 159 assertFalse(ArrayIteratorPrototype.hasOwnProperty('constructor')); | |
| 160 assertArrayEquals(['next'], | |
| 161 Object.getOwnPropertyNames(ArrayIteratorPrototype)); | |
| 162 assertHasOwnProperty(ArrayIteratorPrototype, 'next', DONT_ENUM); | |
| 163 assertHasOwnProperty(ArrayIteratorPrototype, Symbol.iterator, DONT_ENUM); | |
| 164 } | |
| 165 TestArrayIteratorPrototype(); | |
| 166 | |
| 167 | |
| 168 function TestForArrayValues() { | |
| 169 var buffer = []; | |
| 170 var array = [0, 'a', true, false, null, /* hole */, undefined, NaN]; | |
| 171 var i = 0; | |
| 172 for (var value of array.values()) { | |
| 173 buffer[i++] = value; | |
| 174 } | |
| 175 | |
| 176 assertEquals(8, buffer.length); | |
| 177 | |
| 178 for (var i = 0; i < buffer.length - 1; i++) { | |
| 179 assertSame(array[i], buffer[i]); | |
| 180 } | |
| 181 assertTrue(isNaN(buffer[buffer.length - 1])); | |
| 182 } | |
| 183 TestForArrayValues(); | |
| 184 | |
| 185 | |
| 186 function TestForArrayKeys() { | |
| 187 var buffer = []; | |
| 188 var array = [0, 'a', true, false, null, /* hole */, undefined, NaN]; | |
| 189 var i = 0; | |
| 190 for (var key of array.keys()) { | |
| 191 buffer[i++] = key; | |
| 192 } | |
| 193 | |
| 194 assertEquals(8, buffer.length); | |
| 195 | |
| 196 for (var i = 0; i < buffer.length; i++) { | |
| 197 assertEquals(i, buffer[i]); | |
| 198 } | |
| 199 } | |
| 200 TestForArrayKeys(); | |
| 201 | |
| 202 | |
| 203 function TestForArrayEntries() { | |
| 204 var buffer = []; | |
| 205 var array = [0, 'a', true, false, null, /* hole */, undefined, NaN]; | |
| 206 var i = 0; | |
| 207 for (var entry of array.entries()) { | |
| 208 buffer[i++] = entry; | |
| 209 } | |
| 210 | |
| 211 assertEquals(8, buffer.length); | |
| 212 | |
| 213 for (var i = 0; i < buffer.length - 1; i++) { | |
| 214 assertSame(array[i], buffer[i][1]); | |
| 215 } | |
| 216 assertTrue(isNaN(buffer[buffer.length - 1][1])); | |
| 217 | |
| 218 for (var i = 0; i < buffer.length; i++) { | |
| 219 assertEquals(i, buffer[i][0]); | |
| 220 } | |
| 221 } | |
| 222 TestForArrayEntries(); | |
| 223 | |
| 224 | |
| 225 function TestForArray() { | |
| 226 var buffer = []; | |
| 227 var array = [0, 'a', true, false, null, /* hole */, undefined, NaN]; | |
| 228 var i = 0; | |
| 229 for (var value of array) { | |
| 230 buffer[i++] = value; | |
| 231 } | |
| 232 | |
| 233 assertEquals(8, buffer.length); | |
| 234 | |
| 235 for (var i = 0; i < buffer.length - 1; i++) { | |
| 236 assertSame(array[i], buffer[i]); | |
| 237 } | |
| 238 assertTrue(isNaN(buffer[buffer.length - 1])); | |
| 239 } | |
| 240 TestForArrayValues(); | |
| 241 | |
| 242 | |
| 243 function TestNonOwnSlots() { | |
| 244 var array = [0]; | |
| 245 var iterator = array.values(); | |
| 246 var object = {__proto__: iterator}; | |
| 247 | |
| 248 assertThrows(function() { | |
| 249 object.next(); | |
| 250 }, TypeError); | |
| 251 } | |
| 252 TestNonOwnSlots(); | |
| OLD | NEW |