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

           )
           via Identity

_theInvalid :: Invalid x -> x
_theInvalid :: Invalid x -> x
_theInvalid (Invalid !x
x) = x
x
{-# INLINE _theInvalid #-}

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