|
10 | 10 | //
|
11 | 11 | //===----------------------------------------------------------------------===//
|
12 | 12 |
|
| 13 | +//////////////////////////////////////////////////////////////////////////////// |
| 14 | +// WARNING: This file is manually generated from .gyb template and should not |
| 15 | +// be directly modified. Instead, make changes to Suffix.swift.gyb and run |
| 16 | +// scripts/generate_harness/generate_harness.py to regenerate this file. |
| 17 | +//////////////////////////////////////////////////////////////////////////////// |
| 18 | + |
13 | 19 | import TestsUtils
|
14 | 20 |
|
15 |
| -let reps = 1 |
16 | 21 | let sequenceCount = 4096
|
17 | 22 | let prefixCount = 1024
|
18 | 23 | let dropCount = sequenceCount - prefixCount
|
19 |
| -let sumCount = prefixCount * (prefixCount-1) / 2 |
| 24 | +let sumCount = prefixCount * (prefixCount - 1) / 2 |
| 25 | + |
20 | 26 |
|
21 | 27 | @inline(never)
|
22 | 28 | public func run_DropLastCountableRange(_ N: Int) {
|
23 |
| - let s = 0 ..< sequenceCount |
| 29 | + let s = 0..<sequenceCount |
24 | 30 | for _ in 1...20*N {
|
25 |
| - for _ in 1...reps { |
26 |
| - var result = 0 |
27 |
| - for element in s.dropLast(dropCount) { |
28 |
| - result += element |
29 |
| - } |
30 |
| - CheckResults(result == sumCount, |
31 |
| - "IncorrectResults in DropLastCountableRange: \(result) != \(sumCount)") |
| 31 | + var result = 0 |
| 32 | + for element in s.dropLast(dropCount) { |
| 33 | + result += element |
32 | 34 | }
|
| 35 | + CheckResults(result == sumCount, |
| 36 | + "IncorrectResults in DropLastCountableRange: \(result) != \(sumCount)") |
33 | 37 | }
|
34 | 38 | }
|
35 |
| - |
36 |
| -fileprivate struct MySequence: Sequence { |
37 |
| - let range: CountableRange<Int> |
38 |
| - public func makeIterator() -> IndexingIterator<CountableRange<Int>> { |
39 |
| - return range.makeIterator() |
40 |
| - } |
41 |
| -} |
42 |
| - |
43 | 39 | @inline(never)
|
44 | 40 | public func run_DropLastSequence(_ N: Int) {
|
45 |
| - let s = MySequence(range: 0 ..< sequenceCount) |
| 41 | + let s = sequence(first: 0) { $0 < sequenceCount - 1 ? $0 &+ 1 : nil } |
46 | 42 | for _ in 1...20*N {
|
47 |
| - for _ in 1...reps { |
48 |
| - var result = 0 |
49 |
| - for element in s.dropLast(dropCount) { |
50 |
| - result += element |
51 |
| - } |
52 |
| - CheckResults(result == sumCount, |
53 |
| - "IncorrectResults in DropLastSequence: \(result) != \(sumCount)") |
| 43 | + var result = 0 |
| 44 | + for element in s.dropLast(dropCount) { |
| 45 | + result += element |
54 | 46 | }
|
| 47 | + CheckResults(result == sumCount, |
| 48 | + "IncorrectResults in DropLastSequence: \(result) != \(sumCount)") |
55 | 49 | }
|
56 | 50 | }
|
57 |
| - |
58 | 51 | @inline(never)
|
59 | 52 | public func run_DropLastAnySequence(_ N: Int) {
|
60 |
| - let s = AnySequence(0 ..< sequenceCount) |
| 53 | + let s = AnySequence(sequence(first: 0) { $0 < sequenceCount - 1 ? $0 &+ 1 : nil }) |
61 | 54 | for _ in 1...20*N {
|
62 |
| - for _ in 1...reps { |
63 |
| - var result = 0 |
64 |
| - for element in s.dropLast(dropCount) { |
65 |
| - result += element |
66 |
| - } |
67 |
| - CheckResults(result == sumCount, |
68 |
| - "IncorrectResults in DropLastAnySequence: \(result) != \(sumCount)") |
| 55 | + var result = 0 |
| 56 | + for element in s.dropLast(dropCount) { |
| 57 | + result += element |
69 | 58 | }
|
| 59 | + CheckResults(result == sumCount, |
| 60 | + "IncorrectResults in DropLastAnySequence: \(result) != \(sumCount)") |
| 61 | + } |
| 62 | +} |
| 63 | +@inline(never) |
| 64 | +public func run_DropLastAnySeqCntRange(_ N: Int) { |
| 65 | + let s = AnySequence(0..<sequenceCount) |
| 66 | + for _ in 1...20*N { |
| 67 | + var result = 0 |
| 68 | + for element in s.dropLast(dropCount) { |
| 69 | + result += element |
| 70 | + } |
| 71 | + CheckResults(result == sumCount, |
| 72 | + "IncorrectResults in DropLastAnySeqCntRange: \(result) != \(sumCount)") |
| 73 | + } |
| 74 | +} |
| 75 | +@inline(never) |
| 76 | +public func run_DropLastAnyCollection(_ N: Int) { |
| 77 | + let s = AnyCollection(0..<sequenceCount) |
| 78 | + for _ in 1...20*N { |
| 79 | + var result = 0 |
| 80 | + for element in s.dropLast(dropCount) { |
| 81 | + result += element |
| 82 | + } |
| 83 | + CheckResults(result == sumCount, |
| 84 | + "IncorrectResults in DropLastAnyCollection: \(result) != \(sumCount)") |
70 | 85 | }
|
71 | 86 | }
|
72 |
| - |
73 | 87 | @inline(never)
|
74 | 88 | public func run_DropLastArray(_ N: Int) {
|
75 |
| - let s = Array(0 ..< sequenceCount) |
| 89 | + let s = Array(0..<sequenceCount) |
| 90 | + for _ in 1...20*N { |
| 91 | + var result = 0 |
| 92 | + for element in s.dropLast(dropCount) { |
| 93 | + result += element |
| 94 | + } |
| 95 | + CheckResults(result == sumCount, |
| 96 | + "IncorrectResults in DropLastArray: \(result) != \(sumCount)") |
| 97 | + } |
| 98 | +} |
| 99 | +@inline(never) |
| 100 | +public func run_DropLastCountableRangeLazy(_ N: Int) { |
| 101 | + let s = (0..<sequenceCount).lazy |
| 102 | + for _ in 1...20*N { |
| 103 | + var result = 0 |
| 104 | + for element in s.dropLast(dropCount) { |
| 105 | + result += element |
| 106 | + } |
| 107 | + CheckResults(result == sumCount, |
| 108 | + "IncorrectResults in DropLastCountableRangeLazy: \(result) != \(sumCount)") |
| 109 | + } |
| 110 | +} |
| 111 | +@inline(never) |
| 112 | +public func run_DropLastSequenceLazy(_ N: Int) { |
| 113 | + let s = (sequence(first: 0) { $0 < sequenceCount - 1 ? $0 &+ 1 : nil }).lazy |
| 114 | + for _ in 1...20*N { |
| 115 | + var result = 0 |
| 116 | + for element in s.dropLast(dropCount) { |
| 117 | + result += element |
| 118 | + } |
| 119 | + CheckResults(result == sumCount, |
| 120 | + "IncorrectResults in DropLastSequenceLazy: \(result) != \(sumCount)") |
| 121 | + } |
| 122 | +} |
| 123 | +@inline(never) |
| 124 | +public func run_DropLastAnySequenceLazy(_ N: Int) { |
| 125 | + let s = (AnySequence(sequence(first: 0) { $0 < sequenceCount - 1 ? $0 &+ 1 : nil })).lazy |
| 126 | + for _ in 1...20*N { |
| 127 | + var result = 0 |
| 128 | + for element in s.dropLast(dropCount) { |
| 129 | + result += element |
| 130 | + } |
| 131 | + CheckResults(result == sumCount, |
| 132 | + "IncorrectResults in DropLastAnySequenceLazy: \(result) != \(sumCount)") |
| 133 | + } |
| 134 | +} |
| 135 | +@inline(never) |
| 136 | +public func run_DropLastAnySeqCntRangeLazy(_ N: Int) { |
| 137 | + let s = (AnySequence(0..<sequenceCount)).lazy |
| 138 | + for _ in 1...20*N { |
| 139 | + var result = 0 |
| 140 | + for element in s.dropLast(dropCount) { |
| 141 | + result += element |
| 142 | + } |
| 143 | + CheckResults(result == sumCount, |
| 144 | + "IncorrectResults in DropLastAnySeqCntRangeLazy: \(result) != \(sumCount)") |
| 145 | + } |
| 146 | +} |
| 147 | +@inline(never) |
| 148 | +public func run_DropLastAnyCollectionLazy(_ N: Int) { |
| 149 | + let s = (AnyCollection(0..<sequenceCount)).lazy |
| 150 | + for _ in 1...20*N { |
| 151 | + var result = 0 |
| 152 | + for element in s.dropLast(dropCount) { |
| 153 | + result += element |
| 154 | + } |
| 155 | + CheckResults(result == sumCount, |
| 156 | + "IncorrectResults in DropLastAnyCollectionLazy: \(result) != \(sumCount)") |
| 157 | + } |
| 158 | +} |
| 159 | +@inline(never) |
| 160 | +public func run_DropLastArrayLazy(_ N: Int) { |
| 161 | + let s = (Array(0..<sequenceCount)).lazy |
76 | 162 | for _ in 1...20*N {
|
77 |
| - for _ in 1...reps { |
78 |
| - var result = 0 |
79 |
| - for element in s.dropLast(dropCount) { |
80 |
| - result += element |
81 |
| - } |
82 |
| - CheckResults(result == sumCount, |
83 |
| - "IncorrectResults in DropLastArray: \(result) != \(sumCount)") |
| 163 | + var result = 0 |
| 164 | + for element in s.dropLast(dropCount) { |
| 165 | + result += element |
84 | 166 | }
|
| 167 | + CheckResults(result == sumCount, |
| 168 | + "IncorrectResults in DropLastArrayLazy: \(result) != \(sumCount)") |
85 | 169 | }
|
86 | 170 | }
|
0 commit comments