Safe Haskell	None
Language	Haskell2010

Factory.Math.Implementations.PrimeFactorisation

Contents

Description

Synopsis

Types

Data-types

The algorithms by which prime-factorisation has been implemented.

Constructors

FermatsMethod	https://en.wikipedia.org/wiki/Fermat%27s_factorization_method.
TrialDivision	https://en.wikipedia.org/wiki/Trial_division.

Instances

Eq Algorithm Source #
Methods (==) :: Algorithm -> Algorithm -> Bool # (/=) :: Algorithm -> Algorithm -> Bool #
Read Algorithm Source #
Methods readsPrec :: Int -> ReadS Algorithm # readList :: ReadS [Algorithm] # readPrec :: ReadPrec Algorithm # readListPrec :: ReadPrec [Algorithm] #
Show Algorithm Source #
Methods showsPrec :: Int -> Algorithm -> ShowS # show :: Algorithm -> String # showList :: [Algorithm] -> ShowS #
Default Algorithm Source #
Methods def :: Algorithm #
Algorithmic Algorithm Source #
Methods primeFactors :: (NFData base, Integral base) => Algorithm -> base -> Factors base Int Source #