-- | Indicate that something is `Active`.
module NewtypeZoo.Active
  ( Active(Active)
  , _theActive
  , theActive
  ) where

import           Control.Comonad (Comonad)
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)

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

-- | An accessor function for something 'Active'.
_theActive :: Active x -> x
_theActive :: Active x -> x
_theActive (Active !x
x) = x
x
{-# INLINE _theActive #-}

-- | A lens for something 'Active'.
theActive :: forall a b p f. (Profunctor p, Functor f) => p a (f b) -> p (Active a) (f (Active b))
theActive :: p a (f b) -> p (Active a) (f (Active b))
theActive = (Active a -> a)
-> (f b -> f (Active b))
-> p a (f b)
-> p (Active a) (f (Active b))
forall (p :: * -> * -> *) a b c d.
Profunctor p =>
(a -> b) -> (c -> d) -> p b c -> p a d
dimap Active a -> a
forall a. Active a -> a
_theActive ((b -> Active b) -> f b -> f (Active b)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap b -> Active b
forall a. a -> Active a
Active)
{-# INLINE theActive #-}