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 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389
|
@_implementationOnly import _RegexParser // For AssertionKind
extension Character {
var _isHorizontalWhitespace: Bool {
self.unicodeScalars.first?.isHorizontalWhitespace == true
}
var _isNewline: Bool {
self.unicodeScalars.first?.isNewline == true
}
}
extension Processor {
mutating func matchBuiltinCC(
_ cc: _CharacterClassModel.Representation,
isInverted: Bool,
isStrictASCII: Bool,
isScalarSemantics: Bool
) -> Bool {
guard currentPosition < end, let next = input.matchBuiltinCC(
cc,
at: currentPosition,
limitedBy: end,
isInverted: isInverted,
isStrictASCII: isStrictASCII,
isScalarSemantics: isScalarSemantics
) else {
signalFailure()
return false
}
currentPosition = next
return true
}
func isAtStartOfLine(_ payload: AssertionPayload) -> Bool {
// TODO: needs benchmark coverage
if currentPosition == subjectBounds.lowerBound { return true }
switch payload.semanticLevel {
case .graphemeCluster:
return input[input.index(before: currentPosition)].isNewline
case .unicodeScalar:
return input.unicodeScalars[input.unicodeScalars.index(before: currentPosition)].isNewline
}
}
func isAtEndOfLine(_ payload: AssertionPayload) -> Bool {
// TODO: needs benchmark coverage
if currentPosition == subjectBounds.upperBound { return true }
switch payload.semanticLevel {
case .graphemeCluster:
return input[currentPosition].isNewline
case .unicodeScalar:
return input.unicodeScalars[currentPosition].isNewline
}
}
mutating func builtinAssert(by payload: AssertionPayload) throws -> Bool {
// TODO: needs benchmark coverage
// Future work: Optimize layout and dispatch
switch payload.kind {
case .startOfSubject: return currentPosition == subjectBounds.lowerBound
case .endOfSubjectBeforeNewline:
if currentPosition == subjectBounds.upperBound { return true }
switch payload.semanticLevel {
case .graphemeCluster:
return input.index(after: currentPosition) == subjectBounds.upperBound
&& input[currentPosition].isNewline
case .unicodeScalar:
return input.unicodeScalars.index(after: currentPosition) == subjectBounds.upperBound
&& input.unicodeScalars[currentPosition].isNewline
}
case .endOfSubject: return currentPosition == subjectBounds.upperBound
case .resetStartOfMatch:
fatalError("Unreachable, we should have thrown an error during compilation")
case .firstMatchingPositionInSubject:
return currentPosition == searchBounds.lowerBound
case .textSegment: return input.isOnGraphemeClusterBoundary(currentPosition)
case .notTextSegment: return !input.isOnGraphemeClusterBoundary(currentPosition)
case .startOfLine:
return isAtStartOfLine(payload)
case .endOfLine:
return isAtEndOfLine(payload)
case .caretAnchor:
if payload.anchorsMatchNewlines {
return isAtStartOfLine(payload)
} else {
return currentPosition == subjectBounds.lowerBound
}
case .dollarAnchor:
if payload.anchorsMatchNewlines {
return isAtEndOfLine(payload)
} else {
return currentPosition == subjectBounds.upperBound
}
case .wordBoundary:
if payload.usesSimpleUnicodeBoundaries {
return atSimpleBoundary(payload.usesASCIIWord, payload.semanticLevel)
} else {
return input.isOnWordBoundary(at: currentPosition, in: subjectBounds, using: &wordIndexCache, &wordIndexMaxIndex)
}
case .notWordBoundary:
if payload.usesSimpleUnicodeBoundaries {
return !atSimpleBoundary(payload.usesASCIIWord, payload.semanticLevel)
} else {
return !input.isOnWordBoundary(at: currentPosition, in: subjectBounds, using: &wordIndexCache, &wordIndexMaxIndex)
}
}
}
}
// MARK: Matching `.`
extension String {
/// Returns the character at `pos`, bounded by `end`, as well as the upper
/// boundary of the returned character.
///
/// This function handles loading a character from a string while respecting
/// an end boundary, even if that end boundary is sub-character or sub-scalar.
///
/// - If `pos` is at or past `end`, this function returns `nil`.
/// - If `end` is between `pos` and the next grapheme cluster boundary (i.e.,
/// `end` is before `self.index(after: pos)`, then the returned character
/// is smaller than the one that would be produced by `self[pos]` and the
/// returned index is at the end of that character.
/// - If `end` is between `pos` and the next grapheme cluster boundary, and
/// is not on a Unicode scalar boundary, the partial scalar is dropped. This
/// can result in a `nil` return or a character that includes only part of
/// the `self[pos]` character.
///
/// - Parameters:
/// - pos: The position to load a character from.
/// - end: The limit for the character at `pos`.
/// - Returns: The character at `pos`, bounded by `end`, if it exists, along
/// with the upper bound of that character. The upper bound is always
/// scalar-aligned.
func characterAndEnd(at pos: String.Index, limitedBy end: String.Index) -> (Character, String.Index)? {
// FIXME: Sink into the stdlib to avoid multiple boundary calculations
guard pos < end else { return nil }
let next = index(after: pos)
if next <= end {
return (self[pos], next)
}
// `end` must be a sub-character position that is between `pos` and the
// next grapheme boundary. This is okay if `end` is on a Unicode scalar
// boundary, but if it's in the middle of a scalar's code units, there
// may not be a character to return at all after rounding down. Use
// `Substring`'s rounding to determine what we can return.
let substr = self[pos..<end]
return substr.isEmpty
? nil
: (substr.first!, substr.endIndex)
}
func matchAnyNonNewline(
at currentPosition: String.Index,
limitedBy end: String.Index,
isScalarSemantics: Bool
) -> String.Index? {
guard currentPosition < end else { return nil }
if case .definite(let result) = _quickMatchAnyNonNewline(
at: currentPosition,
limitedBy: end,
isScalarSemantics: isScalarSemantics
) {
assert(result == _thoroughMatchAnyNonNewline(
at: currentPosition,
limitedBy: end,
isScalarSemantics: isScalarSemantics))
return result
}
return _thoroughMatchAnyNonNewline(
at: currentPosition,
limitedBy: end,
isScalarSemantics: isScalarSemantics)
}
@inline(__always)
private func _quickMatchAnyNonNewline(
at currentPosition: String.Index,
limitedBy end: String.Index,
isScalarSemantics: Bool
) -> QuickResult<String.Index?> {
assert(currentPosition < end)
guard let (asciiValue, next, isCRLF) = _quickASCIICharacter(
at: currentPosition, limitedBy: end
) else {
return .unknown
}
switch asciiValue {
case (._lineFeed)...(._carriageReturn):
return .definite(nil)
default:
assert(!isCRLF)
return .definite(next)
}
}
@inline(never)
private func _thoroughMatchAnyNonNewline(
at currentPosition: String.Index,
limitedBy end: String.Index,
isScalarSemantics: Bool
) -> String.Index? {
if isScalarSemantics {
guard currentPosition < end else { return nil }
let scalar = unicodeScalars[currentPosition]
guard !scalar.isNewline else { return nil }
return unicodeScalars.index(after: currentPosition)
}
guard let (char, next) = characterAndEnd(at: currentPosition, limitedBy: end),
!char.isNewline
else { return nil }
return next
}
internal func matchRegexDot(
at currentPosition: Index,
limitedBy end: Index,
anyMatchesNewline: Bool,
isScalarSemantics: Bool
) -> Index? {
guard currentPosition < end else { return nil }
if anyMatchesNewline {
return index(
after: currentPosition, isScalarSemantics: isScalarSemantics)
}
return matchAnyNonNewline(
at: currentPosition,
limitedBy: end,
isScalarSemantics: isScalarSemantics)
}
}
// MARK: - Built-in character class matching
extension String {
// Mentioned in ProgrammersManual.md, update docs if redesigned
func matchBuiltinCC(
_ cc: _CharacterClassModel.Representation,
at currentPosition: String.Index,
limitedBy end: String.Index,
isInverted: Bool,
isStrictASCII: Bool,
isScalarSemantics: Bool
) -> String.Index? {
guard currentPosition < end else { return nil }
if case .definite(let result) = _quickMatchBuiltinCC(
cc,
at: currentPosition,
limitedBy: end,
isInverted: isInverted,
isStrictASCII: isStrictASCII,
isScalarSemantics: isScalarSemantics
) {
assert(result == _thoroughMatchBuiltinCC(
cc,
at: currentPosition,
limitedBy: end,
isInverted: isInverted,
isStrictASCII: isStrictASCII,
isScalarSemantics: isScalarSemantics))
return result
}
return _thoroughMatchBuiltinCC(
cc,
at: currentPosition,
limitedBy: end,
isInverted: isInverted,
isStrictASCII: isStrictASCII,
isScalarSemantics: isScalarSemantics)
}
// Mentioned in ProgrammersManual.md, update docs if redesigned
@inline(__always)
private func _quickMatchBuiltinCC(
_ cc: _CharacterClassModel.Representation,
at currentPosition: String.Index,
limitedBy end: String.Index,
isInverted: Bool,
isStrictASCII: Bool,
isScalarSemantics: Bool
) -> QuickResult<String.Index?> {
assert(currentPosition < end)
guard let (next, result) = _quickMatch(
cc,
at: currentPosition,
limitedBy: end,
isScalarSemantics: isScalarSemantics
) else {
return .unknown
}
return .definite(result == isInverted ? nil : next)
}
// Mentioned in ProgrammersManual.md, update docs if redesigned
@inline(never)
private func _thoroughMatchBuiltinCC(
_ cc: _CharacterClassModel.Representation,
at currentPosition: String.Index,
limitedBy end: String.Index,
isInverted: Bool,
isStrictASCII: Bool,
isScalarSemantics: Bool
) -> String.Index? {
// TODO: Branch here on scalar semantics
// Don't want to pay character cost if unnecessary
guard let (char, nextIndex) =
characterAndEnd(at: currentPosition, limitedBy: end)
else { return nil }
var next = nextIndex
let scalar = unicodeScalars[currentPosition]
let asciiCheck = !isStrictASCII
|| (scalar.isASCII && isScalarSemantics)
|| char.isASCII
var matched: Bool
if isScalarSemantics && cc != .anyGrapheme {
next = unicodeScalars.index(after: currentPosition)
}
switch cc {
case .any, .anyGrapheme:
matched = true
case .digit:
if isScalarSemantics {
matched = scalar.properties.numericType != nil && asciiCheck
} else {
matched = char.isNumber && asciiCheck
}
case .horizontalWhitespace:
if isScalarSemantics {
matched = scalar.isHorizontalWhitespace && asciiCheck
} else {
matched = char._isHorizontalWhitespace && asciiCheck
}
case .verticalWhitespace:
if isScalarSemantics {
matched = scalar.isNewline && asciiCheck
} else {
matched = char._isNewline && asciiCheck
}
case .newlineSequence:
if isScalarSemantics {
matched = scalar.isNewline && asciiCheck
if matched && scalar == "\r"
&& next < end && unicodeScalars[next] == "\n" {
// Match a full CR-LF sequence even in scalar semantics
unicodeScalars.formIndex(after: &next)
}
} else {
matched = char._isNewline && asciiCheck
}
case .whitespace:
if isScalarSemantics {
matched = scalar.properties.isWhitespace && asciiCheck
} else {
matched = char.isWhitespace && asciiCheck
}
case .word:
if isScalarSemantics {
matched = scalar.properties.isAlphabetic && asciiCheck
} else {
matched = char.isWordCharacter && asciiCheck
}
}
if isInverted {
matched.toggle()
}
guard matched else {
return nil
}
return next
}
}
|