We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2.2.2
1 parent 9083bb9 commit b9bde32Copy full SHA for b9bde32
.github/workflows/nim_test.yml
@@ -20,7 +20,7 @@ jobs:
20
- macos-latest
21
- windows-latest
22
nim-version:
23
- - '2.0.8'
+ - '2.2.2'
24
25
steps:
26
- uses: actions/checkout@v4
maths/modular_inverse.nim
@@ -56,15 +56,15 @@ when isMainModule:
56
check modularInverse(tc.a, tc.modulus).get() == tc.inv
57
58
test "No inverse when modulus is 1":
59
- check modularInverse(0, 1).is_none()
60
- check modularInverse(1, 1).is_none()
61
- check modularInverse(-1, 1).is_none()
+ check modularInverse(0, 1).isNone()
+ check modularInverse(1, 1).isNone()
+ check modularInverse(-1, 1).isNone()
62
63
test "No inverse when inputs are not co-prime":
64
- check modularInverse(2, 4).is_none()
65
- check modularInverse(-5, 25).is_none()
66
- check modularInverse(0, 17).is_none()
67
- check modularInverse(17, 17).is_none()
+ check modularInverse(2, 4).isNone()
+ check modularInverse(-5, 25).isNone()
+ check modularInverse(0, 17).isNone()
+ check modularInverse(17, 17).isNone()
68
69
randomize()
70
const randomTestSize = 10
0 commit comments