Fixed Array test indentations
This commit is contained in:
parent
48faac66cb
commit
88733f8a30
|
@ -63,9 +63,9 @@ class EZSwiftExtensionsTestsArray: XCTestCase {
|
|||
XCTAssertNil([].random())
|
||||
}
|
||||
|
||||
func testTestAll() {
|
||||
XCTAssertTrue(numberArray.testAll { $0 < 10 })
|
||||
}
|
||||
func testTestAll() {
|
||||
XCTAssertTrue(numberArray.testAll { $0 < 10 })
|
||||
}
|
||||
|
||||
func testTestIfAllIs() {
|
||||
let array1 = [true, true, true]
|
||||
|
@ -80,66 +80,66 @@ class EZSwiftExtensionsTestsArray: XCTestCase {
|
|||
XCTAssertEqual(numberArray.testIfAllIs(true), false)
|
||||
}
|
||||
|
||||
func testGet() {
|
||||
XCTAssertNotNil(numberArray.get(1))
|
||||
XCTAssertNil(numberArray.get(10))
|
||||
}
|
||||
|
||||
func testReverseIndex() {
|
||||
let array = [Int](0...5)
|
||||
XCTAssertEqual(array.reverseIndex(0), 5)
|
||||
XCTAssertEqual(array.reverseIndex(2), 3)
|
||||
}
|
||||
|
||||
func testTakeMax() {
|
||||
XCTAssertEqual(numberArray.takeMax(2).count, 2)
|
||||
}
|
||||
|
||||
func testEach() {
|
||||
var sameArray: [Int] = []
|
||||
numberArray.each { sameArray.append($0) }
|
||||
XCTAssertEqual(numberArray, sameArray)
|
||||
|
||||
var indexArray: [Int] = []
|
||||
numberArray.each { indexArray.append($0.0) }
|
||||
XCTAssertEqual(indexArray, [Int](0..<numberArray.count))
|
||||
}
|
||||
|
||||
func testMapFilter() {
|
||||
let filtered = numberArray.mapFilter { number -> String? in
|
||||
return number == 1 ? String(number) : nil
|
||||
func testGet() {
|
||||
XCTAssertNotNil(numberArray.get(1))
|
||||
XCTAssertNil(numberArray.get(10))
|
||||
}
|
||||
|
||||
XCTAssertEqual(filtered.count, 2)
|
||||
}
|
||||
func testReverseIndex() {
|
||||
let array = [Int](0...5)
|
||||
XCTAssertEqual(array.reverseIndex(0), 5)
|
||||
XCTAssertEqual(array.reverseIndex(2), 3)
|
||||
}
|
||||
|
||||
func testUnion() {
|
||||
let a = [Int](0...2), b = [Int](3...5), c = [Int](6...8)
|
||||
let union = a.union(b, c)
|
||||
func testTakeMax() {
|
||||
XCTAssertEqual(numberArray.takeMax(2).count, 2)
|
||||
}
|
||||
|
||||
XCTAssertEqual(union, [Int](0...8))
|
||||
}
|
||||
func testEach() {
|
||||
var sameArray: [Int] = []
|
||||
numberArray.each { sameArray.append($0) }
|
||||
XCTAssertEqual(numberArray, sameArray)
|
||||
|
||||
func testIntersection() {
|
||||
let a = [Int](0...8), b = [Int](3...4), c = [Int](1...6)
|
||||
let intersection = a.intersection(b, c)
|
||||
var indexArray: [Int] = []
|
||||
numberArray.each { indexArray.append($0.0) }
|
||||
XCTAssertEqual(indexArray, [Int](0..<numberArray.count))
|
||||
}
|
||||
|
||||
XCTAssertEqual(intersection, [3, 4])
|
||||
}
|
||||
func testMapFilter() {
|
||||
let filtered = numberArray.mapFilter { number -> String? in
|
||||
return number == 1 ? String(number) : nil
|
||||
}
|
||||
|
||||
func testDifference() {
|
||||
let a = [Int](0...8), b = [Int](3...4), c = [Int](1...2)
|
||||
let difference = a.difference(b, c)
|
||||
XCTAssertEqual(filtered.count, 2)
|
||||
}
|
||||
|
||||
XCTAssertEqual(difference, [0, 5, 6, 7, 8])
|
||||
}
|
||||
func testUnion() {
|
||||
let a = [Int](0...2), b = [Int](3...5), c = [Int](6...8)
|
||||
let union = a.union(b, c)
|
||||
|
||||
func testOptionalEquatable() {
|
||||
let a: [Int]? = [1, 2, 3]
|
||||
let b: [Int]? = [1, 2, 3]
|
||||
let c: [Int]? = nil
|
||||
XCTAssertEqual(union, [Int](0...8))
|
||||
}
|
||||
|
||||
XCTAssertTrue(a == b)
|
||||
XCTAssertFalse(a == c)
|
||||
}
|
||||
func testIntersection() {
|
||||
let a = [Int](0...8), b = [Int](3...4), c = [Int](1...6)
|
||||
let intersection = a.intersection(b, c)
|
||||
|
||||
XCTAssertEqual(intersection, [3, 4])
|
||||
}
|
||||
|
||||
func testDifference() {
|
||||
let a = [Int](0...8), b = [Int](3...4), c = [Int](1...2)
|
||||
let difference = a.difference(b, c)
|
||||
|
||||
XCTAssertEqual(difference, [0, 5, 6, 7, 8])
|
||||
}
|
||||
|
||||
func testOptionalEquatable() {
|
||||
let a: [Int]? = [1, 2, 3]
|
||||
let b: [Int]? = [1, 2, 3]
|
||||
let c: [Int]? = nil
|
||||
|
||||
XCTAssertTrue(a == b)
|
||||
XCTAssertFalse(a == c)
|
||||
}
|
||||
}
|
||||
|
|
Loading…
Reference in New Issue