54 lines
2.1 KiB
JavaScript
54 lines
2.1 KiB
JavaScript
|
// Copyright 2010-2015 the V8 project authors. All rights reserved.
|
||
|
// Redistribution and use in source and binary forms, with or without
|
||
|
// modification, are permitted provided that the following conditions are
|
||
|
// met:
|
||
|
//
|
||
|
// * Redistributions of source code must retain the above copyright
|
||
|
// notice, this list of conditions and the following disclaimer.
|
||
|
// * Redistributions in binary form must reproduce the above
|
||
|
// copyright notice, this list of conditions and the following
|
||
|
// disclaimer in the documentation and/or other materials provided
|
||
|
// with the distribution.
|
||
|
// * Neither the name of Google Inc. nor the names of its
|
||
|
// contributors may be used to endorse or promote products derived
|
||
|
// from this software without specific prior written permission.
|
||
|
//
|
||
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
||
|
// Test that properties deleted during an enumeration do not show up in
|
||
|
// the enumeration. This is adapted from mjsunit/for-in-delete.js.
|
||
|
|
||
|
// Flags: --harmony-reflect
|
||
|
|
||
|
|
||
|
function f(o, expected, del) {
|
||
|
var index = 0;
|
||
|
for (p of Reflect.enumerate(o)) {
|
||
|
if (del) delete o[del];
|
||
|
assertEquals(expected[index], p);
|
||
|
index++;
|
||
|
}
|
||
|
assertEquals(expected.length, index);
|
||
|
}
|
||
|
|
||
|
var o = {}
|
||
|
o.a = 1;
|
||
|
o.b = 2;
|
||
|
o.c = 3;
|
||
|
o.d = 3;
|
||
|
|
||
|
f(o, ['a', 'b', 'c', 'd']);
|
||
|
f(o, ['a', 'b', 'c', 'd']);
|
||
|
f(o, ['a', 'c', 'd'], 'b');
|
||
|
f(o, ['a', 'c'], 'd');
|