File: SetAlgebra.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 (161 lines) | stat: -rw-r--r-- 5,040 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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
// RUN: %target-run-simple-swift
// REQUIRES: executable_test

import StdlibUnittest
import StdlibCollectionUnittest

extension MinimalEquatableValue : Hashable {
  public func hash(into hasher: inout Hasher) {
    hasher.combine(value)
  }
}

public struct DefaultedSetAlgebra<Element : Hashable> : SetAlgebra {
  var store = Set<Element>()
  public init() {}

  public init(_ elements: [Element]) {
    store = Set(elements)
  }

  public init(_store: Set<Element>) {
    store = _store
  }

  public func contains(_ member: Element) -> Bool {
    return store.contains(member)
  }

  public func union(_ other: DefaultedSetAlgebra) -> DefaultedSetAlgebra {
    return DefaultedSetAlgebra(_store: store.union(other.store))
  }

  public func intersection(_ other: DefaultedSetAlgebra)
    -> DefaultedSetAlgebra {
    var defaultedSetAlgebra = DefaultedSetAlgebra()
    defaultedSetAlgebra.store = store.intersection(other.store)
    return defaultedSetAlgebra
  }

  public func symmetricDifference(_ other: DefaultedSetAlgebra)
    -> DefaultedSetAlgebra {
    var defaultedSetAlgebra = DefaultedSetAlgebra()
    defaultedSetAlgebra.store = store.symmetricDifference(other.store)
    return defaultedSetAlgebra
  }

  public mutating func insert(_ newMember: Element)
    -> (inserted: Bool, memberAfterInsert: Element) {
    return store.insert(newMember)
  }

  public mutating func remove(_ member: Element) -> Element? {
    return store.remove(member)
  }

  public mutating func update(with newMember: Element) -> Element? {
    return store.update(with: newMember)
  }

  public mutating func formUnion(_ other: DefaultedSetAlgebra) {
    store.formUnion(other.store)
  }

  public mutating func formSymmetricDifference(_ other: DefaultedSetAlgebra) {
    store.formSymmetricDifference(other.store)
  }

  public mutating func formIntersection(_ other: DefaultedSetAlgebra) {
    store.formIntersection(other.store)
  }
}

public func ==<Element>(lhs: DefaultedSetAlgebra<Element>,
  rhs: DefaultedSetAlgebra<Element>) -> Bool {
  return lhs.store == rhs.store
}

let SetAlgebraTests = TestSuite("SetAlgebra")

SetAlgebraTests.test("contains").forEach(in: findTests) { test in
  typealias P = DefaultedSetAlgebra<MinimalEquatableValue>
  expectEqual(test.expected != nil,
    P(test.sequence).contains(test.element))
}

SetAlgebraTests.test("union").forEach(in: unionTests) { test in
  expectEqual(DefaultedSetAlgebra(test.expected),
    DefaultedSetAlgebra(test.lhs).union(DefaultedSetAlgebra(test.rhs)))
}

SetAlgebraTests.test("intersection").forEach(in: intersectionTests) { test in
  expectEqual(DefaultedSetAlgebra(test.expected),
    DefaultedSetAlgebra(test.lhs).intersection(DefaultedSetAlgebra(test.rhs)))
}

SetAlgebraTests.test("symmetricDifference")
  .forEach(in: symmetricDifferenceTests) { test in
  let sequence =  DefaultedSetAlgebra(test.rhs)
  expectEqual(DefaultedSetAlgebra(test.expected),
    DefaultedSetAlgebra(test.lhs).symmetricDifference(sequence))
}

SetAlgebraTests.test("insert").forEach(in: findTests) { test in
  var sequence = DefaultedSetAlgebra(test.sequence)
  expectEqual((test.expected == nil, test.element),
    sequence.insert(test.element))
}

SetAlgebraTests.test("subtracting").forEach(in: subtractingTests) { test in
  expectEqual(DefaultedSetAlgebra(test.expected),
    DefaultedSetAlgebra(test.lhs).subtracting(DefaultedSetAlgebra(test.rhs)))
}

SetAlgebraTests.test("isSubset").forEach(in: findTests) { test in
  let sequence = DefaultedSetAlgebra(test.sequence)
  expectEqual(test.expected != nil,
    DefaultedSetAlgebra([test.element]).isSubset(of: sequence))
}

SetAlgebraTests.test("isDisjoint").forEach(in: findTests) { test in
  let sequence = DefaultedSetAlgebra(test.sequence)
  expectEqual(test.expected == nil,
    sequence.isDisjoint(with: DefaultedSetAlgebra([test.element])))
}

SetAlgebraTests.test("isSuperset").forEach(in: findTests) { test in
  let sequence = DefaultedSetAlgebra(test.sequence)
  expectEqual(test.expected != nil,
    sequence.isSuperset(of: DefaultedSetAlgebra([test.element])))
}

SetAlgebraTests.test("isStrictSuperset")
  .forEach(in: strictSupersetTests) { test in
  let sequence = DefaultedSetAlgebra(test.rhs)
  expectEqual(test.expected,
    DefaultedSetAlgebra(test.lhs).isStrictSuperset(of: sequence))
}

SetAlgebraTests.test("isStrictSubset").forEach(in: strictSupersetTests) {
  test in
  let sequence = DefaultedSetAlgebra(test.lhs)
  expectEqual(test.expected,
    DefaultedSetAlgebra(test.rhs).isStrictSubset(of: sequence))
}

SetAlgebraTests.test("isEmpty") {
  let sequence = [MinimalEquatableValue(1, identity: 1),
    MinimalEquatableValue(2, identity: 2)]

  expectTrue(DefaultedSetAlgebra<MinimalEquatableValue>().isEmpty)
  expectFalse(DefaultedSetAlgebra(sequence).isEmpty)
}

SetAlgebraTests.test("subtract").forEach(in: subtractTests) { test in
  var sequence = DefaultedSetAlgebra(test.lhs)
  sequence.subtract(DefaultedSetAlgebra(test.rhs))
  expectEqual(sequence, DefaultedSetAlgebra(test.expected))
}

runAllTests()