Documentation

Methods

(>>=) :: Ordered a -> (a -> Ordered b) -> Ordered b #

(>>) :: Ordered a -> Ordered b -> Ordered b #

return :: a -> Ordered a #

fail :: String -> Ordered a #

Methods

fmap :: (a -> b) -> Ordered a -> Ordered b #

(<$) :: a -> Ordered b -> Ordered a #

Methods

pure :: a -> Ordered a #

(<*>) :: Ordered (a -> b) -> Ordered a -> Ordered b #

liftA2 :: (a -> b -> c) -> Ordered a -> Ordered b -> Ordered c #

(*>) :: Ordered a -> Ordered b -> Ordered b #

(<*) :: Ordered a -> Ordered b -> Ordered a #

Methods

fold :: Monoid m => Ordered m -> m #

foldMap :: Monoid m => (a -> m) -> Ordered a -> m #

foldr :: (a -> b -> b) -> b -> Ordered a -> b #

foldr' :: (a -> b -> b) -> b -> Ordered a -> b #

foldl :: (b -> a -> b) -> b -> Ordered a -> b #

foldl' :: (b -> a -> b) -> b -> Ordered a -> b #

foldr1 :: (a -> a -> a) -> Ordered a -> a #

foldl1 :: (a -> a -> a) -> Ordered a -> a #

toList :: Ordered a -> [a] #

null :: Ordered a -> Bool #

length :: Ordered a -> Int #

elem :: Eq a => a -> Ordered a -> Bool #

maximum :: Ord a => Ordered a -> a #

minimum :: Ord a => Ordered a -> a #

sum :: Num a => Ordered a -> a #

product :: Num a => Ordered a -> a #

Methods

traverse :: Applicative f => (a -> f b) -> Ordered a -> f (Ordered b) #

sequenceA :: Applicative f => Ordered (f a) -> f (Ordered a) #

mapM :: Monad m => (a -> m b) -> Ordered a -> m (Ordered b) #

sequence :: Monad m => Ordered (m a) -> m (Ordered a) #

Methods

(==) :: Ordered a -> Ordered a -> Bool #

(/=) :: Ordered a -> Ordered a -> Bool #

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Ordered a -> c (Ordered a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Ordered a) #

toConstr :: Ordered a -> Constr #

dataTypeOf :: Ordered a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Ordered a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Ordered a)) #

gmapT :: (forall b. Data b => b -> b) -> Ordered a -> Ordered a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Ordered a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Ordered a -> r #

gmapQ :: (forall d. Data d => d -> u) -> Ordered a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Ordered a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Ordered a -> m (Ordered a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Ordered a -> m (Ordered a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Ordered a -> m (Ordered a) #

Methods

compare :: Ordered a -> Ordered a -> Ordering #

(<) :: Ordered a -> Ordered a -> Bool #

(<=) :: Ordered a -> Ordered a -> Bool #

(>) :: Ordered a -> Ordered a -> Bool #

(>=) :: Ordered a -> Ordered a -> Bool #

max :: Ordered a -> Ordered a -> Ordered a #

min :: Ordered a -> Ordered a -> Ordered a #

Methods

readsPrec :: Int -> ReadS (Ordered a) #

readList :: ReadS [Ordered a] #

readPrec :: ReadPrec (Ordered a) #

readListPrec :: ReadPrec [Ordered a] #

Methods

showsPrec :: Int -> Ordered a -> ShowS #

show :: Ordered a -> String #

showList :: [Ordered a] -> ShowS #

Methods

from :: Ordered a -> Rep (Ordered a) x #

to :: Rep (Ordered a) x -> Ordered a #

Methods

rnf :: Ordered a -> () #

Methods

hashWithSalt :: Int -> Ordered a -> Int #

hash :: Ordered a -> Int #

Methods

leq :: Ordered a -> Ordered a -> Bool Source #

comparable :: Ordered a -> Ordered a -> Bool Source #

Methods

top :: Ordered a Source #

Methods

bottom :: Ordered a Source #

Methods

(/\) :: Ordered a -> Ordered a -> Ordered a Source #

meet :: Ordered a -> Ordered a -> Ordered a Source #

Methods

(\/) :: Ordered a -> Ordered a -> Ordered a Source #

join :: Ordered a -> Ordered a -> Ordered a Source #

Methods

from1 :: f a -> Rep1 Ordered f a #

to1 :: Rep1 Ordered f a -> f a #