| 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-symbols --harmony-collections | |
| 29 // Flags: --expose-gc --allow-natives-syntax | |
| 30 | |
| 31 var symbols = [] | |
| 32 | |
| 33 | |
| 34 // Returns true if the string is a valid | |
| 35 // serialization of Symbols added to the 'symbols' | |
| 36 // array. Adjust if you extend 'symbols' with other | |
| 37 // values. | |
| 38 function isValidSymbolString(s) { | |
| 39 return ["Symbol(66)", "Symbol()"].indexOf(s) >= 0; | |
| 40 } | |
| 41 | |
| 42 | |
| 43 // Test different forms of constructor calls. | |
| 44 function TestNew() { | |
| 45 function indirectSymbol() { return Symbol() } | |
| 46 function indirect() { return indirectSymbol() } | |
| 47 for (var i = 0; i < 2; ++i) { | |
| 48 for (var j = 0; j < 5; ++j) { | |
| 49 symbols.push(Symbol()) | |
| 50 symbols.push(Symbol(undefined)) | |
| 51 symbols.push(Symbol("66")) | |
| 52 symbols.push(Symbol(66)) | |
| 53 symbols.push(Symbol().valueOf()) | |
| 54 symbols.push(indirect()) | |
| 55 } | |
| 56 %OptimizeFunctionOnNextCall(indirect) | |
| 57 indirect() // Call once before GC throws away type feedback. | |
| 58 gc() // Promote existing symbols and then allocate some more. | |
| 59 } | |
| 60 assertThrows(function () { Symbol(Symbol()) }, TypeError) | |
| 61 assertThrows(function () { new Symbol(66) }, TypeError) | |
| 62 } | |
| 63 TestNew() | |
| 64 | |
| 65 | |
| 66 function TestType() { | |
| 67 for (var i in symbols) { | |
| 68 assertEquals("symbol", typeof symbols[i]) | |
| 69 assertTrue(typeof symbols[i] === "symbol") | |
| 70 assertFalse(%SymbolIsPrivate(symbols[i])) | |
| 71 assertEquals(null, %_ClassOf(symbols[i])) | |
| 72 assertEquals("Symbol", %_ClassOf(Object(symbols[i]))) | |
| 73 } | |
| 74 } | |
| 75 TestType() | |
| 76 | |
| 77 | |
| 78 function TestPrototype() { | |
| 79 assertSame(Object.prototype, Symbol.prototype.__proto__) | |
| 80 assertSame(Symbol.prototype, Symbol().__proto__) | |
| 81 assertSame(Symbol.prototype, Object(Symbol()).__proto__) | |
| 82 for (var i in symbols) { | |
| 83 assertSame(Symbol.prototype, symbols[i].__proto__) | |
| 84 } | |
| 85 } | |
| 86 TestPrototype() | |
| 87 | |
| 88 | |
| 89 function TestConstructor() { | |
| 90 assertSame(Function.prototype, Symbol.__proto__) | |
| 91 assertFalse(Object === Symbol.prototype.constructor) | |
| 92 assertFalse(Symbol === Object.prototype.constructor) | |
| 93 assertSame(Symbol, Symbol.prototype.constructor) | |
| 94 assertSame(Symbol, Symbol().__proto__.constructor) | |
| 95 assertSame(Symbol, Object(Symbol()).__proto__.constructor) | |
| 96 for (var i in symbols) { | |
| 97 assertSame(Symbol, symbols[i].__proto__.constructor) | |
| 98 } | |
| 99 } | |
| 100 TestConstructor() | |
| 101 | |
| 102 | |
| 103 function TestValueOf() { | |
| 104 for (var i in symbols) { | |
| 105 assertTrue(symbols[i] === symbols[i].valueOf()) | |
| 106 assertTrue(Symbol.prototype.valueOf.call(symbols[i]) === symbols[i]) | |
| 107 } | |
| 108 } | |
| 109 TestValueOf() | |
| 110 | |
| 111 | |
| 112 function TestToString() { | |
| 113 for (var i in symbols) { | |
| 114 assertThrows(function() { String(symbols[i]) }, TypeError) | |
| 115 assertThrows(function() { symbols[i] + "" }, TypeError) | |
| 116 assertTrue(isValidSymbolString(String(Object(symbols[i])))) | |
| 117 assertTrue(isValidSymbolString(symbols[i].toString())) | |
| 118 assertTrue(isValidSymbolString(Object(symbols[i]).toString())) | |
| 119 assertTrue( | |
| 120 isValidSymbolString(Symbol.prototype.toString.call(symbols[i]))) | |
| 121 assertEquals( | |
| 122 "[object Symbol]", Object.prototype.toString.call(symbols[i])) | |
| 123 } | |
| 124 } | |
| 125 TestToString() | |
| 126 | |
| 127 | |
| 128 function TestToBoolean() { | |
| 129 for (var i in symbols) { | |
| 130 assertTrue(Boolean(symbols[i]).valueOf()) | |
| 131 assertFalse(!symbols[i]) | |
| 132 assertTrue(!!symbols[i]) | |
| 133 assertTrue(symbols[i] && true) | |
| 134 assertFalse(!symbols[i] && false) | |
| 135 assertTrue(!symbols[i] || true) | |
| 136 assertEquals(1, symbols[i] ? 1 : 2) | |
| 137 assertEquals(2, !symbols[i] ? 1 : 2) | |
| 138 if (!symbols[i]) assertUnreachable(); | |
| 139 if (symbols[i]) {} else assertUnreachable(); | |
| 140 } | |
| 141 } | |
| 142 TestToBoolean() | |
| 143 | |
| 144 | |
| 145 function TestToNumber() { | |
| 146 for (var i in symbols) { | |
| 147 assertSame(NaN, Number(symbols[i]).valueOf()) | |
| 148 assertSame(NaN, symbols[i] + 0) | |
| 149 } | |
| 150 } | |
| 151 TestToNumber() | |
| 152 | |
| 153 | |
| 154 function TestEquality() { | |
| 155 // Every symbol should equal itself, and non-strictly equal its wrapper. | |
| 156 for (var i in symbols) { | |
| 157 assertSame(symbols[i], symbols[i]) | |
| 158 assertEquals(symbols[i], symbols[i]) | |
| 159 assertTrue(Object.is(symbols[i], symbols[i])) | |
| 160 assertTrue(symbols[i] === symbols[i]) | |
| 161 assertTrue(symbols[i] == symbols[i]) | |
| 162 assertFalse(symbols[i] === Object(symbols[i])) | |
| 163 assertFalse(Object(symbols[i]) === symbols[i]) | |
| 164 assertFalse(symbols[i] == Object(symbols[i])) | |
| 165 assertFalse(Object(symbols[i]) == symbols[i]) | |
| 166 assertTrue(symbols[i] === symbols[i].valueOf()) | |
| 167 assertTrue(symbols[i].valueOf() === symbols[i]) | |
| 168 assertTrue(symbols[i] == symbols[i].valueOf()) | |
| 169 assertTrue(symbols[i].valueOf() == symbols[i]) | |
| 170 assertFalse(Object(symbols[i]) === Object(symbols[i])) | |
| 171 assertEquals(Object(symbols[i]).valueOf(), Object(symbols[i]).valueOf()) | |
| 172 } | |
| 173 | |
| 174 // All symbols should be distinct. | |
| 175 for (var i = 0; i < symbols.length; ++i) { | |
| 176 for (var j = i + 1; j < symbols.length; ++j) { | |
| 177 assertFalse(Object.is(symbols[i], symbols[j])) | |
| 178 assertFalse(symbols[i] === symbols[j]) | |
| 179 assertFalse(symbols[i] == symbols[j]) | |
| 180 } | |
| 181 } | |
| 182 | |
| 183 // Symbols should not be equal to any other value (and the test terminates). | |
| 184 var values = [347, 1.275, NaN, "string", null, undefined, {}, function() {}] | |
| 185 for (var i in symbols) { | |
| 186 for (var j in values) { | |
| 187 assertFalse(symbols[i] === values[j]) | |
| 188 assertFalse(values[j] === symbols[i]) | |
| 189 assertFalse(symbols[i] == values[j]) | |
| 190 assertFalse(values[j] == symbols[i]) | |
| 191 } | |
| 192 } | |
| 193 } | |
| 194 TestEquality() | |
| 195 | |
| 196 | |
| 197 function TestGet() { | |
| 198 for (var i in symbols) { | |
| 199 assertTrue(isValidSymbolString(symbols[i].toString())) | |
| 200 assertEquals(symbols[i], symbols[i].valueOf()) | |
| 201 assertEquals(undefined, symbols[i].a) | |
| 202 assertEquals(undefined, symbols[i]["a" + "b"]) | |
| 203 assertEquals(undefined, symbols[i]["" + "1"]) | |
| 204 assertEquals(undefined, symbols[i][62]) | |
| 205 } | |
| 206 } | |
| 207 TestGet() | |
| 208 | |
| 209 | |
| 210 function TestSet() { | |
| 211 for (var i in symbols) { | |
| 212 symbols[i].toString = 0 | |
| 213 assertTrue(isValidSymbolString(symbols[i].toString())) | |
| 214 symbols[i].valueOf = 0 | |
| 215 assertEquals(symbols[i], symbols[i].valueOf()) | |
| 216 symbols[i].a = 0 | |
| 217 assertEquals(undefined, symbols[i].a) | |
| 218 symbols[i]["a" + "b"] = 0 | |
| 219 assertEquals(undefined, symbols[i]["a" + "b"]) | |
| 220 symbols[i][62] = 0 | |
| 221 assertEquals(undefined, symbols[i][62]) | |
| 222 } | |
| 223 } | |
| 224 TestSet() | |
| 225 | |
| 226 | |
| 227 // Test Symbol wrapping/boxing over non-builtins. | |
| 228 Symbol.prototype.getThisProto = function () { | |
| 229 return Object.getPrototypeOf(this); | |
| 230 } | |
| 231 function TestCall() { | |
| 232 for (var i in symbols) { | |
| 233 assertTrue(symbols[i].getThisProto() === Symbol.prototype) | |
| 234 } | |
| 235 } | |
| 236 TestCall() | |
| 237 | |
| 238 | |
| 239 function TestCollections() { | |
| 240 var set = new Set | |
| 241 var map = new Map | |
| 242 var weakmap = new WeakMap | |
| 243 for (var i in symbols) { | |
| 244 set.add(symbols[i]) | |
| 245 map.set(symbols[i], i) | |
| 246 weakmap.set(symbols[i], i) | |
| 247 } | |
| 248 assertEquals(symbols.length, set.size) | |
| 249 assertEquals(symbols.length, map.size) | |
| 250 for (var i in symbols) { | |
| 251 assertTrue(set.has(symbols[i])) | |
| 252 assertTrue(map.has(symbols[i])) | |
| 253 assertTrue(weakmap.has(symbols[i])) | |
| 254 assertEquals(i, map.get(symbols[i])) | |
| 255 assertEquals(i, weakmap.get(symbols[i])) | |
| 256 } | |
| 257 for (var i in symbols) { | |
| 258 assertTrue(set.delete(symbols[i])) | |
| 259 assertTrue(map.delete(symbols[i])) | |
| 260 assertTrue(weakmap.delete(symbols[i])) | |
| 261 } | |
| 262 assertEquals(0, set.size) | |
| 263 assertEquals(0, map.size) | |
| 264 } | |
| 265 TestCollections() | |
| 266 | |
| 267 | |
| 268 | |
| 269 function TestKeySet(obj) { | |
| 270 assertTrue(%HasFastProperties(obj)) | |
| 271 // Set the even symbols via assignment. | |
| 272 for (var i = 0; i < symbols.length; i += 2) { | |
| 273 obj[symbols[i]] = i | |
| 274 // Object should remain in fast mode until too many properties were added. | |
| 275 assertTrue(%HasFastProperties(obj) || i >= 30) | |
| 276 } | |
| 277 } | |
| 278 | |
| 279 | |
| 280 function TestKeyDefine(obj) { | |
| 281 // Set the odd symbols via defineProperty (as non-enumerable). | |
| 282 for (var i = 1; i < symbols.length; i += 2) { | |
| 283 Object.defineProperty(obj, symbols[i], {value: i, configurable: true}) | |
| 284 } | |
| 285 } | |
| 286 | |
| 287 | |
| 288 function TestKeyGet(obj) { | |
| 289 var obj2 = Object.create(obj) | |
| 290 for (var i in symbols) { | |
| 291 assertEquals(i|0, obj[symbols[i]]) | |
| 292 assertEquals(i|0, obj2[symbols[i]]) | |
| 293 } | |
| 294 } | |
| 295 | |
| 296 | |
| 297 function TestKeyHas(obj) { | |
| 298 for (var i in symbols) { | |
| 299 assertTrue(symbols[i] in obj) | |
| 300 assertTrue(Object.hasOwnProperty.call(obj, symbols[i])) | |
| 301 } | |
| 302 } | |
| 303 | |
| 304 | |
| 305 function TestKeyEnum(obj) { | |
| 306 for (var name in obj) { | |
| 307 assertEquals("string", typeof name) | |
| 308 } | |
| 309 } | |
| 310 | |
| 311 | |
| 312 function TestKeyNames(obj) { | |
| 313 assertEquals(0, Object.keys(obj).length) | |
| 314 | |
| 315 var names = Object.getOwnPropertyNames(obj) | |
| 316 for (var i in names) { | |
| 317 assertEquals("string", typeof names[i]) | |
| 318 } | |
| 319 } | |
| 320 | |
| 321 | |
| 322 function TestGetOwnPropertySymbols(obj) { | |
| 323 var syms = Object.getOwnPropertySymbols(obj) | |
| 324 assertEquals(syms.length, symbols.length) | |
| 325 for (var i in syms) { | |
| 326 assertEquals("symbol", typeof syms[i]) | |
| 327 } | |
| 328 } | |
| 329 | |
| 330 | |
| 331 function TestKeyDescriptor(obj) { | |
| 332 for (var i in symbols) { | |
| 333 var desc = Object.getOwnPropertyDescriptor(obj, symbols[i]) | |
| 334 assertEquals(i|0, desc.value) | |
| 335 assertTrue(desc.configurable) | |
| 336 assertEquals(i % 2 == 0, desc.writable) | |
| 337 assertEquals(i % 2 == 0, desc.enumerable) | |
| 338 assertEquals(i % 2 == 0, | |
| 339 Object.prototype.propertyIsEnumerable.call(obj, symbols[i])) | |
| 340 } | |
| 341 } | |
| 342 | |
| 343 | |
| 344 function TestKeyDelete(obj) { | |
| 345 for (var i in symbols) { | |
| 346 delete obj[symbols[i]] | |
| 347 } | |
| 348 for (var i in symbols) { | |
| 349 assertEquals(undefined, Object.getOwnPropertyDescriptor(obj, symbols[i])) | |
| 350 } | |
| 351 } | |
| 352 | |
| 353 | |
| 354 var objs = [{}, [], Object.create(null), Object(1), new Map, function(){}] | |
| 355 | |
| 356 for (var i in objs) { | |
| 357 var obj = objs[i] | |
| 358 TestKeySet(obj) | |
| 359 TestKeyDefine(obj) | |
| 360 TestKeyGet(obj) | |
| 361 TestKeyHas(obj) | |
| 362 TestKeyEnum(obj) | |
| 363 TestKeyNames(obj) | |
| 364 TestGetOwnPropertySymbols(obj) | |
| 365 TestKeyDescriptor(obj) | |
| 366 TestKeyDelete(obj) | |
| 367 } | |
| 368 | |
| 369 | |
| 370 function TestCachedKeyAfterScavenge() { | |
| 371 gc(); | |
| 372 // Keyed property lookup are cached. Hereby we assume that the keys are | |
| 373 // tenured, so that we only have to clear the cache between mark compacts, | |
| 374 // but not between scavenges. This must also apply for symbol keys. | |
| 375 var key = Symbol("key"); | |
| 376 var a = {}; | |
| 377 a[key] = "abc"; | |
| 378 | |
| 379 for (var i = 0; i < 100000; i++) { | |
| 380 a[key] += "a"; // Allocations cause a scavenge. | |
| 381 } | |
| 382 } | |
| 383 TestCachedKeyAfterScavenge(); | |
| 384 | |
| 385 | |
| 386 function TestGetOwnPropertySymbolsWithProto() { | |
| 387 // We need to be have fast properties to have insertion order for property | |
| 388 // keys. The current limit is currently 30 properties. | |
| 389 var syms = symbols.slice(0, 30); | |
| 390 var proto = {} | |
| 391 var object = Object.create(proto) | |
| 392 for (var i = 0; i < syms.length; i++) { | |
| 393 // Even on object, odd on proto. | |
| 394 if (i % 2) { | |
| 395 proto[syms[i]] = i | |
| 396 } else { | |
| 397 object[syms[i]] = i | |
| 398 } | |
| 399 } | |
| 400 | |
| 401 assertTrue(%HasFastProperties(object)); | |
| 402 | |
| 403 var objectOwnSymbols = Object.getOwnPropertySymbols(object) | |
| 404 assertEquals(objectOwnSymbols.length, syms.length / 2) | |
| 405 | |
| 406 for (var i = 0; i < objectOwnSymbols.length; i++) { | |
| 407 assertEquals(objectOwnSymbols[i], syms[i * 2]) | |
| 408 } | |
| 409 } | |
| 410 TestGetOwnPropertySymbolsWithProto() | |
| 411 | |
| 412 | |
| 413 function TestWellKnown() { | |
| 414 var symbols = [ | |
| 415 "create", "hasInstance", "isConcatSpreadable", "isRegExp", | |
| 416 "iterator", "toStringTag", "unscopables" | |
| 417 ] | |
| 418 | |
| 419 for (var i in symbols) { | |
| 420 var name = symbols[i] | |
| 421 var desc = Object.getOwnPropertyDescriptor(Symbol, name) | |
| 422 assertSame("symbol", typeof desc.value) | |
| 423 assertSame("Symbol(Symbol." + name + ")", desc.value.toString()) | |
| 424 assertFalse(desc.writable) | |
| 425 assertFalse(desc.configurable) | |
| 426 assertFalse(desc.enumerable) | |
| 427 | |
| 428 assertFalse(Symbol.for("Symbol." + name) === desc.value) | |
| 429 assertTrue(Symbol.keyFor(desc.value) === undefined) | |
| 430 } | |
| 431 } | |
| 432 TestWellKnown() | |
| 433 | |
| 434 | |
| 435 function TestRegistry() { | |
| 436 var symbol1 = Symbol.for("x1") | |
| 437 var symbol2 = Symbol.for("x2") | |
| 438 assertFalse(symbol1 === symbol2) | |
| 439 | |
| 440 assertSame(symbol1, Symbol.for("x1")) | |
| 441 assertSame(symbol2, Symbol.for("x2")) | |
| 442 assertSame("x1", Symbol.keyFor(symbol1)) | |
| 443 assertSame("x2", Symbol.keyFor(symbol2)) | |
| 444 | |
| 445 assertSame(Symbol.for("1"), Symbol.for(1)) | |
| 446 assertThrows(function() { Symbol.keyFor("bla") }, TypeError) | |
| 447 assertThrows(function() { Symbol.keyFor({}) }, TypeError) | |
| 448 | |
| 449 var realm = Realm.create() | |
| 450 assertFalse(Symbol === Realm.eval(realm, "Symbol")) | |
| 451 assertFalse(Symbol.for === Realm.eval(realm, "Symbol.for")) | |
| 452 assertFalse(Symbol.keyFor === Realm.eval(realm, "Symbol.keyFor")) | |
| 453 assertSame(Symbol.create, Realm.eval(realm, "Symbol.create")) | |
| 454 assertSame(Symbol.iterator, Realm.eval(realm, "Symbol.iterator")) | |
| 455 | |
| 456 assertSame(symbol1, Realm.eval(realm, "Symbol.for")("x1")) | |
| 457 assertSame(symbol1, Realm.eval(realm, "Symbol.for('x1')")) | |
| 458 assertSame("x1", Realm.eval(realm, "Symbol.keyFor")(symbol1)) | |
| 459 Realm.shared = symbol1 | |
| 460 assertSame("x1", Realm.eval(realm, "Symbol.keyFor(Realm.shared)")) | |
| 461 | |
| 462 var symbol3 = Realm.eval(realm, "Symbol.for('x3')") | |
| 463 assertFalse(symbol1 === symbol3) | |
| 464 assertFalse(symbol2 === symbol3) | |
| 465 assertSame(symbol3, Symbol.for("x3")) | |
| 466 assertSame("x3", Symbol.keyFor(symbol3)) | |
| 467 } | |
| 468 TestRegistry() | |
| OLD | NEW |