| OLD | NEW |
| (Empty) |
| 1 // Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file | |
| 2 // for details. All rights reserved. Use of this source code is governed by a | |
| 3 // BSD-style license that can be found in the LICENSE file. | |
| 4 | |
| 5 part of dart.core; | |
| 6 | |
| 7 /** | |
| 8 * An interface for basic searches within strings. | |
| 9 */ | |
| 10 abstract class Pattern { | |
| 11 // NOTE: When using "start" index from the language library, call | |
| 12 // without an argument if start is zero. This allows backwards compatiblity | |
| 13 // with implementations of the older interface that didn't have the start | |
| 14 // index argument. | |
| 15 /** | |
| 16 * Match this pattern against the string repeatedly. | |
| 17 * | |
| 18 * If [start] is provided, matching will start at that index. | |
| 19 * | |
| 20 * The iterable will contain all the non-overlapping matches of the | |
| 21 * pattern on the string, ordered by start index. | |
| 22 * | |
| 23 * The matches are found by repeatedly finding the first match | |
| 24 * of the pattern on the string, starting from the end of the previous | |
| 25 * match, and initially starting from index zero. | |
| 26 * | |
| 27 * If the pattern matches the empty string at some point, the next | |
| 28 * match is found by starting at the previous match's end plus one. | |
| 29 */ | |
| 30 Iterable<Match> allMatches(String string, [int start = 0]); | |
| 31 | |
| 32 /** | |
| 33 * Match this pattern against the start of `string`. | |
| 34 * | |
| 35 * If [start] is provided, it must be an integer in the range `0` .. | |
| 36 * `string.length`. In that case, this patten is tested against the | |
| 37 * string at the [start] position. That is, a [Match] is returned if the | |
| 38 * pattern can match a part of the string starting from position [start]. | |
| 39 * Returns `null` if the pattern doesn't match. | |
| 40 */ | |
| 41 Match matchAsPrefix(String string, [int start = 0]); | |
| 42 } | |
| OLD | NEW |