smart-math
Safe HaskellNone
LanguageHaskell2010

Numeric.Data.ModN.Internal

Description

Provides the ModN type for modular arithmetic.

Since: 0.1

Synopsis

Type

newtype ModN (n :: Nat) a Source #

Newtype wrapper that represents \( \mathbb{Z}/n\mathbb{Z} \). ModN is a Ring i.e. supports addition, subtraction, and multiplication.

When constructing a ModN n a we must verify that the type a is large enough to accommodate n, hence the possible failure.

Examples

Expand
>>> import Data.Text.Display (display)
>>> display $ unsafeModN @7 10
"3 (mod 7)"

Since: 0.1

Constructors

UnsafeModN a 

Bundled Patterns

pattern MkModN :: a -> ModN n a

Bidirectional pattern synonym for ModN. Construction will apply modular reduction to the parameter.

Since: 0.1

Instances

Instances details
HasField "unModN" (ModN n a :: Type) (a :: Type) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

getField :: ModN n a -> a #

(k ~ A_Getter, x ~ a, y ~ a) => LabelOptic "unModN" k (ModN n a) (ModN n a) x y Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

labelOptic :: Optic k NoIx (ModN n a) (ModN n a) x y Source #

Lift a => Lift (ModN n a :: Type) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

lift :: Quote m => ModN n a -> m Exp #

liftTyped :: forall (m :: Type -> Type). Quote m => ModN n a -> Code m (ModN n a) #

Foldable (ModN n) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

fold :: Monoid m => ModN n m -> m #

foldMap :: Monoid m => (a -> m) -> ModN n a -> m #

foldMap' :: Monoid m => (a -> m) -> ModN n a -> m #

foldr :: (a -> b -> b) -> b -> ModN n a -> b #

foldr' :: (a -> b -> b) -> b -> ModN n a -> b #

foldl :: (b -> a -> b) -> b -> ModN n a -> b #

foldl' :: (b -> a -> b) -> b -> ModN n a -> b #

foldr1 :: (a -> a -> a) -> ModN n a -> a #

foldl1 :: (a -> a -> a) -> ModN n a -> a #

toList :: ModN n a -> [a] #

null :: ModN n a -> Bool #

length :: ModN n a -> Int #

elem :: Eq a => a -> ModN n a -> Bool #

maximum :: Ord a => ModN n a -> a #

minimum :: Ord a => ModN n a -> a #

sum :: Num a => ModN n a -> a #

product :: Num a => ModN n a -> a #

(AMonoid a, FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a, Typeable a) => AGroup (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

(.-.) :: ModN n a -> ModN n a -> ModN n a Source #

(AMonoid a, FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a, Typeable a) => AMonoid (ModN n a) Source #

WARNING: Partial

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

zero :: ModN n a Source #

(ASemigroup a, FromInteger a, KnownNat n, MEuclidean a, ToInteger a, MaybeUpperBounded a) => ASemigroup (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

(.+.) :: ModN n a -> ModN n a -> ModN n a Source #

(AGroup a, FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a, Typeable a) => MetricSpace (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

diffR :: ModN n a -> ModN n a -> Double Source #

(FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a, Typeable a) => MMonoid (ModN n a) Source #

WARNING: Partial

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

one :: ModN n a Source #

(FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a) => MSemigroup (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

(.*.) :: ModN n a -> ModN n a -> ModN n a Source #

(AMonoid a, FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a, Typeable a) => Demiring (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

(AMonoid a, FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a, Typeable a) => Hemiring (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

(AMonoid a, FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a, Typeable a) => PseudoRing (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

(AMonoid a, FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a) => Quartaring (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

(AGroup a, FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a, Typeable a) => Ring (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

(AMonoid a, FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a, Typeable a) => Semiring (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

(FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a, Typeable a) => FromInteger (ModN n a) Source #

WARNING: Partial

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

fromZ :: Integer -> ModN n a Source #

ToInteger a => ToInteger (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

toZ :: ModN n a -> Integer Source #

ToRational a => ToRational (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

toQ :: ModN n a -> Rational Source #

ToReal a => ToReal (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

toR :: ModN n a -> Double Source #

(AMonoid a, FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a, Typeable a) => LowerBounded (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

lowerBound :: ModN n a Source #

(AMonoid a, FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a, Typeable a) => MaybeLowerBounded (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

maybeLowerBound :: Maybe (ModN n a) Source #

(FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a, Typeable a) => MaybeUpperBounded (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

maybeUpperBound :: Maybe (ModN n a) Source #

(FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a, Typeable a) => UpperBounded (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

upperBound :: ModN n a Source #

NFData a => NFData (ModN n a) Source #

Since: 0.1.0.0

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

rnf :: ModN n a -> () #

(AMonoid a, FromInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a, Typeable a) => Bounded (ModN n a) Source #

WARNING: Partial

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

minBound :: ModN n a #

maxBound :: ModN n a #

Generic (ModN n a) Source # 
Instance details

Defined in Numeric.Data.ModN.Internal

Associated Types

type Rep (ModN n a)

Since: smart-math-0.1

Instance details

Defined in Numeric.Data.ModN.Internal

type Rep (ModN n a) = D1 ('MetaData "ModN" "Numeric.Data.ModN.Internal" "smart-math-0.1-inplace" 'True) (C1 ('MetaCons "UnsafeModN" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))

Methods

from :: ModN n a -> Rep (ModN n a) x #

to :: Rep (ModN n a) x -> ModN n a #

(KnownNat n, Show a) => Show (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

showsPrec :: Int -> ModN n a -> ShowS #

show :: ModN n a -> String #

showList :: [ModN n a] -> ShowS #

Eq a => Eq (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

(==) :: ModN n a -> ModN n a -> Bool #

(/=) :: ModN n a -> ModN n a -> Bool #

Ord a => Ord (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

compare :: ModN n a -> ModN n a -> Ordering #

(<) :: ModN n a -> ModN n a -> Bool #

(<=) :: ModN n a -> ModN n a -> Bool #

(>) :: ModN n a -> ModN n a -> Bool #

(>=) :: ModN n a -> ModN n a -> Bool #

max :: ModN n a -> ModN n a -> ModN n a #

min :: ModN n a -> ModN n a -> ModN n a #

Hashable a => Hashable (ModN n a) Source #

Since: 0.1.0.0

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

hashWithSalt :: Int -> ModN n a -> Int Source #

hash :: ModN n a -> Int Source #

(KnownNat n, Show a) => Display (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

Methods

displayBuilder :: ModN n a -> Builder Source #

displayList :: [ModN n a] -> Builder Source #

displayPrec :: Int -> ModN n a -> Builder Source #

type Rep (ModN n a) Source #

Since: 0.1

Instance details

Defined in Numeric.Data.ModN.Internal

type Rep (ModN n a) = D1 ('MetaData "ModN" "Numeric.Data.ModN.Internal" "smart-math-0.1-inplace" 'True) (C1 ('MetaCons "UnsafeModN" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))

Creation

mkModN :: forall (n :: Nat) a. (FromInteger a, ToInteger a, KnownNat n, MaybeUpperBounded a, MEuclidean a, Typeable a) => a -> Either String (ModN n a) Source #

Constructor for ModN.

Examples

Expand
>>> mkModN @5 7
Right (MkModN 2 (mod 5))

>>> mkModN @10 7
Right (MkModN 7 (mod 10))

>>> mkModN @128 (9 :: Int8)
Left "Type 'Int8' has a maximum size of 127. This is not large enough to safely implement mod 128."

Since: 0.1

unsafeModN :: forall (n :: Nat) a. (FromInteger a, HasCallStack, KnownNat n, MaybeUpperBounded a, MEuclidean a, ToInteger a, Typeable a) => a -> ModN n a Source #

Variant of mkModN that throws an error when type a is not large enough to fit n.

WARNING: Partial

Examples

Expand
>>> unsafeModN @7 12
MkModN 5 (mod 7)

Since: 0.1

reallyUnsafeModN :: forall (n :: Nat) a. (FromInteger a, KnownNat n, MEuclidean a) => a -> ModN n a Source #

This function reduces the argument modulo p but does not check that n fits within a. Note that correct behavior requires this, so this is dangerous. This is intended only for when we absolutely know n fits in a and the check is undesirable for performance reasons. Exercise extreme caution.

Since: 0.1

Misc

errMsg :: String -> String Source #

Since: 0.1