Test.ClassLaws.TestingFinFuns

Functions from a finite type can be shown, checked for equality, and generated. We provide variants both for total and for partial values.

Documentation

showPartialFun :: (Bounded a, Enum a, Show (Partial b), Show (Partial a)) => (a -> b) -> String

showFun :: (Enum a, Bounded a, Show a, Show b) => (a -> b) -> String

enumElems :: (Bounded a, Enum a) => [a]

arbitraryPartialFun :: forall e a. (Enum e, Bounded e, SemanticOrd a) => Gen a -> Gen (e -> a)

type FunTab e a = [a]

table2fun :: (Enum e, Bounded e, SemanticOrd a) => FunTab e a -> e -> a

lMeet :: SemanticOrd a => [a] -> a

semanticLE :: t -> a -> a1 -> Bool

type SemEq a = Tweak -> a -> a -> Bool

semEqFun :: (Bounded a, Enum a) => SemEq b -> SemEq (a -> b)

lessEqPartial :: Bool -> a -> a1 -> Bool

eqPartial :: Bool -> a -> a1 -> Bool

meetPartial :: a2 -> a -> a1 -> a2