forked from CosmicMind/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSortedMultiDictionaryTests.swift
129 lines (107 loc) · 4.12 KB
/
SortedMultiDictionaryTests.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
/*
* 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 SortedMultiDictionaryTests: XCTestCase {
override func setUp() {
super.setUp()
}
override func tearDown() {
super.tearDown()
}
func testInt() {
let s: SortedMultiDictionary<Int, Int> = SortedMultiDictionary<Int, Int>()
XCTAssert(0 == s.count, "Test failed, got \(s.count).")
for _ in 0..<1000 {
s.insert((1, 1))
s.insert((2, 2))
s.insert((3, 3))
}
XCTAssert(3000 == s.count, "Test failed.")
XCTAssert(1 == s[0].value, "Test failed.")
XCTAssert(1 == s[1].value, "Test failed.")
XCTAssert(1 == s[2].value, "Test failed.")
for _ in 0..<500 {
s.removeValueForKeys(1)
s.removeValueForKeys(3)
}
XCTAssert(1000 == s.count, "Test failed.")
s.removeValueForKeys(2)
s.insert((2, 10))
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, 1))
s.insert((2, 2))
s.insert((3, 3))
s.insert((3, 3))
s.updateValue(5, forKey: 3)
let subs: SortedMultiDictionary<Int, Int>= s.search(3)
XCTAssert(2 == subs.count, "Test failed.")
let generator: SortedMultiDictionary<Int, Int>.Generator = subs.generate()
while let x = generator.next() {
XCTAssert(5 == x.value, "Test failed.")
}
for i in 0..<s.endIndex {
s[i] = (s[i].key, 100)
XCTAssert(100 == s[i].value, "Test failed.")
}
s.removeAll()
XCTAssert(0 == s.count, "Test failed.")
}
func testIndexOf() {
let d1: SortedMultiDictionary<Int, Int> = SortedMultiDictionary<Int, Int>()
d1.insert(1, value: 1)
d1.insert(2, value: 2)
d1.insert(3, value: 3)
d1.insert(4, value: 4)
d1.insert(5, value: 5)
d1.insert(5, value: 5)
d1.insert(6, value: 6)
XCTAssert(0 == d1.indexOf(1), "Test failed.")
XCTAssert(6 == d1.indexOf(6), "Test failed.")
XCTAssert(-1 == d1.indexOf(100), "Test failed.")
}
func testKeys() {
let s: SortedMultiDictionary<String, Int> = SortedMultiDictionary<String, Int>(elements: ("adam", 1), ("daniel", 2), ("mike", 3), ("natalie", 4))
let keys: SortedMultiSet<String> = SortedMultiSet<String>(elements: "adam", "daniel", "mike", "natalie")
XCTAssert(keys == s.keys, "Test failed.")
}
func testValues() {
let s: SortedMultiDictionary<String, Int> = SortedMultiDictionary<String, Int>(elements: ("adam", 1), ("daniel", 2), ("mike", 3), ("natalie", 4))
let values: Array<Int> = [1, 2, 3, 4]
XCTAssert(values == s.values, "Test failed.")
}
func testPerformance() {
self.measureBlock() {}
}
}