satchmo-2.9.9.4: SAT encoding monad

Safe Haskell	Safe-Inferred
Language	Haskell2010

Satchmo.Polynomial

Synopsis

data Poly a = Poly [a]
type NumPoly = Poly Number
polynomial :: MonadSAT m => Int -> Int -> m NumPoly
constant :: MonadSAT m => Integer -> m NumPoly
fromCoefficients :: MonadSAT m => Int -> [Integer] -> m NumPoly
isNull :: Poly a -> Bool
null :: Poly a
constantTerm :: Poly a -> a
coefficients :: Poly a -> [a]
equals :: MonadSAT m => NumPoly -> NumPoly -> m Boolean
ge :: MonadSAT m => NumPoly -> NumPoly -> m Boolean
gt :: MonadSAT m => NumPoly -> NumPoly -> m Boolean
add :: MonadSAT m => NumPoly -> NumPoly -> m NumPoly
times :: MonadSAT m => NumPoly -> NumPoly -> m NumPoly
subtract :: MonadSAT m => NumPoly -> NumPoly -> m NumPoly
compose :: MonadSAT m => NumPoly -> NumPoly -> m NumPoly
apply :: MonadSAT m => NumPoly -> Number -> m Number
derive :: MonadSAT m => NumPoly -> m NumPoly

Documentation

data Poly a Source #

polynomial in one variable, coefficients starting from degree zero

Constructors

Poly [a]

Instances

Instances details

Decode m a Integer => Decode m (Poly a) (Poly Integer) Source #
Instance details Defined in Satchmo.Polynomial Methods decode :: Poly a -> m (Poly Integer) Source #
Show a => Show (Poly a) Source #
Instance details Defined in Satchmo.Polynomial Methods showsPrec :: Int -> Poly a -> ShowS # show :: Poly a -> String # showList :: [Poly a] -> ShowS #
Eq a => Eq (Poly a) Source #
Instance details Defined in Satchmo.Polynomial Methods (==) :: Poly a -> Poly a -> Bool # (/=) :: Poly a -> Poly a -> Bool #
Ord a => Ord (Poly a) Source #
Instance details Defined in Satchmo.Polynomial Methods compare :: Poly a -> Poly a -> Ordering # (<) :: Poly a -> Poly a -> Bool # (<=) :: Poly a -> Poly a -> Bool # (>) :: Poly a -> Poly a -> Bool # (>=) :: Poly a -> Poly a -> Bool # max :: Poly a -> Poly a -> Poly a # min :: Poly a -> Poly a -> Poly a #

type NumPoly = Poly Number Source #

polynomial Source #

Arguments

:: MonadSAT m
=> Int	Bits
-> Int	Degree
-> m NumPoly

constant :: MonadSAT m => Integer -> m NumPoly Source #

fromCoefficients Source #

Arguments

:: MonadSAT m
=> Int	Bits
-> [Integer]	Coefficients
-> m NumPoly

isNull :: Poly a -> Bool Source #

null :: Poly a Source #

constantTerm :: Poly a -> a Source #

coefficients :: Poly a -> [a] Source #

equals :: MonadSAT m => NumPoly -> NumPoly -> m Boolean Source #

ge :: MonadSAT m => NumPoly -> NumPoly -> m Boolean Source #

gt :: MonadSAT m => NumPoly -> NumPoly -> m Boolean Source #

add :: MonadSAT m => NumPoly -> NumPoly -> m NumPoly Source #

times :: MonadSAT m => NumPoly -> NumPoly -> m NumPoly Source #

subtract :: MonadSAT m => NumPoly -> NumPoly -> m NumPoly Source #

compose :: MonadSAT m => NumPoly -> NumPoly -> m NumPoly Source #

compose p(x) q(x) = p(q(x))

apply :: MonadSAT m => NumPoly -> Number -> m Number Source #

apply p x applies number x to polynomial p

derive :: MonadSAT m => NumPoly -> m NumPoly Source #

derive p computes the derivation of p