[swiftlint] Fix rule: empty_parentheses_with_trailing_closure

warning: Empty Parentheses with Trailing Closure Violation: When using trailing closures, empty parentheses should be avoided after the method call.

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

@@ -175,7 +175,7 @@ public struct FloydWarshallResult<T>: APSPResult where T: Hashable {
   public func path(fromVertex from: Vertex<T>, toVertex to: Vertex<T>, inGraph graph: AbstractGraph<T>) -> [T]? {
 
     if let path = recursePathFrom(fromVertex: from, toVertex: to, path: [ to ], inGraph: graph) {
-      let pathValues = path.map() { vertex in
+      let pathValues = path.map { vertex in
         vertex.data
       }
       return pathValues

Bloom Filter/BloomFilter.playground/Contents.swift

@@ -10,7 +10,7 @@ public class BloomFilter<T> {
   }
 
   private func computeHashes(_ value: T) -> [Int] {
-    return hashFunctions.map() { hashFunc in abs(hashFunc(value) % array.count) }
+    return hashFunctions.map { hashFunc in abs(hashFunc(value) % array.count) }
   }
 
   public func insert(_ element: T) {
@@ -29,7 +29,7 @@ public class BloomFilter<T> {
     let hashValues = computeHashes(value)
 
     // Map hashes to indices in the Bloom Filter
-    let results = hashValues.map() { hashValue in array[hashValue] }
+    let results = hashValues.map { hashValue in array[hashValue] }
 
     // All values must be 'true' for the query to return true
 

Bloom Filter/BloomFilter.swift

@@ -8,7 +8,7 @@ public class BloomFilter<T> {
   }
 
   private func computeHashes(_ value: T) -> [Int] {
-    return hashFunctions.map() { hashFunc in abs(hashFunc(value) % array.count) }
+    return hashFunctions.map { hashFunc in abs(hashFunc(value) % array.count) }
   }
 
   public func insert(_ element: T) {
@@ -27,7 +27,7 @@ public class BloomFilter<T> {
     let hashValues = computeHashes(value)
 
     // Map hashes to indices in the Bloom Filter
-    let results = hashValues.map() { hashValue in array[hashValue] }
+    let results = hashValues.map { hashValue in array[hashValue] }
 
     // All values must be 'true' for the query to return true
 

Graph/Graph/AdjacencyListGraph.swift

@@ -64,7 +64,7 @@ open class AdjacencyListGraph<T>: AbstractGraph<T> where T: Equatable, T: Hashab
 
   open override func createVertex(_ data: T) -> Vertex<T> {
     // check if the vertex already exists
-    let matchingVertices = vertices.filter() { vertex in
+    let matchingVertices = vertices.filter { vertex in
       return vertex.data == data
     }
 

Graph/Graph/AdjacencyMatrixGraph.swift

@@ -46,7 +46,7 @@ open class AdjacencyMatrixGraph<T>: AbstractGraph<T> where T: Equatable, T: Hash
   // Performance: possibly O(n^2) because of the resizing of the matrix.
   open override func createVertex(_ data: T) -> Vertex<T> {
     // check if the vertex already exists
-    let matchingVertices = vertices.filter() { vertex in
+    let matchingVertices = vertices.filter { vertex in
       return vertex.data == data
     }
 

Single-Source Shortest Paths (Weighted)/SSSP/BellmanFord.swift

@@ -41,7 +41,7 @@ extension BellmanFord: SSSPAlgorithm {
 
     for _ in 0 ..< vertices.count - 1 {
       var weightsUpdated = false
-      edges.forEach() { edge in
+      edges.forEach { edge in
         let weight = edge.weight!
         let relaxedDistance = weights[edge.from.index] + weight
         let nextVertexIdx = edge.to.index
@@ -116,7 +116,7 @@ extension BellmanFordResult: SSSPResult {
       return nil
     }
 
-    return path.map() { vertex in
+    return path.map { vertex in
       return vertex.data
     }
   }

Trie/Trie/TrieTests/TrieTests.swift

@@ -101,7 +101,7 @@ class TrieTests: XCTestCase {
 
     /// Tests the performance of the insert method.
     func testInsertPerformance() {
-        self.measure() {
+        self.measure {
             let trie = Trie()
             for word in self.wordArray! {
                 trie.insert(word: word)
@@ -114,7 +114,7 @@ class TrieTests: XCTestCase {
     /// Tests the performance of the insert method when the words are already
     /// present.
     func testInsertAgainPerformance() {
-        self.measure() {
+        self.measure {
             for word in self.wordArray! {
                 self.trie.insert(word: word)
             }
@@ -123,7 +123,7 @@ class TrieTests: XCTestCase {
 
     /// Tests the performance of the contains method.
     func testContainsPerformance() {
-        self.measure() {
+        self.measure {
             for word in self.wordArray! {
                 XCTAssertTrue(self.trie.contains(word: word))
             }
@@ -136,7 +136,7 @@ class TrieTests: XCTestCase {
         for word in self.wordArray! {
             self.trie.remove(word: word)
         }
-        self.measure() {
+        self.measure {
             self.insertWordsIntoTrie()
             for word in self.wordArray! {
                 self.trie.remove(word: word)