| OLD | NEW |
| 1 // Copyright 2008 the V8 project authors. All rights reserved. | 1 // Copyright 2008 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 12 matching lines...) Expand all Loading... |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 function CheckMatch(re, str, matches) { | 28 function CheckMatch(re, str, matches) { |
| 29 assertEquals(matches.length > 0, re.test(str)); | 29 assertEquals(matches.length > 0, re.test(str)); |
| 30 var result = str.match(re); | 30 var result = str.match(re); |
| 31 if (matches.length > 0) { | 31 if (matches.length > 0) { |
| 32 assertEquals(matches.length, result.length); | 32 assertEquals(matches.length, result.length); |
| 33 for (idx in matches) { | 33 var lastExpected; |
| 34 var lastFrom; |
| 35 var lastLength; |
| 36 for (var idx = 0; idx < matches.length; idx++) { |
| 34 var from = matches[idx][0]; | 37 var from = matches[idx][0]; |
| 35 var length = matches[idx][1]; | 38 var length = matches[idx][1]; |
| 36 var expected = str.substr(from, length); | 39 var expected = str.substr(from, length); |
| 37 assertEquals(expected, result[idx]); | 40 var name = str + "[" + from + ".." + (from+length) + "]"; |
| 41 assertEquals(expected, result[idx], name); |
| 42 if (re.global || idx == 0) { |
| 43 lastExpected = expected; |
| 44 lastFrom = from; |
| 45 lastLength = length; |
| 46 } |
| 38 } | 47 } |
| 39 assertEquals(expected, RegExp.lastMatch); | 48 assertEquals(lastExpected, RegExp.lastMatch, "lastMatch"); |
| 40 assertEquals(str.substr(0, from), RegExp.leftContext); | 49 assertEquals(str.substr(0, lastFrom), RegExp.leftContext, "leftContext"); |
| 41 assertEquals(str.substr(from + length), RegExp.rightContext); | 50 assertEquals( |
| 51 str.substr(lastFrom + lastLength), RegExp.rightContext, "rightContext"); |
| 42 } else { | 52 } else { |
| 43 assertTrue(result === null); | 53 assertTrue(result === null); |
| 44 } | 54 } |
| 45 } | 55 } |
| 46 | 56 |
| 47 CheckMatch(/abc/, "xxxabcxxxabcxxx", [[3, 3]]); | 57 CheckMatch(/abc/, "xxxabcxxxabcxxx", [[3, 3]]); |
| 48 CheckMatch(/abc/g, "xxxabcxxxabcxxx", [[3, 3], [9, 3]]); | 58 CheckMatch(/abc/g, "xxxabcxxxabcxxx", [[3, 3], [9, 3]]); |
| 49 CheckMatch(/abc/, "xxxabababcxxxabcxxx", [[7, 3]]); | 59 CheckMatch(/abc/, "xxxabababcxxxabcxxx", [[7, 3]]); |
| 50 CheckMatch(/abc/g, "abcabcabc", [[0, 3], [3, 3], [6, 3]]); | 60 CheckMatch(/abc/g, "abcabcabc", [[0, 3], [3, 3], [6, 3]]); |
| 51 CheckMatch(/aba/g, "ababababa", [[0, 3], [4, 3]]); | 61 CheckMatch(/aba/g, "ababababa", [[0, 3], [4, 3]]); |
| 52 CheckMatch(/foo/g, "ofooofoooofofooofo", [[1, 3], [5, 3], [12, 3]]); | 62 CheckMatch(/foo/g, "ofooofoooofofooofo", [[1, 3], [5, 3], [12, 3]]); |
| 53 CheckMatch(/foobarbaz/, "xx", []); | 63 CheckMatch(/foobarbaz/, "xx", []); |
| 54 CheckMatch(new RegExp(""), "xxx", [[0, 0]]); | 64 CheckMatch(new RegExp(""), "xxx", [[0, 0]]); |
| 55 CheckMatch(/abc/, "abababa", []); | 65 CheckMatch(/abc/, "abababa", []); |
| 56 | 66 |
| 57 assertEquals("xxxdefxxxdefxxx", "xxxabcxxxabcxxx".replace(/abc/g, "def")); | 67 assertEquals("xxxdefxxxdefxxx", "xxxabcxxxabcxxx".replace(/abc/g, "def")); |
| 58 assertEquals("o-o-oofo-ofo", "ofooofoooofofooofo".replace(/foo/g, "-")); | 68 assertEquals("o-o-oofo-ofo", "ofooofoooofofooofo".replace(/foo/g, "-")); |
| 59 assertEquals("deded", "deded".replace(/x/g, "-")); | 69 assertEquals("deded", "deded".replace(/x/g, "-")); |
| 60 assertEquals("-a-b-c-d-e-f-", "abcdef".replace(new RegExp("", "g"), "-")); | 70 assertEquals("-a-b-c-d-e-f-", "abcdef".replace(new RegExp("", "g"), "-")); |
| 71 |
| 72 CheckMatch(/a(.)/, "xyzzyabxyzzzyacxyzzy", [[5, 2], [6, 1]]); |
| 73 CheckMatch(/a(.)/g, "xyzzyabxyzzyacxyzzy", [[5, 2], [12, 2]]); |
| 74 |
| 75 CheckMatch(/a|(?:)/g, "aba", [[0, 1], [1, 0], [2, 1], [3, 0]]); |
| 76 CheckMatch(/a|(?:)/g, "baba", [[0, 0], [1, 1], [2, 0], [3, 1], [4, 0]]); |
| 77 CheckMatch(/a|(?:)/g, "bab", [[0, 0], [1, 1], [2, 0], [3, 0]]); |
| OLD | NEW |