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

           )
           via Identity

_theRemaining :: Remaining x -> x
_theRemaining :: Remaining x -> x
_theRemaining (Remaining !x
x) = x
x
{-# INLINE _theRemaining #-}

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