ordering-util-0.1.3.2: Utilities for Orderings
Safe HaskellSafe-Inferred
LanguageHaskell2010

Data.Ordering

Synopsis

Simple functions

ifEQ :: Ordering -> Ordering -> Ordering Source #

Replace the EQ case with another Ordering

isLE :: Ordering -> Bool Source #

Check an Ordering represents less-or-equal

isNE :: Ordering -> Bool Source #

Check an Ordering represents not-equal

isGE :: Ordering -> Bool Source #

Check an Ordering represents greater-or-equal

toSign :: Num n => Ordering -> n Source #

Returns -1, 0, and 1 for LT, EQ, and GT, respectively

fromSign :: (Ord n, Num n) => n -> Ordering Source #

Get an Ordering depending on the sign of a number

Compares the number to 0

adjustBy :: Num a => a -> Ordering -> a -> a Source #

Adjust a number by a difference up, down, or not at all

Reexports from base

data Ordering #

Constructors

LT 
EQ 
GT 

Instances

Instances details
Monoid Ordering

Since: base-2.1

Instance details

Defined in GHC.Base

Semigroup Ordering

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Bounded Ordering

Since: base-2.1

Instance details

Defined in GHC.Enum

Enum Ordering

Since: base-2.1

Instance details

Defined in GHC.Enum

Read Ordering

Since: base-2.1

Instance details

Defined in GHC.Read

Show Ordering

Since: base-2.1

Instance details

Defined in GHC.Show

Eq Ordering 
Instance details

Defined in GHC.Classes

Ord Ordering 
Instance details

Defined in GHC.Classes