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

           )
           via Identity

_theProposed :: Proposed x -> x
_theProposed :: Proposed x -> x
_theProposed (Proposed !x
x) = x
x
{-# INLINE _theProposed #-}

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