File: Combos.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 (85 lines) | stat: -rw-r--r-- 2,344 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
81
82
83
84
85
// Combos benchmark
//
// Description: Generates every combination of every element in two sequences
// Source: https://gist.github.com/airspeedswift/34251f2ddb1b038c5d88

import TestsUtils

public let benchmarks =
  BenchmarkInfo(
    name: "Combos",
    runFunction: run_Combos,
    tags: [.validation, .abstraction]
  )

@inline(never)
public func run_Combos(_ n: Int) {
  let firstRef = [Character("A"), Character("0")]
  let lastRef = [Character("J"), Character("9")]
  var combos = [[Character]]()

  for _ in 1...10*n {
    combos = combinations("ABCDEFGHIJ", "0123456789").map {
      return [$0] + [$1]
    }

    if combos.first! != firstRef || combos.last! != lastRef {
      break
    }
  }

  check(combos.first! == firstRef && combos.last! == lastRef)
}

func combinations
<First: Sequence, Second: Collection>
(_ first: First, _ second: Second)
-> AnyIterator<(First.Element, Second.Element)> {
  var first_gen = first.makeIterator()
  var second_gen = second.makeIterator()
  var current_first = first_gen.next()
  return AnyIterator {
    // check if there's more of first to consume
    if let this_first = current_first {
      // if so, is there more of this go-around
      // of second to consume?
      if let this_second = second_gen.next() {
        return (this_first, this_second)
      }
      // if second used up, reset it
      else {
        // go back to the beginning of second
        second_gen = second.makeIterator()
        // and take the first element of it
        let next_second = second_gen.next()
        // was there a first element?
        if let this_second = next_second {
          // move on to the next element of first
          current_first = first_gen.next()
          // is there such an element?
          if let this_first = current_first {
            return (this_first, this_second)
          }
          // if not, we've reached the end of
          // the first sequence
          else {
            // so we've finished
            return nil
          }
        }
        // if not, second is empty
        else {
          // so we need to guard against
          // infinite looping in that case
          return nil
        }
      }
    }
    // if not, we've reached the end of
    // the first sequence
    else {
      // so we've finished
      return nil
    }
  }
}