| 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('Test for beginning of line (BOL or ^) matching</a>'); | |
| 30 | |
| 31 var s = "abc123def456xyzabc789abc999"; | |
| 32 shouldBeNull(firstMatch(s, new RegExp(r"^notHere"))); | |
| 33 shouldBe(firstMatch(s, new RegExp(r"^abc")), ["abc"]); | |
| 34 shouldBe(firstMatch(s, new RegExp(r"(^|X)abc")), ["abc", ""]); | |
| 35 shouldBe(firstMatch(s, new RegExp(r"^longer|123")), ["123"]); | |
| 36 shouldBe(firstMatch(s, new RegExp(r"(^abc|c)123")), ["abc123", "abc"]); | |
| 37 shouldBe(firstMatch(s, new RegExp(r"(c|^abc)123")), ["abc123", "abc"]); | |
| 38 shouldBe(firstMatch(s, new RegExp(r"(^ab|abc)123")), ["abc123", "abc"]); | |
| 39 shouldBe(firstMatch(s, new RegExp(r"(bc|^abc)([0-9]*)a")), | |
| 40 ["bc789a", "bc", "789"]); | |
| 41 shouldBeNull(new RegExp(r"(?:(Y)X)|(X)").firstMatch("abc")); | |
| 42 shouldBeNull(new RegExp(r"(?:(?:^|Y)X)|(X)").firstMatch("abc")); | |
| 43 shouldBeNull(new RegExp(r"(?:(?:^|Y)X)|(X)").firstMatch("abcd")); | |
| 44 shouldBe(new RegExp(r"(?:(?:^|Y)X)|(X)").firstMatch("Xabcd"), ["X", null]); | |
| 45 shouldBe(new RegExp(r"(?:(?:^|Y)X)|(X)").firstMatch("aXbcd"), ["X", "X"]); | |
| 46 shouldBe(new RegExp(r"(?:(?:^|Y)X)|(X)").firstMatch("abXcd"), ["X", "X"]); | |
| 47 shouldBe(new RegExp(r"(?:(?:^|Y)X)|(X)").firstMatch("abcXd"), ["X", "X"]); | |
| 48 shouldBe(new RegExp(r"(?:(?:^|Y)X)|(X)").firstMatch("abcdX"), ["X", "X"]); | |
| 49 shouldBe(new RegExp(r"(?:(?:^|Y)X)|(X)").firstMatch("YXabcd"), ["YX", null]); | |
| 50 shouldBe(new RegExp(r"(?:(?:^|Y)X)|(X)").firstMatch("aYXbcd"), ["YX", null]); | |
| 51 shouldBe(new RegExp(r"(?:(?:^|Y)X)|(X)").firstMatch("abYXcd"), ["YX", null]); | |
| 52 shouldBe(new RegExp(r"(?:(?:^|Y)X)|(X)").firstMatch("abcYXd"), ["YX", null]); | |
| 53 shouldBe(new RegExp(r"(?:(?:^|Y)X)|(X)").firstMatch("abcdYX"), ["YX", null]); | |
| 54 } | |
| OLD | NEW |