Tests/DoublyLinkedListTests.swift

/*
* 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 DoublyLinkedListTests: XCTestCase {
	
	override func setUp() {
		super.setUp()
	}
	
	override func tearDown() {
		super.tearDown()
	}
	
	func testInt() {
		let l: DoublyLinkedList<Int> = DoublyLinkedList<Int>()
		
		l.insertAtFront(1)
		l.insertAtFront(2)
		l.insertAtFront(3)
		
		XCTAssert(3 == l.count, "Count incorrect, got \(l.count).")
		
		XCTAssert(3 == l.front, "Front incorrect, got \(l.front)")
		XCTAssert(1 == l.back, "Back incorrect, got \(l.back)")
		
		l.insertAtBack(5)
		l.insertAtBack(6)
		l.insertAtBack(7)
		
		l.cursorToFront()
		while !l.isCursorAtBack {
			l.next
		}

		l.cursorToBack()
		while !l.isCursorAtFront {
			l.previous
		}

		XCTAssert(6 == l.count, "Count incorrect, got \(l.count).")
		
		XCTAssert(3 == l.front, "Front incorrect, got \(l.front)")
		XCTAssert(7 == l.back, "Back incorrect, got \(l.back)")

		l.cursorToFront()
		XCTAssert(3 == l.front && l.front == l.cursor, "Current incorrect, got \(l.cursor)")
		XCTAssert(2 == l.next, "Test failed, got \(l.cursor)")
		XCTAssert(1 == l.next, "Test failed, got \(l.cursor)")
		XCTAssert(5 == l.next, "Test failed, got \(l.cursor)")
		XCTAssert(6 == l.next, "Test failed, got \(l.cursor)")
		XCTAssert(7 == l.next, "Test failed, got \(l.cursor)")

		l.cursorToBack()
		XCTAssert(7 == l.back && l.back == l.cursor, "Current incorrect, got \(l.cursor)")
		XCTAssert(6 == l.previous, "Test failed, got \(l.cursor)")
		XCTAssert(5 == l.previous, "Test failed, got \(l.cursor)")
		XCTAssert(1 == l.previous, "Test failed, got \(l.cursor)")
		XCTAssert(2 == l.previous, "Test failed, got \(l.cursor)")
		XCTAssert(3 == l.previous, "Test failed, got \(l.cursor)")

		l.cursorToFront()
		XCTAssert(3 == l.removeAtFront() && 5 == l.count, "Test failed.")
		XCTAssert(2 == l.removeAtFront() && 4 == l.count, "Test failed.")
		XCTAssert(1 == l.removeAtFront() && 3 == l.count, "Test failed.")
		
		l.cursorToBack()
		XCTAssert(7 == l.removeAtBack() && 2 == l.count, "Test failed.")
		XCTAssert(6 == l.removeAtBack() && 1 == l.count, "Test failed.")
		XCTAssert(5 == l.removeAtBack() && 0 == l.count, "Test failed.")
		
		l.removeAll()
		l.cursorToFront()
		XCTAssert(nil == l.cursor && 0 == l.count, "Test failed, got \(l.cursor)")
		l.insertBeforeCursor(1)
		XCTAssert(1 == l.cursor && 1 == l.count, "Test failed, got \(l.cursor)")
		
		l.removeAll()
		l.cursorToBack()
		XCTAssert(nil == l.cursor && 0 == l.count, "Test failed, got \(l.cursor)")
		l.insertAfterCursor(1)
		XCTAssert(1 == l.cursor && 1 == l.count, "Test failed, got \(l.cursor)")
		
		l.removeAll()
		l.insertAtBack(1)
		XCTAssert(1 == l.cursor && 1 == l.count, "Test failed, got \(l.cursor)")
		l.insertAfterCursor(2)
		l.insertAfterCursor(6)
		l.next
		XCTAssert(6 == l.cursor && 3 == l.count, "Test failed, got \(l.cursor)")
		l.insertBeforeCursor(3)
		l.insertBeforeCursor(5)
		l.previous
		XCTAssert(5 == l.cursor && 5 == l.count, "Test failed, got \(l.cursor)")
		l.insertAtBack(4)
		l.previous
		l.removeAtCursor()
		XCTAssert(5 == l.cursor && 5 == l.count, "Test failed, got \(l.cursor)")
		l.removeAtCursor()
		XCTAssert(6 == l.cursor && 4 == l.count, "Test failed, got \(l.cursor)")
		l.removeAtCursor()
		XCTAssert(2 == l.cursor && 3 == l.count, "Test failed, got \(l.cursor)")
		l.removeAtCursor()
		XCTAssert(1 == l.previous && 2 == l.count, "Test failed, got \(l.cursor)")
		l.removeAtCursor()
		XCTAssert(l.front == l.cursor && l.back == l.cursor && 1 == l.count, "Test failed, got \(l.cursor)")
		l.removeAtCursor()
		XCTAssert(nil == l.cursor && 0 == l.count, "Test failed, got \(l.cursor)")
		
		l.insertAtFront(1)
		l.insertAtBack(2)
		l.insertAtFront(3)
	}
	
	func testConcat() {
		let l1: DoublyLinkedList<Int> = DoublyLinkedList<Int>()
		l1.insertAtFront(3)
		l1.insertAtFront(2)
		l1.insertAtFront(1)
		
		let l2: DoublyLinkedList<Int> = DoublyLinkedList<Int>()
		l2.insertAtBack(4)
		l2.insertAtBack(5)
		l2.insertAtBack(6)
		
		let l3: DoublyLinkedList<Int> = l1 + l2
		
		for x in l1 {
			XCTAssert(x == l3.removeAtFront(), "Concat incorrect.")
		}
		
		for x in l2 {
			XCTAssert(x == l3.removeAtFront(), "Concat incorrect.")
		}
	}
	
	func testPerformance() {
		self.measureBlock() {}
	}
}