Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 1 | // Copyright 2016 the V8 project authors. All rights reserved. |
| 2 | // Use of this source code is governed by a BSD-style license that can be |
| 3 | // found in the LICENSE file. |
| 4 | |
Ben Murdoch | 097c5b2 | 2016-05-18 11:27:45 +0100 | [diff] [blame] | 5 | var L = "\ud800"; |
| 6 | var T = "\udc00"; |
| 7 | var x = "x"; |
| 8 | |
| 9 | var r = /()/g; // Global, but not unicode. |
| 10 | // Zero-length matches do not advance lastIndex. |
| 11 | assertEquals(["", ""], r.exec(L + T + L + T)); |
| 12 | assertEquals(0, r.lastIndex); |
| 13 | r.lastIndex = 1; |
| 14 | assertEquals(["", ""], r.exec(L + T + L + T)); |
| 15 | assertEquals(1, r.lastIndex); |
| 16 | |
| 17 | var u = /()/ug; // Global and unicode. |
| 18 | // Zero-length matches do not advance lastIndex. |
| 19 | assertEquals(["", ""], u.exec(L + T + L + T)); |
| 20 | assertEquals(0, u.lastIndex); |
| 21 | u.lastIndex = 1; |
| 22 | assertEquals(["", ""], u.exec(L + T + L + T)); |
| 23 | assertEquals(0, u.lastIndex); |
| 24 | |
| 25 | // However, with repeating matches, lastIndex does not matter. |
| 26 | // We do advance from match to match. |
| 27 | r.lastIndex = 2; |
| 28 | assertEquals(x + L + x + T + x + L + x + T + x, |
| 29 | (L + T + L + T).replace(r, "x")); |
| 30 | |
| 31 | // With unicode flag, we advance code point by code point. |
| 32 | u.lastIndex = 3; |
| 33 | assertEquals(x + L + T + x + L + T + x, |
| 34 | (L + T + L + T).replace(u, "x")); |
| 35 | |
| 36 | // Test that exhausting the global match cache is fine. |
| 37 | assertEquals((x + L + T).repeat(1000) + x, |
| 38 | (L + T).repeat(1000).replace(u, "x")); |
| 39 | |
| 40 | // Same thing for RegExp.prototype.match. |
| 41 | r.lastIndex = 1; |
| 42 | assertEquals(["","","","",""], (L + T + L + T).match(r)); |
| 43 | r.lastIndex = 2; |
| 44 | assertEquals(["","","","",""], (L + T + L + T).match(r)); |
| 45 | |
| 46 | u.lastIndex = 1; |
| 47 | assertEquals(["","",""], (L + T + L + T).match(u)); |
| 48 | u.lastIndex = 2; |
| 49 | assertEquals(["","",""], (L + T + L + T).match(u)); |
| 50 | |
| 51 | var expected = []; |
| 52 | for (var i = 0; i <= 1000; i++) expected.push(""); |
| 53 | assertEquals(expected, (L + T).repeat(1000).match(u)); |
| 54 | |
| 55 | // Also test RegExp.prototype.@@split. |
| 56 | assertEquals(["\u{12345}"], "\u{12345}".split(/(?:)/u)); |