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

           )
           via Identity

_theWanted :: Wanted x -> x
_theWanted :: Wanted x -> x
_theWanted (Wanted !x
x) = x
x
{-# INLINE _theWanted #-}

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