Safe Haskell	Safe-Inferred
Language	Haskell2010

PlutusCore.Eq

Description

An internal module that defines functions for deciding equality of values of data types that encode things with binders.

Synopsis

newtype LR a = LR {
- unLR ∷ a
}
newtype RL a = RL {
- unRL ∷ a
}
type EqRename ren = RenameT (Bilateral ren) Maybe ()
type ScopedEqRename = EqRename ScopedRenaming
runEqRename ∷ Monoid ren ⇒ EqRename ren → Bool
withTwinBindings ∷ (HasRenaming ren unique, HasUnique name unique, Monad m) ⇒ name → name → RenameT (Bilateral ren) m c → RenameT (Bilateral ren) m c
eqNameM ∷ (HasRenaming ren unique, HasUnique name unique, Eq unique) ⇒ name → name → EqRename ren
eqM ∷ Eq a ⇒ a → a → EqRename ren

Documentation

newtype LR a Source #

From left to right.

Constructors

LR
Fields unLR ∷ a

Instances

Instances details

Generic (LR a) Source #
Instance details Defined in PlutusCore.Eq Associated Types type Rep (LR a) ∷ Type → Type Source # Methods from ∷ LR a → Rep (LR a) x Source # to ∷ Rep (LR a) x → LR a Source #
Wrapped (LR a) Source #
Instance details Defined in PlutusCore.Eq Associated Types type Unwrapped (LR a) Methods _Wrapped' ∷ Iso' (LR a) (Unwrapped (LR a))
HasUnique name unique ⇒ HasUnique (LR name) (LR unique) Source #
Instance details Defined in PlutusCore.Eq Methods unique ∷ Lens' (LR name) (LR unique) Source #
type Rep (LR a) Source #
Instance details Defined in PlutusCore.Eq type Rep (LR a) = D1 ('MetaData "LR" "PlutusCore.Eq" "plutus-core-1.36.0.0-inplace" 'True) (C1 ('MetaCons "LR" 'PrefixI 'True) (S1 ('MetaSel ('Just "unLR") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))
type Unwrapped (LR a) Source #
Instance details Defined in PlutusCore.Eq type Unwrapped (LR a) = GUnwrapped (Rep (LR a))

newtype RL a Source #

From right to left.

Constructors

RL
Fields unRL ∷ a

Instances

Instances details

Generic (RL a) Source #
Instance details Defined in PlutusCore.Eq Associated Types type Rep (RL a) ∷ Type → Type Source # Methods from ∷ RL a → Rep (RL a) x Source # to ∷ Rep (RL a) x → RL a Source #
Wrapped (RL a) Source #
Instance details Defined in PlutusCore.Eq Associated Types type Unwrapped (RL a) Methods _Wrapped' ∷ Iso' (RL a) (Unwrapped (RL a))
HasUnique name unique ⇒ HasUnique (RL name) (RL unique) Source #
Instance details Defined in PlutusCore.Eq Methods unique ∷ Lens' (RL name) (RL unique) Source #
type Rep (RL a) Source #
Instance details Defined in PlutusCore.Eq type Rep (RL a) = D1 ('MetaData "RL" "PlutusCore.Eq" "plutus-core-1.36.0.0-inplace" 'True) (C1 ('MetaCons "RL" 'PrefixI 'True) (S1 ('MetaSel ('Just "unRL") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))
type Unwrapped (RL a) Source #
Instance details Defined in PlutusCore.Eq type Unwrapped (RL a) = GUnwrapped (Rep (RL a))

type EqRename ren = RenameT (Bilateral ren) Maybe () Source #

The type of a runnable equality check. Maybe () is isomorphic to Bool and we use it instead of Bool, because this unlocks the convenient and readable do-notation and allows for automatic short-circuiting, which would be tedious with Rename (Bilateral ren) Bool.

type ScopedEqRename = EqRename ScopedRenaming Source #

runEqRename ∷ Monoid ren ⇒ EqRename ren → Bool Source #

Run an EqRename computation.

withTwinBindings ∷ (HasRenaming ren unique, HasUnique name unique, Monad m) ⇒ name → name → RenameT (Bilateral ren) m c → RenameT (Bilateral ren) m c Source #

Record that two names map to each other.

eqNameM ∷ (HasRenaming ren unique, HasUnique name unique, Eq unique) ⇒ name → name → EqRename ren Source #

Check equality of two names.

eqM ∷ Eq a ⇒ a → a → EqRename ren Source #

Check equality of things having an Eq instance.