|
| 1 | +import XCTest |
| 2 | +@testable import LinkedList |
| 3 | + |
| 4 | +class LinkedListTest: XCTestCase { |
| 5 | + let numbers = [8, 2, 10, 9, 7, 5] |
| 6 | + |
| 7 | + private func buildList() -> LinkedList<Int> { |
| 8 | + let list = LinkedList<Int>() |
| 9 | + for number in numbers { |
| 10 | + list.append(number) |
| 11 | + } |
| 12 | + return list |
| 13 | + } |
| 14 | + |
| 15 | + func testEmptyList() { |
| 16 | + let list = LinkedList<Int>() |
| 17 | + XCTAssertTrue(list.isEmpty) |
| 18 | + XCTAssertEqual(list.count, 0) |
| 19 | + XCTAssertNil(list.first) |
| 20 | + XCTAssertNil(list.last) |
| 21 | + } |
| 22 | + |
| 23 | + func testListWithOneElement() { |
| 24 | + let list = LinkedList<Int>() |
| 25 | + list.append(123) |
| 26 | + |
| 27 | + XCTAssertFalse(list.isEmpty) |
| 28 | + XCTAssertEqual(list.count, 1) |
| 29 | + |
| 30 | + XCTAssertNotNil(list.first) |
| 31 | + XCTAssertNil(list.first!.previous) |
| 32 | + XCTAssertNil(list.first!.next) |
| 33 | + XCTAssertEqual(list.first!.value, 123) |
| 34 | + |
| 35 | + XCTAssertNotNil(list.last) |
| 36 | + XCTAssertNil(list.last!.previous) |
| 37 | + XCTAssertNil(list.last!.next) |
| 38 | + XCTAssertEqual(list.last!.value, 123) |
| 39 | + |
| 40 | + XCTAssertTrue(list.first === list.last) |
| 41 | + } |
| 42 | + |
| 43 | + func testListWithTwoElements() { |
| 44 | + let list = LinkedList<Int>() |
| 45 | + list.append(123) |
| 46 | + list.append(456) |
| 47 | + |
| 48 | + XCTAssertEqual(list.count, 2) |
| 49 | + |
| 50 | + XCTAssertNotNil(list.first) |
| 51 | + XCTAssertEqual(list.first!.value, 123) |
| 52 | + |
| 53 | + XCTAssertNotNil(list.last) |
| 54 | + XCTAssertEqual(list.last!.value, 456) |
| 55 | + |
| 56 | + XCTAssertTrue(list.first !== list.last) |
| 57 | + |
| 58 | + XCTAssertNil(list.first!.previous) |
| 59 | + XCTAssertTrue(list.first!.next === list.last) |
| 60 | + XCTAssertTrue(list.last!.previous === list.first) |
| 61 | + XCTAssertNil(list.last!.next) |
| 62 | + } |
| 63 | + |
| 64 | + func testListWithThreeElements() { |
| 65 | + let list = LinkedList<Int>() |
| 66 | + list.append(123) |
| 67 | + list.append(456) |
| 68 | + list.append(789) |
| 69 | + |
| 70 | + XCTAssertEqual(list.count, 3) |
| 71 | + |
| 72 | + XCTAssertNotNil(list.first) |
| 73 | + XCTAssertEqual(list.first!.value, 123) |
| 74 | + |
| 75 | + let second = list.first!.next |
| 76 | + XCTAssertNotNil(second) |
| 77 | + XCTAssertEqual(second!.value, 456) |
| 78 | + |
| 79 | + XCTAssertNotNil(list.last) |
| 80 | + XCTAssertEqual(list.last!.value, 789) |
| 81 | + |
| 82 | + XCTAssertNil(list.first!.previous) |
| 83 | + XCTAssertTrue(list.first!.next === second) |
| 84 | + XCTAssertTrue(second!.previous === list.first) |
| 85 | + XCTAssertTrue(second!.next === list.last) |
| 86 | + XCTAssertTrue(list.last!.previous === second) |
| 87 | + XCTAssertNil(list.last!.next) |
| 88 | + } |
| 89 | + |
| 90 | + func testNodeAtIndexInEmptyList() { |
| 91 | + let list = LinkedList<Int>() |
| 92 | + let node = list.nodeAtIndex(0) |
| 93 | + XCTAssertNil(node) |
| 94 | + } |
| 95 | + |
| 96 | + func testNodeAtIndexInListWithOneElement() { |
| 97 | + let list = LinkedList<Int>() |
| 98 | + list.append(123) |
| 99 | + |
| 100 | + let node = list.nodeAtIndex(0) |
| 101 | + XCTAssertNotNil(node) |
| 102 | + XCTAssertEqual(node!.value, 123) |
| 103 | + XCTAssertTrue(node === list.first) |
| 104 | + } |
| 105 | + |
| 106 | + func testNodeAtIndex() { |
| 107 | + let list = buildList() |
| 108 | + |
| 109 | + let nodeCount = list.count |
| 110 | + XCTAssertEqual(nodeCount, numbers.count) |
| 111 | + |
| 112 | + XCTAssertNil(list.nodeAtIndex(-1)) |
| 113 | + XCTAssertNil(list.nodeAtIndex(nodeCount)) |
| 114 | + |
| 115 | + let first = list.nodeAtIndex(0) |
| 116 | + XCTAssertNotNil(first) |
| 117 | + XCTAssertTrue(first === list.first) |
| 118 | + XCTAssertEqual(first!.value, numbers[0]) |
| 119 | + |
| 120 | + let last = list.nodeAtIndex(nodeCount - 1) |
| 121 | + XCTAssertNotNil(last) |
| 122 | + XCTAssertTrue(last === list.last) |
| 123 | + XCTAssertEqual(last!.value, numbers[nodeCount - 1]) |
| 124 | + |
| 125 | + for i in 0..<nodeCount { |
| 126 | + let node = list.nodeAtIndex(i) |
| 127 | + XCTAssertNotNil(node) |
| 128 | + XCTAssertEqual(node!.value, numbers[i]) |
| 129 | + } |
| 130 | + } |
| 131 | + |
| 132 | + func testSubscript() { |
| 133 | + let list = buildList() |
| 134 | + for i in 0 ..< list.count { |
| 135 | + XCTAssertEqual(list[i], numbers[i]) |
| 136 | + } |
| 137 | + } |
| 138 | + |
| 139 | + func testInsertAtIndexInEmptyList() { |
| 140 | + let list = LinkedList<Int>() |
| 141 | + list.insert(123, atIndex: 0) |
| 142 | + |
| 143 | + XCTAssertFalse(list.isEmpty) |
| 144 | + XCTAssertEqual(list.count, 1) |
| 145 | + |
| 146 | + let node = list.nodeAtIndex(0) |
| 147 | + XCTAssertNotNil(node) |
| 148 | + XCTAssertEqual(node!.value, 123) |
| 149 | + } |
| 150 | + |
| 151 | + func testInsertAtIndex() { |
| 152 | + let list = buildList() |
| 153 | + let prev = list.nodeAtIndex(2) |
| 154 | + let next = list.nodeAtIndex(3) |
| 155 | + let nodeCount = list.count |
| 156 | + |
| 157 | + list.insert(444, atIndex: 3) |
| 158 | + |
| 159 | + let node = list.nodeAtIndex(3) |
| 160 | + XCTAssertNotNil(node) |
| 161 | + XCTAssertEqual(node!.value, 444) |
| 162 | + XCTAssertEqual(nodeCount + 1, list.count) |
| 163 | + |
| 164 | + XCTAssertFalse(prev === node) |
| 165 | + XCTAssertFalse(next === node) |
| 166 | + XCTAssertTrue(prev!.next === node) |
| 167 | + XCTAssertTrue(next!.previous === node) |
| 168 | + } |
| 169 | + |
| 170 | + func testRemoveAtIndexOnListWithOneElement() { |
| 171 | + let list = LinkedList<Int>() |
| 172 | + list.append(123) |
| 173 | + |
| 174 | + let value = list.removeAtIndex(0) |
| 175 | + XCTAssertEqual(value, 123) |
| 176 | + |
| 177 | + XCTAssertTrue(list.isEmpty) |
| 178 | + XCTAssertEqual(list.count, 0) |
| 179 | + XCTAssertNil(list.first) |
| 180 | + XCTAssertNil(list.last) |
| 181 | + } |
| 182 | + |
| 183 | + func testRemoveAtIndex() { |
| 184 | + let list = buildList() |
| 185 | + let prev = list.nodeAtIndex(2) |
| 186 | + let next = list.nodeAtIndex(3) |
| 187 | + let nodeCount = list.count |
| 188 | + |
| 189 | + list.insert(444, atIndex: 3) |
| 190 | + |
| 191 | + let value = list.removeAtIndex(3) |
| 192 | + XCTAssertEqual(value, 444) |
| 193 | + |
| 194 | + let node = list.nodeAtIndex(3) |
| 195 | + XCTAssertTrue(next === node) |
| 196 | + XCTAssertTrue(prev!.next === node) |
| 197 | + XCTAssertTrue(node!.previous === prev) |
| 198 | + XCTAssertEqual(nodeCount, list.count) |
| 199 | + } |
| 200 | + |
| 201 | + func testRemoveLastOnListWithOneElement() { |
| 202 | + let list = LinkedList<Int>() |
| 203 | + list.append(123) |
| 204 | + |
| 205 | + let value = list.removeLast() |
| 206 | + XCTAssertEqual(value, 123) |
| 207 | + |
| 208 | + XCTAssertTrue(list.isEmpty) |
| 209 | + XCTAssertEqual(list.count, 0) |
| 210 | + XCTAssertNil(list.first) |
| 211 | + XCTAssertNil(list.last) |
| 212 | + } |
| 213 | + |
| 214 | + func testRemoveLast() { |
| 215 | + let list = buildList() |
| 216 | + let last = list.last |
| 217 | + let prev = last!.previous |
| 218 | + let nodeCount = list.count |
| 219 | + |
| 220 | + let value = list.removeLast() |
| 221 | + XCTAssertEqual(value, 5) |
| 222 | + |
| 223 | + XCTAssertNil(last!.previous) |
| 224 | + XCTAssertNil(last!.next) |
| 225 | + |
| 226 | + XCTAssertNil(prev!.next) |
| 227 | + XCTAssertTrue(list.last === prev) |
| 228 | + XCTAssertEqual(nodeCount - 1, list.count) |
| 229 | + } |
| 230 | + |
| 231 | + func testRemoveAll() { |
| 232 | + let list = buildList() |
| 233 | + list.removeAll() |
| 234 | + XCTAssertTrue(list.isEmpty) |
| 235 | + XCTAssertEqual(list.count, 0) |
| 236 | + XCTAssertNil(list.first) |
| 237 | + XCTAssertNil(list.last) |
| 238 | + } |
| 239 | + |
| 240 | + func testReverseLinkedList() { |
| 241 | + let list = buildList() |
| 242 | + let first = list.first |
| 243 | + let last = list.last |
| 244 | + let nodeCount = list.count |
| 245 | + |
| 246 | + list.reverse() |
| 247 | + |
| 248 | + XCTAssertTrue(first === list.last) |
| 249 | + XCTAssertTrue(last === list.first) |
| 250 | + XCTAssertEqual(nodeCount, list.count) |
| 251 | + } |
| 252 | +} |
0 commit comments