{-# language Safe #-}

module LazyAsync.Types.Status where

import LazyAsync.Types.Outcome (Outcome)

import LazyAsync.Prelude (Foldable, Functor, Show, Traversable)

-- | Whether a 'LazyAsync.LazyAsync' action has
-- completed yet, and, if so, what it produced
--
-- Obtained using 'LazyAsync.poll'
data Status a =
    Incomplete -- ^ ⏳
        -- The 'LazyAsync.LazyAsync' action has not finished
        -- (and might not have even started yet)
  | Done (Outcome a) -- ^ ⌛
        -- The 'LazyAsync.LazyAsync' action has ended, either
        -- by ✅ returning normally or by 💣 throwing an exception
    deriving (Status a -> Bool
(a -> m) -> Status a -> m
(a -> b -> b) -> b -> Status a -> b
(forall m. Monoid m => Status m -> m)
-> (forall m a. Monoid m => (a -> m) -> Status a -> m)
-> (forall m a. Monoid m => (a -> m) -> Status a -> m)
-> (forall a b. (a -> b -> b) -> b -> Status a -> b)
-> (forall a b. (a -> b -> b) -> b -> Status a -> b)
-> (forall b a. (b -> a -> b) -> b -> Status a -> b)
-> (forall b a. (b -> a -> b) -> b -> Status a -> b)
-> (forall a. (a -> a -> a) -> Status a -> a)
-> (forall a. (a -> a -> a) -> Status a -> a)
-> (forall a. Status a -> [a])
-> (forall a. Status a -> Bool)
-> (forall a. Status a -> Int)
-> (forall a. Eq a => a -> Status a -> Bool)
-> (forall a. Ord a => Status a -> a)
-> (forall a. Ord a => Status a -> a)
-> (forall a. Num a => Status a -> a)
-> (forall a. Num a => Status a -> a)
-> Foldable Status
forall a. Eq a => a -> Status a -> Bool
forall a. Num a => Status a -> a
forall a. Ord a => Status a -> a
forall m. Monoid m => Status m -> m
forall a. Status a -> Bool
forall a. Status a -> Int
forall a. Status a -> [a]
forall a. (a -> a -> a) -> Status a -> a
forall m a. Monoid m => (a -> m) -> Status a -> m
forall b a. (b -> a -> b) -> b -> Status a -> b
forall a b. (a -> b -> b) -> b -> Status 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 :: Status a -> a
$cproduct :: forall a. Num a => Status a -> a
sum :: Status a -> a
$csum :: forall a. Num a => Status a -> a
minimum :: Status a -> a
$cminimum :: forall a. Ord a => Status a -> a
maximum :: Status a -> a
$cmaximum :: forall a. Ord a => Status a -> a
elem :: a -> Status a -> Bool
$celem :: forall a. Eq a => a -> Status a -> Bool
length :: Status a -> Int
$clength :: forall a. Status a -> Int
null :: Status a -> Bool
$cnull :: forall a. Status a -> Bool
toList :: Status a -> [a]
$ctoList :: forall a. Status a -> [a]
foldl1 :: (a -> a -> a) -> Status a -> a
$cfoldl1 :: forall a. (a -> a -> a) -> Status a -> a
foldr1 :: (a -> a -> a) -> Status a -> a
$cfoldr1 :: forall a. (a -> a -> a) -> Status a -> a
foldl' :: (b -> a -> b) -> b -> Status a -> b
$cfoldl' :: forall b a. (b -> a -> b) -> b -> Status a -> b
foldl :: (b -> a -> b) -> b -> Status a -> b
$cfoldl :: forall b a. (b -> a -> b) -> b -> Status a -> b
foldr' :: (a -> b -> b) -> b -> Status a -> b
$cfoldr' :: forall a b. (a -> b -> b) -> b -> Status a -> b
foldr :: (a -> b -> b) -> b -> Status a -> b
$cfoldr :: forall a b. (a -> b -> b) -> b -> Status a -> b
foldMap' :: (a -> m) -> Status a -> m
$cfoldMap' :: forall m a. Monoid m => (a -> m) -> Status a -> m
foldMap :: (a -> m) -> Status a -> m
$cfoldMap :: forall m a. Monoid m => (a -> m) -> Status a -> m
fold :: Status m -> m
$cfold :: forall m. Monoid m => Status m -> m
Foldable, a -> Status b -> Status a
(a -> b) -> Status a -> Status b
(forall a b. (a -> b) -> Status a -> Status b)
-> (forall a b. a -> Status b -> Status a) -> Functor Status
forall a b. a -> Status b -> Status a
forall a b. (a -> b) -> Status a -> Status b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: a -> Status b -> Status a
$c<$ :: forall a b. a -> Status b -> Status a
fmap :: (a -> b) -> Status a -> Status b
$cfmap :: forall a b. (a -> b) -> Status a -> Status b
Functor, Int -> Status a -> ShowS
[Status a] -> ShowS
Status a -> String
(Int -> Status a -> ShowS)
-> (Status a -> String) -> ([Status a] -> ShowS) -> Show (Status a)
forall a. Show a => Int -> Status a -> ShowS
forall a. Show a => [Status a] -> ShowS
forall a. Show a => Status a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Status a] -> ShowS
$cshowList :: forall a. Show a => [Status a] -> ShowS
show :: Status a -> String
$cshow :: forall a. Show a => Status a -> String
showsPrec :: Int -> Status a -> ShowS
$cshowsPrec :: forall a. Show a => Int -> Status a -> ShowS
Show, Functor Status
Foldable Status
Functor Status
-> Foldable Status
-> (forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> Status a -> f (Status b))
-> (forall (f :: * -> *) a.
    Applicative f =>
    Status (f a) -> f (Status a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> Status a -> m (Status b))
-> (forall (m :: * -> *) a.
    Monad m =>
    Status (m a) -> m (Status a))
-> Traversable Status
(a -> f b) -> Status a -> f (Status 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 => Status (m a) -> m (Status a)
forall (f :: * -> *) a.
Applicative f =>
Status (f a) -> f (Status a)
forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Status a -> m (Status b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Status a -> f (Status b)
sequence :: Status (m a) -> m (Status a)
$csequence :: forall (m :: * -> *) a. Monad m => Status (m a) -> m (Status a)
mapM :: (a -> m b) -> Status a -> m (Status b)
$cmapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Status a -> m (Status b)
sequenceA :: Status (f a) -> f (Status a)
$csequenceA :: forall (f :: * -> *) a.
Applicative f =>
Status (f a) -> f (Status a)
traverse :: (a -> f b) -> Status a -> f (Status b)
$ctraverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Status a -> f (Status b)
$cp2Traversable :: Foldable Status
$cp1Traversable :: Functor Status
Traversable)