Swiftlint autocorrect

Author: ph1ps

AVL Tree/AVLTree.playground/Sources/AVLTree.swift

@@ -341,11 +341,11 @@ extension AVLTree {
       }
     } else {
       // Handle stem cases
-      if let replacement = node.leftChild?.maximum() , replacement !== node {
+      if let replacement = node.leftChild?.maximum(), replacement !== node {
         node.key = replacement.key
         node.payload = replacement.payload
         delete(node: replacement)
-      } else if let replacement = node.rightChild?.minimum() , replacement !== node {
+      } else if let replacement = node.rightChild?.minimum(), replacement !== node {
         node.key = replacement.key
         node.payload = replacement.payload
         delete(node: replacement)
@@ -354,7 +354,6 @@ extension AVLTree {
   }
 }
 
-
 // MARK: - Debugging
 
 extension TreeNode: CustomDebugStringConvertible {

AVL Tree/AVLTree.swift

@@ -341,11 +341,11 @@ extension AVLTree {
       }
     } else {
       // Handle stem cases
-      if let replacement = node.leftChild?.maximum() , replacement !== node {
+      if let replacement = node.leftChild?.maximum(), replacement !== node {
         node.key = replacement.key
         node.payload = replacement.payload
         delete(node: replacement)
-      } else if let replacement = node.rightChild?.minimum() , replacement !== node {
+      } else if let replacement = node.rightChild?.minimum(), replacement !== node {
         node.key = replacement.key
         node.payload = replacement.payload
         delete(node: replacement)
@@ -354,7 +354,6 @@ extension AVLTree {
   }
 }
 
-
 // MARK: - Debugging
 
 extension TreeNode: CustomDebugStringConvertible {

AVL Tree/Tests/TreeNodeTests.swift

@@ -27,7 +27,6 @@ class TreeNodeTests: XCTestCase {
         super.tearDown()
     }
 
-
     func testSingleNodeCreationNOPayload() {
         let treeNode = TreeNode<String, String>(key: "Building")
         XCTAssertNil(treeNode.payload, "Payload for this case should be nil")

All-Pairs Shortest Paths/APSP/APSP/Helpers.swift

@@ -7,7 +7,6 @@
 
 import Foundation
 
-
 /**
  Print a matrix, optionally specifying only the cells to display with the triplet (i, j, k) -> matrix[i][j], matrix[i][k], matrix[k][j]
  */

Array2D/Array2D.playground/Contents.swift

@@ -28,7 +28,6 @@ public struct Array2D<T> {
   }
 }
 
-
 // initialization
 var matrix = Array2D(columns: 3, rows: 5, initialValue: 0)
 

Binary Tree/BinaryTree.playground/Contents.swift

@@ -25,8 +25,6 @@ extension BinaryTree: CustomStringConvertible {
   }
 }
 
-
-
 // leaf nodes
 let node5 = BinaryTree.node(.empty, "5", .empty)
 let nodeA = BinaryTree.node(.empty, "a", .empty)
@@ -50,8 +48,6 @@ let tree = BinaryTree.node(timesLeft, "+", timesRight)
 print(tree)
 tree.count  // 12
 
-
-
 extension BinaryTree {
   public func traverseInOrder(process: (T) -> Void) {
     if case let .node(left, value, right) = self {

Bit Set/BitSet.playground/Contents.swift

@@ -29,9 +29,6 @@ print(bits)
 
 print("")
 
-
-
-
 // Bitwise operations
 
 var a = BitSet(size: 4)
@@ -69,9 +66,6 @@ print(~c)  // 0101110000000000000000000000000000000000000000000000000000000000
 (~b).cardinality  // 5
 (~c).cardinality  // 4
 
-
-
-
 var z = BitSet(size: 66)
 z.all0()        // true
 z.all1()        // false
@@ -93,8 +87,5 @@ z.all1()        // true
 z[65] = false
 z.all1()        // false
 
-
-
-
 //var bigBits = BitSet(size: 10000)
 //print(bigBits)

Bloom Filter/BloomFilter.playground/Contents.swift

@@ -47,8 +47,6 @@ public class BloomFilter<T> {
   }
 }
 
-
-
 /* Two hash functions, adapted from http://www.cse.yorku.ca/~oz/hash.html */
 
 func djb2(x: String) -> Int {
@@ -67,8 +65,6 @@ func sdbm(x: String) -> Int {
   return Int(hash)
 }
 
-
-
 /* A simple test */
 
 let bloom = BloomFilter<String>(size: 17, hashFunctions: [djb2, sdbm])

Bloom Filter/Tests/BloomFilterTests.swift

@@ -23,7 +23,6 @@ func sdbm(_ x: String) -> Int {
   return Int(hash)
 }
 
-
 class BloomFilterTests: XCTestCase {
 
   func testSingleHashFunction() {

Bounded Priority Queue/BoundedPriorityQueue.playground/Contents.swift

@@ -15,8 +15,6 @@ func < (m1: Message, m2: Message) -> Bool {
   return m1.priority < m2.priority
 }
 
-
-
 let queue = BoundedPriorityQueue<Message>(maxElements: 5)
 queue.count
 
@@ -48,8 +46,6 @@ print(queue)
 // At this point, the queue is:
 // <world:150, swift:110, hello:100, there:99, is:30, >
 
-
-
 // Try to insert an item with a really low priority. This should not get added.
 queue.enqueue(Message(name: "very", priority: -1))
 queue.count    // 5
@@ -70,8 +66,6 @@ queue.count
 queue.peek()
 print(queue)
 
-
-
 // Test dequeuing
 queue.dequeue()
 queue.count