id -package:universum -package:med-module package:mixed-types-num

id :: a -> a
mixed-types-num Numeric.MixedTypes.PreludeHiding
Identity function. 
id x = x
divide :: CanDiv t1 t2 => t1 -> t2 -> DivType t1 t2
mixed-types-num Numeric.MixedTypes.Div
class CanTestValid t
mixed-types-num Numeric.MixedTypes.Eq
isValid :: CanTestValid t => t -> Bool
mixed-types-num Numeric.MixedTypes.Eq
specResultIsValid1 :: (Arbitrary t1, Show t1, CanTestValid t1, CanTestValid t2) => (t1 -> t2) -> String -> T t1 -> Spec
mixed-types-num Numeric.MixedTypes.Eq
HSpec property checking the validity of unary operations' results.
specResultIsValid1Pre :: (Arbitrary t1, Show t1, CanTestValid t1, CanTestValid t2) => (t1 -> Bool) -> (t1 -> t2) -> String -> T t1 -> Spec
mixed-types-num Numeric.MixedTypes.Eq
specResultIsValid2 :: (Arbitrary t1, Show t1, Arbitrary t2, Show t2, CanTestValid t1, CanTestValid t2, CanTestValid t3) => (t1 -> t2 -> t3) -> String -> T t1 -> T t2 -> Spec
mixed-types-num Numeric.MixedTypes.Eq
HSpec properties that check validity of operations' results.
specResultIsValid2Pre :: (Arbitrary t1, Show t1, Arbitrary t2, Show t2, CanTestValid t1, CanTestValid t2, CanTestValid t3) => (t1 -> t2 -> Bool) -> (t1 -> t2 -> t3) -> String -> T t1 -> T t2 -> Spec
mixed-types-num Numeric.MixedTypes.Eq
module Numeric.MixedTypes.PreludeHiding
mixed-types-num
Prelude without operations that clash with MixedTypes
class Semigroup a => Monoid a
mixed-types-num Numeric.MixedTypes.PreludeHiding
The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following: The method names refer to the monoid of lists under concatenation, but there are many other instances. Some types can be viewed as a monoid in more than one way, e.g. both addition and multiplication on numbers. In such cases we often define newtypes and make those instances of Monoid, e.g. Sum and Product. NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.