modular-arithmetic 2.0.0.0 → 2.0.0.1
raw patch · 3 files changed
+4/−4 lines, 3 filesPVP ok
version bump matches the API change (PVP)
API changes (from Hackage documentation)
Files
- README.md +1/−1
- modular-arithmetic.cabal +2/−2
- src/Data/Modular.hs +1/−1
README.md view
@@ -1,7 +1,7 @@ # Modular Arithmetic [](http://hackage.haskell.org/package/modular-arithmetic)-[](https://travis-ci.org/TikhonJelvis/modular-arithmetic)+ This package provides a type for integers modulo some constant, usually written as ℤ/n.
modular-arithmetic.cabal view
@@ -1,6 +1,6 @@ cabal-version: 2.2 name: modular-arithmetic-version: 2.0.0.0+version: 2.0.0.1 synopsis: A type for integers modulo some constant. description: A convenient type for working with integers modulo some constant. It saves you from manually wrapping numeric operations all over the place and prevents a range of simple mistakes. @Integer `Mod` 7@ is the type of integers (mod 7) backed by @Integer@.@@ -31,7 +31,7 @@ , typelits-witnesses <0.5 test-suite examples- hs-source-dirs: test-suite+ hs-source-dirs: test-suite, src main-is: DocTest.hs default-language: Haskell2010 type: exitcode-stdio-1.0
src/Data/Modular.hs view
@@ -293,7 +293,7 @@ -- ^ Modulus @n@ -> Maybe (SomeMod i) someModVal i n = do- SomeNat (_ :: p n) <- someNatVal n+ SomeNat (_ :: Proxy n) <- someNatVal n case SNat @1 %<=? SNat @n of LE Refl -> pure $ SomeMod $ toMod @n i NLE _ _ -> Nothing