OLD | NEW |
(Empty) | |
| 1 // Copyright 2009 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are |
| 4 // met: |
| 5 // |
| 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided |
| 11 // with the distribution. |
| 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. |
| 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 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. |
| 27 // |
| 28 // Flags: --string-slices |
| 29 |
| 30 var re = /^(((N({)?)|(R)|(U)|(V)|(B)|(H)|(n((n)|(r)|(v)|(h))?)|(r(r)?)|(v)|(b((n
)|(b))?)|(h))|((Y)|(A)|(E)|(o(u)?)|(p(u)?)|(q(u)?)|(s)|(t)|(u)|(w)|(x(u)?)|(y)|(
z)|(a((T)|(A)|(L))?)|(c)|(e)|(f(u)?)|(g(u)?)|(i)|(j)|(l)|(m(u)?)))+/; |
| 31 var r = new RegExp(re) |
| 32 var str = "_Avtnennan gunzvmu pubExnY nEvln vaTxh rmuhguhaTxnY_".slice(1,-1); |
| 33 str = str + str; |
| 34 assertTrue(r.test(str)); |
| 35 assertTrue(r.test(str)); |
| 36 var re = /x/; |
| 37 assertEquals("a.yb", "_axyb_".slice(1,-1).replace(re, ".")); |
| 38 re.compile("y"); |
| 39 assertEquals("ax.b", "_axyb_".slice(1,-1).replace(re, ".")); |
| 40 re.compile("(x)"); |
| 41 assertEquals(["x", "x"], re.exec("_axyb_".slice(1,-1))); |
| 42 |
| 43 re.compile("(y)"); |
| 44 assertEquals(["y", "y"], re.exec("_axyb_".slice(1,-1))); |
| 45 |
| 46 var a = "_bbaababbabaaaaabbaaaabba_".slice(1,-1); |
| 47 var b = "bbaababbabaaaaabbaaaabba" + a; |
| 48 // The first time, the slice will be truncated and handled by the |
| 49 // runtime system. |
| 50 assertEquals(["bbaa", "a", "", "a"], /((\3|b)\2(a)){2,}/.exec(a)); |
| 51 // The second time, the slice is already truncated and will be handled |
| 52 // by generated code. |
| 53 assertEquals(["bbaa", "a", "", "a"], /((\3|b)\2(a)){2,}/.exec(a)); |
| 54 // The first time, the cons string will be flattened and handled by the |
| 55 // runtime system. |
| 56 assertEquals(["bbaa", "a", "", "a"], /((\3|b)\2(a)){2,}/.exec(b)); |
| 57 // The second time, the cons string is already flattened and will be |
| 58 // handled by generated code. |
| 59 assertEquals(["bbaa", "a", "", "a"], /((\3|b)\2(a)){2,}/.exec(b)); |
| 60 |
| 61 var c = "ABCDEFGHIJKLMN".slice(2,-2); |
| 62 var d = "ABCDEF\u1234GHIJKLMN".slice(2,-2); |
| 63 assertTrue(/^C.*L$/.test(c)); |
| 64 assertTrue(/^C.*L$/.test(c)); |
| 65 assertTrue(/^C.*L$/.test(d)); |
| 66 assertTrue(/^C.*L$/.test(d)); |
OLD | NEW |