crypto-numbers-0.2.7: Cryptographic numbers: functions and algorithms
LicenseBSD-style
MaintainerVincent Hanquez <vincent@snarc.org>
Stabilityexperimental
PortabilityGood
Safe HaskellNone
LanguageHaskell98

Crypto.Number.Polynomial

Description

 
Synopsis

Documentation

data Monomial Source #

Constructors

Monomial !Int !Integer 

Instances

Instances details
Eq Monomial Source # 
Instance details

Defined in Crypto.Number.Polynomial

Methods

(==) :: Monomial -> Monomial -> Bool

(/=) :: Monomial -> Monomial -> Bool

Ord Monomial Source # 
Instance details

Defined in Crypto.Number.Polynomial

Methods

compare :: Monomial -> Monomial -> Ordering

(<) :: Monomial -> Monomial -> Bool

(<=) :: Monomial -> Monomial -> Bool

(>) :: Monomial -> Monomial -> Bool

(>=) :: Monomial -> Monomial -> Bool

max :: Monomial -> Monomial -> Monomial

min :: Monomial -> Monomial -> Monomial

Show Monomial Source # 
Instance details

Defined in Crypto.Number.Polynomial

Methods

showsPrec :: Int -> Monomial -> ShowS

show :: Monomial -> String

showList :: [Monomial] -> ShowS

polynomial operations

data Polynomial Source #

Instances

Instances details
Eq Polynomial Source # 
Instance details

Defined in Crypto.Number.Polynomial

Methods

(==) :: Polynomial -> Polynomial -> Bool

(/=) :: Polynomial -> Polynomial -> Bool

Show Polynomial Source # 
Instance details

Defined in Crypto.Number.Polynomial

Methods

showsPrec :: Int -> Polynomial -> ShowS

show :: Polynomial -> String

showList :: [Polynomial] -> ShowS