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

           )
           via Identity

_thePrevious :: Previous x -> x
_thePrevious :: Previous x -> x
_thePrevious (Previous !x
x) = x
x
{-# INLINE _thePrevious #-}

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