89 lines
3.3 KiB
JavaScript
89 lines
3.3 KiB
JavaScript
|
// Copyright 2008-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.
|
||
|
|
|
||
|
|
// This is adapted from mjsunit/for-in-special-cases.js.
|
||
|
|
|
||
|
|
// Flags: --harmony-reflect
|
||
|
|
|
||
|
|
|
||
|
|
function Accumulate(x) {
|
||
|
|
var accumulator = "";
|
||
|
|
for (var i of Reflect.enumerate(Object(x))) {
|
||
|
|
accumulator += i;
|
||
|
|
}
|
||
|
|
return accumulator;
|
||
|
|
}
|
||
|
|
|
||
|
|
for (var i = 0; i < 3; ++i) {
|
||
|
|
var elements = Accumulate("abcd");
|
||
|
|
// We do not assume that enumerate enumerates elements in order.
|
||
|
|
assertTrue(-1 != elements.indexOf("0"));
|
||
|
|
assertTrue(-1 != elements.indexOf("1"));
|
||
|
|
assertTrue(-1 != elements.indexOf("2"));
|
||
|
|
assertTrue(-1 != elements.indexOf("3"));
|
||
|
|
assertEquals(4, elements.length);
|
||
|
|
}
|
||
|
|
|
||
|
|
function for_in_string_prototype() {
|
||
|
|
|
||
|
|
var x = new String("abc");
|
||
|
|
x.foo = 19;
|
||
|
|
function B() {
|
||
|
|
this.bar = 5;
|
||
|
|
this[7] = 4;
|
||
|
|
}
|
||
|
|
B.prototype = x;
|
||
|
|
|
||
|
|
var y = new B();
|
||
|
|
y.gub = 13;
|
||
|
|
|
||
|
|
var elements = Accumulate(y);
|
||
|
|
var elements1 = Accumulate(y);
|
||
|
|
// If enumerate returns elements in a different order on multiple calls, this
|
||
|
|
// assert will fail. If that happens, consider if that behavior is OK.
|
||
|
|
assertEquals(elements, elements1, "Enumeration not the same both times.");
|
||
|
|
// We do not assume that enumerate enumerates elements in order.
|
||
|
|
assertTrue(-1 != elements.indexOf("0"));
|
||
|
|
assertTrue(-1 != elements.indexOf("1"));
|
||
|
|
assertTrue(-1 != elements.indexOf("2"));
|
||
|
|
assertTrue(-1 != elements.indexOf("7"));
|
||
|
|
assertTrue(-1 != elements.indexOf("foo"));
|
||
|
|
assertTrue(-1 != elements.indexOf("bar"));
|
||
|
|
assertTrue(-1 != elements.indexOf("gub"));
|
||
|
|
assertEquals(13, elements.length);
|
||
|
|
|
||
|
|
elements = Accumulate(x);
|
||
|
|
assertTrue(-1 != elements.indexOf("0"));
|
||
|
|
assertTrue(-1 != elements.indexOf("1"));
|
||
|
|
assertTrue(-1 != elements.indexOf("2"));
|
||
|
|
assertTrue(-1 != elements.indexOf("foo"));
|
||
|
|
assertEquals(6, elements.length);
|
||
|
|
}
|
||
|
|
|
||
|
|
for_in_string_prototype();
|
||
|
|
for_in_string_prototype();
|