 			XCTAssert(l.description == "[1 -> 2 -> 3]")
 		} else if L.self == DoublyLinkedList<Int>.self {
 			XCTAssert(l.description == "[1 <-> 2 <-> 3]")
-		} else {
-			XCTAssert(false, "add this type")
-		}
+		} else { XCTAssert(false, "add this type") }
 	}
 	
     func testLazyLists() {

			
			var llRev = [Int]()
			
			for i in arr.indices.reversed() {
				// print("will remove \(i):", arr[i])
				llRev.append(try! ll.remove(at: i))
			}
			
			XCTAssert(ll.count == 0)
			
			// print(sllRev)
			let arrRev : [Int] = arr.reversed()
			XCTAssert(llRev == arrRev)
			
			for i in arrRev.indices { ll[i] = arrRev[i] }
			
			// print(sll.array)
			XCTAssert(ll.array == arrRev)
			
			var arr2 = [Int]()
			
			for _ in arrRev.indices {
				arr2.append(ll.popBack()!)
			}
			
			XCTAssert(arr2 == arr)
			XCTAssert(ll.count == 0)
			
			for e in arr {
				ll.pushBack(e)
			}
			
			XCTAssert(ll.array == arr, "\(ll.array) != \(arr)")
		}

				if let o = e as? ListError	{ XCTAssert(o == ListError.IndexOutOfRange) }
				else						{ XCTAssert(false) }
			}
            
			XCTAssert(ll.count == arr.count)
			XCTAssert(ll.array == arr)
			
