File: ChainedFilterMap.swift

package info (click to toggle)
swiftlang 6.0.3-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 2,519,992 kB
  • sloc: cpp: 9,107,863; ansic: 2,040,022; asm: 1,135,751; python: 296,500; objc: 82,456; f90: 60,502; lisp: 34,951; pascal: 19,946; sh: 18,133; perl: 7,482; ml: 4,937; javascript: 4,117; makefile: 3,840; awk: 3,535; xml: 914; fortran: 619; cs: 573; ruby: 573
file content (44 lines) | stat: -rw-r--r-- 1,136 bytes parent folder | download 
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
 
import TestsUtils

public let benchmarks = [
  BenchmarkInfo(name: "ChainedFilterMap", runFunction: run_ChainedFilterMap,
    tags: [.algorithm], setUpFunction: { blackHole(first100k) },
    legacyFactor: 9),
  BenchmarkInfo(name: "FatCompactMap", runFunction: run_FatCompactMap,
    tags: [.algorithm], setUpFunction: { blackHole(first100k) },
    legacyFactor: 10)
]

public let first100k = Array(0...100_000-1)

@inline(never)
public func run_ChainedFilterMap(_ n: Int) {
  var result = 0
  for _ in 1...n {
    let numbers = first100k.lazy
      .filter { $0 % 3 == 0 }
      .map { $0 * 2 }
      .filter { $0 % 8 == 0 }
      .map { $0 / 2 + 1}
    result = numbers.reduce(into: 0) { $0 += $1 }
  }

  check(result == 416691666)
}

@inline(never)
public func run_FatCompactMap(_ n: Int) {
  var result = 0
  for _ in 1...n {
    let numbers = first100k.lazy
      .compactMap { (x: Int) -> Int? in
        if x % 3 != 0 { return nil }
        let y = x * 2
        if y % 8 != 0 { return nil }
        let z = y / 2 + 1
        return z
      }
    result = numbers.reduce(into: 0) { $0 += $1 }
  }
  check(result == 416691666)
}