File: NibbleSort.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 (54 lines) | stat: -rw-r--r-- 1,019 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
 
// NibbleSort benchmark
//
// Source: https://gist.github.com/airspeedswift/f4daff4ea5c6de9e1fdf

import TestsUtils

public let benchmarks = [
  BenchmarkInfo(
    name: "NibbleSort",
    runFunction: run_NibbleSort,
    tags: [.validation],
    legacyFactor: 10
  ),
]

@inline(never)
public func run_NibbleSort(_ n: Int) {
  let vRef: UInt64 = 0xfeedbba000000000
  let v: UInt64 = 0xbadbeef
  var c = NibbleCollection(v)

  for _ in 1...1_000*n {
    c.val = v
    c.sort()

    if c.val != vRef {
      break
    }
  }

  check(c.val == vRef)
}

struct NibbleCollection {
  var val: UInt64
  init(_ val: UInt64) { self.val = val }
}

extension NibbleCollection: RandomAccessCollection, MutableCollection {
  typealias Index = UInt64
  var startIndex: UInt64 { return 0 }
  var endIndex: UInt64 { return 16 }

  subscript(idx: UInt64) -> UInt64 {
    get {
      return (val >> (idx*4)) & 0xf
    }
    set(n) {
      let mask = (0xf as UInt64) << (idx * 4)
      val &= ~mask
      val |= n << (idx * 4)
    }
  }
}