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

           )
           via Identity

_theRejected :: Rejected x -> x
_theRejected :: Rejected x -> x
_theRejected (Rejected !x
x) = x
x
{-# INLINE _theRejected #-}

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