Ritt-Wu-0.1.0.0: Parallel implementation of Ritt-Wu's algorithm.

Safe HaskellNone
LanguageHaskell2010

Polynomial.Wu

Documentation

newtype PS t ord Source #

Constructors

PS (Array N Ix1 (Idp t ord)) 
Instances
(NFData t, Eq t) => Eq (PS t ord) Source # 
Instance details

Defined in Polynomial.Wu

Methods

(==) :: PS t ord -> PS t ord -> Bool #

(/=) :: PS t ord -> PS t ord -> Bool #

(NFData t, Ord t, Num t, Show t) => Show (PS t ord) Source # 
Instance details

Defined in Polynomial.Wu

Methods

showsPrec :: Int -> PS t ord -> ShowS #

show :: PS t ord -> String #

showList :: [PS t ord] -> ShowS #

Generic (PS t ord) Source # 
Instance details

Defined in Polynomial.Wu

Associated Types

type Rep (PS t ord) :: Type -> Type #

Methods

from :: PS t ord -> Rep (PS t ord) x #

to :: Rep (PS t ord) x -> PS t ord #

NFData t => NFData (PS t ord) Source # 
Instance details

Defined in Polynomial.Wu

Methods

rnf :: PS t ord -> () #

type Rep (PS t ord) Source # 
Instance details

Defined in Polynomial.Wu

type Rep (PS t ord)

psBsUParP :: (NFData t, Num t, Eq t) => PS t Revlex -> PS t Revlex -> PS t Revlex Source #

psBsUParS :: (NFData t, Fractional t, Num t, Eq t, Ord t) => PS t Revlex -> PS t Revlex -> PS t Revlex Source #

charSetMSP :: (NFData t, Fractional t, Ord t, Eq t, Num t) => PS t Revlex -> PS t Revlex Source #

charSetMPS :: (NFData t, Eq t, Num t) => PS t Revlex -> PS t Revlex Source #

t :: k -> [Int] -> Term k ord Source #

tp :: k -> [Int] -> [Int] -> Term k ord Source #

parps :: NFData t => [Poly t ord] -> PS t ord Source #