forked from CosmicMind/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDequeTests.swift
102 lines (82 loc) · 3.54 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
98
99
100
101
102
/*
* Copyright (C) 2015 - 2018, Daniel Dahan and CosmicMind, Inc. <http://cosmicmind.com>.
* 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 CosmicMind 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 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.")
}
}
}