OLD | NEW |
| (Empty) |
1 // Copyright (c) 2014, the Dart project authors. All rights reserved. | |
2 // Copyright 2013 the V8 project authors. All rights reserved. | |
3 // Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. | |
4 // | |
5 // Redistribution and use in source and binary forms, with or without | |
6 // modification, are permitted provided that the following conditions | |
7 // are met: | |
8 // 1. Redistributions of source code must retain the above copyright | |
9 // notice, this list of conditions and the following disclaimer. | |
10 // 2. Redistributions in binary form must reproduce the above copyright | |
11 // notice, this list of conditions and the following disclaimer in the | |
12 // documentation and/or other materials provided with the distribution. | |
13 // | |
14 // THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND AN
Y | |
15 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED | |
16 // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE | |
17 // DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR AN
Y | |
18 // DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES | |
19 // (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | |
20 // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND O
N | |
21 // ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
22 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS | |
23 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
24 | |
25 import 'v8_regexp_utils.dart'; | |
26 import 'package:expect/expect.dart'; | |
27 | |
28 void main() { | |
29 description( | |
30 "Test to ensure correct behaviour when using backreferences in a RegExp"); | |
31 | |
32 shouldBeTrue(new RegExp(r"(...)\1$").hasMatch('abcabc')); | |
33 shouldBeFalse(new RegExp(r"(...)\1$").hasMatch('abcdef')); | |
34 shouldBeFalse(new RegExp(r"(...)\2$").hasMatch('abcabc')); | |
35 shouldBeFalse(new RegExp(r"(...)\2$").hasMatch('abc')); | |
36 shouldBeTrue(new RegExp(r"\1(...)$").hasMatch('abcabc')); | |
37 shouldBeTrue(new RegExp(r"\1(...)$").hasMatch('abcdef')); | |
38 shouldBeFalse(new RegExp(r"\2(...)$").hasMatch('abcabc')); | |
39 shouldBeFalse(new RegExp(r"\2(...)$").hasMatch('abc')); | |
40 shouldBeTrue(new RegExp(r"\1?(...)$").hasMatch('abc')); | |
41 shouldBeTrue(new RegExp(r"\1?(...)$").hasMatch('abc')); | |
42 | |
43 var re = new RegExp(r"[^b]*((..)|(\2))+Sz", caseSensitive: false); | |
44 | |
45 shouldBeFalse(re.hasMatch('axabcd')); | |
46 shouldBeTrue(re.hasMatch('axabcsz')); | |
47 } | |
OLD | NEW |