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
|
/*
This source file is part of the Swift.org open source project
Copyright (c) 2021 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
See https://swift.org/CONTRIBUTORS.txt for Swift project authors
*/
import XCTest
import Markdown
final class EditPerformanceTests: XCTestCase {
#if os(Windows)
#if DEBUG
static let maxDepth = 625
#else
static let maxDepth = 1250
#endif
#else
static let maxDepth = 5000
#endif
/// Test the performance of changing a leaf in an unrealistically deep markup tree.
func testChangeTextInDeepTree() {
func buildDeepListItem(depth: Int) -> ListItem {
guard depth < EditPerformanceTests.maxDepth else {
return ListItem(Paragraph(Text("A"), Text("B"), Text("C")))
}
return ListItem(buildDeepList(depth: depth + 1))
}
func buildDeepList(depth: Int = 0) -> UnorderedList {
guard depth < EditPerformanceTests.maxDepth else {
return UnorderedList(buildDeepListItem(depth: depth))
}
return UnorderedList(buildDeepListItem(depth: depth + 1))
}
let list = buildDeepList()
var deepChild: Markup = list
while let child = deepChild.child(at: 0) {
deepChild = child
}
var deepText = (deepChild as! Text)
measure {
deepText.string = "Z"
}
}
/// Test the performance of change an element among unrealistically many siblings.
func testChangeTextInWideParagraph() {
let paragraph = Paragraph((0..<10000).map { _ in Text("OK") })
var firstText = paragraph.child(at: 0) as! Text
measure {
firstText.string = "OK"
}
}
}
|
