linear-programming-0.0.1: Linear Programming basic definitions
Safe HaskellSafe-Inferred
LanguageHaskell98

Numeric.LinearProgramming.Test

Documentation

class (Storable a, Random a, Num a, Ord a) => Element a Source #

Minimal complete definition

doubleFromElement

Instances

Instances details
Element Int64 Source # 
Instance details

Defined in Numeric.LinearProgramming.Test

Element Double Source # 
Instance details

Defined in Numeric.LinearProgramming.Test

forAllProblem :: (Indexed sh, Index sh ~ ix, Show ix) => (Testable prop, Element a) => Array sh a -> (Bounds ix -> Constraints ix -> prop) -> Property Source #

forAllBoundedProblem :: (Indexed sh, Index sh ~ ix, Show ix) => (Testable prop, Element a) => Array sh a -> (Bounds ix -> Constraints ix -> prop) -> Property Source #

genObjective :: (Indexed sh, Index sh ~ ix, Element a) => Array sh a -> Gen (Direction, Objective sh) Source #

forAllObjectives :: (Indexed sh, Index sh ~ ix, Show ix) => (Testable prop, Element a) => Array sh a -> (T [] (Direction, [Term (Index sh)]) -> prop) -> Property Source #

successiveObjectives :: (Indexed sh, Index sh ~ ix) => Array sh a -> Double -> T [] (Direction, [Term ix]) -> ((Direction, Objective sh), [(Double -> Constraints ix, (Direction, Objective sh))]) Source #

approxReal :: (Ord a, Num a) => a -> a -> a -> Bool Source #

approx :: (PrintfArg a, Ord a, Num a) => String -> a -> a -> a -> Property Source #

checkFeasibility :: (Indexed sh, Index sh ~ ix) => Double -> Bounds ix -> Constraints ix -> Array sh Double -> Property Source #

affineCombination :: (C sh, Eq sh, Storable a, Num a) => a -> Array sh a -> Array sh a -> Array sh a Source #

scalarProduct :: (C sh, Eq sh, Storable a, Num a) => Array sh a -> Array sh a -> a Source #