forked from CosmicMind/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDequeTests.swift
97 lines (77 loc) · 3.19 KB
/
DequeTests.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
/*
* 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 DequeTests: XCTestCase {
override func setUp() {
super.setUp()
}
override func tearDown() {
super.tearDown()
}
func testInt() {
var d = Deque<Int>()
d.insert(atFront: 1)
d.insert(atFront: 2)
d.insert(atFront: 3)
XCTAssert(3 == d.count, "Count incorrect, got \(d.count).")
XCTAssert(3 == d.front, "Front incorrect, got \(String(describing: d.front))")
XCTAssert(1 == d.back, "Back incorrect, got \(String(describing: d.back))")
d.insert(atBack: 5)
d.insert(atBack: 6)
d.insert(atBack: 7)
XCTAssert(6 == d.count, "Count incorrect, got \(d.count).")
XCTAssert(3 == d.front, "Front incorrect, got \(String(describing: d.front))")
XCTAssert(7 == d.back, "Back incorrect, got \(String(describing: d.back))")
XCTAssert(3 == d.removeAtFront() && 5 == d.count && 2 == d.front, "RemoveAtFront incorrect")
XCTAssert(2 == d.removeAtFront() && 4 == d.count && 1 == d.front, "RemoveAtFront incorrect")
XCTAssert(1 == d.removeAtFront() && 3 == d.count && 5 == d.front, "RemoveAtFront incorrect")
XCTAssert(7 == d.removeAtBack() && 2 == d.count && 6 == d.back, "RemoveAtBack incorrect")
XCTAssert(6 == d.removeAtBack() && 1 == d.count && 5 == d.back, "RemoveAtBack incorrect")
XCTAssert(5 == d.removeAtBack() && 0 == d.count && nil == d.back, "RemoveAtBack incorrect")
d.insert(atFront: 1)
d.insert(atFront: 2)
d.insert(atFront: 3)
d.removeAll()
XCTAssert(0 == d.count, "Count incorrect, got \(d.count).")
}
func testConcat() {
var d1 = Deque<Int>()
d1.insert(atBack: 1)
d1.insert(atBack: 2)
d1.insert(atBack: 3)
var d2 = Deque<Int>()
d2.insert(atBack: 5)
d2.insert(atBack: 6)
d2.insert(atBack: 7)
var d3 = d1 + d2
for x in d1 {
XCTAssertEqual(x, d3.removeAtFront(), "Concat incorrect.")
}
for x in d2 {
XCTAssertEqual(x, d3.removeAtFront(), "Concat incorrect.")
}
}
}