-- | Indicate that something is `Missing`.
module NewtypeZoo.Missing
  ( Missing(Missing)
  , _theMissing
  , theMissing
  ) where

import           Control.DeepSeq (NFData)
import           Control.Monad.Fix (MonadFix)
import           Control.Monad.Zip (MonadZip)
import           Data.Bits       (Bits,FiniteBits)
import           Data.Copointed  (Copointed)
import           Data.Default    (Default)
import           Data.Functor.Classes (Eq1, Ord1, Read1, Show1)
import           Data.Functor.Identity
import           Data.Ix         (Ix)
import           Data.Profunctor (Profunctor, dimap)
import           Data.Pointed    (Pointed)
import           Data.String     (IsString)
import           Data.Typeable   (Typeable)
import           Foreign.Storable (Storable)
import           GHC.Generics    (Generic, Generic1)
import           System.Random   (Random)
import           Test.QuickCheck (Arbitrary)

newtype Missing a = Missing a
  deriving ( Missing a -> Missing a -> Bool
(Missing a -> Missing a -> Bool)
-> (Missing a -> Missing a -> Bool) -> Eq (Missing a)
forall a. Eq a => Missing a -> Missing a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Missing a -> Missing a -> Bool
$c/= :: forall a. Eq a => Missing a -> Missing a -> Bool
== :: Missing a -> Missing a -> Bool
$c== :: forall a. Eq a => Missing a -> Missing a -> Bool
Eq
           , Eq (Missing a)
Eq (Missing a)
-> (Missing a -> Missing a -> Ordering)
-> (Missing a -> Missing a -> Bool)
-> (Missing a -> Missing a -> Bool)
-> (Missing a -> Missing a -> Bool)
-> (Missing a -> Missing a -> Bool)
-> (Missing a -> Missing a -> Missing a)
-> (Missing a -> Missing a -> Missing a)
-> Ord (Missing a)
Missing a -> Missing a -> Bool
Missing a -> Missing a -> Ordering
Missing a -> Missing a -> Missing 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 (Missing a)
forall a. Ord a => Missing a -> Missing a -> Bool
forall a. Ord a => Missing a -> Missing a -> Ordering
forall a. Ord a => Missing a -> Missing a -> Missing a
min :: Missing a -> Missing a -> Missing a
$cmin :: forall a. Ord a => Missing a -> Missing a -> Missing a
max :: Missing a -> Missing a -> Missing a
$cmax :: forall a. Ord a => Missing a -> Missing a -> Missing a
>= :: Missing a -> Missing a -> Bool
$c>= :: forall a. Ord a => Missing a -> Missing a -> Bool
> :: Missing a -> Missing a -> Bool
$c> :: forall a. Ord a => Missing a -> Missing a -> Bool
<= :: Missing a -> Missing a -> Bool
$c<= :: forall a. Ord a => Missing a -> Missing a -> Bool
< :: Missing a -> Missing a -> Bool
$c< :: forall a. Ord a => Missing a -> Missing a -> Bool
compare :: Missing a -> Missing a -> Ordering
$ccompare :: forall a. Ord a => Missing a -> Missing a -> Ordering
$cp1Ord :: forall a. Ord a => Eq (Missing a)
Ord
           , ReadPrec [Missing a]
ReadPrec (Missing a)
Int -> ReadS (Missing a)
ReadS [Missing a]
(Int -> ReadS (Missing a))
-> ReadS [Missing a]
-> ReadPrec (Missing a)
-> ReadPrec [Missing a]
-> Read (Missing a)
forall a. Read a => ReadPrec [Missing a]
forall a. Read a => ReadPrec (Missing a)
forall a. Read a => Int -> ReadS (Missing a)
forall a. Read a => ReadS [Missing a]
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [Missing a]
$creadListPrec :: forall a. Read a => ReadPrec [Missing a]
readPrec :: ReadPrec (Missing a)
$creadPrec :: forall a. Read a => ReadPrec (Missing a)
readList :: ReadS [Missing a]
$creadList :: forall a. Read a => ReadS [Missing a]
readsPrec :: Int -> ReadS (Missing a)
$creadsPrec :: forall a. Read a => Int -> ReadS (Missing a)
Read
           , Int -> Missing a -> ShowS
[Missing a] -> ShowS
Missing a -> String
(Int -> Missing a -> ShowS)
-> (Missing a -> String)
-> ([Missing a] -> ShowS)
-> Show (Missing a)
forall a. Show a => Int -> Missing a -> ShowS
forall a. Show a => [Missing a] -> ShowS
forall a. Show a => Missing a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Missing a] -> ShowS
$cshowList :: forall a. Show a => [Missing a] -> ShowS
show :: Missing a -> String
$cshow :: forall a. Show a => Missing a -> String
showsPrec :: Int -> Missing a -> ShowS
$cshowsPrec :: forall a. Show a => Int -> Missing a -> ShowS
Show
           , Missing a -> ()
(Missing a -> ()) -> NFData (Missing a)
forall a. NFData a => Missing a -> ()
forall a. (a -> ()) -> NFData a
rnf :: Missing a -> ()
$crnf :: forall a. NFData a => Missing a -> ()
NFData
           , Missing a -> Bool
(a -> m) -> Missing a -> m
(a -> b -> b) -> b -> Missing a -> b
(forall m. Monoid m => Missing m -> m)
-> (forall m a. Monoid m => (a -> m) -> Missing a -> m)
-> (forall m a. Monoid m => (a -> m) -> Missing a -> m)
-> (forall a b. (a -> b -> b) -> b -> Missing a -> b)
-> (forall a b. (a -> b -> b) -> b -> Missing a -> b)
-> (forall b a. (b -> a -> b) -> b -> Missing a -> b)
-> (forall b a. (b -> a -> b) -> b -> Missing a -> b)
-> (forall a. (a -> a -> a) -> Missing a -> a)
-> (forall a. (a -> a -> a) -> Missing a -> a)
-> (forall a. Missing a -> [a])
-> (forall a. Missing a -> Bool)
-> (forall a. Missing a -> Int)
-> (forall a. Eq a => a -> Missing a -> Bool)
-> (forall a. Ord a => Missing a -> a)
-> (forall a. Ord a => Missing a -> a)
-> (forall a. Num a => Missing a -> a)
-> (forall a. Num a => Missing a -> a)
-> Foldable Missing
forall a. Eq a => a -> Missing a -> Bool
forall a. Num a => Missing a -> a
forall a. Ord a => Missing a -> a
forall m. Monoid m => Missing m -> m
forall a. Missing a -> Bool
forall a. Missing a -> Int
forall a. Missing a -> [a]
forall a. (a -> a -> a) -> Missing a -> a
forall m a. Monoid m => (a -> m) -> Missing a -> m
forall b a. (b -> a -> b) -> b -> Missing a -> b
forall a b. (a -> b -> b) -> b -> Missing 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 :: Missing a -> a
$cproduct :: forall a. Num a => Missing a -> a
sum :: Missing a -> a
$csum :: forall a. Num a => Missing a -> a
minimum :: Missing a -> a
$cminimum :: forall a. Ord a => Missing a -> a
maximum :: Missing a -> a
$cmaximum :: forall a. Ord a => Missing a -> a
elem :: a -> Missing a -> Bool
$celem :: forall a. Eq a => a -> Missing a -> Bool
length :: Missing a -> Int
$clength :: forall a. Missing a -> Int
null :: Missing a -> Bool
$cnull :: forall a. Missing a -> Bool
toList :: Missing a -> [a]
$ctoList :: forall a. Missing a -> [a]
foldl1 :: (a -> a -> a) -> Missing a -> a
$cfoldl1 :: forall a. (a -> a -> a) -> Missing a -> a
foldr1 :: (a -> a -> a) -> Missing a -> a
$cfoldr1 :: forall a. (a -> a -> a) -> Missing a -> a
foldl' :: (b -> a -> b) -> b -> Missing a -> b
$cfoldl' :: forall b a. (b -> a -> b) -> b -> Missing a -> b
foldl :: (b -> a -> b) -> b -> Missing a -> b
$cfoldl :: forall b a. (b -> a -> b) -> b -> Missing a -> b
foldr' :: (a -> b -> b) -> b -> Missing a -> b
$cfoldr' :: forall a b. (a -> b -> b) -> b -> Missing a -> b
foldr :: (a -> b -> b) -> b -> Missing a -> b
$cfoldr :: forall a b. (a -> b -> b) -> b -> Missing a -> b
foldMap' :: (a -> m) -> Missing a -> m
$cfoldMap' :: forall m a. Monoid m => (a -> m) -> Missing a -> m
foldMap :: (a -> m) -> Missing a -> m
$cfoldMap :: forall m a. Monoid m => (a -> m) -> Missing a -> m
fold :: Missing m -> m
$cfold :: forall m. Monoid m => Missing m -> m
Foldable
           , Functor Missing
Foldable Missing
Functor Missing
-> Foldable Missing
-> (forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> Missing a -> f (Missing b))
-> (forall (f :: * -> *) a.
    Applicative f =>
    Missing (f a) -> f (Missing a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> Missing a -> m (Missing b))
-> (forall (m :: * -> *) a.
    Monad m =>
    Missing (m a) -> m (Missing a))
-> Traversable Missing
(a -> f b) -> Missing a -> f (Missing b)
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 => Missing (m a) -> m (Missing a)
forall (f :: * -> *) a.
Applicative f =>
Missing (f a) -> f (Missing a)
forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Missing a -> m (Missing b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Missing a -> f (Missing b)
sequence :: Missing (m a) -> m (Missing a)
$csequence :: forall (m :: * -> *) a. Monad m => Missing (m a) -> m (Missing a)
mapM :: (a -> m b) -> Missing a -> m (Missing b)
$cmapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Missing a -> m (Missing b)
sequenceA :: Missing (f a) -> f (Missing a)
$csequenceA :: forall (f :: * -> *) a.
Applicative f =>
Missing (f a) -> f (Missing a)
traverse :: (a -> f b) -> Missing a -> f (Missing b)
$ctraverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Missing a -> f (Missing b)
$cp2Traversable :: Foldable Missing
$cp1Traversable :: Functor Missing
Traversable
           , a -> Missing b -> Missing a
(a -> b) -> Missing a -> Missing b
(forall a b. (a -> b) -> Missing a -> Missing b)
-> (forall a b. a -> Missing b -> Missing a) -> Functor Missing
forall a b. a -> Missing b -> Missing a
forall a b. (a -> b) -> Missing a -> Missing b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: a -> Missing b -> Missing a
$c<$ :: forall a b. a -> Missing b -> Missing a
fmap :: (a -> b) -> Missing a -> Missing b
$cfmap :: forall a b. (a -> b) -> Missing a -> Missing b
Functor
           , Missing a
Missing a -> Default (Missing a)
forall a. a -> Default a
forall a. Default a => Missing a
def :: Missing a
$cdef :: forall a. Default a => Missing a
Default
           , Semigroup (Missing a)
Missing a
Semigroup (Missing a)
-> Missing a
-> (Missing a -> Missing a -> Missing a)
-> ([Missing a] -> Missing a)
-> Monoid (Missing a)
[Missing a] -> Missing a
Missing a -> Missing a -> Missing a
forall a.
Semigroup a -> a -> (a -> a -> a) -> ([a] -> a) -> Monoid a
forall a. Monoid a => Semigroup (Missing a)
forall a. Monoid a => Missing a
forall a. Monoid a => [Missing a] -> Missing a
forall a. Monoid a => Missing a -> Missing a -> Missing a
mconcat :: [Missing a] -> Missing a
$cmconcat :: forall a. Monoid a => [Missing a] -> Missing a
mappend :: Missing a -> Missing a -> Missing a
$cmappend :: forall a. Monoid a => Missing a -> Missing a -> Missing a
mempty :: Missing a
$cmempty :: forall a. Monoid a => Missing a
$cp1Monoid :: forall a. Monoid a => Semigroup (Missing a)
Monoid
           , b -> Missing a -> Missing a
NonEmpty (Missing a) -> Missing a
Missing a -> Missing a -> Missing a
(Missing a -> Missing a -> Missing a)
-> (NonEmpty (Missing a) -> Missing a)
-> (forall b. Integral b => b -> Missing a -> Missing a)
-> Semigroup (Missing a)
forall b. Integral b => b -> Missing a -> Missing a
forall a. Semigroup a => NonEmpty (Missing a) -> Missing a
forall a. Semigroup a => Missing a -> Missing a -> Missing a
forall a b.
(Semigroup a, Integral b) =>
b -> Missing a -> Missing a
forall a.
(a -> a -> a)
-> (NonEmpty a -> a)
-> (forall b. Integral b => b -> a -> a)
-> Semigroup a
stimes :: b -> Missing a -> Missing a
$cstimes :: forall a b.
(Semigroup a, Integral b) =>
b -> Missing a -> Missing a
sconcat :: NonEmpty (Missing a) -> Missing a
$csconcat :: forall a. Semigroup a => NonEmpty (Missing a) -> Missing a
<> :: Missing a -> Missing a -> Missing a
$c<> :: forall a. Semigroup a => Missing a -> Missing a -> Missing a
Semigroup
           , Typeable
           , (forall x. Missing a -> Rep (Missing a) x)
-> (forall x. Rep (Missing a) x -> Missing a)
-> Generic (Missing a)
forall x. Rep (Missing a) x -> Missing a
forall x. Missing a -> Rep (Missing a) x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall a x. Rep (Missing a) x -> Missing a
forall a x. Missing a -> Rep (Missing a) x
$cto :: forall a x. Rep (Missing a) x -> Missing a
$cfrom :: forall a x. Missing a -> Rep (Missing a) x
Generic
           , (forall a. Missing a -> Rep1 Missing a)
-> (forall a. Rep1 Missing a -> Missing a) -> Generic1 Missing
forall a. Rep1 Missing a -> Missing a
forall a. Missing a -> Rep1 Missing a
forall k (f :: k -> *).
(forall (a :: k). f a -> Rep1 f a)
-> (forall (a :: k). Rep1 f a -> f a) -> Generic1 f
$cto1 :: forall a. Rep1 Missing a -> Missing a
$cfrom1 :: forall a. Missing a -> Rep1 Missing a
Generic1
           , g -> (Missing a, g)
g -> [Missing a]
(Missing a, Missing a) -> g -> (Missing a, g)
(Missing a, Missing a) -> g -> [Missing a]
(forall g.
 RandomGen g =>
 (Missing a, Missing a) -> g -> (Missing a, g))
-> (forall g. RandomGen g => g -> (Missing a, g))
-> (forall g.
    RandomGen g =>
    (Missing a, Missing a) -> g -> [Missing a])
-> (forall g. RandomGen g => g -> [Missing a])
-> Random (Missing a)
forall a g. (Random a, RandomGen g) => g -> [Missing a]
forall a g. (Random a, RandomGen g) => g -> (Missing a, g)
forall a g.
(Random a, RandomGen g) =>
(Missing a, Missing a) -> g -> [Missing a]
forall a g.
(Random a, RandomGen g) =>
(Missing a, Missing a) -> g -> (Missing a, g)
forall g. RandomGen g => g -> [Missing a]
forall g. RandomGen g => g -> (Missing a, g)
forall g. RandomGen g => (Missing a, Missing a) -> g -> [Missing a]
forall g.
RandomGen g =>
(Missing a, Missing a) -> g -> (Missing a, g)
forall a.
(forall g. RandomGen g => (a, a) -> g -> (a, g))
-> (forall g. RandomGen g => g -> (a, g))
-> (forall g. RandomGen g => (a, a) -> g -> [a])
-> (forall g. RandomGen g => g -> [a])
-> Random a
randoms :: g -> [Missing a]
$crandoms :: forall a g. (Random a, RandomGen g) => g -> [Missing a]
randomRs :: (Missing a, Missing a) -> g -> [Missing a]
$crandomRs :: forall a g.
(Random a, RandomGen g) =>
(Missing a, Missing a) -> g -> [Missing a]
random :: g -> (Missing a, g)
$crandom :: forall a g. (Random a, RandomGen g) => g -> (Missing a, g)
randomR :: (Missing a, Missing a) -> g -> (Missing a, g)
$crandomR :: forall a g.
(Random a, RandomGen g) =>
(Missing a, Missing a) -> g -> (Missing a, g)
Random
           , Gen (Missing a)
Gen (Missing a)
-> (Missing a -> [Missing a]) -> Arbitrary (Missing a)
Missing a -> [Missing a]
forall a. Arbitrary a => Gen (Missing a)
forall a. Arbitrary a => Missing a -> [Missing a]
forall a. Gen a -> (a -> [a]) -> Arbitrary a
shrink :: Missing a -> [Missing a]
$cshrink :: forall a. Arbitrary a => Missing a -> [Missing a]
arbitrary :: Gen (Missing a)
$carbitrary :: forall a. Arbitrary a => Gen (Missing a)
Arbitrary
           , Missing a
Missing a -> Missing a -> Bounded (Missing a)
forall a. a -> a -> Bounded a
forall a. Bounded a => Missing a
maxBound :: Missing a
$cmaxBound :: forall a. Bounded a => Missing a
minBound :: Missing a
$cminBound :: forall a. Bounded a => Missing a
Bounded
           , Int -> Missing a
Missing a -> Int
Missing a -> [Missing a]
Missing a -> Missing a
Missing a -> Missing a -> [Missing a]
Missing a -> Missing a -> Missing a -> [Missing a]
(Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Int -> Missing a)
-> (Missing a -> Int)
-> (Missing a -> [Missing a])
-> (Missing a -> Missing a -> [Missing a])
-> (Missing a -> Missing a -> [Missing a])
-> (Missing a -> Missing a -> Missing a -> [Missing a])
-> Enum (Missing a)
forall a. Enum a => Int -> Missing a
forall a. Enum a => Missing a -> Int
forall a. Enum a => Missing a -> [Missing a]
forall a. Enum a => Missing a -> Missing a
forall a. Enum a => Missing a -> Missing a -> [Missing a]
forall a.
Enum a =>
Missing a -> Missing a -> Missing a -> [Missing a]
forall a.
(a -> a)
-> (a -> a)
-> (Int -> a)
-> (a -> Int)
-> (a -> [a])
-> (a -> a -> [a])
-> (a -> a -> [a])
-> (a -> a -> a -> [a])
-> Enum a
enumFromThenTo :: Missing a -> Missing a -> Missing a -> [Missing a]
$cenumFromThenTo :: forall a.
Enum a =>
Missing a -> Missing a -> Missing a -> [Missing a]
enumFromTo :: Missing a -> Missing a -> [Missing a]
$cenumFromTo :: forall a. Enum a => Missing a -> Missing a -> [Missing a]
enumFromThen :: Missing a -> Missing a -> [Missing a]
$cenumFromThen :: forall a. Enum a => Missing a -> Missing a -> [Missing a]
enumFrom :: Missing a -> [Missing a]
$cenumFrom :: forall a. Enum a => Missing a -> [Missing a]
fromEnum :: Missing a -> Int
$cfromEnum :: forall a. Enum a => Missing a -> Int
toEnum :: Int -> Missing a
$ctoEnum :: forall a. Enum a => Int -> Missing a
pred :: Missing a -> Missing a
$cpred :: forall a. Enum a => Missing a -> Missing a
succ :: Missing a -> Missing a
$csucc :: forall a. Enum a => Missing a -> Missing a
Enum
           , Fractional (Missing a)
Missing a
Fractional (Missing a)
-> Missing a
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a -> Missing a)
-> (Missing a -> Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> Floating (Missing a)
Missing a -> Missing a
Missing a -> Missing a -> Missing a
forall a. Floating a => Fractional (Missing a)
forall a. Floating a => Missing a
forall a. Floating a => Missing a -> Missing a
forall a. Floating a => Missing a -> Missing a -> Missing a
forall a.
Fractional a
-> a
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a -> a)
-> (a -> a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> Floating a
log1mexp :: Missing a -> Missing a
$clog1mexp :: forall a. Floating a => Missing a -> Missing a
log1pexp :: Missing a -> Missing a
$clog1pexp :: forall a. Floating a => Missing a -> Missing a
expm1 :: Missing a -> Missing a
$cexpm1 :: forall a. Floating a => Missing a -> Missing a
log1p :: Missing a -> Missing a
$clog1p :: forall a. Floating a => Missing a -> Missing a
atanh :: Missing a -> Missing a
$catanh :: forall a. Floating a => Missing a -> Missing a
acosh :: Missing a -> Missing a
$cacosh :: forall a. Floating a => Missing a -> Missing a
asinh :: Missing a -> Missing a
$casinh :: forall a. Floating a => Missing a -> Missing a
tanh :: Missing a -> Missing a
$ctanh :: forall a. Floating a => Missing a -> Missing a
cosh :: Missing a -> Missing a
$ccosh :: forall a. Floating a => Missing a -> Missing a
sinh :: Missing a -> Missing a
$csinh :: forall a. Floating a => Missing a -> Missing a
atan :: Missing a -> Missing a
$catan :: forall a. Floating a => Missing a -> Missing a
acos :: Missing a -> Missing a
$cacos :: forall a. Floating a => Missing a -> Missing a
asin :: Missing a -> Missing a
$casin :: forall a. Floating a => Missing a -> Missing a
tan :: Missing a -> Missing a
$ctan :: forall a. Floating a => Missing a -> Missing a
cos :: Missing a -> Missing a
$ccos :: forall a. Floating a => Missing a -> Missing a
sin :: Missing a -> Missing a
$csin :: forall a. Floating a => Missing a -> Missing a
logBase :: Missing a -> Missing a -> Missing a
$clogBase :: forall a. Floating a => Missing a -> Missing a -> Missing a
** :: Missing a -> Missing a -> Missing a
$c** :: forall a. Floating a => Missing a -> Missing a -> Missing a
sqrt :: Missing a -> Missing a
$csqrt :: forall a. Floating a => Missing a -> Missing a
log :: Missing a -> Missing a
$clog :: forall a. Floating a => Missing a -> Missing a
exp :: Missing a -> Missing a
$cexp :: forall a. Floating a => Missing a -> Missing a
pi :: Missing a
$cpi :: forall a. Floating a => Missing a
$cp1Floating :: forall a. Floating a => Fractional (Missing a)
Floating
           , Num (Missing a)
Num (Missing a)
-> (Missing a -> Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Rational -> Missing a)
-> Fractional (Missing a)
Rational -> Missing a
Missing a -> Missing a
Missing a -> Missing a -> Missing a
forall a. Fractional a => Num (Missing a)
forall a. Fractional a => Rational -> Missing a
forall a. Fractional a => Missing a -> Missing a
forall a. Fractional a => Missing a -> Missing a -> Missing a
forall a.
Num a
-> (a -> a -> a) -> (a -> a) -> (Rational -> a) -> Fractional a
fromRational :: Rational -> Missing a
$cfromRational :: forall a. Fractional a => Rational -> Missing a
recip :: Missing a -> Missing a
$crecip :: forall a. Fractional a => Missing a -> Missing a
/ :: Missing a -> Missing a -> Missing a
$c/ :: forall a. Fractional a => Missing a -> Missing a -> Missing a
$cp1Fractional :: forall a. Fractional a => Num (Missing a)
Fractional
           , Enum (Missing a)
Real (Missing a)
Real (Missing a)
-> Enum (Missing a)
-> (Missing a -> Missing a -> Missing a)
-> (Missing a -> Missing a -> Missing a)
-> (Missing a -> Missing a -> Missing a)
-> (Missing a -> Missing a -> Missing a)
-> (Missing a -> Missing a -> (Missing a, Missing a))
-> (Missing a -> Missing a -> (Missing a, Missing a))
-> (Missing a -> Integer)
-> Integral (Missing a)
Missing a -> Integer
Missing a -> Missing a -> (Missing a, Missing a)
Missing a -> Missing a -> Missing a
forall a. Integral a => Enum (Missing a)
forall a. Integral a => Real (Missing a)
forall a. Integral a => Missing a -> Integer
forall a.
Integral a =>
Missing a -> Missing a -> (Missing a, Missing a)
forall a. Integral a => Missing a -> Missing a -> Missing a
forall a.
Real a
-> Enum a
-> (a -> a -> a)
-> (a -> a -> a)
-> (a -> a -> a)
-> (a -> a -> a)
-> (a -> a -> (a, a))
-> (a -> a -> (a, a))
-> (a -> Integer)
-> Integral a
toInteger :: Missing a -> Integer
$ctoInteger :: forall a. Integral a => Missing a -> Integer
divMod :: Missing a -> Missing a -> (Missing a, Missing a)
$cdivMod :: forall a.
Integral a =>
Missing a -> Missing a -> (Missing a, Missing a)
quotRem :: Missing a -> Missing a -> (Missing a, Missing a)
$cquotRem :: forall a.
Integral a =>
Missing a -> Missing a -> (Missing a, Missing a)
mod :: Missing a -> Missing a -> Missing a
$cmod :: forall a. Integral a => Missing a -> Missing a -> Missing a
div :: Missing a -> Missing a -> Missing a
$cdiv :: forall a. Integral a => Missing a -> Missing a -> Missing a
rem :: Missing a -> Missing a -> Missing a
$crem :: forall a. Integral a => Missing a -> Missing a -> Missing a
quot :: Missing a -> Missing a -> Missing a
$cquot :: forall a. Integral a => Missing a -> Missing a -> Missing a
$cp2Integral :: forall a. Integral a => Enum (Missing a)
$cp1Integral :: forall a. Integral a => Real (Missing a)
Integral
           , Integer -> Missing a
Missing a -> Missing a
Missing a -> Missing a -> Missing a
(Missing a -> Missing a -> Missing a)
-> (Missing a -> Missing a -> Missing a)
-> (Missing a -> Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Integer -> Missing a)
-> Num (Missing a)
forall a. Num a => Integer -> Missing a
forall a. Num a => Missing a -> Missing a
forall a. Num a => Missing a -> Missing a -> Missing a
forall a.
(a -> a -> a)
-> (a -> a -> a)
-> (a -> a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (Integer -> a)
-> Num a
fromInteger :: Integer -> Missing a
$cfromInteger :: forall a. Num a => Integer -> Missing a
signum :: Missing a -> Missing a
$csignum :: forall a. Num a => Missing a -> Missing a
abs :: Missing a -> Missing a
$cabs :: forall a. Num a => Missing a -> Missing a
negate :: Missing a -> Missing a
$cnegate :: forall a. Num a => Missing a -> Missing a
* :: Missing a -> Missing a -> Missing a
$c* :: forall a. Num a => Missing a -> Missing a -> Missing a
- :: Missing a -> Missing a -> Missing a
$c- :: forall a. Num a => Missing a -> Missing a -> Missing a
+ :: Missing a -> Missing a -> Missing a
$c+ :: forall a. Num a => Missing a -> Missing a -> Missing a
Num
           , Num (Missing a)
Ord (Missing a)
Num (Missing a)
-> Ord (Missing a) -> (Missing a -> Rational) -> Real (Missing a)
Missing a -> Rational
forall a. Num a -> Ord a -> (a -> Rational) -> Real a
forall a. Real a => Num (Missing a)
forall a. Real a => Ord (Missing a)
forall a. Real a => Missing a -> Rational
toRational :: Missing a -> Rational
$ctoRational :: forall a. Real a => Missing a -> Rational
$cp2Real :: forall a. Real a => Ord (Missing a)
$cp1Real :: forall a. Real a => Num (Missing a)
Real
           , Floating (Missing a)
RealFrac (Missing a)
RealFrac (Missing a)
-> Floating (Missing a)
-> (Missing a -> Integer)
-> (Missing a -> Int)
-> (Missing a -> (Int, Int))
-> (Missing a -> (Integer, Int))
-> (Integer -> Int -> Missing a)
-> (Missing a -> Int)
-> (Missing a -> Missing a)
-> (Int -> Missing a -> Missing a)
-> (Missing a -> Bool)
-> (Missing a -> Bool)
-> (Missing a -> Bool)
-> (Missing a -> Bool)
-> (Missing a -> Bool)
-> (Missing a -> Missing a -> Missing a)
-> RealFloat (Missing a)
Int -> Missing a -> Missing a
Integer -> Int -> Missing a
Missing a -> Bool
Missing a -> Int
Missing a -> Integer
Missing a -> (Int, Int)
Missing a -> (Integer, Int)
Missing a -> Missing a
Missing a -> Missing a -> Missing a
forall a. RealFloat a => Floating (Missing a)
forall a. RealFloat a => RealFrac (Missing a)
forall a. RealFloat a => Int -> Missing a -> Missing a
forall a. RealFloat a => Integer -> Int -> Missing a
forall a. RealFloat a => Missing a -> Bool
forall a. RealFloat a => Missing a -> Int
forall a. RealFloat a => Missing a -> Integer
forall a. RealFloat a => Missing a -> (Int, Int)
forall a. RealFloat a => Missing a -> (Integer, Int)
forall a. RealFloat a => Missing a -> Missing a
forall a. RealFloat a => Missing a -> Missing a -> Missing a
forall a.
RealFrac a
-> Floating a
-> (a -> Integer)
-> (a -> Int)
-> (a -> (Int, Int))
-> (a -> (Integer, Int))
-> (Integer -> Int -> a)
-> (a -> Int)
-> (a -> a)
-> (Int -> a -> a)
-> (a -> Bool)
-> (a -> Bool)
-> (a -> Bool)
-> (a -> Bool)
-> (a -> Bool)
-> (a -> a -> a)
-> RealFloat a
atan2 :: Missing a -> Missing a -> Missing a
$catan2 :: forall a. RealFloat a => Missing a -> Missing a -> Missing a
isIEEE :: Missing a -> Bool
$cisIEEE :: forall a. RealFloat a => Missing a -> Bool
isNegativeZero :: Missing a -> Bool
$cisNegativeZero :: forall a. RealFloat a => Missing a -> Bool
isDenormalized :: Missing a -> Bool
$cisDenormalized :: forall a. RealFloat a => Missing a -> Bool
isInfinite :: Missing a -> Bool
$cisInfinite :: forall a. RealFloat a => Missing a -> Bool
isNaN :: Missing a -> Bool
$cisNaN :: forall a. RealFloat a => Missing a -> Bool
scaleFloat :: Int -> Missing a -> Missing a
$cscaleFloat :: forall a. RealFloat a => Int -> Missing a -> Missing a
significand :: Missing a -> Missing a
$csignificand :: forall a. RealFloat a => Missing a -> Missing a
exponent :: Missing a -> Int
$cexponent :: forall a. RealFloat a => Missing a -> Int
encodeFloat :: Integer -> Int -> Missing a
$cencodeFloat :: forall a. RealFloat a => Integer -> Int -> Missing a
decodeFloat :: Missing a -> (Integer, Int)
$cdecodeFloat :: forall a. RealFloat a => Missing a -> (Integer, Int)
floatRange :: Missing a -> (Int, Int)
$cfloatRange :: forall a. RealFloat a => Missing a -> (Int, Int)
floatDigits :: Missing a -> Int
$cfloatDigits :: forall a. RealFloat a => Missing a -> Int
floatRadix :: Missing a -> Integer
$cfloatRadix :: forall a. RealFloat a => Missing a -> Integer
$cp2RealFloat :: forall a. RealFloat a => Floating (Missing a)
$cp1RealFloat :: forall a. RealFloat a => RealFrac (Missing a)
RealFloat
           , Fractional (Missing a)
Real (Missing a)
Real (Missing a)
-> Fractional (Missing a)
-> (forall b. Integral b => Missing a -> (b, Missing a))
-> (forall b. Integral b => Missing a -> b)
-> (forall b. Integral b => Missing a -> b)
-> (forall b. Integral b => Missing a -> b)
-> (forall b. Integral b => Missing a -> b)
-> RealFrac (Missing a)
Missing a -> b
Missing a -> b
Missing a -> b
Missing a -> b
Missing a -> (b, Missing a)
forall b. Integral b => Missing a -> b
forall b. Integral b => Missing a -> (b, Missing a)
forall a.
Real a
-> Fractional a
-> (forall b. Integral b => a -> (b, a))
-> (forall b. Integral b => a -> b)
-> (forall b. Integral b => a -> b)
-> (forall b. Integral b => a -> b)
-> (forall b. Integral b => a -> b)
-> RealFrac a
forall a. RealFrac a => Fractional (Missing a)
forall a. RealFrac a => Real (Missing a)
forall a b. (RealFrac a, Integral b) => Missing a -> b
forall a b. (RealFrac a, Integral b) => Missing a -> (b, Missing a)
floor :: Missing a -> b
$cfloor :: forall a b. (RealFrac a, Integral b) => Missing a -> b
ceiling :: Missing a -> b
$cceiling :: forall a b. (RealFrac a, Integral b) => Missing a -> b
round :: Missing a -> b
$cround :: forall a b. (RealFrac a, Integral b) => Missing a -> b
truncate :: Missing a -> b
$ctruncate :: forall a b. (RealFrac a, Integral b) => Missing a -> b
properFraction :: Missing a -> (b, Missing a)
$cproperFraction :: forall a b. (RealFrac a, Integral b) => Missing a -> (b, Missing a)
$cp2RealFrac :: forall a. RealFrac a => Fractional (Missing a)
$cp1RealFrac :: forall a. RealFrac a => Real (Missing a)
RealFrac
           , Ord (Missing a)
Ord (Missing a)
-> ((Missing a, Missing a) -> [Missing a])
-> ((Missing a, Missing a) -> Missing a -> Int)
-> ((Missing a, Missing a) -> Missing a -> Int)
-> ((Missing a, Missing a) -> Missing a -> Bool)
-> ((Missing a, Missing a) -> Int)
-> ((Missing a, Missing a) -> Int)
-> Ix (Missing a)
(Missing a, Missing a) -> Int
(Missing a, Missing a) -> [Missing a]
(Missing a, Missing a) -> Missing a -> Bool
(Missing a, Missing a) -> Missing a -> Int
forall a.
Ord a
-> ((a, a) -> [a])
-> ((a, a) -> a -> Int)
-> ((a, a) -> a -> Int)
-> ((a, a) -> a -> Bool)
-> ((a, a) -> Int)
-> ((a, a) -> Int)
-> Ix a
forall a. Ix a => Ord (Missing a)
forall a. Ix a => (Missing a, Missing a) -> Int
forall a. Ix a => (Missing a, Missing a) -> [Missing a]
forall a. Ix a => (Missing a, Missing a) -> Missing a -> Bool
forall a. Ix a => (Missing a, Missing a) -> Missing a -> Int
unsafeRangeSize :: (Missing a, Missing a) -> Int
$cunsafeRangeSize :: forall a. Ix a => (Missing a, Missing a) -> Int
rangeSize :: (Missing a, Missing a) -> Int
$crangeSize :: forall a. Ix a => (Missing a, Missing a) -> Int
inRange :: (Missing a, Missing a) -> Missing a -> Bool
$cinRange :: forall a. Ix a => (Missing a, Missing a) -> Missing a -> Bool
unsafeIndex :: (Missing a, Missing a) -> Missing a -> Int
$cunsafeIndex :: forall a. Ix a => (Missing a, Missing a) -> Missing a -> Int
index :: (Missing a, Missing a) -> Missing a -> Int
$cindex :: forall a. Ix a => (Missing a, Missing a) -> Missing a -> Int
range :: (Missing a, Missing a) -> [Missing a]
$crange :: forall a. Ix a => (Missing a, Missing a) -> [Missing a]
$cp1Ix :: forall a. Ix a => Ord (Missing a)
Ix
           , String -> Missing a
(String -> Missing a) -> IsString (Missing a)
forall a. IsString a => String -> Missing a
forall a. (String -> a) -> IsString a
fromString :: String -> Missing a
$cfromString :: forall a. IsString a => String -> Missing a
IsString
           , Eq (Missing a)
Missing a
Eq (Missing a)
-> (Missing a -> Missing a -> Missing a)
-> (Missing a -> Missing a -> Missing a)
-> (Missing a -> Missing a -> Missing a)
-> (Missing a -> Missing a)
-> (Missing a -> Int -> Missing a)
-> (Missing a -> Int -> Missing a)
-> Missing a
-> (Int -> Missing a)
-> (Missing a -> Int -> Missing a)
-> (Missing a -> Int -> Missing a)
-> (Missing a -> Int -> Missing a)
-> (Missing a -> Int -> Bool)
-> (Missing a -> Maybe Int)
-> (Missing a -> Int)
-> (Missing a -> Bool)
-> (Missing a -> Int -> Missing a)
-> (Missing a -> Int -> Missing a)
-> (Missing a -> Int -> Missing a)
-> (Missing a -> Int -> Missing a)
-> (Missing a -> Int -> Missing a)
-> (Missing a -> Int -> Missing a)
-> (Missing a -> Int)
-> Bits (Missing a)
Int -> Missing a
Missing a -> Bool
Missing a -> Int
Missing a -> Maybe Int
Missing a -> Missing a
Missing a -> Int -> Bool
Missing a -> Int -> Missing a
Missing a -> Missing a -> Missing a
forall a.
Eq a
-> (a -> a -> a)
-> (a -> a -> a)
-> (a -> a -> a)
-> (a -> a)
-> (a -> Int -> a)
-> (a -> Int -> a)
-> a
-> (Int -> a)
-> (a -> Int -> a)
-> (a -> Int -> a)
-> (a -> Int -> a)
-> (a -> Int -> Bool)
-> (a -> Maybe Int)
-> (a -> Int)
-> (a -> Bool)
-> (a -> Int -> a)
-> (a -> Int -> a)
-> (a -> Int -> a)
-> (a -> Int -> a)
-> (a -> Int -> a)
-> (a -> Int -> a)
-> (a -> Int)
-> Bits a
forall a. Bits a => Eq (Missing a)
forall a. Bits a => Missing a
forall a. Bits a => Int -> Missing a
forall a. Bits a => Missing a -> Bool
forall a. Bits a => Missing a -> Int
forall a. Bits a => Missing a -> Maybe Int
forall a. Bits a => Missing a -> Missing a
forall a. Bits a => Missing a -> Int -> Bool
forall a. Bits a => Missing a -> Int -> Missing a
forall a. Bits a => Missing a -> Missing a -> Missing a
popCount :: Missing a -> Int
$cpopCount :: forall a. Bits a => Missing a -> Int
rotateR :: Missing a -> Int -> Missing a
$crotateR :: forall a. Bits a => Missing a -> Int -> Missing a
rotateL :: Missing a -> Int -> Missing a
$crotateL :: forall a. Bits a => Missing a -> Int -> Missing a
unsafeShiftR :: Missing a -> Int -> Missing a
$cunsafeShiftR :: forall a. Bits a => Missing a -> Int -> Missing a
shiftR :: Missing a -> Int -> Missing a
$cshiftR :: forall a. Bits a => Missing a -> Int -> Missing a
unsafeShiftL :: Missing a -> Int -> Missing a
$cunsafeShiftL :: forall a. Bits a => Missing a -> Int -> Missing a
shiftL :: Missing a -> Int -> Missing a
$cshiftL :: forall a. Bits a => Missing a -> Int -> Missing a
isSigned :: Missing a -> Bool
$cisSigned :: forall a. Bits a => Missing a -> Bool
bitSize :: Missing a -> Int
$cbitSize :: forall a. Bits a => Missing a -> Int
bitSizeMaybe :: Missing a -> Maybe Int
$cbitSizeMaybe :: forall a. Bits a => Missing a -> Maybe Int
testBit :: Missing a -> Int -> Bool
$ctestBit :: forall a. Bits a => Missing a -> Int -> Bool
complementBit :: Missing a -> Int -> Missing a
$ccomplementBit :: forall a. Bits a => Missing a -> Int -> Missing a
clearBit :: Missing a -> Int -> Missing a
$cclearBit :: forall a. Bits a => Missing a -> Int -> Missing a
setBit :: Missing a -> Int -> Missing a
$csetBit :: forall a. Bits a => Missing a -> Int -> Missing a
bit :: Int -> Missing a
$cbit :: forall a. Bits a => Int -> Missing a
zeroBits :: Missing a
$czeroBits :: forall a. Bits a => Missing a
rotate :: Missing a -> Int -> Missing a
$crotate :: forall a. Bits a => Missing a -> Int -> Missing a
shift :: Missing a -> Int -> Missing a
$cshift :: forall a. Bits a => Missing a -> Int -> Missing a
complement :: Missing a -> Missing a
$ccomplement :: forall a. Bits a => Missing a -> Missing a
xor :: Missing a -> Missing a -> Missing a
$cxor :: forall a. Bits a => Missing a -> Missing a -> Missing a
.|. :: Missing a -> Missing a -> Missing a
$c.|. :: forall a. Bits a => Missing a -> Missing a -> Missing a
.&. :: Missing a -> Missing a -> Missing a
$c.&. :: forall a. Bits a => Missing a -> Missing a -> Missing a
$cp1Bits :: forall a. Bits a => Eq (Missing a)
Bits
           , Bits (Missing a)
Bits (Missing a)
-> (Missing a -> Int)
-> (Missing a -> Int)
-> (Missing a -> Int)
-> FiniteBits (Missing a)
Missing a -> Int
forall b.
Bits b -> (b -> Int) -> (b -> Int) -> (b -> Int) -> FiniteBits b
forall a. FiniteBits a => Bits (Missing a)
forall a. FiniteBits a => Missing a -> Int
countTrailingZeros :: Missing a -> Int
$ccountTrailingZeros :: forall a. FiniteBits a => Missing a -> Int
countLeadingZeros :: Missing a -> Int
$ccountLeadingZeros :: forall a. FiniteBits a => Missing a -> Int
finiteBitSize :: Missing a -> Int
$cfiniteBitSize :: forall a. FiniteBits a => Missing a -> Int
$cp1FiniteBits :: forall a. FiniteBits a => Bits (Missing a)
FiniteBits
           )
  deriving ( (a -> b -> Bool) -> Missing a -> Missing b -> Bool
(forall a b. (a -> b -> Bool) -> Missing a -> Missing b -> Bool)
-> Eq1 Missing
forall a b. (a -> b -> Bool) -> Missing a -> Missing b -> Bool
forall (f :: * -> *).
(forall a b. (a -> b -> Bool) -> f a -> f b -> Bool) -> Eq1 f
liftEq :: (a -> b -> Bool) -> Missing a -> Missing b -> Bool
$cliftEq :: forall a b. (a -> b -> Bool) -> Missing a -> Missing b -> Bool
Eq1
           , Eq1 Missing
Eq1 Missing
-> (forall a b.
    (a -> b -> Ordering) -> Missing a -> Missing b -> Ordering)
-> Ord1 Missing
(a -> b -> Ordering) -> Missing a -> Missing b -> Ordering
forall a b.
(a -> b -> Ordering) -> Missing a -> Missing b -> Ordering
forall (f :: * -> *).
Eq1 f
-> (forall a b. (a -> b -> Ordering) -> f a -> f b -> Ordering)
-> Ord1 f
liftCompare :: (a -> b -> Ordering) -> Missing a -> Missing b -> Ordering
$cliftCompare :: forall a b.
(a -> b -> Ordering) -> Missing a -> Missing b -> Ordering
$cp1Ord1 :: Eq1 Missing
Ord1
           , ReadPrec a -> ReadPrec [a] -> ReadPrec (Missing a)
ReadPrec a -> ReadPrec [a] -> ReadPrec [Missing a]
(Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Missing a)
(Int -> ReadS a) -> ReadS [a] -> ReadS [Missing a]
(forall a.
 (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Missing a))
-> (forall a. (Int -> ReadS a) -> ReadS [a] -> ReadS [Missing a])
-> (forall a. ReadPrec a -> ReadPrec [a] -> ReadPrec (Missing a))
-> (forall a. ReadPrec a -> ReadPrec [a] -> ReadPrec [Missing a])
-> Read1 Missing
forall a. ReadPrec a -> ReadPrec [a] -> ReadPrec [Missing a]
forall a. ReadPrec a -> ReadPrec [a] -> ReadPrec (Missing a)
forall a. (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Missing a)
forall a. (Int -> ReadS a) -> ReadS [a] -> ReadS [Missing a]
forall (f :: * -> *).
(forall a. (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (f a))
-> (forall a. (Int -> ReadS a) -> ReadS [a] -> ReadS [f a])
-> (forall a. ReadPrec a -> ReadPrec [a] -> ReadPrec (f a))
-> (forall a. ReadPrec a -> ReadPrec [a] -> ReadPrec [f a])
-> Read1 f
liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Missing a]
$cliftReadListPrec :: forall a. ReadPrec a -> ReadPrec [a] -> ReadPrec [Missing a]
liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Missing a)
$cliftReadPrec :: forall a. ReadPrec a -> ReadPrec [a] -> ReadPrec (Missing a)
liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Missing a]
$cliftReadList :: forall a. (Int -> ReadS a) -> ReadS [a] -> ReadS [Missing a]
liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Missing a)
$cliftReadsPrec :: forall a. (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Missing a)
Read1
           , (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Missing a -> ShowS
(Int -> a -> ShowS) -> ([a] -> ShowS) -> [Missing a] -> ShowS
(forall a.
 (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Missing a -> ShowS)
-> (forall a.
    (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Missing a] -> ShowS)
-> Show1 Missing
forall a.
(Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Missing a -> ShowS
forall a.
(Int -> a -> ShowS) -> ([a] -> ShowS) -> [Missing a] -> ShowS
forall (f :: * -> *).
(forall a.
 (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> f a -> ShowS)
-> (forall a.
    (Int -> a -> ShowS) -> ([a] -> ShowS) -> [f a] -> ShowS)
-> Show1 f
liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Missing a] -> ShowS
$cliftShowList :: forall a.
(Int -> a -> ShowS) -> ([a] -> ShowS) -> [Missing a] -> ShowS
liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Missing a -> ShowS
$cliftShowsPrec :: forall a.
(Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Missing a -> ShowS
Show1
           , a -> Missing a
(forall a. a -> Missing a) -> Pointed Missing
forall a. a -> Missing a
forall (p :: * -> *). (forall a. a -> p a) -> Pointed p
point :: a -> Missing a
$cpoint :: forall a. a -> Missing a
Pointed
           , Missing a -> a
(forall a. Missing a -> a) -> Copointed Missing
forall a. Missing a -> a
forall (p :: * -> *). (forall a. p a -> a) -> Copointed p
copoint :: Missing a -> a
$ccopoint :: forall a. Missing a -> a
Copointed
           , Functor Missing
a -> Missing a
Functor Missing
-> (forall a. a -> Missing a)
-> (forall a b. Missing (a -> b) -> Missing a -> Missing b)
-> (forall a b c.
    (a -> b -> c) -> Missing a -> Missing b -> Missing c)
-> (forall a b. Missing a -> Missing b -> Missing b)
-> (forall a b. Missing a -> Missing b -> Missing a)
-> Applicative Missing
Missing a -> Missing b -> Missing b
Missing a -> Missing b -> Missing a
Missing (a -> b) -> Missing a -> Missing b
(a -> b -> c) -> Missing a -> Missing b -> Missing c
forall a. a -> Missing a
forall a b. Missing a -> Missing b -> Missing a
forall a b. Missing a -> Missing b -> Missing b
forall a b. Missing (a -> b) -> Missing a -> Missing b
forall a b c. (a -> b -> c) -> Missing a -> Missing b -> Missing c
forall (f :: * -> *).
Functor f
-> (forall a. a -> f a)
-> (forall a b. f (a -> b) -> f a -> f b)
-> (forall a b c. (a -> b -> c) -> f a -> f b -> f c)
-> (forall a b. f a -> f b -> f b)
-> (forall a b. f a -> f b -> f a)
-> Applicative f
<* :: Missing a -> Missing b -> Missing a
$c<* :: forall a b. Missing a -> Missing b -> Missing a
*> :: Missing a -> Missing b -> Missing b
$c*> :: forall a b. Missing a -> Missing b -> Missing b
liftA2 :: (a -> b -> c) -> Missing a -> Missing b -> Missing c
$cliftA2 :: forall a b c. (a -> b -> c) -> Missing a -> Missing b -> Missing c
<*> :: Missing (a -> b) -> Missing a -> Missing b
$c<*> :: forall a b. Missing (a -> b) -> Missing a -> Missing b
pure :: a -> Missing a
$cpure :: forall a. a -> Missing a
$cp1Applicative :: Functor Missing
Applicative
           , Monad Missing
Monad Missing
-> (forall a. (a -> Missing a) -> Missing a) -> MonadFix Missing
(a -> Missing a) -> Missing a
forall a. (a -> Missing a) -> Missing a
forall (m :: * -> *).
Monad m -> (forall a. (a -> m a) -> m a) -> MonadFix m
mfix :: (a -> Missing a) -> Missing a
$cmfix :: forall a. (a -> Missing a) -> Missing a
$cp1MonadFix :: Monad Missing
MonadFix
           , Applicative Missing
a -> Missing a
Applicative Missing
-> (forall a b. Missing a -> (a -> Missing b) -> Missing b)
-> (forall a b. Missing a -> Missing b -> Missing b)
-> (forall a. a -> Missing a)
-> Monad Missing
Missing a -> (a -> Missing b) -> Missing b
Missing a -> Missing b -> Missing b
forall a. a -> Missing a
forall a b. Missing a -> Missing b -> Missing b
forall a b. Missing a -> (a -> Missing b) -> Missing b
forall (m :: * -> *).
Applicative m
-> (forall a b. m a -> (a -> m b) -> m b)
-> (forall a b. m a -> m b -> m b)
-> (forall a. a -> m a)
-> Monad m
return :: a -> Missing a
$creturn :: forall a. a -> Missing a
>> :: Missing a -> Missing b -> Missing b
$c>> :: forall a b. Missing a -> Missing b -> Missing b
>>= :: Missing a -> (a -> Missing b) -> Missing b
$c>>= :: forall a b. Missing a -> (a -> Missing b) -> Missing b
$cp1Monad :: Applicative Missing
Monad
           , Monad Missing
Monad Missing
-> (forall a b. Missing a -> Missing b -> Missing (a, b))
-> (forall a b c.
    (a -> b -> c) -> Missing a -> Missing b -> Missing c)
-> (forall a b. Missing (a, b) -> (Missing a, Missing b))
-> MonadZip Missing
Missing a -> Missing b -> Missing (a, b)
Missing (a, b) -> (Missing a, Missing b)
(a -> b -> c) -> Missing a -> Missing b -> Missing c
forall a b. Missing a -> Missing b -> Missing (a, b)
forall a b. Missing (a, b) -> (Missing a, Missing b)
forall a b c. (a -> b -> c) -> Missing a -> Missing b -> Missing c
forall (m :: * -> *).
Monad m
-> (forall a b. m a -> m b -> m (a, b))
-> (forall a b c. (a -> b -> c) -> m a -> m b -> m c)
-> (forall a b. m (a, b) -> (m a, m b))
-> MonadZip m
munzip :: Missing (a, b) -> (Missing a, Missing b)
$cmunzip :: forall a b. Missing (a, b) -> (Missing a, Missing b)
mzipWith :: (a -> b -> c) -> Missing a -> Missing b -> Missing c
$cmzipWith :: forall a b c. (a -> b -> c) -> Missing a -> Missing b -> Missing c
mzip :: Missing a -> Missing b -> Missing (a, b)
$cmzip :: forall a b. Missing a -> Missing b -> Missing (a, b)
$cp1MonadZip :: Monad Missing
MonadZip

           )
           via Identity

_theMissing :: Missing x -> x
_theMissing :: Missing x -> x
_theMissing (Missing !x
x) = x
x
{-# INLINE _theMissing #-}

theMissing :: forall a b p f. (Profunctor p, Functor f) => p a (f b) -> p (Missing a) (f (Missing b))
theMissing :: p a (f b) -> p (Missing a) (f (Missing b))
theMissing = (Missing a -> a)
-> (f b -> f (Missing b))
-> p a (f b)
-> p (Missing a) (f (Missing b))
forall (p :: * -> * -> *) a b c d.
Profunctor p =>
(a -> b) -> (c -> d) -> p b c -> p a d
dimap Missing a -> a
forall a. Missing a -> a
_theMissing ((b -> Missing b) -> f b -> f (Missing b)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap b -> Missing b
forall a. a -> Missing a
Missing)
{-# INLINE theMissing #-}