File: MemoryBenchmarks.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 (80 lines) | stat: -rw-r--r-- 2,174 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
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
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift Collections open source project
//
// Copyright (c) 2022 - 2024 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
//
//===----------------------------------------------------------------------===//

import ArgumentParser
import CollectionsBenchmark
import Collections

@main
struct MemoryBenchmarks: ParsableCommand {
  static var configuration: CommandConfiguration {
    CommandConfiguration(
      commandName: "memory-statistics",
      abstract: "A utility for running memory benchmarks for collection types.")
  }

  @OptionGroup
  var sizes: Benchmark.Options.SizeSelection

  mutating func run() throws {
    let sizes = try self.sizes.resolveSizes()

    var i = 0

    var d: Dictionary<String, String> = [:]
    var pd: TreeDictionary<String, String> = [:]

    print("""
      Size,"Dictionary<String, String>",\
      "TreeDictionary<String, String>",\
      "average node size",\
      "average item depth"
      """)

    var sumd: Double = 0
    var sump: Double = 0
    for size in sizes {
      while i < size.rawValue {
        let key = "key \(i)"
        let value = "value \(i)"
        d[key] = value
        pd[key] = value
        i += 1
      }

      let dstats = d.statistics
      let pstats = pd._statistics
      print("""
        \(size.rawValue),\
        \(dstats.memoryEfficiency),\
        \(pstats.memoryEfficiency),\
        \(pstats.averageNodeSize),\
        \(pstats.averageItemDepth)
        """)
      sumd += dstats.memoryEfficiency
      sump += pstats.memoryEfficiency
    }

    let pstats = pd._statistics
    complain("""
      Averages:
        Dictionary: \(sumd / Double(sizes.count))
        TreeDictionary: \(sump / Double(sizes.count))

      TreeDictionary at 1M items:
        average node size: \(pstats.averageNodeSize)
        average item depth: \(pstats.averageItemDepth)
        average lookup chain length: \(pstats.averageLookupChainLength)
      """)
  }
}