| OLD | NEW |
| 1 // Copyright 2008 the V8 project authors. All rights reserved. | 1 // Copyright 2008-2015 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| 11 // with the distribution. | 11 // with the distribution. |
| 12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
| 15 // | 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 // Flags: --expose-gc | 28 // This is adapted from mjsunit/for-in-special-cases.js. |
| 29 | 29 |
| 30 function for_in_null() { | 30 // Flags: --harmony-reflect |
| 31 try { | |
| 32 for (var x in null) { | |
| 33 return false; | |
| 34 } | |
| 35 } catch(e) { | |
| 36 return false; | |
| 37 } | |
| 38 return true; | |
| 39 } | |
| 40 | |
| 41 function for_in_undefined() { | |
| 42 try { | |
| 43 for (var x in undefined) { | |
| 44 return false; | |
| 45 } | |
| 46 } catch(e) { | |
| 47 return false; | |
| 48 } | |
| 49 return true; | |
| 50 } | |
| 51 | |
| 52 for (var i = 0; i < 10; ++i) { | |
| 53 assertTrue(for_in_null()); | |
| 54 gc(); | |
| 55 } | |
| 56 | |
| 57 for (var j = 0; j < 10; ++j) { | |
| 58 assertTrue(for_in_undefined()); | |
| 59 gc(); | |
| 60 } | |
| 61 | |
| 62 assertEquals(10, i); | |
| 63 assertEquals(10, j); | |
| 64 | 31 |
| 65 | 32 |
| 66 function Accumulate(x) { | 33 function Accumulate(x) { |
| 67 var accumulator = ""; | 34 var accumulator = ""; |
| 68 for (var i in x) { | 35 for (var i of Reflect.enumerate(Object(x))) { |
| 69 accumulator += i; | 36 accumulator += i; |
| 70 } | 37 } |
| 71 return accumulator; | 38 return accumulator; |
| 72 } | 39 } |
| 73 | 40 |
| 74 for (var i = 0; i < 3; ++i) { | 41 for (var i = 0; i < 3; ++i) { |
| 75 var elements = Accumulate("abcd"); | 42 var elements = Accumulate("abcd"); |
| 76 // We do not assume that for-in enumerates elements in order. | 43 // We do not assume that enumerate enumerates elements in order. |
| 77 assertTrue(-1 != elements.indexOf("0")); | 44 assertTrue(-1 != elements.indexOf("0")); |
| 78 assertTrue(-1 != elements.indexOf("1")); | 45 assertTrue(-1 != elements.indexOf("1")); |
| 79 assertTrue(-1 != elements.indexOf("2")); | 46 assertTrue(-1 != elements.indexOf("2")); |
| 80 assertTrue(-1 != elements.indexOf("3")); | 47 assertTrue(-1 != elements.indexOf("3")); |
| 81 assertEquals(4, elements.length); | 48 assertEquals(4, elements.length); |
| 82 } | 49 } |
| 83 | 50 |
| 84 function for_in_string_prototype() { | 51 function for_in_string_prototype() { |
| 85 | 52 |
| 86 var x = new String("abc"); | 53 var x = new String("abc"); |
| 87 x.foo = 19; | 54 x.foo = 19; |
| 88 function B() { | 55 function B() { |
| 89 this.bar = 5; | 56 this.bar = 5; |
| 90 this[7] = 4; | 57 this[7] = 4; |
| 91 } | 58 } |
| 92 B.prototype = x; | 59 B.prototype = x; |
| 93 | 60 |
| 94 var y = new B(); | 61 var y = new B(); |
| 95 y.gub = 13; | 62 y.gub = 13; |
| 96 | 63 |
| 97 var elements = Accumulate(y); | 64 var elements = Accumulate(y); |
| 98 var elements1 = Accumulate(y); | 65 var elements1 = Accumulate(y); |
| 99 // If for-in returns elements in a different order on multiple calls, this | 66 // If enumerate returns elements in a different order on multiple calls, this |
| 100 // assert will fail. If that happens, consider if that behavior is OK. | 67 // assert will fail. If that happens, consider if that behavior is OK. |
| 101 assertEquals(elements, elements1, "For-in elements not the same both times."); | 68 assertEquals(elements, elements1, "Enumeration not the same both times."); |
| 102 // We do not assume that for-in enumerates elements in order. | 69 // We do not assume that enumerate enumerates elements in order. |
| 103 assertTrue(-1 != elements.indexOf("0")); | 70 assertTrue(-1 != elements.indexOf("0")); |
| 104 assertTrue(-1 != elements.indexOf("1")); | 71 assertTrue(-1 != elements.indexOf("1")); |
| 105 assertTrue(-1 != elements.indexOf("2")); | 72 assertTrue(-1 != elements.indexOf("2")); |
| 106 assertTrue(-1 != elements.indexOf("7")); | 73 assertTrue(-1 != elements.indexOf("7")); |
| 107 assertTrue(-1 != elements.indexOf("foo")); | 74 assertTrue(-1 != elements.indexOf("foo")); |
| 108 assertTrue(-1 != elements.indexOf("bar")); | 75 assertTrue(-1 != elements.indexOf("bar")); |
| 109 assertTrue(-1 != elements.indexOf("gub")); | 76 assertTrue(-1 != elements.indexOf("gub")); |
| 110 assertEquals(13, elements.length); | 77 assertEquals(13, elements.length); |
| 111 | 78 |
| 112 elements = Accumulate(x); | 79 elements = Accumulate(x); |
| 113 assertTrue(-1 != elements.indexOf("0")); | 80 assertTrue(-1 != elements.indexOf("0")); |
| 114 assertTrue(-1 != elements.indexOf("1")); | 81 assertTrue(-1 != elements.indexOf("1")); |
| 115 assertTrue(-1 != elements.indexOf("2")); | 82 assertTrue(-1 != elements.indexOf("2")); |
| 116 assertTrue(-1 != elements.indexOf("foo")); | 83 assertTrue(-1 != elements.indexOf("foo")); |
| 117 assertEquals(6, elements.length); | 84 assertEquals(6, elements.length); |
| 118 } | 85 } |
| 119 | 86 |
| 120 for_in_string_prototype(); | 87 for_in_string_prototype(); |
| 121 for_in_string_prototype(); | 88 for_in_string_prototype(); |
| OLD | NEW |