| OLD | NEW | 
|    1 // Copyright 2011 the V8 project authors. All rights reserved. |    1 // Copyright 2011 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 "use strict"; |   27  | 
 |   28 // Flags: --no-legacy-const --harmony-sloppy | 
|   28  |   29  | 
|   29 function props(x) { |   30 function props(x) { | 
|   30   var array = []; |   31   var array = []; | 
|   31   for (let p in x) array.push(p); |   32   for (let p in x) array.push(p); | 
|   32   return array.sort(); |   33   return array.sort(); | 
|   33 } |   34 } | 
|   34  |   35  | 
|   35 assertEquals(0, props({}).length); |   36 assertEquals(0, props({}).length); | 
|   36 assertEquals(1, props({x:1}).length); |   37 assertEquals(1, props({x:1}).length); | 
|   37 assertEquals(2, props({x:1, y:2}).length); |   38 assertEquals(2, props({x:1, y:2}).length); | 
| (...skipping 151 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
|  189 assertEquals(0, eval("for (let i = 0; true;) { i; break; }")); |  190 assertEquals(0, eval("for (let i = 0; true;) { i; break; }")); | 
|  190 assertEquals(0, eval("for (const i = 0; true;) { i; break; }")); |  191 assertEquals(0, eval("for (const i = 0; true;) { i; break; }")); | 
|  191 assertEquals(9, eval("for (let i = 0; i < 10; i++) { i; continue; }")); |  192 assertEquals(9, eval("for (let i = 0; i < 10; i++) { i; continue; }")); | 
|  192 assertEquals(3, eval("for (let i = 0; true; i++) { i; if (i >= 3) break; }")); |  193 assertEquals(3, eval("for (let i = 0; true; i++) { i; if (i >= 3) break; }")); | 
|  193 assertEquals(2, eval("for (let i = 0; true; i++) { if (i >= 3) break; i; }")); |  194 assertEquals(2, eval("for (let i = 0; true; i++) { if (i >= 3) break; i; }")); | 
|  194 assertEquals( |  195 assertEquals( | 
|  195   2, eval("for (let i = 0; i < 10; i++) { if (i >= 3) continue; i; }")); |  196   2, eval("for (let i = 0; i < 10; i++) { if (i >= 3) continue; i; }")); | 
|  196 assertEquals(undefined, eval("foo: for (let i = 0; true;) { break foo; }")); |  197 assertEquals(undefined, eval("foo: for (let i = 0; true;) { break foo; }")); | 
|  197 assertEquals(undefined, eval("foo: for (const i = 0; true;) { break foo; }")); |  198 assertEquals(undefined, eval("foo: for (const i = 0; true;) { break foo; }")); | 
|  198 assertEquals(3, eval("foo: for (let i = 3; true;) { i; break foo; }")); |  199 assertEquals(3, eval("foo: for (let i = 3; true;) { i; break foo; }")); | 
| OLD | NEW |