forked from CosmicMind/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathRedBlackTreeTests.swift
175 lines (144 loc) · 5.32 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
172
173
174
175
/*
* Copyright (C) 2015 - 2016, Daniel Dahan and CosmicMind, Inc. <http://cosmicmind.io>.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* * Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* * Neither the name of Algorithm nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
import XCTest
@testable import Algorithm
class RedBlackTreeTests: XCTestCase {
override func setUp() {
super.setUp()
}
override func tearDown() {
super.tearDown()
}
func testInt() {
let s: RedBlackTree<Int, Int> = RedBlackTree<Int, Int>(uniqueKeys: true)
XCTAssert(0 == s.count, "Test failed, got \(s.count).")
for _ in 0..<1000 {
s.insert(1, value: 1)
s.insert(2, value: 2)
s.insert(3, value: 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.removeValueForKeys(1)
s.removeValueForKeys(3)
}
XCTAssert(1 == s.count, "Test failed.")
s.removeValueForKeys(2)
XCTAssert(true == s.insert(2, value: 10), "Test failed.")
XCTAssert(1 == s.count, "Test failed.")
XCTAssert(10 == s.findValueForKey(2), "Test failed.")
XCTAssert(10 == s[0].value, "Test failed.")
s.removeValueForKeys(2)
XCTAssert(0 == s.count, "Test failed.")
s.insert(1, value: 1)
s.insert(2, value: 2)
s.insert(3, value: 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() {
let s: RedBlackTree<String, Array<Int>> = RedBlackTree<String, Array<Int>>(uniqueKeys: false)
s.insert("friends", value: [1, 2, 3])
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() {
let t1: RedBlackTree<Int, Int> = RedBlackTree<Int, Int>()
t1.insert(1, value: 1)
t1.insert(2, value: 2)
t1.insert(3, value: 3)
let t2: RedBlackTree<Int, Int> = RedBlackTree<Int, Int>()
t2.insert(4, value: 4)
t2.insert(5, value: 5)
t2.insert(6, value: 6)
let t3: RedBlackTree<Int, Int> = t1 + t2
for i in 0..<t1.count {
XCTAssert(t1[i].value == t3.findValueForKey(t1[i].value!), "Test failed.")
}
for i in 0..<t2.count {
XCTAssert(t2[i].value == t3.findValueForKey(t2[i].value!), "Test failed.")
}
}
func testIndexOfUniqueKeys() {
let t1: RedBlackTree<Int, Int> = RedBlackTree<Int, Int>(uniqueKeys: true)
t1.insert(1, value: 1)
t1.insert(2, value: 2)
t1.insert(3, value: 3)
t1.insert(4, value: 4)
t1.insert(5, value: 5)
t1.insert(5, value: 5)
t1.insert(6, value: 6)
XCTAssert(0 == t1.indexOf(1), "Test failed.")
XCTAssert(5 == t1.indexOf(6), "Test failed.")
XCTAssert(-1 == t1.indexOf(100), "Test failed.")
}
func testIndexOfNonUniqueKeys() {
let t1: RedBlackTree<Int, Int> = RedBlackTree<Int, Int>()
t1.insert(1, value: 1)
t1.insert(2, value: 2)
t1.insert(3, value: 3)
t1.insert(4, value: 4)
t1.insert(5, value: 5)
t1.insert(5, value: 5)
t1.insert(6, value: 6)
XCTAssert(0 == t1.indexOf(1), "Test failed.")
XCTAssert(6 == t1.indexOf(6), "Test failed.")
XCTAssert(-1 == t1.indexOf(100), "Test failed.")
}
func testOperands() {
let t1: RedBlackTree<Int, Int> = RedBlackTree<Int, Int>(uniqueKeys: true)
t1.insert((1, 1), (2, 2), (3, 3), (4, 4))
XCTAssert(4 == t1.count, "Test failed.")
let t2: RedBlackTree<Int, Int> = RedBlackTree<Int, Int>(uniqueKeys: true)
t2.insert((5, 5), (6, 6), (7, 7), (8, 8))
XCTAssert(4 == t2.count, "Test failed.")
let t3: RedBlackTree<Int, Int> = t1 + t2
XCTAssert(8 == t3.count, "Test failed.")
XCTAssert(t1 != t2, "Test failed.")
XCTAssert(t3 != t2, "Test failed.")
XCTAssert(t3 == (t1 + t2), "Test failed.")
}
func testPerformance() {
self.measureBlock() {}
}
}