regress-2506.js 1.19 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
// Copyright 2014 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

'use strict';

// Top-level code
let s = 0;
let f = [undefined, undefined, undefined]
for (const x of [1,2,3]) {
  s += x;
  f[x-1] = function() { return x; }
}
assertEquals(6, s);
assertEquals(1, f[0]());
assertEquals(2, f[1]());
assertEquals(3, f[2]());

let x = 1;
s = 0;
21 22
for (const z of [x, x+1, x+2]) {
  s += z;
23 24 25 26 27
}
assertEquals(6, s);

s = 0;
var q = 1;
28 29
for (const x of [q, q+1, q+2]) {
  s += x;
30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46
}
assertEquals(6, s);

let z = 1;
s = 0;
for (const x = 1; z < 2; z++) {
  s += x + z;
}
assertEquals(2, s);


s = "";
for (const x in [1,2,3]) {
  s += x;
}
assertEquals("012", s);

47
assertThrows("'use strict'; for (const x in [1,2,3]) { x++ }", TypeError);
48 49 50 51 52 53 54 55 56 57 58

// Function scope
(function() {
  let s = 0;
  for (const x of [1,2,3]) {
    s += x;
  }
  assertEquals(6, s);

  let x = 1;
  s = 0;
59 60
  for (const q of [x, x+1, x+2]) {
    s += q;
61 62 63 64 65
  }
  assertEquals(6, s);

  s = 0;
  var q = 1;
66 67
  for (const x of [q, q+1, q+2]) {
    s += x;
68 69 70 71 72 73 74 75 76
  }
  assertEquals(6, s);

  s = "";
  for (const x in [1,2,3]) {
    s += x;
  }
  assertEquals("012", s);
}());