-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Functions for detecting duplicates
--   
--   Functions for detecting duplicates in a list
@package ordering-duplicates
@version 0.0.2

module Data.Ord.Ordering
type OrderingKnownEq = Maybe Ordering
newtype Order b a
Order :: (a -> a -> b) -> Order b a
class IsOrdering a
_Ordering :: IsOrdering a => Prism' a Ordering
_LT :: IsOrdering a => Prism' a ()
_EQ :: IsOrdering a => Prism' a ()
_GT :: IsOrdering a => Prism' a ()
class IsOrdering a => IsOrderingKnownEq a
_OrderingKnownEq :: IsOrderingKnownEq a => Prism' a OrderingKnownEq
_KnownEQ :: IsOrderingKnownEq a => Prism' a ()
order :: Iso (Order b a) (Order b' a') (a -> a -> b) (a' -> a' -> b')
lt :: IsOrdering b => Order b a
isLT :: IsOrdering b => Order b a -> a -> a -> Bool
ifLT :: IsOrdering x => a -> a -> x -> a
eq :: IsOrdering b => Order b a
isEQ :: IsOrdering b => Order b a -> a -> a -> Bool
ifEQ :: IsOrdering x => a -> a -> x -> a
gt :: IsOrdering b => Order b a
isGT :: IsOrdering b => Order b a -> a -> a -> Bool
ifGT :: IsOrdering x => a -> a -> x -> a
knownEq :: IsOrderingKnownEq b => Order b a
isKnownEq :: IsOrderingKnownEq b => Order b a -> a -> a -> Bool
ifKnownEq :: IsOrderingKnownEq x => a -> a -> x -> a
ordOrder :: (Ord a, IsOrdering b) => Order b a
knownUnknownOrdering :: (IsOrderingKnownEq t, IsOrderingKnownEq a) => t -> a
mapOrdering :: (b -> b') -> Order b a -> Order b' a
knownUnknownOrder :: IsOrderingKnownEq b => Order b a -> Order b a
(*>>) :: Applicative f => Order (f a1) a2 -> Order (f b) a2 -> Order (f b) a2
infixr 6 *>>
appendOrder :: Semigroup x => Order x x
listOrder :: (IsOrdering b, Semigroup b) => Order b a -> Order b [a]
orderL :: Contravariant f => Getting a s a -> f a -> f s
orderL' :: (Ord a, IsOrdering b) => Getting a s a -> Order b s
orderS :: Contravariant f => StateT a Identity b -> f b -> f a
orderS' :: (Ord x, IsOrdering b) => StateT a Identity x -> Order b a
duplicates :: KnownEqOrd OrderingKnownEq a => (t -> a) -> [t] -> [(t, t)]
class Ord a => KnownEqOrd b a
knownEqCompare :: KnownEqOrd b a => Order b a
areEqual :: (Eq a, IsOrdering b) => a -> a -> Order b a -> Order b a
(.===.) :: (Ord a, IsOrdering b) => a -> a -> Order b a
instance Data.Ord.Ordering.IsOrderingKnownEq Data.Ord.Ordering.OrderingKnownEq
instance Data.Ord.Ordering.IsOrdering GHC.Types.Ordering
instance Data.Ord.Ordering.IsOrdering (GHC.Maybe.Maybe GHC.Types.Bool)
instance Data.Ord.Ordering.IsOrdering Data.Ord.Ordering.OrderingKnownEq
instance GHC.Base.Semigroup b => GHC.Base.Semigroup (Data.Ord.Ordering.Order b a)
instance GHC.Base.Monoid b => GHC.Base.Monoid (Data.Ord.Ordering.Order b a)
instance Data.Functor.Contravariant.Contravariant (Data.Ord.Ordering.Order b)
instance GHC.Base.Monoid b => Data.Functor.Contravariant.Divisible.Divisible (Data.Ord.Ordering.Order b)
instance GHC.Base.Monoid b => Data.Functor.Contravariant.Divisible.Decidable (Data.Ord.Ordering.Order b)