[swiftlint] Fix rule: colon (i.e. should be next to identifier)

warning: Colon Violation: Colons should be next to the identifier when specifying a type and next to the key in dictionary literals.

Author: jawwad

Diff for: Bucket Sort/BucketSort.playground/Sources/BucketSort.swift

@@ -122,7 +122,7 @@ public struct InsertionSorter: Sorter {
 // MARK: Bucket
 //////////////////////////////////////
 
-public struct Bucket<T:Sortable> {
+public struct Bucket<T: Sortable> {
   var elements: [T]
   let capacity: Int
 

Diff for: Bucket Sort/BucketSort.swift

@@ -173,7 +173,7 @@ public struct InsertionSorter: Sorter {
 // MARK: Bucket
 //////////////////////////////////////
 
-public struct Bucket<T:Sortable> {
+public struct Bucket<T: Sortable> {
     var elements: [T]
     let capacity: Int
 

Diff for: Convex Hull/Convex Hull/View.swift

@@ -150,7 +150,7 @@ class View: UIView {
         let context = UIGraphicsGetCurrentContext()
 
         // Draw hull
-        let lineWidth:CGFloat = 2.0
+        let lineWidth: CGFloat = 2.0
 
         context!.setFillColor(UIColor.black.cgColor)
         context!.setLineWidth(lineWidth)

Diff for: Deque/Deque-Optimized.swift

@@ -7,7 +7,7 @@ public struct Deque<T> {
   private var array: [T?]
   private var head: Int
   private var capacity: Int
-  private let originalCapacity:Int
+  private let originalCapacity: Int
 
   public init(_ capacity: Int = 10) {
     self.capacity = max(capacity, 1)

Diff for: Linked List/LinkedList.playground/Contents.swift

@@ -177,7 +177,7 @@ public final class LinkedList<T> {
     if list.isEmpty { return }
     var (prev, next) = nodesBeforeAndAfter(index: index)
     var nodeToCopy = list.head
-    var newNode:Node?
+    var newNode: Node?
     while let node = nodeToCopy {
       newNode = Node(value: node.value)
       newNode?.previous = prev

Diff for: Linked List/LinkedList.swift

@@ -129,7 +129,7 @@ public final class LinkedList<T> {
         if list.isEmpty { return }
         var (prev, next) = nodesBeforeAndAfter(index: index)
         var nodeToCopy = list.head
-        var newNode:Node?
+        var newNode: Node?
         while let node = nodeToCopy {
             newNode = Node(value: node.value)
             newNode?.previous = prev

Diff for: Red-Black Tree/Red-Black Tree 2.playground/Sources/RBTree.swift

@@ -7,9 +7,9 @@ private enum RBTColor {
 public class RBTNode<T: Comparable>: CustomStringConvertible {
     fileprivate var color: RBTColor = .red
     public var value: T! = nil
-    public var right:  RBTNode<T>!
-    public var left:  RBTNode<T>!
-    public var parent:  RBTNode<T>!
+    public var right: RBTNode<T>!
+    public var left: RBTNode<T>!
+    public var parent: RBTNode<T>!
 
     public var description: String {
         if self.value == nil {
@@ -435,7 +435,7 @@ public class RBTree<T: Comparable>: CustomStringConvertible {
     private func property3() {
         let bDepth = blackDepth(root: self.root)
 
-        let leaves:[RBTNode<T>] = getLeaves(n: self.root)
+        let leaves: [RBTNode<T>] = getLeaves(n: self.root)
 
         for leaflet in leaves {
             var leaf = leaflet

Diff for: Skip-List/SkipList.swift

@@ -283,7 +283,7 @@ extension SkipList {
 
 extension SkipList {
 
-  public func get(key:Key) -> Payload? {
+  public func get(key: Key) -> Payload? {
     return search(key: key)
   }
 }

Diff for: Topological Sort/Graph.swift

@@ -4,7 +4,7 @@ public class Graph: CustomStringConvertible {
   private(set) public var adjacencyLists: [Node : [Node]]
 
   public init() {
-    adjacencyLists = [Node : [Node]]()
+    adjacencyLists = [Node: [Node]]()
   }
 
   public func addNode(_ value: Node) -> Node {
@@ -35,7 +35,7 @@ extension Graph {
   typealias InDegree = Int
 
   func calculateInDegreeOfNodes() -> [Node : InDegree] {
-    var inDegrees = [Node : InDegree]()
+    var inDegrees = [Node: InDegree]()
 
     for (node, _) in adjacencyLists {
       inDegrees[node] = 0

Diff for: Topological Sort/Topological Sort.playground/Sources/Graph.swift

@@ -4,7 +4,7 @@ public class Graph: CustomStringConvertible {
   private(set) public var adjacencyLists: [Node : [Node]]
 
   public init() {
-    adjacencyLists = [Node : [Node]]()
+    adjacencyLists = [Node: [Node]]()
   }
 
   public func addNode(_ value: Node) -> Node {
@@ -35,7 +35,7 @@ extension Graph {
   typealias InDegree = Int
 
   func calculateInDegreeOfNodes() -> [Node : InDegree] {
-    var inDegrees = [Node : InDegree]()
+    var inDegrees = [Node: InDegree]()
 
     for (node, _) in adjacencyLists {
       inDegrees[node] = 0

Diff for: Topological Sort/Topological Sort.playground/Sources/TopologicalSort1.swift

@@ -23,7 +23,7 @@ extension Graph {
       return node
     })
 
-    var visited = [Node : Bool]()
+    var visited = [Node: Bool]()
     for (node, _) in adjacencyLists {
       visited[node] = false
     }

Diff for: Topological Sort/TopologicalSort1.swift

@@ -23,7 +23,7 @@ extension Graph {
       return node
     })
 
-    var visited = [Node : Bool]()
+    var visited = [Node: Bool]()
     for (node, _) in adjacencyLists {
       visited[node] = false
     }