Cosmetic changes…

Author: waynewbishop

Source/Factories/BSTree.swift

@@ -10,7 +10,7 @@ import Foundation
 
  /*
  note: self-balancing binary search tree (BST). Elements are positioned based on their value.
- After insertion, model is checked for balance and automatically completed required rotations.
+ After insertion, model is checked for balance and automatically completes required rotations.
  */
 
 

Source/Factories/Graph.swift

@@ -171,11 +171,9 @@ public class SwiftGraph {
                     bestPath = itemPath
                     pathIndex = x
                 }
-                
             }
 
 
-            
             //enumerate the bestPath edges
             for e in bestPath.destination.neighbors {
 
@@ -188,7 +186,6 @@ public class SwiftGraph {
 
                 //add the new path to the frontier
                 frontier.append(newPath)
-                
             }
 
 

Source/Structures/Node.swift

@@ -11,7 +11,6 @@ import Foundation
 
 //generic node used for stacks, queues and hash tables
 
-
 class Node<T> {
 
     var key: T?

SwiftStructures.xcodeproj/project.xcworkspace/xcuserdata/waynebishop.xcuserdatad/UserInterfaceState.xcuserstate

@@ -133,10 +133,9 @@ class FibTest: XCTestCase {
 
 
     /*
-     notes: method purposely left out of the Int class extension. 
-     function included for demonstration purposes and should not be 
+     notes: function included for demonstration purposes and should not be
      considered as best practice.
-    */
+     */
 
     func fibExponential(n: Int) -> Int {
 

SwiftTests/FibTest.swift

@@ -23,6 +23,7 @@ class SortingTest: XCTestCase, Sortable {
 
     //test input types for algorithms
     var numberList = [8, 2, 10, 9, 7, 5]
+    var searchList = [0,4,7,9,13,16,34]
     var trivialNumberList = [1]
     var emptyNumberList: Array<Int> = []
     var textList = ["Dog", "Cat", "Dinasour", "Lion", "Cheetah", "Gazelle", "Elephant", "Aardvark"]
@@ -63,16 +64,22 @@ class SortingTest: XCTestCase, Sortable {
     }
 
 
-    func testBinaryTestNotFound() {
+    func testBinaryNotFound() {
 
-        var searchList: Array<Int> = [0,4,7,9,13,16,34]
         let key: Int = 8
 
         //test for false positive
         XCTAssertFalse(searchList.binarySearch(forElement: key), "binary key value \(key) found..")
     }
 
 
+    func testBinaryFound() {
+        
+        let key: Int = 9
+        
+        XCTAssertTrue(searchList.binarySearch(forElement: key), "binary key value \(key) not found..")
+    }
+    
 
     //MARK: General Sorting Algorithms