Copyright	(c) Masahiro Sakai 2016
License	BSD-style
Maintainer	masahiro.sakai@gmail.com
Stability	provisional
Portability	portable
Safe Haskell	None
Language	Haskell2010

ToySolver.Arith.Simplex.Simple

Description

Synopsis

Documentation

type Model = IntMap Rational Source #

data OptDir :: * #

The OptDir type represents optimization directions.

Constructors

OptMin	minimization
OptMax	maximization

Instances

Bounded OptDir
Methods minBound :: OptDir # maxBound :: OptDir #
Enum OptDir
Methods succ :: OptDir -> OptDir # pred :: OptDir -> OptDir # toEnum :: Int -> OptDir # fromEnum :: OptDir -> Int # enumFrom :: OptDir -> [OptDir] # enumFromThen :: OptDir -> OptDir -> [OptDir] # enumFromTo :: OptDir -> OptDir -> [OptDir] # enumFromThenTo :: OptDir -> OptDir -> OptDir -> [OptDir] #
Eq OptDir
Methods (==) :: OptDir -> OptDir -> Bool # (/=) :: OptDir -> OptDir -> Bool #
Data OptDir
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> OptDir -> c OptDir # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c OptDir # toConstr :: OptDir -> Constr # dataTypeOf :: OptDir -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c OptDir) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c OptDir) # gmapT :: (forall b. Data b => b -> b) -> OptDir -> OptDir # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> OptDir -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> OptDir -> r # gmapQ :: (forall d. Data d => d -> u) -> OptDir -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> OptDir -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> OptDir -> m OptDir # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> OptDir -> m OptDir # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> OptDir -> m OptDir #
Ord OptDir
Methods compare :: OptDir -> OptDir -> Ordering # (<) :: OptDir -> OptDir -> Bool # (<=) :: OptDir -> OptDir -> Bool # (>) :: OptDir -> OptDir -> Bool # (>=) :: OptDir -> OptDir -> Bool # max :: OptDir -> OptDir -> OptDir # min :: OptDir -> OptDir -> OptDir #
Read OptDir
Methods readsPrec :: Int -> ReadS OptDir # readList :: ReadS [OptDir] # readPrec :: ReadPrec OptDir # readListPrec :: ReadPrec [OptDir] #
Show OptDir
Methods showsPrec :: Int -> OptDir -> ShowS # show :: OptDir -> String # showList :: [OptDir] -> ShowS #
Ix OptDir
Methods range :: (OptDir, OptDir) -> [OptDir] # index :: (OptDir, OptDir) -> OptDir -> Int # unsafeIndex :: (OptDir, OptDir) -> OptDir -> Int inRange :: (OptDir, OptDir) -> OptDir -> Bool # rangeSize :: (OptDir, OptDir) -> Int # unsafeRangeSize :: (OptDir, OptDir) -> Int
Hashable OptDir
Methods hashWithSalt :: Int -> OptDir -> Int # hash :: OptDir -> Int #

data OptResult Source #

results of optimization

Constructors

Optimum
Unsat
Unbounded
ObjLimit

Instances

Eq OptResult Source #
Methods (==) :: OptResult -> OptResult -> Bool # (/=) :: OptResult -> OptResult -> Bool #
Ord OptResult Source #
Methods compare :: OptResult -> OptResult -> Ordering # (<) :: OptResult -> OptResult -> Bool # (<=) :: OptResult -> OptResult -> Bool # (>) :: OptResult -> OptResult -> Bool # (>=) :: OptResult -> OptResult -> Bool # max :: OptResult -> OptResult -> OptResult # min :: OptResult -> OptResult -> OptResult #
Show OptResult Source #
Methods showsPrec :: Int -> OptResult -> ShowS # show :: OptResult -> String # showList :: [OptResult] -> ShowS #

check :: VarSet -> [Atom Rational] -> Maybe Model Source #

optimize :: VarSet -> OptDir -> Expr Rational -> [Atom Rational] -> (OptResult, Maybe Model) Source #