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

           )
           via Identity

_theExisting :: Existing x -> x
_theExisting :: Existing x -> x
_theExisting (Existing !x
x) = x
x
{-# INLINE _theExisting #-}

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