1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2021-2022 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
//
//===----------------------------------------------------------------------===//
// MARK: `CollectionSearcher` algorithms
extension Collection {
func _firstMatch<S: MatchingCollectionSearcher>(
of searcher: S
) -> _MatchResult<S>? where S.Searched == Self {
var state = searcher.state(for: self, in: startIndex..<endIndex)
return searcher.matchingSearch(self, &state).map { range, result in
_MatchResult(match: self[range], result: result)
}
}
}
extension BidirectionalCollection {
func lastMatch<S: BackwardMatchingCollectionSearcher>(
of searcher: S
) -> _BackwardMatchResult<S>?
where S.BackwardSearched == Self
{
var state = searcher.backwardState(for: self, in: startIndex..<endIndex)
return searcher.matchingSearchBack(self, &state).map { range, result in
_BackwardMatchResult(match: self[range], result: result)
}
}
}
// MARK: Regex algorithms
extension BidirectionalCollection where SubSequence == Substring {
/// Returns the first match of the specified regex within the collection.
/// - Parameter regex: The regex to search for.
/// - Returns: The first match of `regex` in the collection, or `nil` if
/// there isn't a match.
@available(SwiftStdlib 5.7, *)
public func firstMatch<Output>(
of r: some RegexComponent<Output>
) -> Regex<Output>.Match? {
let slice = self[...]
return try? r.regex.firstMatch(in: slice)
}
}
|
