forked from CosmicMind/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathRedBlackTreeTests.swift
171 lines (139 loc) · 5.12 KB
/
RedBlackTreeTests.swift
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
162
163
164
165
166
167
168
169
170
171
/*
* The MIT License (MIT)
*
* Copyright (C) 2019, CosmicMind, Inc. <http://cosmicmind.com>.
* All rights reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
import XCTest
@testable import Algorithm
class RedBlackTreeTests: XCTestCase {
override func setUp() {
super.setUp()
}
override func tearDown() {
super.tearDown()
}
func testInt() {
var s = RedBlackTree<Int, Int>(uniqueKeys: true)
XCTAssert(0 == s.count, "Test failed, got \(s.count).")
for _ in 0..<1000 {
s.insert(value: 1, for: 1)
s.insert(value: 2, for: 2)
s.insert(value: 3, for: 3)
}
XCTAssert(3 == s.count, "Test failed.\(s)")
XCTAssert(1 == s[0].value, "Test failed.")
XCTAssert(2 == s[1].value, "Test failed.")
XCTAssert(3 == s[2].value, "Test failed.")
for _ in 0..<500 {
s.removeValue(for: 1)
s.removeValue(for: 3)
}
XCTAssert(1 == s.count, "Test failed.")
s.removeValue(for: 2)
XCTAssert(true == s.insert(value: 10, for: 2), "Test failed.")
XCTAssertEqual(1, s.count, "Test failed.")
XCTAssertEqual(10, s.findValue(for: 2), "Test failed.")
XCTAssertEqual(10, s[0].value, "Test failed.")
s.removeValue(for: 2)
XCTAssertEqual(0, s.count, "Test failed.")
s.insert(value: 1, for: 1)
s.insert(value: 2, for: 2)
s.insert(value: 3, for: 3)
for i in s.startIndex..<s.endIndex {
s[i] = (s[i].key, 100)
XCTAssert(100 == s[i].value, "Test failed.")
}
s.removeAll()
XCTAssert(0 == s.count, "Test failed.")
}
func testPropertyKey() {
var s = RedBlackTree<String, Array<Int>>(uniqueKeys: false)
s.insert(value: [1, 2, 3], for: "friends")
s["menu"] = [11, 22, 33]
XCTAssert(s["friends"]! == s[0].value!, "Test failed.")
XCTAssert(s["menu"]! == s[1].value!, "Test failed.")
XCTAssert(s["empty"] == nil, "Test failed.")
s["menu"] = [22, 33, 44]
XCTAssert(s["menu"]! == [22, 33, 44], "Test failed.")
s["menu"] = nil
XCTAssert(2 == s.count, "Test failed.")
}
func testValue() {
var t1 = RedBlackTree<Int, Int>()
t1.insert(value: 1, for: 1)
t1.insert(value: 2, for: 2)
t1.insert(value: 3, for: 3)
var t2 = RedBlackTree<Int, Int>()
t2.insert(value: 4, for: 4)
t2.insert(value: 5, for: 5)
t2.insert(value: 6, for: 6)
let t3 = t1 + t2
for i in 0..<t1.count {
XCTAssert(t1[i].value == t3.findValue(for: t1[i].value!), "Test failed.")
}
for i in 0..<t2.count {
XCTAssert(t2[i].value == t3.findValue(for: t2[i].value!), "Test failed.")
}
}
func testIndexOfUniqueKeys() {
var t1 = RedBlackTree<Int, Int>(uniqueKeys: true)
t1.insert(value: 1, for: 1)
t1.insert(value: 2, for: 2)
t1.insert(value: 3, for: 3)
t1.insert(value: 4, for: 4)
t1.insert(value: 5, for: 5)
t1.insert(value: 5, for: 5)
t1.insert(value: 6, for: 6)
XCTAssert(0 == t1.index(of: 1), "Test failed.")
XCTAssert(5 == t1.index(of: 6), "Test failed.")
XCTAssert(-1 == t1.index(of: 100), "Test failed.")
}
func testIndexOfNonUniqueKeys() {
var t1 = RedBlackTree<Int, Int>()
t1.insert(value: 1, for: 1)
t1.insert(value: 2, for: 2)
t1.insert(value: 3, for: 3)
t1.insert(value: 4, for: 4)
t1.insert(value: 5, for: 5)
t1.insert(value: 5, for: 5)
t1.insert(value: 6, for: 6)
XCTAssert(0 == t1.index(of: 1), "Test failed.")
XCTAssert(6 == t1.index(of: 6), "Test failed.")
XCTAssert(-1 == t1.index(of: 100), "Test failed.")
}
func testOperands() {
var t1 = RedBlackTree<Int, Int>(uniqueKeys: true)
t1.insert((1, 1), (2, 2), (3, 3), (4, 4))
XCTAssertEqual(4, t1.count, "Test failed.")
var t2 = RedBlackTree<Int, Int>(uniqueKeys: true)
t2.insert((5, 5), (6, 6), (7, 7), (8, 8))
XCTAssertEqual(4, t2.count, "Test failed.")
let t3 = t1 + t2
XCTAssertEqual(8, t3.count, "Test failed.")
XCTAssert(t1 != t2, "Test failed.")
XCTAssert(t3 != t2, "Test failed.")
XCTAssert(t3 == (t1 + t2), "Test failed.")
}
func testPerformance() {
self.measure() {}
}
}