| OLD | NEW |
| (Empty) |
| 1 // Copyright 2010-2015 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 // Test that properties deleted during an enumeration do not show up in | |
| 29 // the enumeration. This is adapted from mjsunit/for-in-delete.js. | |
| 30 | |
| 31 // Flags: --harmony-reflect | |
| 32 | |
| 33 | |
| 34 function f(o, expected, del) { | |
| 35 var index = 0; | |
| 36 for (p of Reflect.enumerate(o)) { | |
| 37 if (del) delete o[del]; | |
| 38 assertEquals(expected[index], p); | |
| 39 index++; | |
| 40 } | |
| 41 assertEquals(expected.length, index); | |
| 42 } | |
| 43 | |
| 44 var o = {} | |
| 45 o.a = 1; | |
| 46 o.b = 2; | |
| 47 o.c = 3; | |
| 48 o.d = 3; | |
| 49 | |
| 50 f(o, ['a', 'b', 'c', 'd']); | |
| 51 f(o, ['a', 'b', 'c', 'd']); | |
| 52 f(o, ['a', 'c', 'd'], 'b'); | |
| 53 f(o, ['a', 'c'], 'd'); | |
| OLD | NEW |