{-# LANGUAGE FlexibleInstances #-}
{-# OPTIONS_GHC -Wno-orphans #-}

module Plutarch.Rational (
  PRational (PRational),
  preduce,
  pnumerator,
  pdenominator,
  Plutarch.Rational.pfromInteger,
  pround,
  ptruncate,
  pproperFraction,
  PFractional (..),
) where

import Data.Kind (Type)
import Data.Ratio (denominator, numerator)
import GHC.Generics (Generic)
import Plutarch.Builtin (
  PAsData,
  PBuiltinList,
  PData,
  PIsData,
  pasInt,
  pasList,
  pdata,
  pdataImpl,
  pforgetData,
  pfromDataImpl,
 )
import Plutarch.Builtin.Bool (pif, pnot)
import Plutarch.Integer (PInteger, PIntegral (pquot), pdiv, pmod)
import Plutarch.Internal.Eq (PEq ((#==)))
import Plutarch.Internal.Lift (pconstant)
import Plutarch.Internal.Ord (POrd, PPartialOrd ((#<), (#<=)))
import Plutarch.Internal.Other (pfix, pto)
import Plutarch.Internal.PLam (plam)
import Plutarch.Internal.PlutusType (
  DerivePlutusType (DPTStrat),
  PlutusType,
  pcon,
  pmatch,
 )
import Plutarch.Internal.ScottEncoding (PlutusTypeScott)
import Plutarch.Internal.Term (
  S,
  Term,
  phoistAcyclic,
  plet,
  (#),
  (#$),
  (:-->),
 )
import Plutarch.List (pcons, phead, pnil, ptail)
import Plutarch.Num (PNum, pabs, pfromInteger, pnegate, psignum, (#*), (#+), (#-))
import Plutarch.Pair (PPair (PPair))
import Plutarch.Positive (PPositive, ptryPositive)
import Plutarch.Show (PShow, pshow, pshow')
import Plutarch.TermCont (
  pguardC,
  runTermCont,
  tcont,
  unTermCont,
 )
import Plutarch.Trace (ptraceInfoError)
import Plutarch.TryFrom (PTryFrom (PTryFromExcess, ptryFrom'), ptryFrom)
import Plutarch.Unsafe (punsafeCoerce, punsafeDowncast)

class PFractional (a :: S -> Type) where
  (#/) :: Term s a -> Term s a -> Term s a
  precip :: Term s (a :--> a)
  pfromRational :: Term s (PRational :--> a)

-- | Note: This type is _not_ the synonym of 'PlutusTx.Rational'.
data PRational s
  = PRational (Term s PInteger) (Term s PPositive)
  deriving stock ((forall x. PRational s -> Rep (PRational s) x)
-> (forall x. Rep (PRational s) x -> PRational s)
-> Generic (PRational s)
forall x. Rep (PRational s) x -> PRational s
forall x. PRational s -> Rep (PRational s) x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall (s :: S) x. Rep (PRational s) x -> PRational s
forall (s :: S) x. PRational s -> Rep (PRational s) x
$cfrom :: forall (s :: S) x. PRational s -> Rep (PRational s) x
from :: forall x. PRational s -> Rep (PRational s) x
$cto :: forall (s :: S) x. Rep (PRational s) x -> PRational s
to :: forall x. Rep (PRational s) x -> PRational s
Generic)
  deriving anyclass ((forall (s :: S). PRational s -> Term s (PInner PRational))
-> (forall (s :: S) (b :: PType).
    Term s (PInner PRational) -> (PRational s -> Term s b) -> Term s b)
-> PlutusType PRational
forall (s :: S). PRational s -> Term s (PInner PRational)
forall (s :: S) (b :: PType).
Term s (PInner PRational) -> (PRational s -> Term s b) -> Term s b
forall (a :: PType).
(forall (s :: S). a s -> Term s (PInner a))
-> (forall (s :: S) (b :: PType).
    Term s (PInner a) -> (a s -> Term s b) -> Term s b)
-> PlutusType a
$cpcon' :: forall (s :: S). PRational s -> Term s (PInner PRational)
pcon' :: forall (s :: S). PRational s -> Term s (PInner PRational)
$cpmatch' :: forall (s :: S) (b :: PType).
Term s (PInner PRational) -> (PRational s -> Term s b) -> Term s b
pmatch' :: forall (s :: S) (b :: PType).
Term s (PInner PRational) -> (PRational s -> Term s b) -> Term s b
PlutusType)

instance DerivePlutusType PRational where type DPTStrat _ = PlutusTypeScott

instance PEq PRational where
  Term s PRational
l' #== :: forall (s :: S).
Term s PRational -> Term s PRational -> Term s PBool
#== Term s PRational
r' =
    ClosedTerm (PRational :--> (PRational :--> PBool))
-> Term s (PRational :--> (PRational :--> PBool))
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic
      ( (Term s PRational -> Term s PRational -> Term s PBool)
-> Term s (PRational :--> (PRational :--> PBool))
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PRational -> Term s PBool)
-> Term s (c :--> (PRational :--> PBool))
plam ((Term s PRational -> Term s PRational -> Term s PBool)
 -> Term s (PRational :--> (PRational :--> PBool)))
-> (Term s PRational -> Term s PRational -> Term s PBool)
-> Term s (PRational :--> (PRational :--> PBool))
forall a b. (a -> b) -> a -> b
$ \Term s PRational
l Term s PRational
r ->
          Term s PRational -> (PRational s -> Term s PBool) -> Term s PBool
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
l ((PRational s -> Term s PBool) -> Term s PBool)
-> (PRational s -> Term s PBool) -> Term s PBool
forall a b. (a -> b) -> a -> b
$ \(PRational Term s PInteger
ln Term s PPositive
ld) ->
            Term s PRational -> (PRational s -> Term s PBool) -> Term s PBool
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
r ((PRational s -> Term s PBool) -> Term s PBool)
-> (PRational s -> Term s PBool) -> Term s PBool
forall a b. (a -> b) -> a -> b
$ \(PRational Term s PInteger
rn Term s PPositive
rd) ->
              Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
rd Term s PInteger -> Term s PInteger -> Term s PInteger
forall a. Num a => a -> a -> a
* Term s PInteger
ln Term s PInteger -> Term s PInteger -> Term s PBool
forall (s :: S). Term s PInteger -> Term s PInteger -> Term s PBool
forall (t :: PType) (s :: S).
PEq t =>
Term s t -> Term s t -> Term s PBool
#== Term s PInteger
rn Term s PInteger -> Term s PInteger -> Term s PInteger
forall a. Num a => a -> a -> a
* Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
ld
      )
      # l'
      # r'

instance (PNum a, PFractional a) => Fractional (Term s a) where
  / :: Term s a -> Term s a -> Term s a
(/) = Term s a -> Term s a -> Term s a
forall (s :: S). Term s a -> Term s a -> Term s a
forall (a :: PType) (s :: S).
PFractional a =>
Term s a -> Term s a -> Term s a
(#/)
  recip :: Term s a -> Term s a
recip Term s a
x = Term s (a :--> a)
forall (s :: S). Term s (a :--> a)
forall (a :: PType) (s :: S). PFractional a => Term s (a :--> a)
precip Term s (a :--> a) -> Term s a -> Term s a
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s a
x
  fromRational :: Rational -> Term s a
fromRational Rational
x =
    Term s (PRational :--> a)
forall (s :: S). Term s (PRational :--> a)
forall (a :: PType) (s :: S).
PFractional a =>
Term s (PRational :--> a)
pfromRational Term s (PRational :--> a) -> Term s PRational -> Term s a
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
#$ PRational s -> Term s PRational
forall (a :: PType) (s :: S). PlutusType a => a s -> Term s a
pcon (PRational s -> Term s PRational)
-> PRational s -> Term s PRational
forall a b. (a -> b) -> a -> b
$
      Term s PInteger -> Term s PPositive -> PRational s
forall (s :: S). Term s PInteger -> Term s PPositive -> PRational s
PRational
        (AsHaskell PInteger -> Term s PInteger
forall (a :: PType) (s :: S).
PLiftable a =>
AsHaskell a -> Term s a
pconstant (AsHaskell PInteger -> Term s PInteger)
-> AsHaskell PInteger -> Term s PInteger
forall a b. (a -> b) -> a -> b
$ Rational -> Integer
forall a. Ratio a -> a
numerator Rational
x)
        (Term s (PInner PPositive) -> Term s PPositive
forall (s :: S) (a :: PType). Term s (PInner a) -> Term s a
punsafeDowncast (Term s (PInner PPositive) -> Term s PPositive)
-> (AsHaskell (PInner PPositive) -> Term s (PInner PPositive))
-> AsHaskell (PInner PPositive)
-> Term s PPositive
forall b c a. (b -> c) -> (a -> b) -> a -> c
. AsHaskell (PInner PPositive) -> Term s (PInner PPositive)
forall (a :: PType) (s :: S).
PLiftable a =>
AsHaskell a -> Term s a
pconstant (AsHaskell (PInner PPositive) -> Term s PPositive)
-> AsHaskell (PInner PPositive) -> Term s PPositive
forall a b. (a -> b) -> a -> b
$ Rational -> Integer
forall a. Ratio a -> a
denominator Rational
x)

instance PShow PRational where
  pshow' :: forall (s :: S). Bool -> Term s PRational -> Term s PString
pshow' Bool
_ Term s PRational
x =
    Term s (PRational :--> PString)
forall {s :: S}. Term s (PRational :--> PString)
pshowRat Term s (PRational :--> PString)
-> Term s PRational -> Term s PString
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PRational
x
    where
      pshowRat :: Term s (PRational :--> PString)
pshowRat = (forall {s :: S}. Term s (PRational :--> PString))
-> Term s (PRational :--> PString)
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall {s :: S}. Term s (PRational :--> PString))
 -> Term s (PRational :--> PString))
-> (forall {s :: S}. Term s (PRational :--> PString))
-> Term s (PRational :--> PString)
forall a b. (a -> b) -> a -> b
$
        (Term s PRational -> Term s PString)
-> Term s (PRational :--> PString)
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PString) -> Term s (c :--> PString)
plam ((Term s PRational -> Term s PString)
 -> Term s (PRational :--> PString))
-> (Term s PRational -> Term s PString)
-> Term s (PRational :--> PString)
forall a b. (a -> b) -> a -> b
$ \Term s PRational
n -> Term s PRational
-> (PRational s -> Term s PString) -> Term s PString
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
n ((PRational s -> Term s PString) -> Term s PString)
-> (PRational s -> Term s PString) -> Term s PString
forall a b. (a -> b) -> a -> b
$ \(PRational Term s PInteger
x Term s PPositive
y) ->
          Term s PInteger -> Term s PString
forall (a :: PType) (s :: S). PShow a => Term s a -> Term s PString
pshow Term s PInteger
x Term s PString -> Term s PString -> Term s PString
forall a. Semigroup a => a -> a -> a
<> Term s PString
"/" Term s PString -> Term s PString -> Term s PString
forall a. Semigroup a => a -> a -> a
<> Term s (PInner PPositive) -> Term s PString
forall (a :: PType) (s :: S). PShow a => Term s a -> Term s PString
pshow (Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
y)

-- | This instance _does not_ correspond to 'PlutusTx.Rational's data encoding.
instance PIsData PRational where
  pfromDataImpl :: forall (s :: S). Term s (PAsData PRational) -> Term s PRational
pfromDataImpl Term s (PAsData PRational)
x' = ClosedTerm (PAsData PRational :--> PRational)
-> Term s (PAsData PRational :--> PRational)
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((Term s (PAsData PRational) -> Term s PRational)
-> Term s (PAsData PRational :--> PRational)
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PRational) -> Term s (c :--> PRational)
plam ((Term s (PAsData PRational) -> Term s PRational)
 -> Term s (PAsData PRational :--> PRational))
-> (Term s (PAsData PRational) -> Term s PRational)
-> Term s (PAsData PRational :--> PRational)
forall a b. (a -> b) -> a -> b
$ \Term s (PAsData PRational)
x -> Term s (PBuiltinList PData :--> PRational)
forall (s :: S). Term s (PBuiltinList PData :--> PRational)
plistToRat Term s (PBuiltinList PData :--> PRational)
-> Term s (PBuiltinList PData) -> Term s PRational
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
#$ Term s (PData :--> PBuiltinList PData)
forall (s :: S). Term s (PData :--> PBuiltinList PData)
pasList Term s (PData :--> PBuiltinList PData)
-> Term s PData -> Term s (PBuiltinList PData)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s (PAsData PRational) -> Term s PData
forall (s :: S) (a :: PType). Term s (PAsData a) -> Term s PData
pforgetData Term s (PAsData PRational)
x) Term s (PAsData PRational :--> PRational)
-> Term s (PAsData PRational) -> Term s PRational
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s (PAsData PRational)
x'
    where
      plistToRat :: Term s (PBuiltinList PData :--> PRational)
      plistToRat :: forall (s :: S). Term s (PBuiltinList PData :--> PRational)
plistToRat = (Term s (PBuiltinList PData) -> Term s PRational)
-> Term s (PBuiltinList PData :--> PRational)
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PRational) -> Term s (c :--> PRational)
plam ((Term s (PBuiltinList PData) -> Term s PRational)
 -> Term s (PBuiltinList PData :--> PRational))
-> (Term s (PBuiltinList PData) -> Term s PRational)
-> Term s (PBuiltinList PData :--> PRational)
forall a b. (a -> b) -> a -> b
$ \Term s (PBuiltinList PData)
x ->
        PRational s -> Term s PRational
forall (a :: PType) (s :: S). PlutusType a => a s -> Term s a
pcon
          (PRational s -> Term s PRational)
-> PRational s -> Term s PRational
forall a b. (a -> b) -> a -> b
$ Term s PInteger -> Term s PPositive -> PRational s
forall (s :: S). Term s PInteger -> Term s PPositive -> PRational s
PRational (Term s (PData :--> PInteger)
forall (s :: S). Term s (PData :--> PInteger)
pasInt Term s (PData :--> PInteger) -> Term s PData -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
#$ Term s (PBuiltinList PData :--> PData)
forall (a :: PType) (s :: S).
PElemConstraint PBuiltinList a =>
Term s (PBuiltinList a :--> a)
forall (list :: PType -> PType) (a :: PType) (s :: S).
(PListLike list, PElemConstraint list a) =>
Term s (list a :--> a)
phead Term s (PBuiltinList PData :--> PData)
-> Term s (PBuiltinList PData) -> Term s PData
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s (PBuiltinList PData)
x)
            (Term s PPositive -> PRational s)
-> (Term s (PInner PPositive) -> Term s PPositive)
-> Term s (PInner PPositive)
-> PRational s
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Term s (PInner PPositive) -> Term s PPositive
forall (s :: S) (a :: PType). Term s (PInner a) -> Term s a
punsafeDowncast
          (Term s (PInner PPositive) -> PRational s)
-> Term s (PInner PPositive) -> PRational s
forall a b. (a -> b) -> a -> b
$ Term s (PData :--> PInteger)
forall (s :: S). Term s (PData :--> PInteger)
pasInt Term s (PData :--> PInteger) -> Term s PData -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
#$ Term s (PBuiltinList PData :--> PData)
forall (a :: PType) (s :: S).
PElemConstraint PBuiltinList a =>
Term s (PBuiltinList a :--> a)
forall (list :: PType -> PType) (a :: PType) (s :: S).
(PListLike list, PElemConstraint list a) =>
Term s (list a :--> a)
phead Term s (PBuiltinList PData :--> PData)
-> Term s (PBuiltinList PData) -> Term s PData
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
#$ Term s (PBuiltinList PData :--> PBuiltinList PData)
forall (a :: PType) (s :: S).
PElemConstraint PBuiltinList a =>
Term s (PBuiltinList a :--> PBuiltinList a)
forall (list :: PType -> PType) (a :: PType) (s :: S).
(PListLike list, PElemConstraint list a) =>
Term s (list a :--> list a)
ptail Term s (PBuiltinList PData :--> PBuiltinList PData)
-> Term s (PBuiltinList PData) -> Term s (PBuiltinList PData)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s (PBuiltinList PData)
x
  pdataImpl :: forall (s :: S). Term s PRational -> Term s PData
pdataImpl Term s PRational
x' =
    ClosedTerm (PRational :--> PData) -> Term s (PRational :--> PData)
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic
      ( (Term s PRational -> Term s PData) -> Term s (PRational :--> PData)
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PData) -> Term s (c :--> PData)
plam ((Term s PRational -> Term s PData)
 -> Term s (PRational :--> PData))
-> (Term s PRational -> Term s PData)
-> Term s (PRational :--> PData)
forall a b. (a -> b) -> a -> b
$ \Term s PRational
x -> TermCont @PData s (Term s PData) -> Term s PData
forall (a :: PType) (s :: S). TermCont @a s (Term s a) -> Term s a
unTermCont (TermCont @PData s (Term s PData) -> Term s PData)
-> TermCont @PData s (Term s PData) -> Term s PData
forall a b. (a -> b) -> a -> b
$ do
          PRational Term s PInteger
a Term s PPositive
b <- ((PRational s -> Term s PData) -> Term s PData)
-> TermCont @PData s (PRational s)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((PRational s -> Term s PData) -> Term s PData)
 -> TermCont @PData s (PRational s))
-> ((PRational s -> Term s PData) -> Term s PData)
-> TermCont @PData s (PRational s)
forall a b. (a -> b) -> a -> b
$ Term s PRational -> (PRational s -> Term s PData) -> Term s PData
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
x
          let res :: Term _ (PBuiltinList (PAsData PInteger))
              res :: Term s (PBuiltinList (PAsData PInteger))
res = Term
  s
  (PAsData PInteger
   :--> (PBuiltinList (PAsData PInteger)
         :--> PBuiltinList (PAsData PInteger)))
forall (a :: PType) (s :: S).
PElemConstraint PBuiltinList a =>
Term s (a :--> (PBuiltinList a :--> PBuiltinList a))
forall (list :: PType -> PType) (a :: PType) (s :: S).
(PListLike list, PElemConstraint list a) =>
Term s (a :--> (list a :--> list a))
pcons Term
  s
  (PAsData PInteger
   :--> (PBuiltinList (PAsData PInteger)
         :--> PBuiltinList (PAsData PInteger)))
-> Term s (PAsData PInteger)
-> Term
     s
     (PBuiltinList (PAsData PInteger)
      :--> PBuiltinList (PAsData PInteger))
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger -> Term s (PAsData PInteger)
forall (a :: PType) (s :: S).
PIsData a =>
Term s a -> Term s (PAsData a)
pdata Term s PInteger
a Term
  s
  (PBuiltinList (PAsData PInteger)
   :--> PBuiltinList (PAsData PInteger))
-> Term s (PBuiltinList (PAsData PInteger))
-> Term s (PBuiltinList (PAsData PInteger))
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
#$ Term
  s
  (PAsData (PInner PPositive)
   :--> (PBuiltinList (PAsData (PInner PPositive))
         :--> PBuiltinList (PAsData (PInner PPositive))))
forall (a :: PType) (s :: S).
PElemConstraint PBuiltinList a =>
Term s (a :--> (PBuiltinList a :--> PBuiltinList a))
forall (list :: PType -> PType) (a :: PType) (s :: S).
(PListLike list, PElemConstraint list a) =>
Term s (a :--> (list a :--> list a))
pcons Term
  s
  (PAsData (PInner PPositive)
   :--> (PBuiltinList (PAsData (PInner PPositive))
         :--> PBuiltinList (PAsData (PInner PPositive))))
-> Term s (PAsData (PInner PPositive))
-> Term
     s
     (PBuiltinList (PAsData (PInner PPositive))
      :--> PBuiltinList (PAsData (PInner PPositive)))
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s (PInner PPositive) -> Term s (PAsData (PInner PPositive))
forall (a :: PType) (s :: S).
PIsData a =>
Term s a -> Term s (PAsData a)
pdata (Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
b) Term
  s
  (PBuiltinList (PAsData (PInner PPositive))
   :--> PBuiltinList (PAsData (PInner PPositive)))
-> Term s (PBuiltinList (PAsData (PInner PPositive)))
-> Term s (PBuiltinList (PAsData (PInner PPositive)))
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
#$ Term s (PBuiltinList (PAsData (PInner PPositive)))
forall (a :: PType) (s :: S).
PElemConstraint PBuiltinList a =>
Term s (PBuiltinList a)
forall (list :: PType -> PType) (a :: PType) (s :: S).
(PListLike list, PElemConstraint list a) =>
Term s (list a)
pnil
          Term s PData -> TermCont @PData s (Term s PData)
forall a. a -> TermCont @PData s a
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (Term s PData -> TermCont @PData s (Term s PData))
-> Term s PData -> TermCont @PData s (Term s PData)
forall a b. (a -> b) -> a -> b
$ Term s (PBuiltinList (PAsData PInteger)) -> Term s PData
forall (s :: S).
Term s (PBuiltinList (PAsData PInteger)) -> Term s PData
forall (a :: PType) (s :: S). PIsData a => Term s a -> Term s PData
pdataImpl Term s (PBuiltinList (PAsData PInteger))
res
      )
      # x'

newtype Flip f a b = Flip (f b a) deriving stock ((forall x. Flip @k @k f a b -> Rep (Flip @k @k f a b) x)
-> (forall x. Rep (Flip @k @k f a b) x -> Flip @k @k f a b)
-> Generic (Flip @k @k f a b)
forall x. Rep (Flip @k @k f a b) x -> Flip @k @k f a b
forall x. Flip @k @k f a b -> Rep (Flip @k @k f a b) x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall k k (f :: k -> k -> Type) (a :: k) (b :: k) x.
Rep (Flip @k @k f a b) x -> Flip @k @k f a b
forall k k (f :: k -> k -> Type) (a :: k) (b :: k) x.
Flip @k @k f a b -> Rep (Flip @k @k f a b) x
$cfrom :: forall k k (f :: k -> k -> Type) (a :: k) (b :: k) x.
Flip @k @k f a b -> Rep (Flip @k @k f a b) x
from :: forall x. Flip @k @k f a b -> Rep (Flip @k @k f a b) x
$cto :: forall k k (f :: k -> k -> Type) (a :: k) (b :: k) x.
Rep (Flip @k @k f a b) x -> Flip @k @k f a b
to :: forall x. Rep (Flip @k @k f a b) x -> Flip @k @k f a b
Generic)

-- | NOTE: This instance produces a verified 'PPositive' as the excess output.
instance PTryFrom PData (PAsData PRational) where
  type PTryFromExcess PData (PAsData PRational) = Flip Term PPositive
  ptryFrom' :: forall (s :: S) (r :: PType).
Term s PData
-> ((Term s (PAsData PRational),
     Reduce (PTryFromExcess PData (PAsData PRational) s))
    -> Term s r)
-> Term s r
ptryFrom' Term s PData
opq = TermCont
  @r
  s
  (Term s (PAsData PRational),
   Reduce (PTryFromExcess PData (PAsData PRational) s))
-> ((Term s (PAsData PRational),
     Reduce (PTryFromExcess PData (PAsData PRational) s))
    -> Term s r)
-> Term s r
forall (r :: PType) (s :: S) a.
TermCont @r s a -> (a -> Term s r) -> Term s r
runTermCont (TermCont
   @r
   s
   (Term s (PAsData PRational),
    Reduce (PTryFromExcess PData (PAsData PRational) s))
 -> ((Term s (PAsData PRational),
      Reduce (PTryFromExcess PData (PAsData PRational) s))
     -> Term s r)
 -> Term s r)
-> TermCont
     @r
     s
     (Term s (PAsData PRational),
      Reduce (PTryFromExcess PData (PAsData PRational) s))
-> ((Term s (PAsData PRational),
     Reduce (PTryFromExcess PData (PAsData PRational) s))
    -> Term s r)
-> Term s r
forall a b. (a -> b) -> a -> b
$ do
    (Term s (PAsData (PBuiltinList PData))
_, Term s (PBuiltinList PData)
ld) <- (((Term s (PAsData (PBuiltinList PData)),
   Term s (PBuiltinList PData))
  -> Term s r)
 -> Term s r)
-> TermCont
     @r
     s
     (Term s (PAsData (PBuiltinList PData)),
      Term s (PBuiltinList PData))
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont ((((Term s (PAsData (PBuiltinList PData)),
    Term s (PBuiltinList PData))
   -> Term s r)
  -> Term s r)
 -> TermCont
      @r
      s
      (Term s (PAsData (PBuiltinList PData)),
       Term s (PBuiltinList PData)))
-> (((Term s (PAsData (PBuiltinList PData)),
      Term s (PBuiltinList PData))
     -> Term s r)
    -> Term s r)
-> TermCont
     @r
     s
     (Term s (PAsData (PBuiltinList PData)),
      Term s (PBuiltinList PData))
forall a b. (a -> b) -> a -> b
$ forall (b :: PType) (a :: PType) (s :: S) (r :: PType).
PTryFrom a b =>
Term s a
-> ((Term s b, Reduce (PTryFromExcess a b s)) -> Term s r)
-> Term s r
ptryFrom @(PAsData (PBuiltinList PData)) Term s PData
opq
    Term s (PBuiltinList PData)
ratTail <- ((Term s (PBuiltinList PData) -> Term s r) -> Term s r)
-> TermCont @r s (Term s (PBuiltinList PData))
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((Term s (PBuiltinList PData) -> Term s r) -> Term s r)
 -> TermCont @r s (Term s (PBuiltinList PData)))
-> (Term s (PBuiltinList PData)
    -> (Term s (PBuiltinList PData) -> Term s r) -> Term s r)
-> Term s (PBuiltinList PData)
-> TermCont @r s (Term s (PBuiltinList PData))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Term s (PBuiltinList PData)
-> (Term s (PBuiltinList PData) -> Term s r) -> Term s r
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet (Term s (PBuiltinList PData)
 -> TermCont @r s (Term s (PBuiltinList PData)))
-> Term s (PBuiltinList PData)
-> TermCont @r s (Term s (PBuiltinList PData))
forall a b. (a -> b) -> a -> b
$ Term s (PBuiltinList PData :--> PBuiltinList PData)
forall (a :: PType) (s :: S).
PElemConstraint PBuiltinList a =>
Term s (PBuiltinList a :--> PBuiltinList a)
forall (list :: PType -> PType) (a :: PType) (s :: S).
(PListLike list, PElemConstraint list a) =>
Term s (list a :--> list a)
ptail Term s (PBuiltinList PData :--> PBuiltinList PData)
-> Term s (PBuiltinList PData) -> Term s (PBuiltinList PData)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s (PBuiltinList PData)
ld
    ((() -> Term s r) -> Term s r) -> TermCont @r s ()
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((() -> Term s r) -> Term s r) -> TermCont @r s ())
-> ((() -> Term s r) -> Term s r) -> TermCont @r s ()
forall a b. (a -> b) -> a -> b
$ \() -> Term s r
f -> Term s PBool -> Term s r -> Term s r -> Term s r
forall (a :: PType) (s :: S).
Term s PBool -> Term s a -> Term s a -> Term s a
pif (Term s (PBuiltinList PData :--> PBuiltinList PData)
forall (a :: PType) (s :: S).
PElemConstraint PBuiltinList a =>
Term s (PBuiltinList a :--> PBuiltinList a)
forall (list :: PType -> PType) (a :: PType) (s :: S).
(PListLike list, PElemConstraint list a) =>
Term s (list a :--> list a)
ptail Term s (PBuiltinList PData :--> PBuiltinList PData)
-> Term s (PBuiltinList PData) -> Term s (PBuiltinList PData)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s (PBuiltinList PData)
ratTail Term s (PBuiltinList PData)
-> Term s (PBuiltinList PData) -> Term s PBool
forall (s :: S).
Term s (PBuiltinList PData)
-> Term s (PBuiltinList PData) -> Term s PBool
forall (t :: PType) (s :: S).
PEq t =>
Term s t -> Term s t -> Term s PBool
#== Term s (PBuiltinList PData)
forall (a :: PType) (s :: S).
PElemConstraint PBuiltinList a =>
Term s (PBuiltinList a)
forall (list :: PType -> PType) (a :: PType) (s :: S).
(PListLike list, PElemConstraint list a) =>
Term s (list a)
pnil) (() -> Term s r
f ()) (Term s r -> Term s r) -> Term s r -> Term s r
forall a b. (a -> b) -> a -> b
$ Term s PString -> Term s r
forall (a :: PType) (s :: S). Term s PString -> Term s a
ptraceInfoError Term s PString
"ptryFrom(PRational): data list length should be 2"
    (Term s (PAsData PInteger)
_, Term s PInteger
denm) <- (((Term s (PAsData PInteger), Term s PInteger) -> Term s r)
 -> Term s r)
-> TermCont @r s (Term s (PAsData PInteger), Term s PInteger)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont ((((Term s (PAsData PInteger), Term s PInteger) -> Term s r)
  -> Term s r)
 -> TermCont @r s (Term s (PAsData PInteger), Term s PInteger))
-> (((Term s (PAsData PInteger), Term s PInteger) -> Term s r)
    -> Term s r)
-> TermCont @r s (Term s (PAsData PInteger), Term s PInteger)
forall a b. (a -> b) -> a -> b
$ forall (b :: PType) (a :: PType) (s :: S) (r :: PType).
PTryFrom a b =>
Term s a
-> ((Term s b, Reduce (PTryFromExcess a b s)) -> Term s r)
-> Term s r
ptryFrom @(PAsData PInteger) (Term s PData
 -> ((Term s (PAsData PInteger),
      Reduce (PTryFromExcess PData (PAsData PInteger) s))
     -> Term s r)
 -> Term s r)
-> Term s PData
-> ((Term s (PAsData PInteger),
     Reduce (PTryFromExcess PData (PAsData PInteger) s))
    -> Term s r)
-> Term s r
forall a b. (a -> b) -> a -> b
$ Term s (PBuiltinList PData :--> PData)
forall (a :: PType) (s :: S).
PElemConstraint PBuiltinList a =>
Term s (PBuiltinList a :--> a)
forall (list :: PType -> PType) (a :: PType) (s :: S).
(PListLike list, PElemConstraint list a) =>
Term s (list a :--> a)
phead Term s (PBuiltinList PData :--> PData)
-> Term s (PBuiltinList PData) -> Term s PData
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s (PBuiltinList PData)
ratTail
    Term s PPositive
res <- ((Term s PPositive -> Term s r) -> Term s r)
-> TermCont @r s (Term s PPositive)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((Term s PPositive -> Term s r) -> Term s r)
 -> TermCont @r s (Term s PPositive))
-> (Term s PPositive -> (Term s PPositive -> Term s r) -> Term s r)
-> Term s PPositive
-> TermCont @r s (Term s PPositive)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Term s PPositive -> (Term s PPositive -> Term s r) -> Term s r
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet (Term s PPositive -> TermCont @r s (Term s PPositive))
-> Term s PPositive -> TermCont @r s (Term s PPositive)
forall a b. (a -> b) -> a -> b
$ Term s (PInteger :--> PPositive)
forall (s :: S). Term s (PInteger :--> PPositive)
ptryPositive Term s (PInteger :--> PPositive)
-> Term s PInteger -> Term s PPositive
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
denm
    (Term s (PAsData PRational), Term s PPositive)
-> TermCont @r s (Term s (PAsData PRational), Term s PPositive)
forall a. a -> TermCont @r s a
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (Term s PData -> Term s (PAsData PRational)
forall (s :: S) (a :: PType) (b :: PType). Term s a -> Term s b
punsafeCoerce Term s PData
opq, Term s PPositive
res)

instance PPartialOrd PRational where
  Term s PRational
l' #<= :: forall (s :: S).
Term s PRational -> Term s PRational -> Term s PBool
#<= Term s PRational
r' =
    ClosedTerm (PRational :--> (PRational :--> PBool))
-> Term s (PRational :--> (PRational :--> PBool))
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic
      ( (Term s PRational -> Term s PRational -> Term s PBool)
-> Term s (PRational :--> (PRational :--> PBool))
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PRational -> Term s PBool)
-> Term s (c :--> (PRational :--> PBool))
plam ((Term s PRational -> Term s PRational -> Term s PBool)
 -> Term s (PRational :--> (PRational :--> PBool)))
-> (Term s PRational -> Term s PRational -> Term s PBool)
-> Term s (PRational :--> (PRational :--> PBool))
forall a b. (a -> b) -> a -> b
$ \Term s PRational
l Term s PRational
r -> TermCont @PBool s (Term s PBool) -> Term s PBool
forall (a :: PType) (s :: S). TermCont @a s (Term s a) -> Term s a
unTermCont (TermCont @PBool s (Term s PBool) -> Term s PBool)
-> TermCont @PBool s (Term s PBool) -> Term s PBool
forall a b. (a -> b) -> a -> b
$ do
          PRational Term s PInteger
ln Term s PPositive
ld <- ((PRational s -> Term s PBool) -> Term s PBool)
-> TermCont @PBool s (PRational s)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((PRational s -> Term s PBool) -> Term s PBool)
 -> TermCont @PBool s (PRational s))
-> ((PRational s -> Term s PBool) -> Term s PBool)
-> TermCont @PBool s (PRational s)
forall a b. (a -> b) -> a -> b
$ Term s PRational -> (PRational s -> Term s PBool) -> Term s PBool
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
l
          PRational Term s PInteger
rn Term s PPositive
rd <- ((PRational s -> Term s PBool) -> Term s PBool)
-> TermCont @PBool s (PRational s)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((PRational s -> Term s PBool) -> Term s PBool)
 -> TermCont @PBool s (PRational s))
-> ((PRational s -> Term s PBool) -> Term s PBool)
-> TermCont @PBool s (PRational s)
forall a b. (a -> b) -> a -> b
$ Term s PRational -> (PRational s -> Term s PBool) -> Term s PBool
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
r
          Term s PBool -> TermCont @PBool s (Term s PBool)
forall a. a -> TermCont @PBool s a
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (Term s PBool -> TermCont @PBool s (Term s PBool))
-> Term s PBool -> TermCont @PBool s (Term s PBool)
forall a b. (a -> b) -> a -> b
$ Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
rd Term s PInteger -> Term s PInteger -> Term s PInteger
forall a. Num a => a -> a -> a
* Term s PInteger
ln Term s PInteger -> Term s PInteger -> Term s PBool
forall (s :: S). Term s PInteger -> Term s PInteger -> Term s PBool
forall (t :: PType) (s :: S).
PPartialOrd t =>
Term s t -> Term s t -> Term s PBool
#<= Term s PInteger
rn Term s PInteger -> Term s PInteger -> Term s PInteger
forall a. Num a => a -> a -> a
* Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
ld
      )
      # l'
      # r'

  Term s PRational
l' #< :: forall (s :: S).
Term s PRational -> Term s PRational -> Term s PBool
#< Term s PRational
r' =
    ClosedTerm (PRational :--> (PRational :--> PBool))
-> Term s (PRational :--> (PRational :--> PBool))
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic
      ( (Term s PRational -> Term s PRational -> Term s PBool)
-> Term s (PRational :--> (PRational :--> PBool))
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PRational -> Term s PBool)
-> Term s (c :--> (PRational :--> PBool))
plam ((Term s PRational -> Term s PRational -> Term s PBool)
 -> Term s (PRational :--> (PRational :--> PBool)))
-> (Term s PRational -> Term s PRational -> Term s PBool)
-> Term s (PRational :--> (PRational :--> PBool))
forall a b. (a -> b) -> a -> b
$ \Term s PRational
l Term s PRational
r -> TermCont @PBool s (Term s PBool) -> Term s PBool
forall (a :: PType) (s :: S). TermCont @a s (Term s a) -> Term s a
unTermCont (TermCont @PBool s (Term s PBool) -> Term s PBool)
-> TermCont @PBool s (Term s PBool) -> Term s PBool
forall a b. (a -> b) -> a -> b
$ do
          PRational Term s PInteger
ln Term s PPositive
ld <- ((PRational s -> Term s PBool) -> Term s PBool)
-> TermCont @PBool s (PRational s)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((PRational s -> Term s PBool) -> Term s PBool)
 -> TermCont @PBool s (PRational s))
-> ((PRational s -> Term s PBool) -> Term s PBool)
-> TermCont @PBool s (PRational s)
forall a b. (a -> b) -> a -> b
$ Term s PRational -> (PRational s -> Term s PBool) -> Term s PBool
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
l
          PRational Term s PInteger
rn Term s PPositive
rd <- ((PRational s -> Term s PBool) -> Term s PBool)
-> TermCont @PBool s (PRational s)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((PRational s -> Term s PBool) -> Term s PBool)
 -> TermCont @PBool s (PRational s))
-> ((PRational s -> Term s PBool) -> Term s PBool)
-> TermCont @PBool s (PRational s)
forall a b. (a -> b) -> a -> b
$ Term s PRational -> (PRational s -> Term s PBool) -> Term s PBool
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
r
          Term s PBool -> TermCont @PBool s (Term s PBool)
forall a. a -> TermCont @PBool s a
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (Term s PBool -> TermCont @PBool s (Term s PBool))
-> Term s PBool -> TermCont @PBool s (Term s PBool)
forall a b. (a -> b) -> a -> b
$ Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
rd Term s PInteger -> Term s PInteger -> Term s PInteger
forall a. Num a => a -> a -> a
* Term s PInteger
ln Term s PInteger -> Term s PInteger -> Term s PBool
forall (s :: S). Term s PInteger -> Term s PInteger -> Term s PBool
forall (t :: PType) (s :: S).
PPartialOrd t =>
Term s t -> Term s t -> Term s PBool
#< Term s PInteger
rn Term s PInteger -> Term s PInteger -> Term s PInteger
forall a. Num a => a -> a -> a
* Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
ld
      )
      # l'
      # r'

instance POrd PRational

instance PNum PRational where
  Term s PRational
x' #+ :: forall (s :: S).
Term s PRational -> Term s PRational -> Term s PRational
#+ Term s PRational
y' =
    ClosedTerm (PRational :--> (PRational :--> PRational))
-> Term s (PRational :--> (PRational :--> PRational))
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic
      ( (Term s PRational -> Term s PRational -> Term s PRational)
-> Term s (PRational :--> (PRational :--> PRational))
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PRational -> Term s PRational)
-> Term s (c :--> (PRational :--> PRational))
plam ((Term s PRational -> Term s PRational -> Term s PRational)
 -> Term s (PRational :--> (PRational :--> PRational)))
-> (Term s PRational -> Term s PRational -> Term s PRational)
-> Term s (PRational :--> (PRational :--> PRational))
forall a b. (a -> b) -> a -> b
$ \Term s PRational
x Term s PRational
y -> TermCont @PRational s (Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S). TermCont @a s (Term s a) -> Term s a
unTermCont (TermCont @PRational s (Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PRational) -> Term s PRational
forall a b. (a -> b) -> a -> b
$ do
          PRational Term s PInteger
xn Term s PPositive
xd' <- ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((PRational s -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (PRational s))
-> ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a b. (a -> b) -> a -> b
$ Term s PRational
-> (PRational s -> Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
x
          PRational Term s PInteger
yn Term s PPositive
yd' <- ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((PRational s -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (PRational s))
-> ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a b. (a -> b) -> a -> b
$ Term s PRational
-> (PRational s -> Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
y
          Term s PPositive
xd <- ((Term s PPositive -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PPositive)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((Term s PPositive -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (Term s PPositive))
-> ((Term s PPositive -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PPositive)
forall a b. (a -> b) -> a -> b
$ Term s PPositive
-> (Term s PPositive -> Term s PRational) -> Term s PRational
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet Term s PPositive
xd'
          Term s PPositive
yd <- ((Term s PPositive -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PPositive)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((Term s PPositive -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (Term s PPositive))
-> ((Term s PPositive -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PPositive)
forall a b. (a -> b) -> a -> b
$ Term s PPositive
-> (Term s PPositive -> Term s PRational) -> Term s PRational
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet Term s PPositive
yd'
          Term s PRational -> TermCont @PRational s (Term s PRational)
forall a. a -> TermCont @PRational s a
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure
            (Term s PRational -> TermCont @PRational s (Term s PRational))
-> Term s PRational -> TermCont @PRational s (Term s PRational)
forall a b. (a -> b) -> a -> b
$ Term s (PRational :--> PRational)
forall (s :: S). Term s (PRational :--> PRational)
preduce
              #$ pcon
            $ PRational (xn * pto yd + yn * pto xd)
            $ punsafeDowncast
            $ pto xd * pto yd
      )
      # x'
      # y'

  -- TODO (Optimize): Could this be optimized with an impl in terms of `#+`.
  Term s PRational
x' #- :: forall (s :: S).
Term s PRational -> Term s PRational -> Term s PRational
#- Term s PRational
y' =
    ClosedTerm (PRational :--> (PRational :--> PRational))
-> Term s (PRational :--> (PRational :--> PRational))
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic
      ( (Term s PRational -> Term s PRational -> Term s PRational)
-> Term s (PRational :--> (PRational :--> PRational))
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PRational -> Term s PRational)
-> Term s (c :--> (PRational :--> PRational))
plam ((Term s PRational -> Term s PRational -> Term s PRational)
 -> Term s (PRational :--> (PRational :--> PRational)))
-> (Term s PRational -> Term s PRational -> Term s PRational)
-> Term s (PRational :--> (PRational :--> PRational))
forall a b. (a -> b) -> a -> b
$ \Term s PRational
x Term s PRational
y -> TermCont @PRational s (Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S). TermCont @a s (Term s a) -> Term s a
unTermCont (TermCont @PRational s (Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PRational) -> Term s PRational
forall a b. (a -> b) -> a -> b
$ do
          PRational Term s PInteger
xn Term s PPositive
xd' <- ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((PRational s -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (PRational s))
-> ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a b. (a -> b) -> a -> b
$ Term s PRational
-> (PRational s -> Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
x
          PRational Term s PInteger
yn Term s PPositive
yd' <- ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((PRational s -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (PRational s))
-> ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a b. (a -> b) -> a -> b
$ Term s PRational
-> (PRational s -> Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
y
          Term s PPositive
xd <- ((Term s PPositive -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PPositive)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((Term s PPositive -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (Term s PPositive))
-> ((Term s PPositive -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PPositive)
forall a b. (a -> b) -> a -> b
$ Term s PPositive
-> (Term s PPositive -> Term s PRational) -> Term s PRational
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet Term s PPositive
xd'
          Term s PPositive
yd <- ((Term s PPositive -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PPositive)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((Term s PPositive -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (Term s PPositive))
-> ((Term s PPositive -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PPositive)
forall a b. (a -> b) -> a -> b
$ Term s PPositive
-> (Term s PPositive -> Term s PRational) -> Term s PRational
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet Term s PPositive
yd'
          Term s PRational -> TermCont @PRational s (Term s PRational)
forall a. a -> TermCont @PRational s a
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure
            (Term s PRational -> TermCont @PRational s (Term s PRational))
-> Term s PRational -> TermCont @PRational s (Term s PRational)
forall a b. (a -> b) -> a -> b
$ Term s (PRational :--> PRational)
forall (s :: S). Term s (PRational :--> PRational)
preduce
              #$ pcon
            $ PRational (xn * pto yd - yn * pto xd)
            $ punsafeDowncast
            $ pto xd * pto yd
      )
      # x'
      # y'

  Term s PRational
x' #* :: forall (s :: S).
Term s PRational -> Term s PRational -> Term s PRational
#* Term s PRational
y' =
    ClosedTerm (PRational :--> (PRational :--> PRational))
-> Term s (PRational :--> (PRational :--> PRational))
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic
      ( (Term s PRational -> Term s PRational -> Term s PRational)
-> Term s (PRational :--> (PRational :--> PRational))
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PRational -> Term s PRational)
-> Term s (c :--> (PRational :--> PRational))
plam ((Term s PRational -> Term s PRational -> Term s PRational)
 -> Term s (PRational :--> (PRational :--> PRational)))
-> (Term s PRational -> Term s PRational -> Term s PRational)
-> Term s (PRational :--> (PRational :--> PRational))
forall a b. (a -> b) -> a -> b
$ \Term s PRational
x Term s PRational
y -> TermCont @PRational s (Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S). TermCont @a s (Term s a) -> Term s a
unTermCont (TermCont @PRational s (Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PRational) -> Term s PRational
forall a b. (a -> b) -> a -> b
$ do
          PRational Term s PInteger
xn Term s PPositive
xd <- ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((PRational s -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (PRational s))
-> ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a b. (a -> b) -> a -> b
$ Term s PRational
-> (PRational s -> Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
x
          PRational Term s PInteger
yn Term s PPositive
yd <- ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((PRational s -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (PRational s))
-> ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a b. (a -> b) -> a -> b
$ Term s PRational
-> (PRational s -> Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
y
          Term s PRational -> TermCont @PRational s (Term s PRational)
forall a. a -> TermCont @PRational s a
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure
            (Term s PRational -> TermCont @PRational s (Term s PRational))
-> Term s PRational -> TermCont @PRational s (Term s PRational)
forall a b. (a -> b) -> a -> b
$ Term s (PRational :--> PRational)
forall (s :: S). Term s (PRational :--> PRational)
preduce
              #$ pcon
            $ PRational (xn * yn)
            $ punsafeDowncast
            $ pto xd * pto yd
      )
      # x'
      # y'

  pnegate :: forall (s :: S). Term s (PRational :--> PRational)
pnegate =
    (forall (s :: S). Term s (PRational :--> PRational))
-> Term s (PRational :--> PRational)
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S). Term s (PRational :--> PRational))
 -> Term s (PRational :--> PRational))
-> (forall (s :: S). Term s (PRational :--> PRational))
-> Term s (PRational :--> PRational)
forall a b. (a -> b) -> a -> b
$
      (Term s PRational -> Term s PRational)
-> Term s (PRational :--> PRational)
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PRational) -> Term s (c :--> PRational)
plam ((Term s PRational -> Term s PRational)
 -> Term s (PRational :--> PRational))
-> (Term s PRational -> Term s PRational)
-> Term s (PRational :--> PRational)
forall a b. (a -> b) -> a -> b
$ \Term s PRational
x ->
        Term s PRational
-> (PRational s -> Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
x ((PRational s -> Term s PRational) -> Term s PRational)
-> (PRational s -> Term s PRational) -> Term s PRational
forall a b. (a -> b) -> a -> b
$ \(PRational Term s PInteger
xn Term s PPositive
xd) ->
          PRational s -> Term s PRational
forall (a :: PType) (s :: S). PlutusType a => a s -> Term s a
pcon (PRational s -> Term s PRational)
-> PRational s -> Term s PRational
forall a b. (a -> b) -> a -> b
$ Term s PInteger -> Term s PPositive -> PRational s
forall (s :: S). Term s PInteger -> Term s PPositive -> PRational s
PRational (Term s PInteger -> Term s PInteger
forall a. Num a => a -> a
negate Term s PInteger
xn) Term s PPositive
xd

  pabs :: forall (s :: S). Term s (PRational :--> PRational)
pabs =
    (forall (s :: S). Term s (PRational :--> PRational))
-> Term s (PRational :--> PRational)
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S). Term s (PRational :--> PRational))
 -> Term s (PRational :--> PRational))
-> (forall (s :: S). Term s (PRational :--> PRational))
-> Term s (PRational :--> PRational)
forall a b. (a -> b) -> a -> b
$
      (Term s PRational -> Term s PRational)
-> Term s (PRational :--> PRational)
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PRational) -> Term s (c :--> PRational)
plam ((Term s PRational -> Term s PRational)
 -> Term s (PRational :--> PRational))
-> (Term s PRational -> Term s PRational)
-> Term s (PRational :--> PRational)
forall a b. (a -> b) -> a -> b
$ \Term s PRational
x ->
        Term s PRational
-> (PRational s -> Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
x ((PRational s -> Term s PRational) -> Term s PRational)
-> (PRational s -> Term s PRational) -> Term s PRational
forall a b. (a -> b) -> a -> b
$ \(PRational Term s PInteger
xn Term s PPositive
xd) ->
          PRational s -> Term s PRational
forall (a :: PType) (s :: S). PlutusType a => a s -> Term s a
pcon (PRational s -> Term s PRational)
-> PRational s -> Term s PRational
forall a b. (a -> b) -> a -> b
$ Term s PInteger -> Term s PPositive -> PRational s
forall (s :: S). Term s PInteger -> Term s PPositive -> PRational s
PRational (Term s PInteger -> Term s PInteger
forall a. Num a => a -> a
abs Term s PInteger
xn) (Term s PPositive -> Term s PPositive
forall a. Num a => a -> a
abs Term s PPositive
xd)

  psignum :: forall (s :: S). Term s (PRational :--> PRational)
psignum =
    (forall (s :: S). Term s (PRational :--> PRational))
-> Term s (PRational :--> PRational)
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S). Term s (PRational :--> PRational))
 -> Term s (PRational :--> PRational))
-> (forall (s :: S). Term s (PRational :--> PRational))
-> Term s (PRational :--> PRational)
forall a b. (a -> b) -> a -> b
$
      (Term s PRational -> Term s PRational)
-> Term s (PRational :--> PRational)
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PRational) -> Term s (c :--> PRational)
plam ((Term s PRational -> Term s PRational)
 -> Term s (PRational :--> PRational))
-> (Term s PRational -> Term s PRational)
-> Term s (PRational :--> PRational)
forall a b. (a -> b) -> a -> b
$ \Term s PRational
x' -> Term s PRational
-> (Term s PRational -> Term s PRational) -> Term s PRational
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet Term s PRational
x' ((Term s PRational -> Term s PRational) -> Term s PRational)
-> (Term s PRational -> Term s PRational) -> Term s PRational
forall a b. (a -> b) -> a -> b
$ \Term s PRational
x ->
        Term s PBool
-> Term s PRational -> Term s PRational -> Term s PRational
forall (a :: PType) (s :: S).
Term s PBool -> Term s a -> Term s a -> Term s a
pif
          (Term s PRational
x Term s PRational -> Term s PRational -> Term s PBool
forall (s :: S).
Term s PRational -> Term s PRational -> Term s PBool
forall (t :: PType) (s :: S).
PEq t =>
Term s t -> Term s t -> Term s PBool
#== Term s PRational
0)
          Term s PRational
0
          (Term s PRational -> Term s PRational)
-> Term s PRational -> Term s PRational
forall a b. (a -> b) -> a -> b
$ Term s PBool
-> Term s PRational -> Term s PRational -> Term s PRational
forall (a :: PType) (s :: S).
Term s PBool -> Term s a -> Term s a -> Term s a
pif
            (Term s PRational
x Term s PRational -> Term s PRational -> Term s PBool
forall (s :: S).
Term s PRational -> Term s PRational -> Term s PBool
forall (t :: PType) (s :: S).
PPartialOrd t =>
Term s t -> Term s t -> Term s PBool
#< Term s PRational
0)
            (Term s PRational
-1)
            Term s PRational
1

  pfromInteger :: forall (s :: S). Integer -> Term s PRational
pfromInteger Integer
n = PRational s -> Term s PRational
forall (a :: PType) (s :: S). PlutusType a => a s -> Term s a
pcon (PRational s -> Term s PRational)
-> PRational s -> Term s PRational
forall a b. (a -> b) -> a -> b
$ Term s PInteger -> Term s PPositive -> PRational s
forall (s :: S). Term s PInteger -> Term s PPositive -> PRational s
PRational (Integer -> Term s PInteger
forall a. Num a => Integer -> a
fromInteger Integer
n) Term s PPositive
1

instance PFractional PRational where
  precip :: forall (s :: S). Term s (PRational :--> PRational)
precip =
    (forall (s :: S). Term s (PRational :--> PRational))
-> Term s (PRational :--> PRational)
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S). Term s (PRational :--> PRational))
 -> Term s (PRational :--> PRational))
-> (forall (s :: S). Term s (PRational :--> PRational))
-> Term s (PRational :--> PRational)
forall a b. (a -> b) -> a -> b
$
      (Term s PRational -> Term s PRational)
-> Term s (PRational :--> PRational)
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PRational) -> Term s (c :--> PRational)
plam ((Term s PRational -> Term s PRational)
 -> Term s (PRational :--> PRational))
-> (Term s PRational -> Term s PRational)
-> Term s (PRational :--> PRational)
forall a b. (a -> b) -> a -> b
$ \Term s PRational
x ->
        Term s PRational
-> (PRational s -> Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
x ((PRational s -> Term s PRational) -> Term s PRational)
-> (PRational s -> Term s PRational) -> Term s PRational
forall a b. (a -> b) -> a -> b
$ \(PRational Term s PInteger
xn Term s PPositive
xd) ->
          Term s PBool
-> Term s PRational -> Term s PRational -> Term s PRational
forall (a :: PType) (s :: S).
Term s PBool -> Term s a -> Term s a -> Term s a
pif (Term s PInteger
xn Term s PInteger -> Term s PInteger -> Term s PBool
forall (s :: S). Term s PInteger -> Term s PInteger -> Term s PBool
forall (t :: PType) (s :: S).
PEq t =>
Term s t -> Term s t -> Term s PBool
#== Term s PInteger
0) (Term s PString -> Term s PRational
forall (a :: PType) (s :: S). Term s PString -> Term s a
ptraceInfoError Term s PString
"precip: attempts to construct reciprocal of zero") (Term s PRational -> Term s PRational)
-> Term s PRational -> Term s PRational
forall a b. (a -> b) -> a -> b
$
            Term s PBool
-> Term s PRational -> Term s PRational -> Term s PRational
forall (a :: PType) (s :: S).
Term s PBool -> Term s a -> Term s a -> Term s a
pif
              (Term s PInteger
xn Term s PInteger -> Term s PInteger -> Term s PBool
forall (s :: S). Term s PInteger -> Term s PInteger -> Term s PBool
forall (t :: PType) (s :: S).
PPartialOrd t =>
Term s t -> Term s t -> Term s PBool
#< Term s PInteger
0)
              (PRational s -> Term s PRational
forall (a :: PType) (s :: S). PlutusType a => a s -> Term s a
pcon (PRational s -> Term s PRational)
-> PRational s -> Term s PRational
forall a b. (a -> b) -> a -> b
$ Term s PInteger -> Term s PPositive -> PRational s
forall (s :: S). Term s PInteger -> Term s PPositive -> PRational s
PRational (Term s (PInner PPositive :--> PInner PPositive)
forall (s :: S). Term s (PInner PPositive :--> PInner PPositive)
forall (a :: PType) (s :: S). PNum a => Term s (a :--> a)
pnegate Term s (PInner PPositive :--> PInner PPositive)
-> Term s (PInner PPositive) -> Term s (PInner PPositive)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
#$ Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
xd) (Term s PPositive -> PRational s)
-> Term s PPositive -> PRational s
forall a b. (a -> b) -> a -> b
$ Term s (PInteger :--> PPositive)
forall (s :: S). Term s (PInteger :--> PPositive)
ptryPositive Term s (PInteger :--> PPositive)
-> Term s PInteger -> Term s PPositive
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
#$ Term s (PInteger :--> PInteger)
forall (s :: S). Term s (PInteger :--> PInteger)
forall (a :: PType) (s :: S). PNum a => Term s (a :--> a)
pnegate Term s (PInteger :--> PInteger)
-> Term s PInteger -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
xn)
              (PRational s -> Term s PRational
forall (a :: PType) (s :: S). PlutusType a => a s -> Term s a
pcon (PRational s -> Term s PRational)
-> PRational s -> Term s PRational
forall a b. (a -> b) -> a -> b
$ Term s PInteger -> Term s PPositive -> PRational s
forall (s :: S). Term s PInteger -> Term s PPositive -> PRational s
PRational (Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
xd) (Term s PPositive -> PRational s)
-> Term s PPositive -> PRational s
forall a b. (a -> b) -> a -> b
$ Term s (PInteger :--> PPositive)
forall (s :: S). Term s (PInteger :--> PPositive)
ptryPositive Term s (PInteger :--> PPositive)
-> Term s PInteger -> Term s PPositive
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
xn)

  -- TODO (Optimize): Could this be optimized with an impl in terms of `#*`.
  Term s PRational
x' #/ :: forall (s :: S).
Term s PRational -> Term s PRational -> Term s PRational
#/ Term s PRational
y' =
    ClosedTerm (PRational :--> (PRational :--> PRational))
-> Term s (PRational :--> (PRational :--> PRational))
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic
      ( (Term s PRational -> Term s PRational -> Term s PRational)
-> Term s (PRational :--> (PRational :--> PRational))
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PRational -> Term s PRational)
-> Term s (c :--> (PRational :--> PRational))
plam ((Term s PRational -> Term s PRational -> Term s PRational)
 -> Term s (PRational :--> (PRational :--> PRational)))
-> (Term s PRational -> Term s PRational -> Term s PRational)
-> Term s (PRational :--> (PRational :--> PRational))
forall a b. (a -> b) -> a -> b
$ \Term s PRational
x Term s PRational
y -> TermCont @PRational s (Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S). TermCont @a s (Term s a) -> Term s a
unTermCont (TermCont @PRational s (Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PRational) -> Term s PRational
forall a b. (a -> b) -> a -> b
$ do
          PRational Term s PInteger
xn Term s PPositive
xd <- ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((PRational s -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (PRational s))
-> ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a b. (a -> b) -> a -> b
$ Term s PRational
-> (PRational s -> Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
x
          PRational Term s PInteger
yn Term s PPositive
yd <- ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((PRational s -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (PRational s))
-> ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a b. (a -> b) -> a -> b
$ Term s PRational
-> (PRational s -> Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
y
          Term s PInteger
denm <- ((Term s PInteger -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PInteger)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((Term s PInteger -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (Term s PInteger))
-> (Term s PInteger
    -> (Term s PInteger -> Term s PRational) -> Term s PRational)
-> Term s PInteger
-> TermCont @PRational s (Term s PInteger)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Term s PInteger
-> (Term s PInteger -> Term s PRational) -> Term s PRational
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet (Term s PInteger -> TermCont @PRational s (Term s PInteger))
-> Term s PInteger -> TermCont @PRational s (Term s PInteger)
forall a b. (a -> b) -> a -> b
$ Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
xd Term s PInteger -> Term s PInteger -> Term s PInteger
forall a. Num a => a -> a -> a
* Term s PInteger
yn
          Term s PString -> Term s PBool -> TermCont @PRational s ()
forall {r :: PType} (s :: S).
Term s PString -> Term s PBool -> TermCont @r s ()
pguardC Term s PString
"Cannot divide by zero" (Term s PBool -> TermCont @PRational s ())
-> Term s PBool -> TermCont @PRational s ()
forall a b. (a -> b) -> a -> b
$ Term s (PBool :--> PBool)
forall (s :: S). Term s (PBool :--> PBool)
pnot Term s (PBool :--> PBool) -> Term s PBool -> Term s PBool
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
#$ Term s PInteger
denm Term s PInteger -> Term s PInteger -> Term s PBool
forall (s :: S). Term s PInteger -> Term s PInteger -> Term s PBool
forall (t :: PType) (s :: S).
PEq t =>
Term s t -> Term s t -> Term s PBool
#== Term s PInteger
0
          Term s PRational -> TermCont @PRational s (Term s PRational)
forall a. a -> TermCont @PRational s a
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (Term s PRational -> TermCont @PRational s (Term s PRational))
-> Term s PRational -> TermCont @PRational s (Term s PRational)
forall a b. (a -> b) -> a -> b
$
            Term s (PRational :--> PRational)
forall (s :: S). Term s (PRational :--> PRational)
preduce
              #$ pif
                (denm #< 0)
                (pcon $ PRational (pnegate #$ xn * pto yd) (ptryPositive #$ pnegate # denm))
                (pcon $ PRational (xn * pto yd) (ptryPositive # denm))
      )
      # x'
      # y'

  pfromRational :: forall (s :: S). Term s (PRational :--> PRational)
pfromRational = (forall (s :: S). Term s (PRational :--> PRational))
-> Term s (PRational :--> PRational)
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S). Term s (PRational :--> PRational))
 -> Term s (PRational :--> PRational))
-> (forall (s :: S). Term s (PRational :--> PRational))
-> Term s (PRational :--> PRational)
forall a b. (a -> b) -> a -> b
$ (Term s PRational -> Term s PRational)
-> Term s (PRational :--> PRational)
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PRational) -> Term s (c :--> PRational)
plam Term s PRational -> Term s PRational
forall a. a -> a
id

preduce :: Term s (PRational :--> PRational)
preduce :: forall (s :: S). Term s (PRational :--> PRational)
preduce = (forall (s :: S). Term s (PRational :--> PRational))
-> Term s (PRational :--> PRational)
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S). Term s (PRational :--> PRational))
 -> Term s (PRational :--> PRational))
-> (forall (s :: S). Term s (PRational :--> PRational))
-> Term s (PRational :--> PRational)
forall a b. (a -> b) -> a -> b
$
  (Term s PRational -> Term s PRational)
-> Term s (PRational :--> PRational)
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PRational) -> Term s (c :--> PRational)
plam ((Term s PRational -> Term s PRational)
 -> Term s (PRational :--> PRational))
-> (Term s PRational -> Term s PRational)
-> Term s (PRational :--> PRational)
forall a b. (a -> b) -> a -> b
$ \Term s PRational
x -> TermCont @PRational s (Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S). TermCont @a s (Term s a) -> Term s a
unTermCont (TermCont @PRational s (Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PRational) -> Term s PRational
forall a b. (a -> b) -> a -> b
$ do
    PRational Term s PInteger
xn Term s PPositive
xd' <- ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((PRational s -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (PRational s))
-> ((PRational s -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (PRational s)
forall a b. (a -> b) -> a -> b
$ Term s PRational
-> (PRational s -> Term s PRational) -> Term s PRational
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
x
    Term s PInteger
xd <- ((Term s PInteger -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PInteger)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((Term s PInteger -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (Term s PInteger))
-> (Term s PInteger
    -> (Term s PInteger -> Term s PRational) -> Term s PRational)
-> Term s PInteger
-> TermCont @PRational s (Term s PInteger)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Term s PInteger
-> (Term s PInteger -> Term s PRational) -> Term s PRational
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet (Term s PInteger -> TermCont @PRational s (Term s PInteger))
-> Term s PInteger -> TermCont @PRational s (Term s PInteger)
forall a b. (a -> b) -> a -> b
$ Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
xd'
    Term s PInteger
r <- ((Term s PInteger -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PInteger)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((Term s PInteger -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (Term s PInteger))
-> (Term s PInteger
    -> (Term s PInteger -> Term s PRational) -> Term s PRational)
-> Term s PInteger
-> TermCont @PRational s (Term s PInteger)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Term s PInteger
-> (Term s PInteger -> Term s PRational) -> Term s PRational
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet (Term s PInteger -> TermCont @PRational s (Term s PInteger))
-> Term s PInteger -> TermCont @PRational s (Term s PInteger)
forall a b. (a -> b) -> a -> b
$ Term s (PInteger :--> (PInteger :--> PInteger))
forall (s :: S). Term s (PInteger :--> (PInteger :--> PInteger))
pgcd Term s (PInteger :--> (PInteger :--> PInteger))
-> Term s PInteger -> Term s (PInteger :--> PInteger)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
xn Term s (PInteger :--> PInteger)
-> Term s PInteger -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
xd
    Term s PInteger
s <- ((Term s PInteger -> Term s PRational) -> Term s PRational)
-> TermCont @PRational s (Term s PInteger)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((Term s PInteger -> Term s PRational) -> Term s PRational)
 -> TermCont @PRational s (Term s PInteger))
-> (Term s PInteger
    -> (Term s PInteger -> Term s PRational) -> Term s PRational)
-> Term s PInteger
-> TermCont @PRational s (Term s PInteger)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Term s PInteger
-> (Term s PInteger -> Term s PRational) -> Term s PRational
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet (Term s PInteger -> TermCont @PRational s (Term s PInteger))
-> Term s PInteger -> TermCont @PRational s (Term s PInteger)
forall a b. (a -> b) -> a -> b
$ Term s (PInteger :--> PInteger)
forall (s :: S). Term s (PInteger :--> PInteger)
forall (a :: PType) (s :: S). PNum a => Term s (a :--> a)
psignum Term s (PInteger :--> PInteger)
-> Term s PInteger -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
xd
    Term s PRational -> TermCont @PRational s (Term s PRational)
forall a. a -> TermCont @PRational s a
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (Term s PRational -> TermCont @PRational s (Term s PRational))
-> (PRational s -> Term s PRational)
-> PRational s
-> TermCont @PRational s (Term s PRational)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. PRational s -> Term s PRational
forall (a :: PType) (s :: S). PlutusType a => a s -> Term s a
pcon (PRational s -> TermCont @PRational s (Term s PRational))
-> PRational s -> TermCont @PRational s (Term s PRational)
forall a b. (a -> b) -> a -> b
$ Term s PInteger -> Term s PPositive -> PRational s
forall (s :: S). Term s PInteger -> Term s PPositive -> PRational s
PRational (Term s PInteger
s Term s PInteger -> Term s PInteger -> Term s PInteger
forall a. Num a => a -> a -> a
* Term s (PInteger :--> (PInteger :--> PInteger))
forall (s :: S). Term s (PInteger :--> (PInteger :--> PInteger))
forall (a :: PType) (s :: S).
PIntegral a =>
Term s (a :--> (a :--> a))
pdiv Term s (PInteger :--> (PInteger :--> PInteger))
-> Term s PInteger -> Term s (PInteger :--> PInteger)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
xn Term s (PInteger :--> PInteger)
-> Term s PInteger -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
r) (Term s PPositive -> PRational s)
-> Term s PPositive -> PRational s
forall a b. (a -> b) -> a -> b
$ Term s (PInner PPositive) -> Term s PPositive
forall (s :: S) (a :: PType). Term s (PInner a) -> Term s a
punsafeDowncast (Term s (PInner PPositive) -> Term s PPositive)
-> Term s (PInner PPositive) -> Term s PPositive
forall a b. (a -> b) -> a -> b
$ Term s PInteger
s Term s PInteger -> Term s PInteger -> Term s PInteger
forall a. Num a => a -> a -> a
* Term s (PInteger :--> (PInteger :--> PInteger))
forall (s :: S). Term s (PInteger :--> (PInteger :--> PInteger))
forall (a :: PType) (s :: S).
PIntegral a =>
Term s (a :--> (a :--> a))
pdiv Term s (PInteger :--> (PInteger :--> PInteger))
-> Term s PInteger -> Term s (PInteger :--> PInteger)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
xd Term s (PInteger :--> PInteger)
-> Term s PInteger -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
r

pgcd :: Term s (PInteger :--> PInteger :--> PInteger)
pgcd :: forall (s :: S). Term s (PInteger :--> (PInteger :--> PInteger))
pgcd = (forall (s :: S). Term s (PInteger :--> (PInteger :--> PInteger)))
-> Term s (PInteger :--> (PInteger :--> PInteger))
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S). Term s (PInteger :--> (PInteger :--> PInteger)))
 -> Term s (PInteger :--> (PInteger :--> PInteger)))
-> (forall (s :: S).
    Term s (PInteger :--> (PInteger :--> PInteger)))
-> Term s (PInteger :--> (PInteger :--> PInteger))
forall a b. (a -> b) -> a -> b
$
  (Term s PInteger -> Term s PInteger -> Term s PInteger)
-> Term s (PInteger :--> (PInteger :--> PInteger))
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PInteger -> Term s PInteger)
-> Term s (c :--> (PInteger :--> PInteger))
plam ((Term s PInteger -> Term s PInteger -> Term s PInteger)
 -> Term s (PInteger :--> (PInteger :--> PInteger)))
-> (Term s PInteger -> Term s PInteger -> Term s PInteger)
-> Term s (PInteger :--> (PInteger :--> PInteger))
forall a b. (a -> b) -> a -> b
$ \Term s PInteger
x' Term s PInteger
y' -> TermCont @PInteger s (Term s PInteger) -> Term s PInteger
forall (a :: PType) (s :: S). TermCont @a s (Term s a) -> Term s a
unTermCont (TermCont @PInteger s (Term s PInteger) -> Term s PInteger)
-> TermCont @PInteger s (Term s PInteger) -> Term s PInteger
forall a b. (a -> b) -> a -> b
$ do
    Term s PInteger
x <- ((Term s PInteger -> Term s PInteger) -> Term s PInteger)
-> TermCont @PInteger s (Term s PInteger)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((Term s PInteger -> Term s PInteger) -> Term s PInteger)
 -> TermCont @PInteger s (Term s PInteger))
-> (Term s PInteger
    -> (Term s PInteger -> Term s PInteger) -> Term s PInteger)
-> Term s PInteger
-> TermCont @PInteger s (Term s PInteger)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Term s PInteger
-> (Term s PInteger -> Term s PInteger) -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet (Term s PInteger -> TermCont @PInteger s (Term s PInteger))
-> Term s PInteger -> TermCont @PInteger s (Term s PInteger)
forall a b. (a -> b) -> a -> b
$ Term s (PInteger :--> PInteger)
forall (s :: S). Term s (PInteger :--> PInteger)
forall (a :: PType) (s :: S). PNum a => Term s (a :--> a)
pabs Term s (PInteger :--> PInteger)
-> Term s PInteger -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
x'
    Term s PInteger
y <- ((Term s PInteger -> Term s PInteger) -> Term s PInteger)
-> TermCont @PInteger s (Term s PInteger)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((Term s PInteger -> Term s PInteger) -> Term s PInteger)
 -> TermCont @PInteger s (Term s PInteger))
-> (Term s PInteger
    -> (Term s PInteger -> Term s PInteger) -> Term s PInteger)
-> Term s PInteger
-> TermCont @PInteger s (Term s PInteger)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Term s PInteger
-> (Term s PInteger -> Term s PInteger) -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet (Term s PInteger -> TermCont @PInteger s (Term s PInteger))
-> Term s PInteger -> TermCont @PInteger s (Term s PInteger)
forall a b. (a -> b) -> a -> b
$ Term s (PInteger :--> PInteger)
forall (s :: S). Term s (PInteger :--> PInteger)
forall (a :: PType) (s :: S). PNum a => Term s (a :--> a)
pabs Term s (PInteger :--> PInteger)
-> Term s PInteger -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
y'
    Term s PInteger -> TermCont @PInteger s (Term s PInteger)
forall a. a -> TermCont @PInteger s a
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (Term s PInteger -> TermCont @PInteger s (Term s PInteger))
-> Term s PInteger -> TermCont @PInteger s (Term s PInteger)
forall a b. (a -> b) -> a -> b
$ Term s (PInteger :--> (PInteger :--> PInteger))
forall (s :: S). Term s (PInteger :--> (PInteger :--> PInteger))
pgcd' Term s (PInteger :--> (PInteger :--> PInteger))
-> Term s PInteger -> Term s (PInteger :--> PInteger)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# (Term s (PInteger :--> (PInteger :--> PInteger))
forall (a :: PType) (s :: S). POrd a => Term s (a :--> (a :--> a))
pmax Term s (PInteger :--> (PInteger :--> PInteger))
-> Term s PInteger -> Term s (PInteger :--> PInteger)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
x Term s (PInteger :--> PInteger)
-> Term s PInteger -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
y) Term s (PInteger :--> PInteger)
-> Term s PInteger -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
#$ Term s (PInteger :--> (PInteger :--> PInteger))
forall (a :: PType) (s :: S). POrd a => Term s (a :--> (a :--> a))
pmin Term s (PInteger :--> (PInteger :--> PInteger))
-> Term s PInteger -> Term s (PInteger :--> PInteger)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
x Term s (PInteger :--> PInteger)
-> Term s PInteger -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
y

-- assumes inputs are non negative and a >= b
pgcd' :: Term s (PInteger :--> PInteger :--> PInteger)
pgcd' :: forall (s :: S). Term s (PInteger :--> (PInteger :--> PInteger))
pgcd' = (forall (s :: S). Term s (PInteger :--> (PInteger :--> PInteger)))
-> Term s (PInteger :--> (PInteger :--> PInteger))
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S). Term s (PInteger :--> (PInteger :--> PInteger)))
 -> Term s (PInteger :--> (PInteger :--> PInteger)))
-> (forall (s :: S).
    Term s (PInteger :--> (PInteger :--> PInteger)))
-> Term s (PInteger :--> (PInteger :--> PInteger))
forall a b. (a -> b) -> a -> b
$ Term
  s
  (((PInteger :--> (PInteger :--> PInteger))
    :--> (PInteger :--> (PInteger :--> PInteger)))
   :--> (PInteger :--> (PInteger :--> PInteger)))
forall (s :: S) (a :: PType) (b :: PType).
Term s (((a :--> b) :--> (a :--> b)) :--> (a :--> b))
pfix Term
  s
  (((PInteger :--> (PInteger :--> PInteger))
    :--> (PInteger :--> (PInteger :--> PInteger)))
   :--> (PInteger :--> (PInteger :--> PInteger)))
-> Term
     s
     ((PInteger :--> (PInteger :--> PInteger))
      :--> (PInteger :--> (PInteger :--> PInteger)))
-> Term s (PInteger :--> (PInteger :--> PInteger))
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
#$ (Term s (PInteger :--> (PInteger :--> PInteger))
 -> Term s PInteger -> Term s PInteger -> Term s PInteger)
-> Term
     s
     ((PInteger :--> (PInteger :--> PInteger))
      :--> (PInteger :--> (PInteger :--> PInteger)))
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PInteger -> Term s PInteger -> Term s PInteger)
-> Term s (c :--> (PInteger :--> (PInteger :--> PInteger)))
plam Term s (PInteger :--> (PInteger :--> PInteger))
-> Term s PInteger -> Term s PInteger -> Term s PInteger
forall {b :: PType} {s :: S}.
(PEq b, PNum b, PIntegral b) =>
Term s (b :--> (b :--> b)) -> Term s b -> Term s b -> Term s b
f
  where
    f :: Term s (b :--> (b :--> b)) -> Term s b -> Term s b -> Term s b
f Term s (b :--> (b :--> b))
self Term s b
a Term s b
b =
      Term s PBool -> Term s b -> Term s b -> Term s b
forall (a :: PType) (s :: S).
Term s PBool -> Term s a -> Term s a -> Term s a
pif
        (Term s b
b Term s b -> Term s b -> Term s PBool
forall (s :: S). Term s b -> Term s b -> Term s PBool
forall (t :: PType) (s :: S).
PEq t =>
Term s t -> Term s t -> Term s PBool
#== Term s b
0)
        Term s b
a
        (Term s b -> Term s b) -> Term s b -> Term s b
forall a b. (a -> b) -> a -> b
$ Term s (b :--> (b :--> b))
self Term s (b :--> (b :--> b)) -> Term s b -> Term s (b :--> b)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s b
b Term s (b :--> b) -> Term s b -> Term s b
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
#$ Term s (b :--> (b :--> b))
forall (s :: S). Term s (b :--> (b :--> b))
forall (a :: PType) (s :: S).
PIntegral a =>
Term s (a :--> (a :--> a))
pmod Term s (b :--> (b :--> b)) -> Term s b -> Term s (b :--> b)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s b
a Term s (b :--> b) -> Term s b -> Term s b
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s b
b

pmin :: POrd a => Term s (a :--> a :--> a)
pmin :: forall (a :: PType) (s :: S). POrd a => Term s (a :--> (a :--> a))
pmin = ClosedTerm (a :--> (a :--> a)) -> Term s (a :--> (a :--> a))
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic (ClosedTerm (a :--> (a :--> a)) -> Term s (a :--> (a :--> a)))
-> ClosedTerm (a :--> (a :--> a)) -> Term s (a :--> (a :--> a))
forall a b. (a -> b) -> a -> b
$ (Term s a -> Term s a -> Term s a) -> Term s (a :--> (a :--> a))
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s a -> Term s a) -> Term s (c :--> (a :--> a))
plam ((Term s a -> Term s a -> Term s a) -> Term s (a :--> (a :--> a)))
-> (Term s a -> Term s a -> Term s a) -> Term s (a :--> (a :--> a))
forall a b. (a -> b) -> a -> b
$ \Term s a
a Term s a
b -> Term s PBool -> Term s a -> Term s a -> Term s a
forall (a :: PType) (s :: S).
Term s PBool -> Term s a -> Term s a -> Term s a
pif (Term s a
a Term s a -> Term s a -> Term s PBool
forall (s :: S). Term s a -> Term s a -> Term s PBool
forall (t :: PType) (s :: S).
PPartialOrd t =>
Term s t -> Term s t -> Term s PBool
#<= Term s a
b) Term s a
a Term s a
b

pmax :: POrd a => Term s (a :--> a :--> a)
pmax :: forall (a :: PType) (s :: S). POrd a => Term s (a :--> (a :--> a))
pmax = ClosedTerm (a :--> (a :--> a)) -> Term s (a :--> (a :--> a))
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic (ClosedTerm (a :--> (a :--> a)) -> Term s (a :--> (a :--> a)))
-> ClosedTerm (a :--> (a :--> a)) -> Term s (a :--> (a :--> a))
forall a b. (a -> b) -> a -> b
$ (Term s a -> Term s a -> Term s a) -> Term s (a :--> (a :--> a))
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s a -> Term s a) -> Term s (c :--> (a :--> a))
plam ((Term s a -> Term s a -> Term s a) -> Term s (a :--> (a :--> a)))
-> (Term s a -> Term s a -> Term s a) -> Term s (a :--> (a :--> a))
forall a b. (a -> b) -> a -> b
$ \Term s a
a Term s a
b -> Term s PBool -> Term s a -> Term s a -> Term s a
forall (a :: PType) (s :: S).
Term s PBool -> Term s a -> Term s a -> Term s a
pif (Term s a
a Term s a -> Term s a -> Term s PBool
forall (s :: S). Term s a -> Term s a -> Term s PBool
forall (t :: PType) (s :: S).
PPartialOrd t =>
Term s t -> Term s t -> Term s PBool
#<= Term s a
b) Term s a
b Term s a
a

pnumerator :: Term s (PRational :--> PInteger)
pnumerator :: forall (s :: S). Term s (PRational :--> PInteger)
pnumerator = (forall (s :: S). Term s (PRational :--> PInteger))
-> Term s (PRational :--> PInteger)
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S). Term s (PRational :--> PInteger))
 -> Term s (PRational :--> PInteger))
-> (forall (s :: S). Term s (PRational :--> PInteger))
-> Term s (PRational :--> PInteger)
forall a b. (a -> b) -> a -> b
$ (Term s PRational -> Term s PInteger)
-> Term s (PRational :--> PInteger)
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PInteger) -> Term s (c :--> PInteger)
plam ((Term s PRational -> Term s PInteger)
 -> Term s (PRational :--> PInteger))
-> (Term s PRational -> Term s PInteger)
-> Term s (PRational :--> PInteger)
forall a b. (a -> b) -> a -> b
$ \Term s PRational
x -> Term s PRational
-> (PRational s -> Term s PInteger) -> Term s PInteger
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
x ((PRational s -> Term s PInteger) -> Term s PInteger)
-> (PRational s -> Term s PInteger) -> Term s PInteger
forall a b. (a -> b) -> a -> b
$ \(PRational Term s PInteger
n Term s PPositive
_) -> Term s PInteger
n

pdenominator :: Term s (PRational :--> PPositive)
pdenominator :: forall (s :: S). Term s (PRational :--> PPositive)
pdenominator = (forall (s :: S). Term s (PRational :--> PPositive))
-> Term s (PRational :--> PPositive)
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S). Term s (PRational :--> PPositive))
 -> Term s (PRational :--> PPositive))
-> (forall (s :: S). Term s (PRational :--> PPositive))
-> Term s (PRational :--> PPositive)
forall a b. (a -> b) -> a -> b
$ (Term s PRational -> Term s PPositive)
-> Term s (PRational :--> PPositive)
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PPositive) -> Term s (c :--> PPositive)
plam ((Term s PRational -> Term s PPositive)
 -> Term s (PRational :--> PPositive))
-> (Term s PRational -> Term s PPositive)
-> Term s (PRational :--> PPositive)
forall a b. (a -> b) -> a -> b
$ \Term s PRational
x -> Term s PRational
-> (PRational s -> Term s PPositive) -> Term s PPositive
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
x ((PRational s -> Term s PPositive) -> Term s PPositive)
-> (PRational s -> Term s PPositive) -> Term s PPositive
forall a b. (a -> b) -> a -> b
$ \(PRational Term s PInteger
_ Term s PPositive
d) -> Term s PPositive
d

pfromInteger :: Term s (PInteger :--> PRational)
pfromInteger :: forall (s :: S). Term s (PInteger :--> PRational)
pfromInteger = (forall (s :: S). Term s (PInteger :--> PRational))
-> Term s (PInteger :--> PRational)
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S). Term s (PInteger :--> PRational))
 -> Term s (PInteger :--> PRational))
-> (forall (s :: S). Term s (PInteger :--> PRational))
-> Term s (PInteger :--> PRational)
forall a b. (a -> b) -> a -> b
$ (Term s PInteger -> Term s PRational)
-> Term s (PInteger :--> PRational)
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PRational) -> Term s (c :--> PRational)
plam ((Term s PInteger -> Term s PRational)
 -> Term s (PInteger :--> PRational))
-> (Term s PInteger -> Term s PRational)
-> Term s (PInteger :--> PRational)
forall a b. (a -> b) -> a -> b
$ \Term s PInteger
n -> PRational s -> Term s PRational
forall (a :: PType) (s :: S). PlutusType a => a s -> Term s a
pcon (PRational s -> Term s PRational)
-> PRational s -> Term s PRational
forall a b. (a -> b) -> a -> b
$ Term s PInteger -> Term s PPositive -> PRational s
forall (s :: S). Term s PInteger -> Term s PPositive -> PRational s
PRational Term s PInteger
n Term s PPositive
1

pround :: Term s (PRational :--> PInteger)
pround :: forall (s :: S). Term s (PRational :--> PInteger)
pround = (forall (s :: S). Term s (PRational :--> PInteger))
-> Term s (PRational :--> PInteger)
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S). Term s (PRational :--> PInteger))
 -> Term s (PRational :--> PInteger))
-> (forall (s :: S). Term s (PRational :--> PInteger))
-> Term s (PRational :--> PInteger)
forall a b. (a -> b) -> a -> b
$
  (Term s PRational -> Term s PInteger)
-> Term s (PRational :--> PInteger)
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PInteger) -> Term s (c :--> PInteger)
plam ((Term s PRational -> Term s PInteger)
 -> Term s (PRational :--> PInteger))
-> (Term s PRational -> Term s PInteger)
-> Term s (PRational :--> PInteger)
forall a b. (a -> b) -> a -> b
$ \Term s PRational
x -> TermCont @PInteger s (Term s PInteger) -> Term s PInteger
forall (a :: PType) (s :: S). TermCont @a s (Term s a) -> Term s a
unTermCont (TermCont @PInteger s (Term s PInteger) -> Term s PInteger)
-> TermCont @PInteger s (Term s PInteger) -> Term s PInteger
forall a b. (a -> b) -> a -> b
$ do
    PRational Term s PInteger
a' Term s PPositive
b' <- ((PRational s -> Term s PInteger) -> Term s PInteger)
-> TermCont @PInteger s (PRational s)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((PRational s -> Term s PInteger) -> Term s PInteger)
 -> TermCont @PInteger s (PRational s))
-> ((PRational s -> Term s PInteger) -> Term s PInteger)
-> TermCont @PInteger s (PRational s)
forall a b. (a -> b) -> a -> b
$ Term s PRational
-> (PRational s -> Term s PInteger) -> Term s PInteger
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
x
    Term s PInteger
a <- ((Term s PInteger -> Term s PInteger) -> Term s PInteger)
-> TermCont @PInteger s (Term s PInteger)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((Term s PInteger -> Term s PInteger) -> Term s PInteger)
 -> TermCont @PInteger s (Term s PInteger))
-> ((Term s PInteger -> Term s PInteger) -> Term s PInteger)
-> TermCont @PInteger s (Term s PInteger)
forall a b. (a -> b) -> a -> b
$ Term s PInteger
-> (Term s PInteger -> Term s PInteger) -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet Term s PInteger
a'
    Term s PPositive
b <- ((Term s PPositive -> Term s PInteger) -> Term s PInteger)
-> TermCont @PInteger s (Term s PPositive)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((Term s PPositive -> Term s PInteger) -> Term s PInteger)
 -> TermCont @PInteger s (Term s PPositive))
-> ((Term s PPositive -> Term s PInteger) -> Term s PInteger)
-> TermCont @PInteger s (Term s PPositive)
forall a b. (a -> b) -> a -> b
$ Term s PPositive
-> (Term s PPositive -> Term s PInteger) -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet Term s PPositive
b'
    Term s PInteger
base <- ((Term s PInteger -> Term s PInteger) -> Term s PInteger)
-> TermCont @PInteger s (Term s PInteger)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((Term s PInteger -> Term s PInteger) -> Term s PInteger)
 -> TermCont @PInteger s (Term s PInteger))
-> (Term s PInteger
    -> (Term s PInteger -> Term s PInteger) -> Term s PInteger)
-> Term s PInteger
-> TermCont @PInteger s (Term s PInteger)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Term s PInteger
-> (Term s PInteger -> Term s PInteger) -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet (Term s PInteger -> TermCont @PInteger s (Term s PInteger))
-> Term s PInteger -> TermCont @PInteger s (Term s PInteger)
forall a b. (a -> b) -> a -> b
$ Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
forall (s :: S).
Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
forall (a :: PType) (s :: S).
PIntegral a =>
Term s (a :--> (a :--> a))
pdiv Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
-> Term s (PInner PPositive)
-> Term s (PInner PPositive :--> PInner PPositive)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s (PInner PPositive)
Term s PInteger
a Term s (PInner PPositive :--> PInner PPositive)
-> Term s (PInner PPositive) -> Term s (PInner PPositive)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
b
    Term s PInteger
rem <- ((Term s PInteger -> Term s PInteger) -> Term s PInteger)
-> TermCont @PInteger s (Term s PInteger)
forall a (s :: S) (r :: PType).
((a -> Term s r) -> Term s r) -> TermCont @r s a
tcont (((Term s PInteger -> Term s PInteger) -> Term s PInteger)
 -> TermCont @PInteger s (Term s PInteger))
-> (Term s PInteger
    -> (Term s PInteger -> Term s PInteger) -> Term s PInteger)
-> Term s PInteger
-> TermCont @PInteger s (Term s PInteger)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Term s PInteger
-> (Term s PInteger -> Term s PInteger) -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet (Term s PInteger -> TermCont @PInteger s (Term s PInteger))
-> Term s PInteger -> TermCont @PInteger s (Term s PInteger)
forall a b. (a -> b) -> a -> b
$ Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
forall (s :: S).
Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
forall (a :: PType) (s :: S).
PIntegral a =>
Term s (a :--> (a :--> a))
pmod Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
-> Term s (PInner PPositive)
-> Term s (PInner PPositive :--> PInner PPositive)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s (PInner PPositive)
Term s PInteger
a Term s (PInner PPositive :--> PInner PPositive)
-> Term s (PInner PPositive) -> Term s (PInner PPositive)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
b
    let result :: Term s PInteger
result =
          Term s PBool
-> Term s PInteger -> Term s PInteger -> Term s PInteger
forall (a :: PType) (s :: S).
Term s PBool -> Term s a -> Term s a -> Term s a
pif
            (Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
forall (s :: S).
Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
forall (a :: PType) (s :: S).
PIntegral a =>
Term s (a :--> (a :--> a))
pmod Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
-> Term s (PInner PPositive)
-> Term s (PInner PPositive :--> PInner PPositive)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
b Term s (PInner PPositive :--> PInner PPositive)
-> Term s (PInner PPositive) -> Term s (PInner PPositive)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s (PInner PPositive)
Term s PInteger
2 Term s (PInner PPositive)
-> Term s (PInner PPositive) -> Term s PBool
forall (s :: S).
Term s (PInner PPositive)
-> Term s (PInner PPositive) -> Term s PBool
forall (t :: PType) (s :: S).
PEq t =>
Term s t -> Term s t -> Term s PBool
#== Term s (PInner PPositive)
Term s PInteger
1)
            (Term s PBool
-> Term s PInteger -> Term s PInteger -> Term s PInteger
forall (a :: PType) (s :: S).
Term s PBool -> Term s a -> Term s a -> Term s a
pif (Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
forall (s :: S).
Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
forall (a :: PType) (s :: S).
PIntegral a =>
Term s (a :--> (a :--> a))
pdiv Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
-> Term s (PInner PPositive)
-> Term s (PInner PPositive :--> PInner PPositive)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
b Term s (PInner PPositive :--> PInner PPositive)
-> Term s (PInner PPositive) -> Term s (PInner PPositive)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s (PInner PPositive)
Term s PInteger
2 Term s (PInner PPositive)
-> Term s (PInner PPositive) -> Term s PBool
forall (s :: S).
Term s (PInner PPositive)
-> Term s (PInner PPositive) -> Term s PBool
forall (t :: PType) (s :: S).
PPartialOrd t =>
Term s t -> Term s t -> Term s PBool
#< Term s (PInner PPositive)
Term s PInteger
rem) Term s PInteger
1 Term s PInteger
0)
            (Term s PInteger -> Term s PInteger)
-> Term s PInteger -> Term s PInteger
forall a b. (a -> b) -> a -> b
$ Term s PBool
-> Term s PInteger -> Term s PInteger -> Term s PInteger
forall (a :: PType) (s :: S).
Term s PBool -> Term s a -> Term s a -> Term s a
pif
              (Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
forall (s :: S).
Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
forall (a :: PType) (s :: S).
PIntegral a =>
Term s (a :--> (a :--> a))
pdiv Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
-> Term s (PInner PPositive)
-> Term s (PInner PPositive :--> PInner PPositive)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
b Term s (PInner PPositive :--> PInner PPositive)
-> Term s (PInner PPositive) -> Term s (PInner PPositive)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s (PInner PPositive)
Term s PInteger
2 Term s (PInner PPositive)
-> Term s (PInner PPositive) -> Term s PBool
forall (s :: S).
Term s (PInner PPositive)
-> Term s (PInner PPositive) -> Term s PBool
forall (t :: PType) (s :: S).
PEq t =>
Term s t -> Term s t -> Term s PBool
#== Term s (PInner PPositive)
Term s PInteger
rem)
              (Term s (PInteger :--> (PInteger :--> PInteger))
forall (s :: S). Term s (PInteger :--> (PInteger :--> PInteger))
forall (a :: PType) (s :: S).
PIntegral a =>
Term s (a :--> (a :--> a))
pmod Term s (PInteger :--> (PInteger :--> PInteger))
-> Term s PInteger -> Term s (PInteger :--> PInteger)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
base Term s (PInteger :--> PInteger)
-> Term s PInteger -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
2)
              (Term s PBool
-> Term s PInteger -> Term s PInteger -> Term s PInteger
forall (a :: PType) (s :: S).
Term s PBool -> Term s a -> Term s a -> Term s a
pif (Term s (PInner PPositive)
Term s PInteger
rem Term s (PInner PPositive)
-> Term s (PInner PPositive) -> Term s PBool
forall (s :: S).
Term s (PInner PPositive)
-> Term s (PInner PPositive) -> Term s PBool
forall (t :: PType) (s :: S).
PPartialOrd t =>
Term s t -> Term s t -> Term s PBool
#< Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
forall (s :: S).
Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
forall (a :: PType) (s :: S).
PIntegral a =>
Term s (a :--> (a :--> a))
pdiv Term
  s (PInner PPositive :--> (PInner PPositive :--> PInner PPositive))
-> Term s (PInner PPositive)
-> Term s (PInner PPositive :--> PInner PPositive)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
b Term s (PInner PPositive :--> PInner PPositive)
-> Term s (PInner PPositive) -> Term s (PInner PPositive)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s (PInner PPositive)
Term s PInteger
2) Term s PInteger
0 Term s PInteger
1)
    Term s PInteger -> TermCont @PInteger s (Term s PInteger)
forall a. a -> TermCont @PInteger s a
forall (f :: Type -> Type) a. Applicative f => a -> f a
pure (Term s PInteger -> TermCont @PInteger s (Term s PInteger))
-> Term s PInteger -> TermCont @PInteger s (Term s PInteger)
forall a b. (a -> b) -> a -> b
$ Term s PInteger
base Term s PInteger -> Term s PInteger -> Term s PInteger
forall a. Num a => a -> a -> a
+ Term s PInteger
result

ptruncate :: Term s (PRational :--> PInteger)
ptruncate :: forall (s :: S). Term s (PRational :--> PInteger)
ptruncate = (forall (s :: S). Term s (PRational :--> PInteger))
-> Term s (PRational :--> PInteger)
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S). Term s (PRational :--> PInteger))
 -> Term s (PRational :--> PInteger))
-> (forall (s :: S). Term s (PRational :--> PInteger))
-> Term s (PRational :--> PInteger)
forall a b. (a -> b) -> a -> b
$
  (Term s PRational -> Term s PInteger)
-> Term s (PRational :--> PInteger)
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s PInteger) -> Term s (c :--> PInteger)
plam ((Term s PRational -> Term s PInteger)
 -> Term s (PRational :--> PInteger))
-> (Term s PRational -> Term s PInteger)
-> Term s (PRational :--> PInteger)
forall a b. (a -> b) -> a -> b
$ \Term s PRational
x ->
    Term s PRational
-> (PRational s -> Term s PInteger) -> Term s PInteger
forall (a :: PType) (s :: S) (b :: PType).
PlutusType a =>
Term s a -> (a s -> Term s b) -> Term s b
pmatch Term s PRational
x ((PRational s -> Term s PInteger) -> Term s PInteger)
-> (PRational s -> Term s PInteger) -> Term s PInteger
forall a b. (a -> b) -> a -> b
$ \(PRational Term s PInteger
a Term s PPositive
b) ->
      Term s (PInteger :--> (PInteger :--> PInteger))
forall (s :: S). Term s (PInteger :--> (PInteger :--> PInteger))
forall (a :: PType) (s :: S).
PIntegral a =>
Term s (a :--> (a :--> a))
pquot Term s (PInteger :--> (PInteger :--> PInteger))
-> Term s PInteger -> Term s (PInteger :--> PInteger)
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
a Term s (PInteger :--> PInteger)
-> Term s PInteger -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PPositive -> Term s (PInner PPositive)
forall (s :: S) (a :: PType). Term s a -> Term s (PInner a)
pto Term s PPositive
b

pproperFraction :: Term s (PRational :--> PPair PInteger PRational)
pproperFraction :: forall (s :: S). Term s (PRational :--> PPair PInteger PRational)
pproperFraction = (forall (s :: S). Term s (PRational :--> PPair PInteger PRational))
-> Term s (PRational :--> PPair PInteger PRational)
forall (a :: PType) (s :: S).
HasCallStack =>
ClosedTerm a -> Term s a
phoistAcyclic ((forall (s :: S).
  Term s (PRational :--> PPair PInteger PRational))
 -> Term s (PRational :--> PPair PInteger PRational))
-> (forall (s :: S).
    Term s (PRational :--> PPair PInteger PRational))
-> Term s (PRational :--> PPair PInteger PRational)
forall a b. (a -> b) -> a -> b
$
  (Term s PRational -> Term s (PPair PInteger PRational))
-> Term s (PRational :--> PPair PInteger PRational)
forall a (b :: PType) (s :: S) (c :: PType).
(PLamN a b s, HasCallStack) =>
(Term s c -> a) -> Term s (c :--> b)
forall (c :: PType).
HasCallStack =>
(Term s c -> Term s (PPair PInteger PRational))
-> Term s (c :--> PPair PInteger PRational)
plam ((Term s PRational -> Term s (PPair PInteger PRational))
 -> Term s (PRational :--> PPair PInteger PRational))
-> (Term s PRational -> Term s (PPair PInteger PRational))
-> Term s (PRational :--> PPair PInteger PRational)
forall a b. (a -> b) -> a -> b
$ \Term s PRational
x ->
    Term s PInteger
-> (Term s PInteger -> Term s (PPair PInteger PRational))
-> Term s (PPair PInteger PRational)
forall (s :: S) (a :: PType) (b :: PType).
Term s a -> (Term s a -> Term s b) -> Term s b
plet (Term s (PRational :--> PInteger)
forall (s :: S). Term s (PRational :--> PInteger)
ptruncate Term s (PRational :--> PInteger)
-> Term s PRational -> Term s PInteger
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PRational
x) ((Term s PInteger -> Term s (PPair PInteger PRational))
 -> Term s (PPair PInteger PRational))
-> (Term s PInteger -> Term s (PPair PInteger PRational))
-> Term s (PPair PInteger PRational)
forall a b. (a -> b) -> a -> b
$ \Term s PInteger
q ->
      PPair PInteger PRational s -> Term s (PPair PInteger PRational)
forall (a :: PType) (s :: S). PlutusType a => a s -> Term s a
pcon (PPair PInteger PRational s -> Term s (PPair PInteger PRational))
-> PPair PInteger PRational s -> Term s (PPair PInteger PRational)
forall a b. (a -> b) -> a -> b
$ Term s PInteger -> Term s PRational -> PPair PInteger PRational s
forall (a :: PType) (b :: PType) (s :: S).
Term s a -> Term s b -> PPair a b s
PPair Term s PInteger
q (Term s PRational
x Term s PRational -> Term s PRational -> Term s PRational
forall a. Num a => a -> a -> a
- Term s (PInteger :--> PRational)
forall (s :: S). Term s (PInteger :--> PRational)
Plutarch.Rational.pfromInteger Term s (PInteger :--> PRational)
-> Term s PInteger -> Term s PRational
forall (s :: S) (a :: PType) (b :: PType).
Term s (a :--> b) -> Term s a -> Term s b
# Term s PInteger
q)