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

           )
           via Identity

_thePending :: Pending x -> x
_thePending :: Pending x -> x
_thePending (Pending !x
x) = x
x
{-# INLINE _thePending #-}

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