Merge branch 'main' into bogo-sort

Author: ibrahimelnemr

.github/workflows/build_directory_md.yml

@@ -19,10 +19,12 @@ jobs:
       - uses: actions/checkout@v4
 
       - uses: jiro4989/setup-nim-action@v2
+        with:
+          parent-nim-install-directory: ${{ runner.temp }}
 
       - name: Build file
         run: |
-          git clean -f -x -d
+          git clean --force -x -d
 
           # Compile the script first
           nim c -o:directory_script .scripts/directory.nim

.github/workflows/check_code_format.yml

@@ -19,6 +19,10 @@ jobs:
           fetch-depth: 0
 
       - uses: jiro4989/setup-nim-action@v2
+        with:
+          nim-version: stable
+          repo-token: ${{ secrets.GITHUB_TOKEN }}
+          parent-nim-install-directory: ${{ runner.temp }}
 
       - name: Format code
         run: |

maths/haversine_distance.nim

@@ -0,0 +1,53 @@
+# Haversine formula
+
+import std/math
+
+func haversineDistance(latitudeA, longitudeA, latitudeB,
+    longitudeB: float): float =
+  ## returns the length of the shortest path connecting the input points on an unit sphere.
+  ## The input points are represented by their spherical/geographical coordinates.
+  ## The inputs are expected to be in radians.
+  let
+    dLatitude = latitudeB - latitudeA
+    dLongitude = longitudeB - longitudeA
+    a = sin(dLatitude / 2.0)^2 + cos(latitudeA) * cos(latitudeB) * sin(
+        dLongitude / 2.0)^2
+  2.0 * arcsin(sqrt(a))
+
+when isMainModule:
+  import std/[unittest, sequtils, strformat]
+  suite "haversineDistance":
+    const testCases = [
+      (0.0, 0.0, 0.0, 0.0, 0.0),
+      (0.0, 0.0, PI / 2.0, 0.0, PI / 2.0),
+      (-PI / 2.0, 0.0, PI / 2.0, 0.0, PI),
+      (0.0, 0.0, 0.0, PI / 2.0, PI / 2.0),
+      (0.0, -PI / 2.0, 0.0, PI / 2.0, PI),
+      (1.0, -PI / 2.0, -1.0, PI / 2.0, PI),
+      (2.0, -PI / 2.0, -2.0, PI / 2.0, PI),
+      (3.0, -PI / 2.0, -3.0, PI / 2.0, PI),
+      (3.0, -PI / 2.0 + 0.5, -3.0, PI / 2.0 + 0.5, PI),
+      (0.0, 0.0, 0.0, PI, PI),
+      (PI / 2.0, 1.0, PI / 2.0, 2.0, 0.0),
+      (-PI / 2.0, 1.0, -PI / 2.0, 2.0, 0.0),
+      (0.0, 0.0, -PI / 4.0, 0.0, PI / 4.0),
+      (0.0, 1.0, PI / 4.0, 1.0, PI / 4.0),
+      (-PI / 2.0, 0.0, -PI / 4.0, 0.0, PI / 4.0),
+      (-PI / 2.0, 0.0, -PI / 4.0, 0.6, PI / 4.0),
+      (-PI / 2.0, 3.0, -PI / 4.0, 0.2, PI / 4.0),
+      ].mapIt:
+        (id: fmt"posA=({it[0]}, {it[1]}), posB=({it[2]}, {it[3]})",
+         latitudeA: it[0], longitudeA: it[1],
+         latitudeB: it[2], longitudeB: it[3],
+         expected: it[4])
+
+    func isClose(a, b: float): bool =
+      return abs(a-b) < 0.0000001
+
+    for tc in testCases:
+      test tc.id:
+        checkpoint("returns expected result")
+        check isClose(haversineDistance(tc.latitudeA, tc.longitudeA,
+            tc.latitudeB, tc.longitudeB), tc.expected)
+        check isClose(haversineDistance(tc.latitudeB, tc.longitudeB,
+            tc.latitudeA, tc.longitudeA), tc.expected)

maths/modular_inverse.nim

@@ -67,7 +67,7 @@ when isMainModule:
       check modularInverse(17, 17).is_none()
 
     randomize()
-    const randomTestSize = 1000
+    const randomTestSize = 10
     for testNum in 0..randomTestSize:
       let a = rand(-10000000..10000000)
       let modulus = rand(1..1000000)

strings/check_anagram.nim

@@ -59,7 +59,7 @@ func toLowerUnchecked(c: char): char {.inline.} =
   # 0b100_0001, so setting the sixth bit to 1 gives letter's lowercase pair.
   char(uint8(c) or 0b0010_0000'u8)
 
-template normalizeChar(c: char) =
+template normalizeChar(c: char): char =
   ## Checks if the character is a letter and lowers its case.
   ##
   ## Raises a `ValueError` on other characters.