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

           )
           via Identity

_theNext :: Next x -> x
_theNext :: Next x -> x
_theNext (Next !x
x) = x
x
{-# INLINE _theNext #-}

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