Plutarch.Internal.Eq
class PEq t where Source #
Minimal complete definition
Nothing
Methods
(#==) :: Term s t -> Term s t -> Term s PBool infix 4 Source #
default (#==) :: (PGeneric t, PlutusType t, All2 PEq (PCode t)) => Term s t -> Term s t -> Term s PBool Source #
Since: 1.9.0
Defined in Plutarch.BLS
(#==) :: forall (s :: S). Term s PBuiltinBLS12_381_G1_Element -> Term s PBuiltinBLS12_381_G1_Element -> Term s PBool Source #
(#==) :: forall (s :: S). Term s PBuiltinBLS12_381_G2_Element -> Term s PBuiltinBLS12_381_G2_Element -> Term s PBool Source #
@since WIP
Defined in Plutarch.BitString
(#==) :: forall (s :: S). Term s PBitString -> Term s PBitString -> Term s PBool Source #
Defined in Plutarch.Builtin
(#==) :: forall (s :: S). Term s PData -> Term s PData -> Term s PBool Source #
Defined in Plutarch.Internal.Eq
(#==) :: forall (s :: S). Term s PBool -> Term s PBool -> Term s PBool Source #
Defined in Plutarch.ByteString
(#==) :: forall (s :: S). Term s PByte -> Term s PByte -> Term s PBool Source #
(#==) :: forall (s :: S). Term s PByteString -> Term s PByteString -> Term s PBool Source #
(#==) :: forall (s :: S). Term s PLogicOpSemantics -> Term s PLogicOpSemantics -> Term s PBool Source #
Defined in Plutarch.Convert
(#==) :: forall (s :: S). Term s PEndianness -> Term s PEndianness -> Term s PBool Source #
Defined in Plutarch.Integer
(#==) :: forall (s :: S). Term s PInteger -> Term s PInteger -> Term s PBool Source #
Defined in Plutarch.Positive
(#==) :: forall (s :: S). Term s PPositive -> Term s PPositive -> Term s PBool Source #
Defined in Plutarch.Rational
(#==) :: forall (s :: S). Term s PRational -> Term s PRational -> Term s PBool Source #
Defined in Plutarch.String
(#==) :: forall (s :: S). Term s PString -> Term s PString -> Term s PBool Source #
(#==) :: forall (s :: S). Term s (PAsData a) -> Term s (PAsData a) -> Term s PBool Source #
(#==) :: forall (s :: S). Term s (PBuiltinList a) -> Term s (PBuiltinList a) -> Term s PBool Source #
Since: 1.7.0
(#==) :: forall (s :: S). Term s (PDataNewtype a) -> Term s (PDataNewtype a) -> Term s PBool Source #
This uses data equality. PEq instances of elements don't make any difference.
PEq
Defined in Plutarch.DataRepr.Internal
(#==) :: forall (s :: S). Term s (PDataRecord xs) -> Term s (PDataRecord xs) -> Term s PBool Source #
(#==) :: forall (s :: S). Term s (PDataSum defs) -> Term s (PDataSum defs) -> Term s PBool Source #
Defined in Plutarch.FFI
(#==) :: forall (s :: S). Term s (PTxList a) -> Term s (PTxList a) -> Term s PBool Source #
(#==) :: forall (s :: S). Term s (PTxMaybe a) -> Term s (PTxMaybe a) -> Term s PBool Source #
Defined in Plutarch.List
(#==) :: forall (s :: S). Term s (PList a) -> Term s (PList a) -> Term s PBool Source #
Defined in Plutarch.Maybe
(#==) :: forall (s :: S). Term s (PMaybe a) -> Term s (PMaybe a) -> Term s PBool Source #
Defined in Plutarch.Unit
(#==) :: forall (s :: S). Term s PUnit -> Term s PUnit -> Term s PBool Source #
(#==) :: forall (s :: S). Term s (PBuiltinPair a b) -> Term s (PBuiltinPair a b) -> Term s PBool Source #
Defined in Plutarch.Either
(#==) :: forall (s :: S). Term s (PEither a b) -> Term s (PEither a b) -> Term s PBool Source #
(#==) :: forall (s :: S). Term s (PEitherData a b) -> Term s (PEitherData a b) -> Term s PBool Source #
Defined in Plutarch.Pair
(#==) :: forall (s :: S). Term s (PPair a b) -> Term s (PPair a b) -> Term s PBool Source #