Merge pull request kodecocodes#156 from chris-pilcher/Set-Cover-Unweighted-Linting

Removing swiftlint warnings from Set Cover (Unweighted)

Author: Chris Pilcher

Set Cover (Unweighted)/SetCover.playground/Contents.swift

@@ -3,7 +3,7 @@ let array1 = randomArrayOfSets(covering: universe1)
 let cover1 = universe1.cover(within: array1)
 
 let universe2 = Set(1...10)
-let array2: Array<Set<Int>> = [[1,2,3,4,5,6,7], [8,9]]
+let array2: Array<Set<Int>> = [[1, 2, 3, 4, 5, 6, 7], [8, 9]]
 let cover2 = universe2.cover(within: array2)
 
 let universe3 = Set(["tall", "heavy"])
@@ -14,7 +14,7 @@ let universe4 = Set(["tall", "heavy", "green"])
 let cover4 = universe4.cover(within: array3)
 
 let universe5: Set<Int> = [16, 32, 64]
-let array5: Array<Set<Int>> = [[16,17,18], [16,32,128], [1,2,3], [32,64,128]]
+let array5: Array<Set<Int>> = [[16, 17, 18], [16, 32, 128], [1, 2, 3], [32, 64, 128]]
 let cover5 = universe5.cover(within: array5)
 
 let universe6: Set<Int> = [24, 89, 132, 90, 22]

Set Cover (Unweighted)/SetCover.playground/Sources/RandomArrayOfSets.swift

@@ -5,17 +5,17 @@ public func randomArrayOfSets<T>(covering universe: Set<T>,
                               maxSetSizeFactor: Double = 0.6) -> Array<Set<T>> {
   var result = [Set<T>]()
   var ongoingUnion = Set<T>()
-  
+
   let minArraySize = Int(Double(universe.count) * minArraySizeFactor)
   var maxSetSize = Int(Double(universe.count) * maxSetSizeFactor)
   if maxSetSize > universe.count {
     maxSetSize = universe.count
   }
-  
+
   while true {
     var generatedSet = Set<T>()
     let targetSetSize = Int(arc4random_uniform(UInt32(maxSetSize)) + 1)
-    
+
     while true {
       let randomUniverseIndex = Int(arc4random_uniform(UInt32(universe.count)))
       for (setIndex, value) in universe.enumerate() {
@@ -24,20 +24,20 @@ public func randomArrayOfSets<T>(covering universe: Set<T>,
           break
         }
       }
-      
+
       if generatedSet.count == targetSetSize {
         result.append(generatedSet)
         ongoingUnion = ongoingUnion.union(generatedSet)
         break
       }
     }
-    
+
     if result.count >= minArraySize {
       if ongoingUnion == universe {
         break
       }
     }
   }
-  
+
   return result
-}
+}

Set Cover (Unweighted)/SetCover.playground/Sources/SetCover.swift

@@ -2,32 +2,32 @@ public extension Set {
   func cover(within array: Array<Set<Element>>) -> Array<Set<Element>>? {
     var result: [Set<Element>]? = [Set<Element>]()
     var remainingSet = self
-    
+
     func largestIntersectingSet() -> Set<Element>? {
       var largestIntersectionLength = 0
       var largestSet: Set<Element>?
-      
+
       for set in array {
         let intersectionLength = remainingSet.intersect(set).count
         if intersectionLength > largestIntersectionLength {
           largestIntersectionLength = intersectionLength
           largestSet = set
         }
       }
-      
+
       return largestSet
     }
-    
+
     while remainingSet.count != 0 {
       guard let largestSet = largestIntersectingSet() else { break }
       result!.append(largestSet)
       remainingSet = remainingSet.subtract(largestSet)
     }
-    
+
     if remainingSet.count != 0 || self.count == 0 {
       result = nil
     }
-    
+
     return result
   }
-}
+}

Set Cover (Unweighted)/SetCover.swift

@@ -2,32 +2,32 @@ extension Set {
   func cover(within array: Array<Set<Element>>) -> Array<Set<Element>>? {
     var result: [Set<Element>]? = [Set<Element>]()
     var remainingSet = self
-    
+
     func largestIntersectingSet() -> Set<Element>? {
       var largestIntersectionLength = 0
       var largestSet: Set<Element>?
-      
+
       for set in array {
         let intersectionLength = remainingSet.intersect(set).count
         if intersectionLength > largestIntersectionLength {
           largestIntersectionLength = intersectionLength
           largestSet = set
         }
       }
-      
+
       return largestSet
     }
-    
+
     while remainingSet.count != 0 {
       guard let largestSet = largestIntersectingSet() else { break }
       result!.append(largestSet)
       remainingSet = remainingSet.subtract(largestSet)
     }
-    
+
     if remainingSet.count != 0 || self.count == 0 {
       result = nil
     }
-    
+
     return result
   }
-}
+}