forked from swiftlang/swift-experimental-string-processing
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAlgorithmsTests.swift
633 lines (548 loc) · 22.9 KB
/
AlgorithmsTests.swift
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
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
import _StringProcessing
import XCTest
// TODO: Protocol-powered testing
class RegexConsumerTests: XCTestCase {
}
var enablePrinting = false
func output<T>(_ s: @autoclosure () -> T) {
if enablePrinting {
print(s())
}
}
func makeSingleUseSequence<T>(element: T, count: Int) -> UnfoldSequence<T, Void> {
var count = count
return sequence(state: ()) { _ in
defer { count -= 1 }
return count > 0 ? element : nil
}
}
struct CountedOptionSet: OptionSet {
static var arrayLiteralCreationCount = 0
var rawValue: Int
static var one = Self(rawValue: 1)
static var two = Self(rawValue: 1)
}
extension CountedOptionSet {
init(arrayLiteral: Self...) {
Self.arrayLiteralCreationCount += 1
self.rawValue = 0
for element in arrayLiteral {
self.insert(element)
}
}
}
class AlgorithmTests: XCTestCase {
func testContains() {
XCTAssertTrue("abcde".contains("a"))
XCTAssertTrue("abcde".contains("e" as Character))
XCTExpectFailure {
XCTAssertTrue("".contains(""))
XCTAssertTrue("abcde".contains(""))
}
XCTAssertTrue("abcde".contains("abcd"))
XCTAssertTrue("abcde".contains("bcde"))
XCTAssertTrue("abcde".contains("bcd"))
XCTAssertTrue("ababacabababa".contains("abababa"))
XCTAssertTrue("bbababacabababa".contains("abababa"))
XCTAssertFalse("bbababacbbababa".contains("abababa"))
let str = "abcde"
let pattern = "bcde"
XCTAssertTrue(str[...].contains(pattern))
XCTAssertTrue(str.contains(pattern[...]))
XCTAssertTrue(str[...].contains(pattern[...]))
XCTAssertFalse("".contains("abcd"))
for start in 0..<9 {
for end in start..<9 {
XCTAssertTrue((0..<10).contains(start...end))
XCTAssertFalse((0..<10).contains(start...10))
}
}
}
func testContainsSourceCompatibility() {
CountedOptionSet.arrayLiteralCreationCount = 0
let both: CountedOptionSet = [.one, .two]
let none: CountedOptionSet = []
XCTAssertEqual(CountedOptionSet.arrayLiteralCreationCount, 2)
let cosArray = [both, .one, .two]
XCTAssertFalse(cosArray.contains(none))
// This tests that `contains([])` uses the element-based `contains(_:)`
// method, interpreting `[]` as an instance of `CountedOptionSet`, rather
// than the collection-based overload, which would interpret `[]` as an
// `Array<CountedOptionSet>`.
XCTAssertFalse(cosArray.contains([]))
XCTAssertEqual(CountedOptionSet.arrayLiteralCreationCount, 3)
// For these references to resolve to the `Element`-based stdlib function,
// the `String`- and `Substring`-based `contains` functions need to be
// marked as `@_disfavoredOverload`. However, that means that Foundation's
// `String.contains` get selected instead, which has inconsistent behavior.
// Test that original `contains` functions are still accessible
// rdar://105502403
// Error: constructing SILType with type that should have been eliminated by SIL lowering
// let containsRef = "abcd".contains
// XCTAssert(type(of: containsRef) == ((Character) -> Bool).self)
// let containsParamsRef = "abcd".contains(_:)
// XCTAssert(type(of: containsParamsRef) == ((Character) -> Bool).self)
}
func testRegexRanges() {
func expectRanges(
_ string: String,
_ regex: String,
_ expected: [Range<Int>],
file: StaticString = #file, line: UInt = #line
) {
let regex = try! Regex(regex)
let actualSeq: [Range<Int>] = string[...].ranges(of: regex).map(string.offsets(of:))
XCTAssertEqual(actualSeq, expected, file: file, line: line)
// `IndexingIterator` tests the collection conformance
let actualCol: [Range<Int>] = string[...].ranges(of: regex)[...].map(string.offsets(of:))
XCTAssertEqual(actualCol, expected, file: file, line: line)
let matchRanges = string.matches(of: regex).map { string.offsets(of: $0.range) }
XCTAssertEqual(matchRanges, expected, file: file, line: line)
let firstRange = string.firstRange(of: regex).map(string.offsets(of:))
XCTAssertEqual(firstRange, expected.first, file: file, line: line)
}
expectRanges("", "", [0..<0])
expectRanges("", "x", [])
expectRanges("", "x+", [])
expectRanges("", "x*", [0..<0])
expectRanges("aaa", "a*", [0..<3, 3..<3])
expectRanges("abc", "", [0..<0, 1..<1, 2..<2, 3..<3])
expectRanges("abc", "x", [])
expectRanges("abc", "x+", [])
expectRanges("abc", "x*", [0..<0, 1..<1, 2..<2, 3..<3])
expectRanges("abc", "a", [0..<1])
expectRanges("abc", "a*", [0..<1, 1..<1, 2..<2, 3..<3])
expectRanges("abc", "a+", [0..<1])
expectRanges("abc", "a|b", [0..<1, 1..<2])
expectRanges("abc", "a|b+", [0..<1, 1..<2])
expectRanges("abc", "a|b*", [0..<1, 1..<2, 2..<2, 3..<3])
expectRanges("abc", "(a|b)+", [0..<2])
expectRanges("abc", "(a|b)*", [0..<2, 2..<2, 3..<3])
expectRanges("abc", "(b|c)+", [1..<3])
expectRanges("abc", "(b|c)*", [0..<0, 1..<3, 3..<3])
}
func testStringRanges() {
func expectRanges(
_ input: String,
_ pattern: String,
_ expected: [Range<Int>],
file: StaticString = #file, line: UInt = #line
) {
let actualSeq: [Range<Int>] = input.ranges(of: pattern).map(input.offsets(of:))
XCTAssertEqual(actualSeq, expected, file: file, line: line)
let a1: [Range<Int>] = input[...].ranges(of: pattern).map(input.offsets(of:))
let a2: [Range<Int>] = input.ranges(of: pattern[...]).map(input.offsets(of:))
let a3: [Range<Int>] = input[...].ranges(of: pattern[...]).map(input.offsets(of:))
XCTAssertEqual(a1, expected, file: file, line: line)
XCTAssertEqual(a2, expected, file: file, line: line)
XCTAssertEqual(a3, expected, file: file, line: line)
// `IndexingIterator` tests the collection conformance
let actualCol: [Range<Int>] = input.ranges(of: pattern)[...].map(input.offsets(of:))
XCTAssertEqual(actualCol, expected, file: file, line: line)
let firstRange = input.firstRange(of: pattern)
XCTAssertEqual(firstRange.map(input.offsets(of:)), expected.first, file: file, line: line)
if let upperBound = firstRange?.upperBound, !pattern.isEmpty {
let secondRange = input[upperBound...].firstRange(of: pattern).map(input.offsets(of:))
XCTAssertEqual(secondRange, expected.dropFirst().first, file: file, line: line)
}
let r1 = input[...].firstRange(of: pattern)
let r2 = input.firstRange(of: pattern[...])
let r3 = input[...].firstRange(of: pattern[...])
XCTAssertEqual(r1.map(input.offsets(of:)), expected.first, file: file, line: line)
XCTAssertEqual(r2.map(input.offsets(of:)), expected.first, file: file, line: line)
XCTAssertEqual(r3.map(input.offsets(of:)), expected.first, file: file, line: line)
}
expectRanges("", "", [0..<0])
expectRanges("abcde", "", [0..<0, 1..<1, 2..<2, 3..<3, 4..<4, 5..<5])
expectRanges("abcde", "abcd", [0..<4])
expectRanges("abcde", "bcde", [1..<5])
expectRanges("abcde", "bcd", [1..<4])
expectRanges("ababacabababa", "abababa", [6..<13])
expectRanges("ababacabababa", "aba", [0..<3, 6..<9, 10..<13])
// Test for rdar://92794248
expectRanges("ADACBADADACBADACB", "ADACB", [0..<5, 7..<12, 12..<17])
}
// rdar://105154010
func testFirstRangeMissingCrash() {
let str = "%2$@ %#@AROUND_TIME@"
let target = "%@"
XCTAssertNil(str.firstRange(of: target))
XCTAssertNil(str.dropFirst().dropLast().firstRange(of: target))
XCTAssertNil(str.dropFirst().dropLast().firstRange(of: target[...]))
XCTAssertNil(str.firstRange(of: target[...]))
}
func testRegexSplit() {
func expectSplit(
_ string: String,
_ regex: String,
_ expected: [Substring],
file: StaticString = #file, line: UInt = #line
) {
let regex = try! Regex(regex)
let actual = Array(string.split(separator: regex, omittingEmptySubsequences: false))
XCTAssertEqual(actual, expected, file: file, line: line)
}
expectSplit("", "", [""])
expectSplit("", "x", [""])
expectSplit("a", "", ["", "a", ""])
expectSplit("a", "x", ["a"])
expectSplit("a", "a", ["", ""])
expectSplit("a____a____a", "_+", ["a", "a", "a"])
expectSplit("____a____a____a____", "_+", ["", "a", "a", "a", ""])
}
func testStringSplit() {
func expectSplit(
_ string: String,
_ separator: String,
_ expected: [Substring],
file: StaticString = #file, line: UInt = #line
) {
let actual = Array(string.split(separator: separator, omittingEmptySubsequences: false))
XCTAssertEqual(actual, expected, file: file, line: line)
let a1 = Array(string[...].split(separator: separator, omittingEmptySubsequences: false))
let a2 = Array(string.split(separator: separator[...], omittingEmptySubsequences: false))
let a3 = Array(string[...].split(separator: separator[...], omittingEmptySubsequences: false))
XCTAssertEqual(a1, expected, file: file, line: line)
XCTAssertEqual(a2, expected, file: file, line: line)
XCTAssertEqual(a3, expected, file: file, line: line)
}
expectSplit("", "", [""])
expectSplit("", "x", [""])
expectSplit("a", "", ["", "a", ""])
expectSplit("a", "x", ["a"])
expectSplit("a", "a", ["", ""])
expectSplit("a__a__a", "_", ["a", "", "a", "", "a"])
expectSplit("_a_a_a_", "_", ["", "a", "a", "a", ""])
XCTAssertEqual("".split(separator: ""), [])
XCTAssertEqual("".split(separator: "", omittingEmptySubsequences: false), [""])
}
func testSplitSourceCompatibility() {
CountedOptionSet.arrayLiteralCreationCount = 0
let both: CountedOptionSet = [.one, .two]
let none: CountedOptionSet = []
XCTAssertEqual(CountedOptionSet.arrayLiteralCreationCount, 2)
let cosArray = [both, .one, .two]
XCTAssertEqual(cosArray.split(separator: none).count, 1)
// This tests that `contains([])` uses the element-based `contains(_:)`
// method, interpreting `[]` as an instance of `CountedOptionSet`, rather
// than the collection-based overload, which would interpret `[]` as an
// `Array<CountedOptionSet>`.
XCTAssertEqual(cosArray.split(separator: []).count, 1)
XCTAssertEqual(CountedOptionSet.arrayLiteralCreationCount, 3)
// Test that original `split` functions are still accessible
// rdar://105502403
// Error: constructing SILType with type that should have been eliminated by SIL lowering
// let splitRef = "abcd".split
// XCTAssert(type(of: splitRef) == ((Character, Int, Bool) -> [Substring]).self)
// let splitParamsRef = "abcd".split(separator:maxSplits:omittingEmptySubsequences:)
// XCTAssert(type(of: splitParamsRef) == ((Character, Int, Bool) -> [Substring]).self)
}
func testSplitPermutations() throws {
let splitRegex = try Regex(#"\|"#)
XCTAssertEqual(
"a|a|||a|a".split(separator: splitRegex),
["a", "a", "a", "a"])
XCTAssertEqual(
"a|a|||a|a".split(separator: splitRegex, omittingEmptySubsequences: false),
["a", "a", "", "", "a", "a"])
XCTAssertEqual(
"a|a|||a|a".split(separator: splitRegex, maxSplits: 2),
["a", "a", "||a|a"])
XCTAssertEqual(
"a|a|||a|a|||a|a|||".split(separator: "|||"),
["a|a", "a|a", "a|a"])
XCTAssertEqual(
"a|a|||a|a|||a|a|||".split(separator: "|||", omittingEmptySubsequences: false),
["a|a", "a|a", "a|a", ""])
XCTAssertEqual(
"a|a|||a|a|||a|a|||".split(separator: "|||", maxSplits: 2),
["a|a", "a|a", "a|a|||"])
XCTAssertEqual(
"aaaa".split(separator: ""),
["a", "a", "a", "a"])
XCTAssertEqual(
"aaaa".split(separator: "", omittingEmptySubsequences: false),
["", "a", "a", "a", "a", ""])
XCTAssertEqual(
"aaaa".split(separator: "", maxSplits: 2),
["a", "a", "aa"])
XCTAssertEqual(
"aaaa".split(separator: "", maxSplits: 2, omittingEmptySubsequences: false),
["", "a", "aaa"])
// Fuzzing the input and parameters
for _ in 1...1_000 {
// Make strings that look like:
// "aaaaaaa"
// "|||aaaa||||"
// "a|a|aa|aa|"
// "|a||||aaa|a|||"
// "a|aa"
let keepCount = Int.random(in: 0...10)
let splitCount = Int.random(in: 0...10)
let str = [repeatElement("a", count: keepCount), repeatElement("|", count: splitCount)]
.joined()
.shuffled()
.joined()
let omitEmpty = Bool.random()
let maxSplits = Bool.random() ? Int.max : Int.random(in: 0...10)
// Use the stdlib behavior as the expected outcome
let expected = str.split(
separator: "|" as Character,
maxSplits: maxSplits,
omittingEmptySubsequences: omitEmpty)
let regexActual = str.split(
separator: splitRegex,
maxSplits: maxSplits,
omittingEmptySubsequences: omitEmpty)
let stringActual = str.split(
separator: "|" as String,
maxSplits: maxSplits,
omittingEmptySubsequences: omitEmpty)
XCTAssertEqual(regexActual, expected, """
Mismatch in regex split of '\(str)', maxSplits: \(maxSplits), omitEmpty: \(omitEmpty)
expected: \(expected.map(String.init))
actual: \(regexActual.map(String.init))
""")
XCTAssertEqual(stringActual, expected, """
Mismatch in string split of '\(str)', maxSplits: \(maxSplits), omitEmpty: \(omitEmpty)
expected: \(expected.map(String.init))
actual: \(stringActual.map(String.init))
""")
}
}
func testRegexTrim() {
func expectTrim(
_ string: String,
_ regex: String,
_ expected: Substring,
file: StaticString = #file, line: UInt = #line
) {
let regex = try! Regex(regex)
let actual = string.trimmingPrefix(regex)
XCTAssertEqual(actual, expected, file: file, line: line)
var actual2 = string
actual2.trimPrefix(regex)
XCTAssertEqual(actual2[...], expected, file: file, line: line)
}
expectTrim("", "", "")
expectTrim("", "x", "")
expectTrim("a", "", "a")
expectTrim("a", "x", "a")
expectTrim("___a", "_", "__a")
expectTrim("___a", "_+", "a")
}
func testPredicateTrim() {
func expectTrim(
_ string: String,
_ predicate: (Character) -> Bool,
_ expected: Substring,
file: StaticString = #file, line: UInt = #line
) {
let actual = string.trimmingPrefix(while: predicate)
XCTAssertEqual(actual, expected, file: file, line: line)
var actual2 = string
actual2.trimPrefix(while: predicate)
XCTAssertEqual(actual2[...], expected, file: file, line: line)
}
expectTrim("", \.isWhitespace, "")
expectTrim("a", \.isWhitespace, "a")
expectTrim(" ", \.isWhitespace, "")
expectTrim(" a", \.isWhitespace, "a")
expectTrim("a ", \.isWhitespace, "a ")
}
func testStringTrim() {
func expectTrim(
_ string: String,
_ pattern: String,
_ expected: Substring,
file: StaticString = #file, line: UInt = #line
) {
let actual = string.trimmingPrefix(pattern)
XCTAssertEqual(actual, expected, file: file, line: line)
var actual2 = string
actual2.trimPrefix(pattern)
XCTAssertEqual(actual2[...], expected, file: file, line: line)
}
expectTrim("", "", "")
expectTrim("", "x", "")
expectTrim("a", "", "a")
expectTrim("a", "x", "a")
expectTrim("a", "a", "")
expectTrim("___a", "_", "__a")
expectTrim("___a", "___", "a")
expectTrim("___a", "____", "___a")
expectTrim("___a", "___a", "")
do {
let prefix = makeSingleUseSequence(element: "_" as Character, count: 5)
XCTAssertEqual("_____a".trimmingPrefix(prefix), "a")
XCTAssertEqual("_____a".trimmingPrefix(prefix), "_____a")
}
do {
let prefix = makeSingleUseSequence(element: "_" as Character, count: 5)
XCTAssertEqual("a".trimmingPrefix(prefix), "a")
// The result of this next call is technically undefined, so this
// is just to test that it doesn't crash.
XCTAssertNotEqual("_____a".trimmingPrefix(prefix), "")
}
}
func testRegexReplace() {
func expectReplace(
_ string: String,
_ regex: String,
_ replacement: String,
_ expected: String,
file: StaticString = #file, line: UInt = #line
) {
let regex = try! Regex(regex)
let actual = string.replacing(regex, with: replacement)
XCTAssertEqual(actual, expected, file: file, line: line)
}
expectReplace("", "", "X", "X")
expectReplace("", "x", "X", "")
expectReplace("", "x*", "X", "X")
expectReplace("a", "", "X", "XaX")
expectReplace("a", "x", "X", "a")
expectReplace("a", "a", "X", "X")
expectReplace("a", "a+", "X", "X")
expectReplace("a", "a*", "X", "XX")
expectReplace("aab", "a", "X", "XXb")
expectReplace("aab", "a+", "X", "Xb")
expectReplace("aab", "a*", "X", "XXbX")
// FIXME: Test maxReplacements
// FIXME: Test closure-based replacement
}
func testStringReplace() {
func expectReplace(
_ string: String,
_ pattern: String,
_ replacement: String,
_ expected: String,
file: StaticString = #file, line: UInt = #line
) {
let actual = string.replacing(pattern, with: replacement)
XCTAssertEqual(actual, expected, file: file, line: line)
}
expectReplace("", "", "X", "X")
expectReplace("", "x", "X", "")
expectReplace("a", "", "X", "XaX")
expectReplace("a", "x", "X", "a")
expectReplace("a", "a", "X", "X")
expectReplace("aab", "a", "X", "XXb")
let str = "aabaaabaab"
XCTAssertEqual(
str.replacing("aab", with: "Z", maxReplacements: 1000),
"ZaZZ")
XCTAssertEqual(
str.replacing("aab", with: "Z", maxReplacements: 3),
"ZaZZ")
XCTAssertEqual(
str.replacing("aab", with: "Z", maxReplacements: 2),
"ZaZaab")
XCTAssertEqual(
str.replacing("aab", with: "Z", maxReplacements: 1),
"Zaaabaab")
XCTAssertEqual(
str.replacing("aab", with: "Z", maxReplacements: 0),
str)
}
func testSubstring() throws {
let s = "aaa | aaaaaa | aaaaaaaaaa"
let s1 = s.dropFirst(6) // "aaaaaa | aaaaaaaaaa"
let s2 = s1.dropLast(17) // "aa"
let regex = try! Regex("a+")
XCTAssertEqual(s.firstMatch(of: regex)?.0, "aaa")
XCTAssertEqual(s1.firstMatch(of: regex)?.0, "aaaaaa")
XCTAssertEqual(s2.firstMatch(of: regex)?.0, "aa")
XCTAssertEqual(
s.ranges(of: regex).map(s.offsets(of:)),
[0..<3, 6..<12, 15..<25])
XCTAssertEqual(
s1.ranges(of: regex).map(s.offsets(of:)),
[6..<12, 15..<25])
XCTAssertEqual(
s2.ranges(of: regex).map(s.offsets(of:)),
[6..<8])
XCTAssertEqual(s.replacing(regex, with: ""), " | | ")
XCTAssertEqual(s1.replacing(regex, with: ""), " | ")
XCTAssertEqual(s2.replacing(regex, with: ""), "")
XCTAssertEqual(s.replacing("aa", with: "Z"), "Za | ZZZ | ZZZZZ")
XCTAssertEqual(s.replacing("aa" as Substring, with: "Z"), "Za | ZZZ | ZZZZZ")
XCTAssertEqual(s.replacing("aa", with: "Z" as Substring), "Za | ZZZ | ZZZZZ")
XCTAssertEqual(s.replacing("aa" as Substring, with: "Z" as Substring), "Za | ZZZ | ZZZZZ")
XCTAssertEqual(s1.replacing("aa", with: "Z"), "ZZZ | ZZZZZ")
XCTAssertEqual(s1.replacing("aa", with: "Z" as Substring), "ZZZ | ZZZZZ")
XCTAssertEqual(s1.replacing("aa" as Substring, with: "Z"), "ZZZ | ZZZZZ")
XCTAssertEqual(s1.replacing("aa" as Substring, with: "Z" as Substring), "ZZZ | ZZZZZ")
XCTAssertEqual(
s.matches(of: regex).map(\.0),
["aaa", "aaaaaa", "aaaaaaaaaa"])
XCTAssertEqual(
s1.matches(of: regex).map(\.0),
["aaaaaa", "aaaaaaaaaa"])
XCTAssertEqual(
s2.matches(of: regex).map(\.0),
["aa"])
XCTAssertEqual(
s2.matches(of: try Regex("a*?")).map { s2.offsets(of: $0.range) }, [0..<0, 1..<1, 2..<2])
XCTAssertEqual(
s2.ranges(of: try Regex("a*?")).map(s2.offsets(of:)), [0..<0, 1..<1, 2..<2])
func checkContains(
_ expected: Bool,
_ a: some StringProtocol,
_ b: some StringProtocol,
file: StaticString = #file, line: UInt = #line
) {
let result = a.firstRange(of: b) != nil
XCTAssertEqual(expected, result, file: file, line: line)
}
// Make sure that searching doesn't match over a substring boundary, even
// when the boundary is in the middle of a character.
let cafe = "c\u{302}afe\u{301}"
let cafeStringDropLastScalar = "c\u{302}afe"
let cafeStringDropFirstScalar = "\u{302}afe\u{301}"
let cafeSubDropLastScalar =
cafe[..<(cafe.unicodeScalars.index(before: cafe.endIndex))]
let cafeSubDropFirstScalar =
cafe[cafe.unicodeScalars.index(after: cafe.startIndex)...]
checkContains(false, cafe, cafeStringDropLastScalar)
checkContains(false, cafe, cafeStringDropFirstScalar)
checkContains(false, cafe, cafeSubDropLastScalar)
checkContains(false, cafe, cafeSubDropFirstScalar)
checkContains(false, cafe, "afe")
checkContains(true, cafe, "afé")
checkContains(true, cafe, "ĉaf")
checkContains(false, cafeSubDropLastScalar, "afe\u{301}")
checkContains(false, cafeSubDropLastScalar, "afé")
checkContains(true, cafeSubDropLastScalar, "afe")
checkContains(true, cafeSubDropLastScalar, cafeStringDropLastScalar)
checkContains(false, cafeSubDropFirstScalar, "c\u{302}af")
checkContains(false, cafeSubDropFirstScalar, "ĉaf")
checkContains(true, cafeSubDropFirstScalar, "\u{302}af")
checkContains(true, cafeSubDropFirstScalar, cafeStringDropFirstScalar)
}
func testUnicodeScalarSemantics() throws {
let regex = try Regex(#"."#, as: Substring.self).matchingSemantics(.unicodeScalar)
let emptyRegex = try Regex(#"z?"#, as: Substring.self).matchingSemantics(.unicodeScalar)
XCTAssertEqual("".matches(of: regex).map(\.output), [])
XCTAssertEqual("Café".matches(of: regex).map(\.output), ["C", "a", "f", "é"])
XCTAssertEqual("Cafe\u{301}".matches(of: regex).map(\.output), ["C", "a", "f", "e", "\u{301}"])
XCTAssertEqual("Cafe\u{301}".matches(of: emptyRegex).count, 6)
XCTAssertEqual("Café".ranges(of: regex).count, 4)
XCTAssertEqual("Cafe\u{301}".ranges(of: regex).count, 5)
XCTAssertEqual("Cafe\u{301}".ranges(of: emptyRegex).count, 6)
XCTAssertEqual("Café".replacing(regex, with: "-"), "----")
XCTAssertEqual("Cafe\u{301}".replacing(regex, with: "-"), "-----")
XCTAssertEqual("Café".replacing(emptyRegex, with: "-"), "-C-a-f-é-")
XCTAssertEqual("Cafe\u{301}".replacing(emptyRegex, with: "-"), "-C-a-f-e-\u{301}-")
}
}