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
|
//===--- QueueTest.swift --------------------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 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 the list of Swift project authors
//
//===----------------------------------------------------------------------===//
import TestsUtils
public let benchmarks = [
BenchmarkInfo(
name: "QueueGeneric",
runFunction: run_QueueGeneric,
tags: [.validation, .api],
setUpFunction: { buildWorkload() },
legacyFactor: 10),
BenchmarkInfo(
name: "QueueConcrete",
runFunction: run_QueueConcrete,
tags: [.validation, .api],
setUpFunction: { buildWorkload() },
legacyFactor: 10),
]
// TODO: remove when there is a native equivalent in the std lib
extension RangeReplaceableCollection where Self: BidirectionalCollection {
public mutating func popLast() -> Element? {
if isEmpty { return nil}
else { return removeLast() }
}
}
public struct Queue<Storage: RangeReplaceableCollection>
where Storage: BidirectionalCollection {
public typealias Element = Storage.Element
internal var _in: Storage
internal var _out: Storage
public init() {
_in = Storage()
_out = Storage()
}
}
extension Queue {
public mutating func enqueue(_ newElement: Element) {
_in.append(newElement)
}
public mutating func dequeue() -> Element? {
if _out.isEmpty {
_out.append(contentsOf: _in.reversed())
_in.removeAll()
}
return _out.popLast()
}
}
func testQueue<Elements: Collection>(elements: Elements)
where Elements.Element: Equatable {
var q = Queue<[Elements.Element]>()
for x in elements { q.enqueue(x) }
let results = sequence(state: q) { $0.dequeue() }
let i = results.reduce(0, { i,_ in i &+ 1 })
for x in elements { q.enqueue(x) }
let j = results.reduce(i, { i,_ in i &+ 1 })
check(j == elements.count*2)
}
let n = 1_000
let workload = (0..<n).map { "\($0): A long enough string to defeat the SSO, or so I hope." }
public func buildWorkload() {
let contents = workload
_ = contents.reduce(0) { $0 + $1.count }
}
@inline(never)
func run_QueueGeneric(_ scale: Int) {
for _ in 0..<scale {
testQueue(elements: workload)
}
}
public struct ConcreteQueue {
internal var _in: [String]
internal var _out: [String]
public init() {
_in = Array()
_out = Array()
}
}
extension ConcreteQueue {
public mutating func enqueue(_ newElement: String) {
_in.append(newElement)
}
public mutating func dequeue() -> String? {
if _out.isEmpty {
_out.append(contentsOf: _in.reversed())
_in.removeAll()
}
return _out.popLast()
}
}
func testConcreteQueue(elements: [String]) {
var q = ConcreteQueue()
for x in elements { q.enqueue(x) }
let results = sequence(state: q) { $0.dequeue() }
let i = results.reduce(0, { i,_ in i &+ 1 })
for x in elements { q.enqueue(x) }
let j = results.reduce(i, { i,_ in i &+ 1 })
check(j == elements.count*2)
}
@inline(never)
func run_QueueConcrete(_ scale: Int) {
for _ in 0..<scale {
testConcreteQueue(elements: workload)
}
}
|
