Ord package:mixed-types-num

module Numeric.MixedTypes.Ord
mixed-types-num
class (Field t, OrderedCertainlyRing t, HasOrderCertainly t Rational, HasOrderCertainly t Rational) => OrderedCertainlyField t
mixed-types-num Numeric.MixedTypes.Field
class (Field t, OrderedRing t, HasOrder t Rational, HasOrder t Rational) => OrderedField t
mixed-types-num Numeric.MixedTypes.Field
type family OrderCompareType a b
mixed-types-num Numeric.MixedTypes.Ord
type OrderCompareType a b = Bool
mixed-types-num Numeric.MixedTypes.Ord
data Ordering
mixed-types-num Numeric.MixedTypes.PreludeHiding
class (Ring t, HasEqCertainly t t, HasEqCertainly t Int, HasEq t Integer, HasOrderCertainly t t, HasOrderCertainly t Int, HasOrderCertainly t Integer, CanTestPosNeg t) => OrderedCertainlyRing t
mixed-types-num Numeric.MixedTypes.Ring
class (Ring t, HasEq t t, HasEq t Int, HasEq t Integer, HasOrder t t, HasOrder t Int, HasOrder t Integer) => OrderedRing t
mixed-types-num Numeric.MixedTypes.Ring
module Numeric.OrdGenericBool
mixed-types-num
Order ops with generic return type. Originally developed for semi-decidable comparisons that return Kleenean instead of Bool. Use in combination with: import Prelude hiding ((==),(/=),(),(<=),(),(>=),abs,max,min,not,(&&),(||)) import qualified Prelude as P The usual comparison operators are still available using the P prefix.
type HasOrder t1 t2 = (HasOrderAsymmetric t1 t2, HasOrderAsymmetric t2 t1, OrderCompareType t1 t2 ~ OrderCompareType t2 t1)
mixed-types-num Numeric.MixedTypes.Ord
class (IsBool (OrderCompareType a b)) => HasOrderAsymmetric a b
mixed-types-num Numeric.MixedTypes.Ord
type HasOrderCertainly t1 t2 = (HasOrder t1 t2, CanTestCertainly (OrderCompareType t1 t2))
mixed-types-num Numeric.MixedTypes.Ord
type HasOrderCertainlyAsymmetric t1 t2 = (HasOrderAsymmetric t1 t2, CanTestCertainly (OrderCompareType t1 t2))
mixed-types-num Numeric.MixedTypes.Ord
specHasOrder :: _ => T t1 -> T t2 -> T t3 -> Spec
mixed-types-num Numeric.MixedTypes.Ord
HSpec properties that each implementation of HasOrder should satisfy.
specHasOrderNotMixed :: _ => T t -> Spec
mixed-types-num Numeric.MixedTypes.Ord
HSpec properties that each implementation of HasOrder should satisfy.
data Word
mixed-types-num Numeric.MixedTypes.PreludeHiding
A Word is an unsigned integral type, with the same size as Int.
unwords :: [String] -> String
mixed-types-num Numeric.MixedTypes.PreludeHiding
unwords is an inverse operation to words. It joins words with separating spaces. 
>>> unwords ["Lorem", "ipsum", "dolor"]
"Lorem ipsum dolor"
words :: String -> [String]
mixed-types-num Numeric.MixedTypes.PreludeHiding
words breaks a string up into a list of words, which were delimited by white space. 
>>> words "Lorem ipsum\ndolor"
["Lorem","ipsum","dolor"]