Safe Haskell	Safe-Inferred
Language	Haskell2010

Plutarch.Extra.Rational

Synopsis

newtype PRationalNoReduce (s :: S) = PRationalNoReduce (Term s PRational)
pnoReduce :: forall (s :: S). Term s PRational -> Term s PRationalNoReduce
preduce' :: forall (s :: S). Term s PRationalNoReduce -> Term s PRational
mulTruncate :: forall (s :: S). Term s (PRational :--> (PInteger :--> PInteger))
mulDivTruncate :: forall (s :: S). Term s (PInteger :--> (PInteger :--> (PInteger :--> PInteger)))
divTruncate :: forall (s :: S). Term s (PRational :--> (PInteger :--> PInteger))
mulRational :: forall (s :: S). Term s (PInteger :--> (PRational :--> PRational))
divRational :: forall (s :: S). Term s (PInteger :--> (PRational :--> PRational))
pliftTaggedRational :: forall k (tag :: k). HasCallStack => ClosedTerm (PTagged tag PRational) -> Tagged tag Rational
(#%) :: forall (s :: S). Term s PInteger -> Term s PInteger -> Term s PRational

Documentation

newtype PRationalNoReduce (s :: S) Source #

Wrapper for PRational. Numeric instances of this don't reduce the fraction after each operation.

Constructors

PRationalNoReduce (Term s PRational)

Instances

Instances details

PEq PRationalNoReduce Source #	Since: 3.12.2
Instance details Defined in Plutarch.Extra.Rational Methods (#==) :: forall (s :: S). Term s PRationalNoReduce -> Term s PRationalNoReduce -> Term s PBool Source #
POrd PRationalNoReduce Source #	Since: 3.12.2
Instance details Defined in Plutarch.Extra.Rational
PPartialOrd PRationalNoReduce Source #	Since: 3.12.2
Instance details Defined in Plutarch.Extra.Rational Methods (#<=) :: forall (s :: S). Term s PRationalNoReduce -> Term s PRationalNoReduce -> Term s PBool Source # (#<) :: forall (s :: S). Term s PRationalNoReduce -> Term s PRationalNoReduce -> Term s PBool Source #
PIsData PRationalNoReduce Source #	Since: 3.12.2
Instance details Defined in Plutarch.Extra.Rational Methods pfromDataImpl :: forall (s :: S). Term s (PAsData PRationalNoReduce) -> Term s PRationalNoReduce Source # pdataImpl :: forall (s :: S). Term s PRationalNoReduce -> Term s PData Source #
DerivePlutusType PRationalNoReduce Source #	Since: 3.12.2
Instance details Defined in Plutarch.Extra.Rational Associated Types type DPTStrat PRationalNoReduce Source #
PlutusType PRationalNoReduce Source #
Instance details Defined in Plutarch.Extra.Rational Associated Types type PInner PRationalNoReduce :: PType Source # type PCovariant' PRationalNoReduce Source # type PContravariant' PRationalNoReduce Source # type PVariant' PRationalNoReduce Source # Methods pcon' :: forall (s :: S). PRationalNoReduce s -> Term s (PInner PRationalNoReduce) Source # pmatch' :: forall (s :: S) (b :: PType). Term s (PInner PRationalNoReduce) -> (PRationalNoReduce s -> Term s b) -> Term s b Source #
PNum PRationalNoReduce Source #	Since: 3.12.2
Instance details Defined in Plutarch.Extra.Rational Methods (#+) :: forall (s :: S). Term s PRationalNoReduce -> Term s PRationalNoReduce -> Term s PRationalNoReduce Source # (#-) :: forall (s :: S). Term s PRationalNoReduce -> Term s PRationalNoReduce -> Term s PRationalNoReduce Source # (#*) :: forall (s :: S). Term s PRationalNoReduce -> Term s PRationalNoReduce -> Term s PRationalNoReduce Source # pnegate :: forall (s :: S). Term s (PRationalNoReduce :--> PRationalNoReduce) Source # pabs :: forall (s :: S). Term s (PRationalNoReduce :--> PRationalNoReduce) Source # psignum :: forall (s :: S). Term s (PRationalNoReduce :--> PRationalNoReduce) Source # pfromInteger :: forall (s :: S). Integer -> Term s PRationalNoReduce Source #
Generic (PRationalNoReduce s) Source #
Instance details Defined in Plutarch.Extra.Rational Associated Types type Rep (PRationalNoReduce s) :: Type -> Type Source # Methods from :: PRationalNoReduce s -> Rep (PRationalNoReduce s) x Source # to :: Rep (PRationalNoReduce s) x -> PRationalNoReduce s Source #
type DPTStrat PRationalNoReduce Source #
Instance details Defined in Plutarch.Extra.Rational type DPTStrat PRationalNoReduce = PlutusTypeNewtype
type PContravariant' PRationalNoReduce Source #
Instance details Defined in Plutarch.Extra.Rational type PContravariant' PRationalNoReduce = All2 PContravariant'' (PCode PRationalNoReduce)
type PCovariant' PRationalNoReduce Source #
Instance details Defined in Plutarch.Extra.Rational type PCovariant' PRationalNoReduce = All2 PCovariant'' (PCode PRationalNoReduce)
type PInner PRationalNoReduce Source #	Since: 3.12.2
Instance details Defined in Plutarch.Extra.Rational type PInner PRationalNoReduce = DerivedPInner (DPTStrat PRationalNoReduce) PRationalNoReduce
type PVariant' PRationalNoReduce Source #
Instance details Defined in Plutarch.Extra.Rational type PVariant' PRationalNoReduce = All2 PVariant'' (PCode PRationalNoReduce)
type Rep (PRationalNoReduce s) Source #	Since: 3.12.2
Instance details Defined in Plutarch.Extra.Rational type Rep (PRationalNoReduce s) = D1 ('MetaData "PRationalNoReduce" "Plutarch.Extra.Rational" "liqwid-plutarch-extra-3.21.1-KPadsMN5oqEA2Ctxwq6qig" 'True) (C1 ('MetaCons "PRationalNoReduce" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term s PRational))))

pnoReduce :: forall (s :: S). Term s PRational -> Term s PRationalNoReduce Source #

Put a PRational into a wrapper that prevents reducing after every numeric operation.

Since: 3.12.2

preduce' :: forall (s :: S). Term s PRationalNoReduce -> Term s PRational Source #

Free a PRational from its no-reduce-wrapper and reduce it.

Since: 3.12.2

mulTruncate :: forall (s :: S). Term s (PRational :--> (PInteger :--> PInteger)) Source #

Combined multiply-truncate.

Since: 3.9.0

mulDivTruncate :: forall (s :: S). Term s (PInteger :--> (PInteger :--> (PInteger :--> PInteger))) Source #

Multiply the first argument by the second argument, divide by the third, truncating.

Since: 3.9.0

divTruncate :: forall (s :: S). Term s (PRational :--> (PInteger :--> PInteger)) Source #

Combined divide-truncate.

Since: 3.9.0

mulRational :: forall (s :: S). Term s (PInteger :--> (PRational :--> PRational)) Source #

Scale a PRational up by a factor indicated by a PInteger, without reducing the fraction.

Note

This merely 'defers' the reduction until later, with possibly a (very) large numerator. Use this only in cases where you know that this won't cause a performance blow-up later.

Since: 3.9.0

divRational :: forall (s :: S). Term s (PInteger :--> (PRational :--> PRational)) Source #

Scale a PRational down by a factor indicated by a PInteger, without reducing the fraction.

Note

This has the same performance caveats as mulRational.

Since: 3.9.0

pliftTaggedRational :: forall k (tag :: k). HasCallStack => ClosedTerm (PTagged tag PRational) -> Tagged tag Rational Source #

plift for Tagged Rationals (kind polymorphic)

(#%) :: forall (s :: S). Term s PInteger -> Term s PInteger -> Term s PRational infixl 7 Source #

Create a PRational out of two PIntegers. Will error if the denominator is zero.

Since: 3.9.0