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

           )
           via Identity

_theUnwanted :: Unwanted x -> x
_theUnwanted :: Unwanted x -> x
_theUnwanted (Unwanted !x
x) = x
x
{-# INLINE _theUnwanted #-}

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