forked from swiftlang/swift
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDictionaryRemove.swift
61 lines (51 loc) · 1.67 KB
/
DictionaryRemove.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
//===--- DictionaryRemove.swift -------------------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2017 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
//
//===----------------------------------------------------------------------===//
// Dictionary element removal benchmark
// rdar://problem/19804127
import TestsUtils
let t: [BenchmarkCategory] = [.validation, .api, .Dictionary]
let size = 100
let numberMap = Dictionary(uniqueKeysWithValues: zip(1...size, 1...size))
let boxedNums = (1...size).lazy.map { Box($0) }
let boxedNumMap = Dictionary(uniqueKeysWithValues: zip(boxedNums, boxedNums))
public let DictionaryRemove = [
BenchmarkInfo(name: "DictionaryRemove",
runFunction: remove, tags: t, legacyFactor: 10),
BenchmarkInfo(name: "DictionaryRemoveOfObjects",
runFunction: removeObjects, tags: t, legacyFactor: 100),
]
class Box<T : Hashable> : Hashable {
var value: T
init(_ v: T) {
value = v
}
func hash(into hasher: inout Hasher) {
hasher.combine(value)
}
static func ==(lhs: Box, rhs: Box) -> Bool {
return lhs.value == rhs.value
}
}
func remove(N: Int) {
for _ in 1...100*N {
var dict = numberMap
for i in 1...size { dict.removeValue(forKey: i) }
CheckResults(dict.isEmpty)
}
}
func removeObjects(N: Int) {
for _ in 1...10*N {
var dict = boxedNumMap
for i in 1...size { dict.removeValue(forKey: Box(i)) }
CheckResults(dict.isEmpty)
}
}