satchmo-2.9.9.4: SAT encoding monad
Safe HaskellSafe-Inferred
LanguageHaskell2010

Satchmo.PolynomialN

Documentation

type Coefficient a = a Source #

type Exponents = [Integer] Source #

data PolynomialN a Source #

Instances

Instances details
Decode m a Integer => Decode m (PolynomialN a) (PolynomialN Integer) Source # 
Instance details

Defined in Satchmo.PolynomialN

Methods

decode :: PolynomialN a -> m (PolynomialN Integer) Source #

Show a => Show (PolynomialN a) Source # 
Instance details

Defined in Satchmo.PolynomialN

Methods

showsPrec :: Int -> PolynomialN a -> ShowS #

show :: PolynomialN a -> String #

showList :: [PolynomialN a] -> ShowS #

type NumPolynomialN = PolynomialN Number Source #

fromMonomials Source #

Arguments

:: MonadSAT m 
=> Int

bit width of coefficients

-> [(Coefficient Integer, Exponents)]

monomials

-> m NumPolynomialN 

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

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