1 files changed, 51 insertions, 0 deletions
diff --git a/js/src/tests/test262/built-ins/Map/prototype/forEach/iterates-values-added-after-foreach-begins.js b/js/src/tests/test262/built-ins/Map/prototype/forEach/iterates-values-added-after-foreach-begins.js
new file mode 100644
index 0000000000..f728b86d9b
--- /dev/null
+++ b/js/src/tests/test262/built-ins/Map/prototype/forEach/iterates-values-added-after-foreach-begins.js
@@ -0,0 +1,51 @@
+// Copyright (C) 2015 the V8 project authors. All rights reserved.
+// This code is governed by the BSD license found in the LICENSE file.
+/*---
+esid: sec-map.prototype.forEach
+description: >
+  New keys are visited if created during forEach execution.
+info: |
+  Map.prototype.forEach ( callbackfn [ , thisArg ] )
+
+  ...
+  5. If thisArg was supplied, let T be thisArg; else let T be undefined.
+  6. Let entries be the List that is the value of M’s [[MapData]] internal slot.
+  7. Repeat for each Record {[[key]], [[value]]} e that is an element of
+  entries, in original key insertion order
+    a. If e.[[key]] is not empty, then
+      i. Let funcResult be Call(callbackfn, T, «e.[[value]], e.[[key]], M»).
+      ii. ReturnIfAbrupt(funcResult).
+  ...
+---*/
+
+var map = new Map();
+map.set('foo', 0);
+map.set('bar', 1);
+
+var count = 0;
+var results = [];
+
+map.forEach(function(value, key) {
+  if (count === 0) {
+    map.set('baz', 2);
+  }
+  results.push({
+    value: value,
+    key: key
+  });
+  count++;
+});
+
+assert.sameValue(count, 3);
+assert.sameValue(map.size, 3);
+
+assert.sameValue(results[0].key, 'foo');
+assert.sameValue(results[0].value, 0);
+
+assert.sameValue(results[1].key, 'bar');
+assert.sameValue(results[1].value, 1);
+
+assert.sameValue(results[2].key, 'baz');
+assert.sameValue(results[2].value, 2);
+
+reportCompare(0, 0);