{-# LANGUAGE Safe, CPP, MultiParamTypeClasses, FunctionalDependencies #-}
{-# LANGUAGE ConstraintKinds #-}
#if __GLASGOW_HASKELL__ >= 806
{-# LANGUAGE QuantifiedConstraints, RankNTypes #-}
#endif
module SDP.SortM
(
SortM (..), SortM1, SortM2,
#if __GLASGOW_HASKELL__ >= 806
SortM', SortM'',
#endif
sortM, sortMOn, sortedM, sortedMOn
)
where
import Prelude ()
import SDP.SafePrelude
default ()
class SortM m s e | s -> m, s -> e
where
{-# MINIMAL sortedMBy, sortMBy #-}
sortedMBy :: (e -> e -> Bool) -> s -> m Bool
sortMBy :: Compare e -> s -> m ()
type SortM1 m s e = SortM m (s e) e
type SortM2 m s i e = SortM m (s i e)
#if __GLASGOW_HASKELL__ >= 806
type SortM' m s = forall e . SortM m (s e) e
type SortM'' m s = forall i e . SortM m (s i e)
#endif
sortedM :: (SortM m s e, Ord e) => s -> m Bool
sortedM :: s -> m Bool
sortedM = (e -> e -> Bool) -> s -> m Bool
forall (m :: * -> *) s e.
SortM m s e =>
(e -> e -> Bool) -> s -> m Bool
sortedMBy e -> e -> Bool
forall a. Ord a => a -> a -> Bool
(<=)
sortedMOn :: (SortM m s e, Ord o) => (e -> o) -> s -> m Bool
sortedMOn :: (e -> o) -> s -> m Bool
sortedMOn = (e -> e -> Bool) -> s -> m Bool
forall (m :: * -> *) s e.
SortM m s e =>
(e -> e -> Bool) -> s -> m Bool
sortedMBy ((e -> e -> Bool) -> s -> m Bool)
-> ((e -> o) -> e -> e -> Bool) -> (e -> o) -> s -> m Bool
forall k (cat :: k -> k -> *) (b :: k) (c :: k) (a :: k).
Category cat =>
cat b c -> cat a b -> cat a c
. ((o -> o -> Bool) -> (e -> o) -> e -> e -> Bool
forall b c a. (b -> b -> c) -> (a -> b) -> a -> a -> c
on o -> o -> Bool
forall a. Ord a => a -> a -> Bool
(<=))
sortM :: (SortM m s e, Ord e) => s -> m ()
sortM :: s -> m ()
sortM = Compare e -> s -> m ()
forall (m :: * -> *) s e. SortM m s e => Compare e -> s -> m ()
sortMBy Compare e
forall a. Ord a => a -> a -> Ordering
compare
sortMOn :: (SortM m s e, Ord o) => (e -> o) -> s -> m ()
sortMOn :: (e -> o) -> s -> m ()
sortMOn = Compare e -> s -> m ()
forall (m :: * -> *) s e. SortM m s e => Compare e -> s -> m ()
sortMBy (Compare e -> s -> m ())
-> ((e -> o) -> Compare e) -> (e -> o) -> s -> m ()
forall k (cat :: k -> k -> *) (b :: k) (c :: k) (a :: k).
Category cat =>
cat b c -> cat a b -> cat a c
. (e -> o) -> Compare e
forall a b. Ord a => (b -> a) -> b -> b -> Ordering
comparing