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

           )
           via Identity

_theNew :: New x -> x
_theNew :: New x -> x
_theNew (New !x
x) = x
x
{-# INLINE _theNew #-}

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