{-# LANGUAGE CPP #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE TypeOperators #-}
module Distribution.Compat.Semigroup
( Semigroup((<>))
, Mon.Monoid(..)
, All(..)
, Any(..)
, First'(..)
, Last'(..)
, Option'(..)
, gmappend
, gmempty
) where
import Distribution.Compat.Binary (Binary)
import Distribution.Utils.Structured (Structured)
import Data.Typeable (Typeable)
import GHC.Generics
import Data.Semigroup
import qualified Data.Monoid as Mon
newtype First' a = First' { forall a. First' a -> a
getFirst' :: a }
deriving (First' a -> First' a -> Bool
forall a. Eq a => First' a -> First' a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: First' a -> First' a -> Bool
$c/= :: forall a. Eq a => First' a -> First' a -> Bool
== :: First' a -> First' a -> Bool
$c== :: forall a. Eq a => First' a -> First' a -> Bool
Eq, First' a -> First' a -> Bool
First' a -> First' a -> Ordering
First' a -> First' a -> First' a
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
forall {a}. Ord a => Eq (First' a)
forall a. Ord a => First' a -> First' a -> Bool
forall a. Ord a => First' a -> First' a -> Ordering
forall a. Ord a => First' a -> First' a -> First' a
min :: First' a -> First' a -> First' a
$cmin :: forall a. Ord a => First' a -> First' a -> First' a
max :: First' a -> First' a -> First' a
$cmax :: forall a. Ord a => First' a -> First' a -> First' a
>= :: First' a -> First' a -> Bool
$c>= :: forall a. Ord a => First' a -> First' a -> Bool
> :: First' a -> First' a -> Bool
$c> :: forall a. Ord a => First' a -> First' a -> Bool
<= :: First' a -> First' a -> Bool
$c<= :: forall a. Ord a => First' a -> First' a -> Bool
< :: First' a -> First' a -> Bool
$c< :: forall a. Ord a => First' a -> First' a -> Bool
compare :: First' a -> First' a -> Ordering
$ccompare :: forall a. Ord a => First' a -> First' a -> Ordering
Ord, Int -> First' a -> ShowS
forall a. Show a => Int -> First' a -> ShowS
forall a. Show a => [First' a] -> ShowS
forall a. Show a => First' a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [First' a] -> ShowS
$cshowList :: forall a. Show a => [First' a] -> ShowS
show :: First' a -> String
$cshow :: forall a. Show a => First' a -> String
showsPrec :: Int -> First' a -> ShowS
$cshowsPrec :: forall a. Show a => Int -> First' a -> ShowS
Show)
instance Semigroup (First' a) where
First' a
a <> :: First' a -> First' a -> First' a
<> First' a
_ = First' a
a
newtype Last' a = Last' { forall a. Last' a -> a
getLast' :: a }
deriving (Last' a -> Last' a -> Bool
forall a. Eq a => Last' a -> Last' a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Last' a -> Last' a -> Bool
$c/= :: forall a. Eq a => Last' a -> Last' a -> Bool
== :: Last' a -> Last' a -> Bool
$c== :: forall a. Eq a => Last' a -> Last' a -> Bool
Eq, Last' a -> Last' a -> Bool
Last' a -> Last' a -> Ordering
Last' a -> Last' a -> Last' a
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
forall {a}. Ord a => Eq (Last' a)
forall a. Ord a => Last' a -> Last' a -> Bool
forall a. Ord a => Last' a -> Last' a -> Ordering
forall a. Ord a => Last' a -> Last' a -> Last' a
min :: Last' a -> Last' a -> Last' a
$cmin :: forall a. Ord a => Last' a -> Last' a -> Last' a
max :: Last' a -> Last' a -> Last' a
$cmax :: forall a. Ord a => Last' a -> Last' a -> Last' a
>= :: Last' a -> Last' a -> Bool
$c>= :: forall a. Ord a => Last' a -> Last' a -> Bool
> :: Last' a -> Last' a -> Bool
$c> :: forall a. Ord a => Last' a -> Last' a -> Bool
<= :: Last' a -> Last' a -> Bool
$c<= :: forall a. Ord a => Last' a -> Last' a -> Bool
< :: Last' a -> Last' a -> Bool
$c< :: forall a. Ord a => Last' a -> Last' a -> Bool
compare :: Last' a -> Last' a -> Ordering
$ccompare :: forall a. Ord a => Last' a -> Last' a -> Ordering
Ord, ReadPrec [Last' a]
ReadPrec (Last' a)
ReadS [Last' a]
forall a. Read a => ReadPrec [Last' a]
forall a. Read a => ReadPrec (Last' a)
forall a. Read a => Int -> ReadS (Last' a)
forall a. Read a => ReadS [Last' a]
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [Last' a]
$creadListPrec :: forall a. Read a => ReadPrec [Last' a]
readPrec :: ReadPrec (Last' a)
$creadPrec :: forall a. Read a => ReadPrec (Last' a)
readList :: ReadS [Last' a]
$creadList :: forall a. Read a => ReadS [Last' a]
readsPrec :: Int -> ReadS (Last' a)
$creadsPrec :: forall a. Read a => Int -> ReadS (Last' a)
Read, Int -> Last' a -> ShowS
forall a. Show a => Int -> Last' a -> ShowS
forall a. Show a => [Last' a] -> ShowS
forall a. Show a => Last' a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Last' a] -> ShowS
$cshowList :: forall a. Show a => [Last' a] -> ShowS
show :: Last' a -> String
$cshow :: forall a. Show a => Last' a -> String
showsPrec :: Int -> Last' a -> ShowS
$cshowsPrec :: forall a. Show a => Int -> Last' a -> ShowS
Show, forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall a x. Rep (Last' a) x -> Last' a
forall a x. Last' a -> Rep (Last' a) x
$cto :: forall a x. Rep (Last' a) x -> Last' a
$cfrom :: forall a x. Last' a -> Rep (Last' a) x
Generic, Get (Last' a)
[Last' a] -> Put
Last' a -> Put
forall a. Binary a => Get (Last' a)
forall a. Binary a => [Last' a] -> Put
forall a. Binary a => Last' a -> Put
forall t. (t -> Put) -> Get t -> ([t] -> Put) -> Binary t
putList :: [Last' a] -> Put
$cputList :: forall a. Binary a => [Last' a] -> Put
get :: Get (Last' a)
$cget :: forall a. Binary a => Get (Last' a)
put :: Last' a -> Put
$cput :: forall a. Binary a => Last' a -> Put
Binary, Typeable)
instance Structured a => Structured (Last' a)
instance Semigroup (Last' a) where
Last' a
_ <> :: Last' a -> Last' a -> Last' a
<> Last' a
b = Last' a
b
instance Functor Last' where
fmap :: forall a b. (a -> b) -> Last' a -> Last' b
fmap a -> b
f (Last' a
x) = forall a. a -> Last' a
Last' (a -> b
f a
x)
newtype Option' a = Option' { forall a. Option' a -> Maybe a
getOption' :: Maybe a }
deriving (Option' a -> Option' a -> Bool
forall a. Eq a => Option' a -> Option' a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Option' a -> Option' a -> Bool
$c/= :: forall a. Eq a => Option' a -> Option' a -> Bool
== :: Option' a -> Option' a -> Bool
$c== :: forall a. Eq a => Option' a -> Option' a -> Bool
Eq, Option' a -> Option' a -> Bool
Option' a -> Option' a -> Ordering
Option' a -> Option' a -> Option' a
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
forall {a}. Ord a => Eq (Option' a)
forall a. Ord a => Option' a -> Option' a -> Bool
forall a. Ord a => Option' a -> Option' a -> Ordering
forall a. Ord a => Option' a -> Option' a -> Option' a
min :: Option' a -> Option' a -> Option' a
$cmin :: forall a. Ord a => Option' a -> Option' a -> Option' a
max :: Option' a -> Option' a -> Option' a
$cmax :: forall a. Ord a => Option' a -> Option' a -> Option' a
>= :: Option' a -> Option' a -> Bool
$c>= :: forall a. Ord a => Option' a -> Option' a -> Bool
> :: Option' a -> Option' a -> Bool
$c> :: forall a. Ord a => Option' a -> Option' a -> Bool
<= :: Option' a -> Option' a -> Bool
$c<= :: forall a. Ord a => Option' a -> Option' a -> Bool
< :: Option' a -> Option' a -> Bool
$c< :: forall a. Ord a => Option' a -> Option' a -> Bool
compare :: Option' a -> Option' a -> Ordering
$ccompare :: forall a. Ord a => Option' a -> Option' a -> Ordering
Ord, ReadPrec [Option' a]
ReadPrec (Option' a)
ReadS [Option' a]
forall a. Read a => ReadPrec [Option' a]
forall a. Read a => ReadPrec (Option' a)
forall a. Read a => Int -> ReadS (Option' a)
forall a. Read a => ReadS [Option' a]
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [Option' a]
$creadListPrec :: forall a. Read a => ReadPrec [Option' a]
readPrec :: ReadPrec (Option' a)
$creadPrec :: forall a. Read a => ReadPrec (Option' a)
readList :: ReadS [Option' a]
$creadList :: forall a. Read a => ReadS [Option' a]
readsPrec :: Int -> ReadS (Option' a)
$creadsPrec :: forall a. Read a => Int -> ReadS (Option' a)
Read, Int -> Option' a -> ShowS
forall a. Show a => Int -> Option' a -> ShowS
forall a. Show a => [Option' a] -> ShowS
forall a. Show a => Option' a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Option' a] -> ShowS
$cshowList :: forall a. Show a => [Option' a] -> ShowS
show :: Option' a -> String
$cshow :: forall a. Show a => Option' a -> String
showsPrec :: Int -> Option' a -> ShowS
$cshowsPrec :: forall a. Show a => Int -> Option' a -> ShowS
Show, Get (Option' a)
[Option' a] -> Put
Option' a -> Put
forall a. Binary a => Get (Option' a)
forall a. Binary a => [Option' a] -> Put
forall a. Binary a => Option' a -> Put
forall t. (t -> Put) -> Get t -> ([t] -> Put) -> Binary t
putList :: [Option' a] -> Put
$cputList :: forall a. Binary a => [Option' a] -> Put
get :: Get (Option' a)
$cget :: forall a. Binary a => Get (Option' a)
put :: Option' a -> Put
$cput :: forall a. Binary a => Option' a -> Put
Binary, forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall a x. Rep (Option' a) x -> Option' a
forall a x. Option' a -> Rep (Option' a) x
$cto :: forall a x. Rep (Option' a) x -> Option' a
$cfrom :: forall a x. Option' a -> Rep (Option' a) x
Generic, forall a b. a -> Option' b -> Option' a
forall a b. (a -> b) -> Option' a -> Option' b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: forall a b. a -> Option' b -> Option' a
$c<$ :: forall a b. a -> Option' b -> Option' a
fmap :: forall a b. (a -> b) -> Option' a -> Option' b
$cfmap :: forall a b. (a -> b) -> Option' a -> Option' b
Functor, Typeable)
instance Structured a => Structured (Option' a)
instance Semigroup a => Semigroup (Option' a) where
Option' (Just a
a) <> :: Option' a -> Option' a -> Option' a
<> Option' (Just a
b) = forall a. Maybe a -> Option' a
Option' (forall a. a -> Maybe a
Just (a
a forall a. Semigroup a => a -> a -> a
<> a
b))
Option' Maybe a
Nothing <> Option' a
b = Option' a
b
Option' a
a <> Option' Maybe a
Nothing = Option' a
a
instance Semigroup a => Monoid (Option' a) where
mempty :: Option' a
mempty = forall a. Maybe a -> Option' a
Option' forall a. Maybe a
Nothing
mappend :: Option' a -> Option' a -> Option' a
mappend = forall a. Semigroup a => a -> a -> a
(<>)
gmappend :: (Generic a, GSemigroup (Rep a)) => a -> a -> a
gmappend :: forall a. (Generic a, GSemigroup (Rep a)) => a -> a -> a
gmappend a
x a
y = forall a x. Generic a => Rep a x -> a
to (forall (f :: * -> *) p. GSemigroup f => f p -> f p -> f p
gmappend' (forall a x. Generic a => a -> Rep a x
from a
x) (forall a x. Generic a => a -> Rep a x
from a
y))
class GSemigroup f where
gmappend' :: f p -> f p -> f p
instance Semigroup a => GSemigroup (K1 i a) where
gmappend' :: forall p. K1 i a p -> K1 i a p -> K1 i a p
gmappend' (K1 a
x) (K1 a
y) = forall k i c (p :: k). c -> K1 i c p
K1 (a
x forall a. Semigroup a => a -> a -> a
<> a
y)
instance GSemigroup f => GSemigroup (M1 i c f) where
gmappend' :: forall p. M1 i c f p -> M1 i c f p -> M1 i c f p
gmappend' (M1 f p
x) (M1 f p
y) = forall k i (c :: Meta) (f :: k -> *) (p :: k). f p -> M1 i c f p
M1 (forall (f :: * -> *) p. GSemigroup f => f p -> f p -> f p
gmappend' f p
x f p
y)
instance (GSemigroup f, GSemigroup g) => GSemigroup (f :*: g) where
gmappend' :: forall p. (:*:) f g p -> (:*:) f g p -> (:*:) f g p
gmappend' (f p
x1 :*: g p
x2) (f p
y1 :*: g p
y2) = forall (f :: * -> *) p. GSemigroup f => f p -> f p -> f p
gmappend' f p
x1 f p
y1 forall k (f :: k -> *) (g :: k -> *) (p :: k).
f p -> g p -> (:*:) f g p
:*: forall (f :: * -> *) p. GSemigroup f => f p -> f p -> f p
gmappend' g p
x2 g p
y2
gmempty :: (Generic a, GMonoid (Rep a)) => a
gmempty :: forall a. (Generic a, GMonoid (Rep a)) => a
gmempty = forall a x. Generic a => Rep a x -> a
to forall (f :: * -> *) p. GMonoid f => f p
gmempty'
class GSemigroup f => GMonoid f where
gmempty' :: f p
instance (Semigroup a, Monoid a) => GMonoid (K1 i a) where
gmempty' :: forall p. K1 i a p
gmempty' = forall k i c (p :: k). c -> K1 i c p
K1 forall a. Monoid a => a
mempty
instance GMonoid f => GMonoid (M1 i c f) where
gmempty' :: forall p. M1 i c f p
gmempty' = forall k i (c :: Meta) (f :: k -> *) (p :: k). f p -> M1 i c f p
M1 forall (f :: * -> *) p. GMonoid f => f p
gmempty'
instance (GMonoid f, GMonoid g) => GMonoid (f :*: g) where
gmempty' :: forall p. (:*:) f g p
gmempty' = forall (f :: * -> *) p. GMonoid f => f p
gmempty' forall k (f :: k -> *) (g :: k -> *) (p :: k).
f p -> g p -> (:*:) f g p
:*: forall (f :: * -> *) p. GMonoid f => f p
gmempty'