format with julefmt

Author: mertcandav

search/interpolation.jule

@@ -27,17 +27,14 @@ fn Interpolation(sortedData: []int, guess: int)!: int {
 				mid--
 			}
 			ret mid
-
 		}
 
 		// adjust our guess and continue
 		if sortedData[mid] > guess {
-			high, highVal = mid-1, sortedData[high]
-
+			high, highVal = mid - 1, sortedData[high]
 		} else {
-			low, lowVal = mid+1, sortedData[low]
+			low, lowVal = mid + 1, sortedData[low]
 		}
-
 	}
 
 	if guess == lowVal {

search/jump.jule

@@ -48,5 +48,4 @@ fn Jump(array: []int, target: int)!: int {
 	}
 
 	error(Error.NotFound)
-
 }

search/linear.jule

@@ -6,4 +6,4 @@ fn Linear(array: []int, query: int)!: int {
 		}
 	}
 	error(Error.NotFound)
-}
+}

sort/bucket.jule

@@ -39,4 +39,4 @@ fn Bucket[T: numeric](mut arr: []T): []T {
 	}
 
 	ret sorted
-}
+}

sort/circle.jule

@@ -3,7 +3,8 @@ fn Circle[T: ordered](mut arr: []T): []T {
 	if len(arr) == 0 {
 		ret arr
 	}
-	for doSort(arr, 0, len(arr)-1) {}
+	for doSort(arr, 0, len(arr)-1) {
+	}
 	ret arr
 }
 
@@ -35,4 +36,4 @@ fn doSort[T: ordered](mut arr: []T, left: int, right: int): bool {
 	rightHalf := doSort(arr, mid+1, right)
 
 	ret swapped || leftHalf || rightHalf
-}
+}

sort/cocktail.jule

@@ -49,4 +49,4 @@ fn Cocktail[T: ordered](mut arr: []T): []T {
 	}
 
 	ret arr
-}
+}

sort/comb.jule

@@ -27,4 +27,4 @@ fn Comb[T: ordered](mut data: []T): []T {
 		}
 	}
 	ret data
-}
+}

sort/count.jule

@@ -28,4 +28,4 @@ fn Count[T: int | i64 | i32 | i16 | i8 | uint | u8 | u16 | u32 | u64](mut data:
 		}
 	}
 	ret data
-}
+}

sort/cycle.jule

@@ -51,4 +51,4 @@ fn Cycle[T: numeric](mut arr: []T): []T {
 	}
 
 	ret arr
-}
+}

sort/exchange.jule

@@ -12,4 +12,4 @@ fn Exchange[T: ordered](mut arr: []T): []T {
 		}
 	}
 	ret arr
-}
+}