{-# LANGUAGE CPP #-}
{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE DeriveFoldable #-}
{-# LANGUAGE DeriveTraversable #-}
module Data.Optional (
Optional(..)
, defaultTo
, fromOptional
, optional
, empty
, pure
) where
import Control.Applicative (Applicative(..), Alternative(..), liftA2)
import Control.Monad (MonadPlus(..))
import Data.Foldable (Foldable)
import Data.Traversable (Traversable)
import Data.Monoid (Monoid(..))
import Data.Semigroup (Semigroup(..))
import Data.String (IsString(..))
data Optional a = Default | Specific a
deriving (Optional a -> Optional a -> Bool
(Optional a -> Optional a -> Bool)
-> (Optional a -> Optional a -> Bool) -> Eq (Optional a)
forall a. Eq a => Optional a -> Optional a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Optional a -> Optional a -> Bool
$c/= :: forall a. Eq a => Optional a -> Optional a -> Bool
== :: Optional a -> Optional a -> Bool
$c== :: forall a. Eq a => Optional a -> Optional a -> Bool
Eq, (forall a b. (a -> b) -> Optional a -> Optional b)
-> (forall a b. a -> Optional b -> Optional a) -> Functor Optional
forall a b. a -> Optional b -> Optional a
forall a b. (a -> b) -> Optional a -> Optional 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 -> Optional b -> Optional a
$c<$ :: forall a b. a -> Optional b -> Optional a
fmap :: forall a b. (a -> b) -> Optional a -> Optional b
$cfmap :: forall a b. (a -> b) -> Optional a -> Optional b
Functor, (forall m. Monoid m => Optional m -> m)
-> (forall m a. Monoid m => (a -> m) -> Optional a -> m)
-> (forall m a. Monoid m => (a -> m) -> Optional a -> m)
-> (forall a b. (a -> b -> b) -> b -> Optional a -> b)
-> (forall a b. (a -> b -> b) -> b -> Optional a -> b)
-> (forall b a. (b -> a -> b) -> b -> Optional a -> b)
-> (forall b a. (b -> a -> b) -> b -> Optional a -> b)
-> (forall a. (a -> a -> a) -> Optional a -> a)
-> (forall a. (a -> a -> a) -> Optional a -> a)
-> (forall a. Optional a -> [a])
-> (forall a. Optional a -> Bool)
-> (forall a. Optional a -> Int)
-> (forall a. Eq a => a -> Optional a -> Bool)
-> (forall a. Ord a => Optional a -> a)
-> (forall a. Ord a => Optional a -> a)
-> (forall a. Num a => Optional a -> a)
-> (forall a. Num a => Optional a -> a)
-> Foldable Optional
forall a. Eq a => a -> Optional a -> Bool
forall a. Num a => Optional a -> a
forall a. Ord a => Optional a -> a
forall m. Monoid m => Optional m -> m
forall a. Optional a -> Bool
forall a. Optional a -> Int
forall a. Optional a -> [a]
forall a. (a -> a -> a) -> Optional a -> a
forall m a. Monoid m => (a -> m) -> Optional a -> m
forall b a. (b -> a -> b) -> b -> Optional a -> b
forall a b. (a -> b -> b) -> b -> Optional a -> b
forall (t :: * -> *).
(forall m. Monoid m => t m -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. t a -> [a])
-> (forall a. t a -> Bool)
-> (forall a. t a -> Int)
-> (forall a. Eq a => a -> t a -> Bool)
-> (forall a. Ord a => t a -> a)
-> (forall a. Ord a => t a -> a)
-> (forall a. Num a => t a -> a)
-> (forall a. Num a => t a -> a)
-> Foldable t
product :: forall a. Num a => Optional a -> a
$cproduct :: forall a. Num a => Optional a -> a
sum :: forall a. Num a => Optional a -> a
$csum :: forall a. Num a => Optional a -> a
minimum :: forall a. Ord a => Optional a -> a
$cminimum :: forall a. Ord a => Optional a -> a
maximum :: forall a. Ord a => Optional a -> a
$cmaximum :: forall a. Ord a => Optional a -> a
elem :: forall a. Eq a => a -> Optional a -> Bool
$celem :: forall a. Eq a => a -> Optional a -> Bool
length :: forall a. Optional a -> Int
$clength :: forall a. Optional a -> Int
null :: forall a. Optional a -> Bool
$cnull :: forall a. Optional a -> Bool
toList :: forall a. Optional a -> [a]
$ctoList :: forall a. Optional a -> [a]
foldl1 :: forall a. (a -> a -> a) -> Optional a -> a
$cfoldl1 :: forall a. (a -> a -> a) -> Optional a -> a
foldr1 :: forall a. (a -> a -> a) -> Optional a -> a
$cfoldr1 :: forall a. (a -> a -> a) -> Optional a -> a
foldl' :: forall b a. (b -> a -> b) -> b -> Optional a -> b
$cfoldl' :: forall b a. (b -> a -> b) -> b -> Optional a -> b
foldl :: forall b a. (b -> a -> b) -> b -> Optional a -> b
$cfoldl :: forall b a. (b -> a -> b) -> b -> Optional a -> b
foldr' :: forall a b. (a -> b -> b) -> b -> Optional a -> b
$cfoldr' :: forall a b. (a -> b -> b) -> b -> Optional a -> b
foldr :: forall a b. (a -> b -> b) -> b -> Optional a -> b
$cfoldr :: forall a b. (a -> b -> b) -> b -> Optional a -> b
foldMap' :: forall m a. Monoid m => (a -> m) -> Optional a -> m
$cfoldMap' :: forall m a. Monoid m => (a -> m) -> Optional a -> m
foldMap :: forall m a. Monoid m => (a -> m) -> Optional a -> m
$cfoldMap :: forall m a. Monoid m => (a -> m) -> Optional a -> m
fold :: forall m. Monoid m => Optional m -> m
$cfold :: forall m. Monoid m => Optional m -> m
Foldable, Functor Optional
Foldable Optional
Functor Optional
-> Foldable Optional
-> (forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Optional a -> f (Optional b))
-> (forall (f :: * -> *) a.
Applicative f =>
Optional (f a) -> f (Optional a))
-> (forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Optional a -> m (Optional b))
-> (forall (m :: * -> *) a.
Monad m =>
Optional (m a) -> m (Optional a))
-> Traversable Optional
forall (t :: * -> *).
Functor t
-> Foldable t
-> (forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> t a -> f (t b))
-> (forall (f :: * -> *) a. Applicative f => t (f a) -> f (t a))
-> (forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> t a -> m (t b))
-> (forall (m :: * -> *) a. Monad m => t (m a) -> m (t a))
-> Traversable t
forall (m :: * -> *) a. Monad m => Optional (m a) -> m (Optional a)
forall (f :: * -> *) a.
Applicative f =>
Optional (f a) -> f (Optional a)
forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Optional a -> m (Optional b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Optional a -> f (Optional b)
sequence :: forall (m :: * -> *) a. Monad m => Optional (m a) -> m (Optional a)
$csequence :: forall (m :: * -> *) a. Monad m => Optional (m a) -> m (Optional a)
mapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Optional a -> m (Optional b)
$cmapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Optional a -> m (Optional b)
sequenceA :: forall (f :: * -> *) a.
Applicative f =>
Optional (f a) -> f (Optional a)
$csequenceA :: forall (f :: * -> *) a.
Applicative f =>
Optional (f a) -> f (Optional a)
traverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Optional a -> f (Optional b)
$ctraverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Optional a -> f (Optional b)
Traversable, Int -> Optional a -> ShowS
[Optional a] -> ShowS
Optional a -> String
(Int -> Optional a -> ShowS)
-> (Optional a -> String)
-> ([Optional a] -> ShowS)
-> Show (Optional a)
forall a. Show a => Int -> Optional a -> ShowS
forall a. Show a => [Optional a] -> ShowS
forall a. Show a => Optional a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Optional a] -> ShowS
$cshowList :: forall a. Show a => [Optional a] -> ShowS
show :: Optional a -> String
$cshow :: forall a. Show a => Optional a -> String
showsPrec :: Int -> Optional a -> ShowS
$cshowsPrec :: forall a. Show a => Int -> Optional a -> ShowS
Show)
instance Applicative Optional where
pure :: forall a. a -> Optional a
pure = a -> Optional a
forall a. a -> Optional a
Specific
Specific a -> b
f <*> :: forall a b. Optional (a -> b) -> Optional a -> Optional b
<*> Specific a
x = b -> Optional b
forall a. a -> Optional a
Specific (a -> b
f a
x)
Optional (a -> b)
_ <*> Optional a
_ = Optional b
forall a. Optional a
Default
instance Monad Optional where
return :: forall a. a -> Optional a
return = a -> Optional a
forall a. a -> Optional a
Specific
Optional a
Default >>= :: forall a b. Optional a -> (a -> Optional b) -> Optional b
>>= a -> Optional b
_ = Optional b
forall a. Optional a
Default
Specific a
x >>= a -> Optional b
f = a -> Optional b
f a
x
instance Alternative Optional where
empty :: forall a. Optional a
empty = Optional a
forall a. Optional a
Default
Optional a
Default <|> :: forall a. Optional a -> Optional a -> Optional a
<|> Optional a
x = Optional a
x
Optional a
x <|> Optional a
_ = Optional a
x
instance MonadPlus Optional where
mzero :: forall a. Optional a
mzero = Optional a
forall (f :: * -> *) a. Alternative f => f a
empty
mplus :: forall a. Optional a -> Optional a -> Optional a
mplus = Optional a -> Optional a -> Optional a
forall (f :: * -> *) a. Alternative f => f a -> f a -> f a
(<|>)
instance Semigroup a => Semigroup (Optional a) where
<> :: Optional a -> Optional a -> Optional a
(<>) = (a -> a -> a) -> Optional a -> Optional a -> Optional a
forall (f :: * -> *) a b c.
Applicative f =>
(a -> b -> c) -> f a -> f b -> f c
liftA2 a -> a -> a
forall a. Semigroup a => a -> a -> a
(<>)
instance Monoid a => Monoid (Optional a) where
mempty :: Optional a
mempty = a -> Optional a
forall (f :: * -> *) a. Applicative f => a -> f a
pure a
forall a. Monoid a => a
mempty
#if !(MIN_VERSION_base(4,11,0))
mappend = liftA2 mappend
#endif
instance IsString a => IsString (Optional a) where
fromString :: String -> Optional a
fromString String
str = a -> Optional a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (String -> a
forall a. IsString a => String -> a
fromString String
str)
instance Num a => Num (Optional a) where
fromInteger :: Integer -> Optional a
fromInteger Integer
n = a -> Optional a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Integer -> a
forall a. Num a => Integer -> a
fromInteger Integer
n)
+ :: Optional a -> Optional a -> Optional a
(+) = (a -> a -> a) -> Optional a -> Optional a -> Optional a
forall (f :: * -> *) a b c.
Applicative f =>
(a -> b -> c) -> f a -> f b -> f c
liftA2 a -> a -> a
forall a. Num a => a -> a -> a
(+)
* :: Optional a -> Optional a -> Optional a
(*) = (a -> a -> a) -> Optional a -> Optional a -> Optional a
forall (f :: * -> *) a b c.
Applicative f =>
(a -> b -> c) -> f a -> f b -> f c
liftA2 a -> a -> a
forall a. Num a => a -> a -> a
(*)
(-) = (a -> a -> a) -> Optional a -> Optional a -> Optional a
forall (f :: * -> *) a b c.
Applicative f =>
(a -> b -> c) -> f a -> f b -> f c
liftA2 (-)
negate :: Optional a -> Optional a
negate = (a -> a) -> Optional a -> Optional a
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap a -> a
forall a. Num a => a -> a
negate
abs :: Optional a -> Optional a
abs = (a -> a) -> Optional a -> Optional a
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap a -> a
forall a. Num a => a -> a
abs
signum :: Optional a -> Optional a
signum = (a -> a) -> Optional a -> Optional a
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap a -> a
forall a. Num a => a -> a
signum
instance Fractional a => Fractional (Optional a) where
fromRational :: Rational -> Optional a
fromRational Rational
n = a -> Optional a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Rational -> a
forall a. Fractional a => Rational -> a
fromRational Rational
n)
recip :: Optional a -> Optional a
recip = (a -> a) -> Optional a -> Optional a
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap a -> a
forall a. Fractional a => a -> a
recip
/ :: Optional a -> Optional a -> Optional a
(/) = (a -> a -> a) -> Optional a -> Optional a -> Optional a
forall (f :: * -> *) a b c.
Applicative f =>
(a -> b -> c) -> f a -> f b -> f c
liftA2 a -> a -> a
forall a. Fractional a => a -> a -> a
(/)
optional :: b -> (a -> b) -> Optional a -> b
optional :: forall b a. b -> (a -> b) -> Optional a -> b
optional b
n a -> b
_ Optional a
Default = b
n
optional b
_ a -> b
f (Specific a
x) = a -> b
f a
x
defaultTo :: a -> Optional a -> a
defaultTo :: forall a. a -> Optional a -> a
defaultTo a
d Optional a
Default = a
d
defaultTo a
_ (Specific a
v) = a
v
fromOptional :: Alternative f => Optional a -> f a
fromOptional :: forall (f :: * -> *) a. Alternative f => Optional a -> f a
fromOptional Optional a
Default = f a
forall (f :: * -> *) a. Alternative f => f a
empty
fromOptional (Specific a
x) = a -> f a
forall (f :: * -> *) a. Applicative f => a -> f a
pure a
x