| Safe Haskell | Safe-Inferred |
|---|---|
| Language | GHC2021 |
Plutarch.Test.Laws
Synopsis
- checkLedgerPropertiesValue :: TestTree
- checkLedgerPropertiesAssocMap :: TestTree
- checkLedgerProperties :: forall (a :: S -> Type). (Typeable a, PLiftable a, Eq (AsHaskell a), PIsData a, ToData (AsHaskell a), Arbitrary (AsHaskell a), Pretty (AsHaskell a), Show (AsHaskell a)) => TestTree
- checkLedgerPropertiesPCountable :: forall (a :: S -> Type). (Typeable a, PCountable a, Arbitrary (AsHaskell a), Pretty (AsHaskell a), Eq (AsHaskell a), Show (AsHaskell a), PLiftable a) => TestTree
- checkLedgerPropertiesPEnumerable :: forall (a :: S -> Type). (Typeable a, PEnumerable a, Arbitrary (AsHaskell a), Pretty (AsHaskell a), Eq (AsHaskell a), PLiftable a) => TestTree
- checkHaskellOrdEquivalent :: forall (plutarchInput :: S -> Type). (PLiftable plutarchInput, Pretty (AsHaskell plutarchInput), Arbitrary (AsHaskell plutarchInput), Typeable (AsHaskell plutarchInput), Ord (AsHaskell plutarchInput), Typeable plutarchInput, POrd plutarchInput) => TestTree
- checkHaskellNumEquivalent :: forall (plutarchInput :: S -> Type). (PLiftable plutarchInput, Pretty (AsHaskell plutarchInput), Arbitrary (AsHaskell plutarchInput), Eq (AsHaskell plutarchInput), Typeable (AsHaskell plutarchInput), Num (AsHaskell plutarchInput), Typeable plutarchInput, PIntegralDomain plutarchInput) => TestTree
- checkPLiftableLaws :: forall (a :: S -> Type). (Arbitrary (AsHaskell a), Pretty (AsHaskell a), Eq (AsHaskell a), PLiftable a, Show (AsHaskell a)) => [TestTree]
- checkPOrdLaws :: forall (a :: S -> Type). (Arbitrary (AsHaskell a), Pretty (AsHaskell a), PLiftable a, POrd a) => [TestTree]
- checkPAdditiveSemigroupLaws :: forall (a :: S -> Type). (Arbitrary (AsHaskell a), Pretty (AsHaskell a), PAdditiveSemigroup a, PEq a, PLiftable a) => TestTree
- checkPAdditiveMonoidLaws :: forall (a :: S -> Type). (Arbitrary (AsHaskell a), Pretty (AsHaskell a), PAdditiveMonoid a, PEq a, PLiftable a) => TestTree
- checkPAdditiveGroupLaws :: forall (a :: S -> Type). (Arbitrary (AsHaskell a), Pretty (AsHaskell a), PAdditiveGroup a, PEq a, PLiftable a) => TestTree
- checkPSemigroupLaws :: forall (a :: S -> Type). (Arbitrary (AsHaskell a), Pretty (AsHaskell a), PSemigroup a, PEq a, PLiftable a) => TestTree
- checkPMonoidLaws :: forall (a :: S -> Type). (Arbitrary (AsHaskell a), Pretty (AsHaskell a), PMonoid a, PEq a, PLiftable a) => TestTree
Documentation
checkLedgerPropertiesValue :: TestTree Source #
Like checkLedgerProperties but specialized to PValue
This is an ugly kludge because PValue doesn't have a direct PData conversion, and bringing one in would break too much other stuff to be worth it.
Since: 1.0.0
checkLedgerPropertiesAssocMap :: TestTree Source #
checkLedgerProperties :: forall (a :: S -> Type). (Typeable a, PLiftable a, Eq (AsHaskell a), PIsData a, ToData (AsHaskell a), Arbitrary (AsHaskell a), Pretty (AsHaskell a), Show (AsHaskell a)) => TestTree Source #
Since: 1.0.0
checkLedgerPropertiesPCountable :: forall (a :: S -> Type). (Typeable a, PCountable a, Arbitrary (AsHaskell a), Pretty (AsHaskell a), Eq (AsHaskell a), Show (AsHaskell a), PLiftable a) => TestTree Source #
Since: 1.0.0
checkLedgerPropertiesPEnumerable :: forall (a :: S -> Type). (Typeable a, PEnumerable a, Arbitrary (AsHaskell a), Pretty (AsHaskell a), Eq (AsHaskell a), PLiftable a) => TestTree Source #
Since: 1.0.0
checkHaskellOrdEquivalent :: forall (plutarchInput :: S -> Type). (PLiftable plutarchInput, Pretty (AsHaskell plutarchInput), Arbitrary (AsHaskell plutarchInput), Typeable (AsHaskell plutarchInput), Ord (AsHaskell plutarchInput), Typeable plutarchInput, POrd plutarchInput) => TestTree Source #
Since: 1.0.0
checkHaskellNumEquivalent :: forall (plutarchInput :: S -> Type). (PLiftable plutarchInput, Pretty (AsHaskell plutarchInput), Arbitrary (AsHaskell plutarchInput), Eq (AsHaskell plutarchInput), Typeable (AsHaskell plutarchInput), Num (AsHaskell plutarchInput), Typeable plutarchInput, PIntegralDomain plutarchInput) => TestTree Source #
checkPLiftableLaws :: forall (a :: S -> Type). (Arbitrary (AsHaskell a), Pretty (AsHaskell a), Eq (AsHaskell a), PLiftable a, Show (AsHaskell a)) => [TestTree] Source #
Verifies that the specified Plutarch and Haskell types satisfy the laws of
PLiftable.
Since: 1.0.0
checkPOrdLaws :: forall (a :: S -> Type). (Arbitrary (AsHaskell a), Pretty (AsHaskell a), PLiftable a, POrd a) => [TestTree] Source #
Verifies that the specified Plutarch type satisfies the POrd laws for
mandatory methods.
Since: 1.0.0
checkPAdditiveSemigroupLaws :: forall (a :: S -> Type). (Arbitrary (AsHaskell a), Pretty (AsHaskell a), PAdditiveSemigroup a, PEq a, PLiftable a) => TestTree Source #
Verifies that the specified Plutarch type satisfies the
PAdditiveSemigroup laws for mandatory methods.
Since: 1.0.0
checkPAdditiveMonoidLaws :: forall (a :: S -> Type). (Arbitrary (AsHaskell a), Pretty (AsHaskell a), PAdditiveMonoid a, PEq a, PLiftable a) => TestTree Source #
Verifies that the specified Plutarch type satisfies the PAdditiveMonoid
laws for mandatory methods.
Since: 1.0.0
checkPAdditiveGroupLaws :: forall (a :: S -> Type). (Arbitrary (AsHaskell a), Pretty (AsHaskell a), PAdditiveGroup a, PEq a, PLiftable a) => TestTree Source #
Verifies that the specified Plutarch type satisfies the PAdditiveGroup
laws for mandatory methods.
Since: 1.0.0
checkPSemigroupLaws :: forall (a :: S -> Type). (Arbitrary (AsHaskell a), Pretty (AsHaskell a), PSemigroup a, PEq a, PLiftable a) => TestTree Source #
Verifies that the specified Plutarch type satisfies the PSemigroup laws
for mandatory methods.
Since: 1.0.0
checkPMonoidLaws :: forall (a :: S -> Type). (Arbitrary (AsHaskell a), Pretty (AsHaskell a), PMonoid a, PEq a, PLiftable a) => TestTree Source #
Verifies that the specified Plutarch type satisfies the PMonoid laws for
mandatory methods.
Since: 1.0.0