P. 1
haskell2010

haskell2010

|Views: 71|Likes:
Published by nricci02

More info:

Categories:Types, Research, Science
Published by: nricci02 on Apr 14, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

04/28/2013

pdf

text

original

class (Eq a) => Ord a where
compare

:: a -> a -> Ordering
(<), (<=), (>=), (>) :: a -> a -> Bool
max, min

:: a -> a -> a

compare x y | x == y = EQ
| x <= y = LT
| otherwise = GT

x <= y = compare x y /= GT
x < y = compare x y == LT
x >= y = compare x y /= LT
x > y = compare x y == GT

-- Note that (min x y, max x y) = (x,y) or (y,x)
max x y | x <= y = y
| otherwise = x
min x y | x <= y = x
| otherwise = y

The Ord class is used for totally ordered datatypes. All basic datatypes except for functions, IO, and
IOError, are instances of this class. Instances of Ord can be derived for any user-defined datatype whose
constituent types are in Ord. The declared order of the constructors in the data declaration determines the
ordering in derived Ord instances. The Ordering datatype allows a single comparison to determine the
precise ordering of two objects.

The default declarations allow a user to create anOrdinstance either with a type-specificcomparefunction
or with type-specific == and <= functions.

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->