OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. | 2 // Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. |
3 // | 3 // |
4 // Redistribution and use in source and binary forms, with or without | 4 // Redistribution and use in source and binary forms, with or without |
5 // modification, are permitted provided that the following conditions | 5 // modification, are permitted provided that the following conditions |
6 // are met: | 6 // are met: |
7 // 1. Redistributions of source code must retain the above copyright | 7 // 1. Redistributions of source code must retain the above copyright |
8 // notice, this list of conditions and the following disclaimer. | 8 // notice, this list of conditions and the following disclaimer. |
9 // 2. Redistributions in binary form must reproduce the above copyright | 9 // 2. Redistributions in binary form must reproduce the above copyright |
10 // notice, this list of conditions and the following disclaimer in the | 10 // notice, this list of conditions and the following disclaimer in the |
11 // documentation and/or other materials provided with the distribution. | 11 // documentation and/or other materials provided with the distribution. |
12 // | 12 // |
13 // THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND AN
Y | 13 // THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND AN
Y |
14 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED | 14 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
15 // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE | 15 // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
16 // DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR AN
Y | 16 // DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR AN
Y |
17 // DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES | 17 // DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
18 // (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | 18 // (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
19 // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND O
N | 19 // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND O
N |
20 // ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 20 // ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
21 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS | 21 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
22 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 22 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
23 | 23 |
24 description( | 24 description( |
25 "Tests the behavior of Array.prototype.concat while the array is having a bad ti
me due to one of the elements we are concatenating." | 25 'Test RegExp.compile method.' |
26 ); | 26 ); |
27 | 27 |
28 Object.defineProperty(Array.prototype, 0, { writable: false }); | 28 re = new RegExp("a", "i"); |
29 shouldBe("[42].concat()", "[42]"); | 29 shouldBe("re.toString()", "'/a/i'"); |
30 | 30 |
| 31 re.compile("a"); |
| 32 shouldBe("re.multiline", "false"); |
| 33 shouldBe("re.ignoreCase", "false"); |
| 34 shouldBe("re.global", "false"); |
| 35 shouldBe("re.test('A')", "false"); |
| 36 shouldBe("re.toString()", "'/a/'"); |
31 | 37 |
| 38 re.compile("b", "g"); |
| 39 shouldBe("re.toString()", "'/b/g'"); |
| 40 |
| 41 re.compile(new RegExp("c")); |
| 42 shouldBe("re.toString()", "'/c/'"); |
| 43 |
| 44 re.compile(new RegExp("c", "i")); |
| 45 shouldBe("re.ignoreCase", "true"); |
| 46 shouldBe("re.test('C')", "true"); |
| 47 shouldBe("re.toString()", "'/c/i'"); |
| 48 |
| 49 shouldThrow("re.compile(new RegExp('c'), 'i');"); |
| 50 |
| 51 // It's OK to supply a second argument, as long as the argument is "undefined". |
| 52 re.compile(re, undefined); |
| 53 shouldBe("re.toString()", "'/c/i'"); |
| 54 |
| 55 shouldThrow("re.compile(new RegExp('+'));"); |
| 56 |
| 57 re.compile(undefined); |
| 58 shouldBe("re.toString()", "'/undefined/'"); |
| 59 |
| 60 re.compile(null); |
| 61 shouldBe("re.toString()", "'/null/'"); |
| 62 |
| 63 re.compile(); |
| 64 shouldBe("re.toString()", "'/(?:)/'"); |
| 65 |
| 66 re.compile("z", undefined); |
| 67 shouldBe("re.toString()", "'/z/'"); |
| 68 |
| 69 // Compiling should reset lastIndex. |
| 70 re.lastIndex = 100; |
| 71 re.compile(/a/g); |
| 72 shouldBe("re.lastIndex", "0"); |
| 73 re.exec("aaa"); |
| 74 shouldBe("re.lastIndex", "1"); |
OLD | NEW |