| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Test.Cardano.Ledger.Common
Synopsis
- module Test.Hspec
- module Test.Hspec.QuickCheck
- vector ∷ Arbitrary a ⇒ Int → Gen [a]
- void ∷ Functor f ⇒ f a → f ()
- newtype NonEmptyList a = NonEmpty {
- getNonEmpty ∷ [a]
- (==>) ∷ Testable prop ⇒ Bool → prop → Property
- data Result
- = Success { }
- | GaveUp { }
- | Failure {
- numTests ∷ Int
- numDiscarded ∷ Int
- numShrinks ∷ Int
- numShrinkTries ∷ Int
- numShrinkFinal ∷ Int
- usedSeed ∷ QCGen
- usedSize ∷ Int
- reason ∷ String
- theException ∷ Maybe AnException
- output ∷ String
- failingTestCase ∷ [String]
- failingLabels ∷ [String]
- failingClasses ∷ Set String
- witnesses ∷ [Witness]
- | NoExpectedFailure { }
- class Testable prop where
- class Arbitrary a where
- data Fun a b = Fun (a :-> b, b, Shrunk) (a → b)
- discard ∷ a
- data Gen a
- variant ∷ Integral n ⇒ n → Gen a → Gen a
- sized ∷ (Int → Gen a) → Gen a
- getSize ∷ Gen Int
- resize ∷ HasCallStack ⇒ Int → Gen a → Gen a
- scale ∷ (Int → Int) → Gen a → Gen a
- choose ∷ Random a ⇒ (a, a) → Gen a
- chooseAny ∷ Random a ⇒ Gen a
- chooseEnum ∷ Enum a ⇒ (a, a) → Gen a
- chooseInt ∷ (Int, Int) → Gen Int
- chooseBoundedIntegral ∷ (Bounded a, Integral a) ⇒ (a, a) → Gen a
- chooseInteger ∷ (Integer, Integer) → Gen Integer
- generate ∷ Gen a → IO a
- sample' ∷ Gen a → IO [a]
- sample ∷ Show a ⇒ Gen a → IO ()
- suchThat ∷ Gen a → (a → Bool) → Gen a
- suchThatMap ∷ Gen a → (a → Maybe b) → Gen b
- suchThatMaybe ∷ Gen a → (a → Bool) → Gen (Maybe a)
- oneof ∷ HasCallStack ⇒ [Gen a] → Gen a
- frequency ∷ HasCallStack ⇒ [(Int, Gen a)] → Gen a
- elements ∷ HasCallStack ⇒ [a] → Gen a
- sublistOf ∷ [a] → Gen [a]
- shuffle ∷ [a] → Gen [a]
- growingElements ∷ HasCallStack ⇒ [a] → Gen a
- listOf ∷ Gen a → Gen [a]
- listOf1 ∷ Gen a → Gen [a]
- vectorOf ∷ Int → Gen a → Gen [a]
- infiniteListOf ∷ Gen a → Gen [a]
- class CoArbitrary a where
- coarbitrary ∷ a → Gen b → Gen b
- class Arbitrary2 (f ∷ Type → Type → Type) where
- liftArbitrary2 ∷ Gen a → Gen b → Gen (f a b)
- liftShrink2 ∷ (a → [a]) → (b → [b]) → f a b → [f a b]
- class Arbitrary1 (f ∷ Type → Type) where
- liftArbitrary ∷ Gen a → Gen (f a)
- liftShrink ∷ (a → [a]) → f a → [f a]
- arbitrary1 ∷ (Arbitrary1 f, Arbitrary a) ⇒ Gen (f a)
- shrink1 ∷ (Arbitrary1 f, Arbitrary a) ⇒ f a → [f a]
- arbitrary2 ∷ (Arbitrary2 f, Arbitrary a, Arbitrary b) ⇒ Gen (f a b)
- shrink2 ∷ (Arbitrary2 f, Arbitrary a, Arbitrary b) ⇒ f a b → [f a b]
- genericShrink ∷ (Generic a, RecursivelyShrink (Rep a), GSubterms (Rep a) a) ⇒ a → [a]
- recursivelyShrink ∷ (Generic a, RecursivelyShrink (Rep a)) ⇒ a → [a]
- subterms ∷ (Generic a, GSubterms (Rep a) a) ⇒ a → [a]
- shrinkList ∷ (a → [a]) → [a] → [[a]]
- applyArbitrary2 ∷ (Arbitrary a, Arbitrary b) ⇒ (a → b → r) → Gen r
- applyArbitrary3 ∷ (Arbitrary a, Arbitrary b, Arbitrary c) ⇒ (a → b → c → r) → Gen r
- applyArbitrary4 ∷ (Arbitrary a, Arbitrary b, Arbitrary c, Arbitrary d) ⇒ (a → b → c → d → r) → Gen r
- arbitrarySizedIntegral ∷ Integral a ⇒ Gen a
- arbitrarySizedNatural ∷ Integral a ⇒ Gen a
- arbitrarySizedFractional ∷ Fractional a ⇒ Gen a
- arbitraryBoundedIntegral ∷ (Bounded a, Integral a) ⇒ Gen a
- arbitraryBoundedRandom ∷ (Bounded a, Random a) ⇒ Gen a
- arbitraryBoundedEnum ∷ (Bounded a, Enum a) ⇒ Gen a
- arbitrarySizedBoundedIntegral ∷ (Bounded a, Integral a) ⇒ Gen a
- arbitraryUnicodeChar ∷ Gen Char
- arbitraryASCIIChar ∷ Gen Char
- arbitraryPrintableChar ∷ Gen Char
- shrinkNothing ∷ a → [a]
- shrinkMap ∷ Arbitrary a ⇒ (a → b) → (b → a) → b → [b]
- shrinkMapBy ∷ (a → b) → (b → a) → (a → [a]) → b → [b]
- shrinkIntegral ∷ Integral a ⇒ a → [a]
- shrinkBoundedEnum ∷ (Bounded a, Enum a, Eq a) ⇒ a → [a]
- shrinkRealFrac ∷ RealFrac a ⇒ a → [a]
- shrinkDecimal ∷ RealFrac a ⇒ a → [a]
- genericCoarbitrary ∷ (Generic a, GCoArbitrary (Rep a)) ⇒ a → Gen b → Gen b
- (><) ∷ (Gen a → Gen a) → (Gen a → Gen a) → Gen a → Gen a
- coarbitraryIntegral ∷ Integral a ⇒ a → Gen b → Gen b
- coarbitraryReal ∷ Real a ⇒ a → Gen b → Gen b
- coarbitraryShow ∷ Show a ⇒ a → Gen b → Gen b
- coarbitraryEnum ∷ Enum a ⇒ a → Gen b → Gen b
- orderedList ∷ (Ord a, Arbitrary a) ⇒ Gen [a]
- infiniteList ∷ Arbitrary a ⇒ Gen [a]
- newtype PrintableString = PrintableString {}
- newtype UnicodeString = UnicodeString {}
- newtype ASCIIString = ASCIIString {}
- class ShrinkState s a where
- shrinkInit ∷ a → s
- shrinkState ∷ a → s → [(a, s)]
- data Shrinking s a = Shrinking s a
- data Smart a = Smart Int a
- newtype Shrink2 a = Shrink2 {
- getShrink2 ∷ a
- newtype Small a = Small {
- getSmall ∷ a
- newtype Large a = Large {
- getLarge ∷ a
- newtype NonPositive a = NonPositive {
- getNonPositive ∷ a
- newtype NonNegative a = NonNegative {
- getNonNegative ∷ a
- newtype NonZero a = NonZero {
- getNonZero ∷ a
- newtype Negative a = Negative {
- getNegative ∷ a
- newtype Positive a = Positive {
- getPositive ∷ a
- newtype SortedList a = Sorted {
- getSorted ∷ [a]
- data InfiniteList a = InfiniteList {
- getInfiniteList ∷ [a]
- infiniteListInternalData ∷ InfiniteListInternalData a
- newtype OrderedList a = Ordered {
- getOrdered ∷ [a]
- newtype Fixed a = Fixed {
- getFixed ∷ a
- newtype Blind a = Blind {
- getBlind ∷ a
- class Function a where
- pattern Fn3 ∷ (a → b → c → d) → Fun (a, b, c) d
- pattern Fn2 ∷ (a → b → c) → Fun (a, b) c
- pattern Fn ∷ (a → b) → Fun a b
- functionBoundedEnum ∷ (Eq a, Bounded a, Enum a) ⇒ (a → b) → a :-> b
- functionRealFrac ∷ RealFrac a ⇒ (a → b) → a :-> b
- functionIntegral ∷ Integral a ⇒ (a → b) → a :-> b
- functionShow ∷ (Show a, Read a) ⇒ (a → c) → a :-> c
- functionVoid ∷ (∀ b. void → b) → void :-> c
- functionMap ∷ Function b ⇒ (a → b) → (b → a) → (a → c) → a :-> c
- applyFun ∷ Fun a b → a → b
- applyFun2 ∷ Fun (a, b) c → a → b → c
- applyFun3 ∷ Fun (a, b, c) d → a → b → c → d
- data Confidence = Confidence {}
- pattern Wit ∷ () ⇒ (Typeable a, Show a) ⇒ a → Witness
- data Discard = Discard
- data Property
- ioProperty ∷ Testable prop ⇒ IO prop → Property
- idempotentIOProperty ∷ Testable prop ⇒ IO prop → Property
- coerceWitness ∷ Typeable a ⇒ Witness → a
- castWitness ∷ Typeable a ⇒ Witness → Maybe a
- mapSize ∷ Testable prop ⇒ (Int → Int) → prop → Property
- shrinking ∷ Testable prop ⇒ (a → [a]) → a → (a → prop) → Property
- noShrinking ∷ Testable prop ⇒ prop → Property
- counterexample ∷ Testable prop ⇒ String → prop → Property
- printTestCase ∷ Testable prop ⇒ String → prop → Property
- whenFail ∷ Testable prop ⇒ IO () → prop → Property
- whenFail' ∷ Testable prop ⇒ IO () → prop → Property
- verbose ∷ Testable prop ⇒ prop → Property
- verboseShrinking ∷ Testable prop ⇒ prop → Property
- expectFailure ∷ Testable prop ⇒ prop → Property
- once ∷ Testable prop ⇒ prop → Property
- again ∷ Testable prop ⇒ prop → Property
- withMaxSuccess ∷ Testable prop ⇒ Int → prop → Property
- withDiscardRatio ∷ Testable prop ⇒ Int → prop → Property
- withMaxShrinks ∷ Testable prop ⇒ Int → prop → Property
- withMaxSize ∷ Testable prop ⇒ Int → prop → Property
- witness ∷ (Typeable a, Show a, Testable prop) ⇒ a → prop → Property
- checkCoverage ∷ Testable prop ⇒ prop → Property
- checkCoverageWith ∷ Testable prop ⇒ Confidence → prop → Property
- stdConfidence ∷ Confidence
- label ∷ Testable prop ⇒ String → prop → Property
- collect ∷ (Show a, Testable prop) ⇒ a → prop → Property
- classify ∷ Testable prop ⇒ Bool → String → prop → Property
- cover ∷ Testable prop ⇒ Double → Bool → String → prop → Property
- tabulate ∷ Testable prop ⇒ String → [String] → prop → Property
- coverTable ∷ Testable prop ⇒ String → [(String, Double)] → prop → Property
- within ∷ Testable prop ⇒ Int → prop → Property
- discardAfter ∷ Testable prop ⇒ Int → prop → Property
- forAll ∷ (Show a, Testable prop) ⇒ Gen a → (a → prop) → Property
- forAllShow ∷ Testable prop ⇒ Gen a → (a → String) → (a → prop) → Property
- forAllBlind ∷ Testable prop ⇒ Gen a → (a → prop) → Property
- forAllShrink ∷ (Show a, Testable prop) ⇒ Gen a → (a → [a]) → (a → prop) → Property
- forAllShrinkShow ∷ Testable prop ⇒ Gen a → (a → [a]) → (a → String) → (a → prop) → Property
- forAllShrinkBlind ∷ Testable prop ⇒ Gen a → (a → [a]) → (a → prop) → Property
- (.&.) ∷ (Testable prop1, Testable prop2) ⇒ prop1 → prop2 → Property
- (.&&.) ∷ (Testable prop1, Testable prop2) ⇒ prop1 → prop2 → Property
- conjoin ∷ Testable prop ⇒ [prop] → Property
- (.||.) ∷ (Testable prop1, Testable prop2) ⇒ prop1 → prop2 → Property
- disjoin ∷ Testable prop ⇒ [prop] → Property
- (===) ∷ (Eq a, Show a) ⇒ a → a → Property
- (=/=) ∷ (Eq a, Show a) ⇒ a → a → Property
- total ∷ NFData a ⇒ a → Property
- data Args = Args {
- replay ∷ Maybe (QCGen, Int)
- maxSuccess ∷ Int
- maxDiscardRatio ∷ Int
- maxSize ∷ Int
- chatty ∷ Bool
- maxShrinks ∷ Int
- isSuccess ∷ Result → Bool
- stdArgs ∷ Args
- quickCheck ∷ Testable prop ⇒ prop → IO ()
- quickCheckWith ∷ Testable prop ⇒ Args → prop → IO ()
- quickCheckResult ∷ Testable prop ⇒ prop → IO Result
- quickCheckWithResult ∷ Testable prop ⇒ Args → prop → IO Result
- recheck ∷ Testable prop ⇒ Result → prop → IO ()
- verboseCheck ∷ Testable prop ⇒ prop → IO ()
- verboseCheckWith ∷ Testable prop ⇒ Args → prop → IO ()
- verboseCheckResult ∷ Testable prop ⇒ prop → IO Result
- verboseCheckWithResult ∷ Testable prop ⇒ Args → prop → IO Result
- polyQuickCheck ∷ Name → ExpQ
- polyVerboseCheck ∷ Name → ExpQ
- monomorphic ∷ Name → ExpQ
- forAllProperties ∷ Q Exp
- allProperties ∷ Q Exp
- quickCheckAll ∷ Q Exp
- verboseCheckAll ∷ Q Exp
- labelledExamples ∷ Testable prop ⇒ prop → IO ()
- labelledExamplesWith ∷ Testable prop ⇒ Args → prop → IO ()
- labelledExamplesResult ∷ Testable prop ⇒ prop → IO Result
- labelledExamplesWithResult ∷ Testable prop ⇒ Args → prop → IO Result
- when ∷ Applicative f ⇒ Bool → f () → f ()
- unless ∷ Applicative f ⇒ Bool → f () → f ()
- (>=>) ∷ Monad m ⇒ (a → m b) → (b → m c) → a → m c
- forM_ ∷ (Foldable t, Monad m) ⇒ t a → (a → m b) → m ()
- replicateM ∷ Applicative m ⇒ Int → m a → m [a]
- replicateM_ ∷ Applicative m ⇒ Int → m a → m ()
- ledgerTestMain ∷ Spec → IO ()
- ledgerTestMainWith ∷ Config → Spec → IO ()
- ledgerHspecConfig ∷ Config
- class NFData a
- runGen ∷ Int → Int → Gen a → a
- class ToExpr a where
- toExpr ∷ a → Expr
- listToExpr ∷ [a] → Expr
- showExpr ∷ ToExpr a ⇒ a → String
- ansiExpr ∷ ToExpr a ⇒ a → Doc AnsiStyle
- ansiExprString ∷ ToExpr a ⇒ a → String
- diffExpr ∷ ToExpr a ⇒ a → a → Doc AnsiStyle
- diffExprString ∷ ToExpr a ⇒ a → a → String
- diffExprCompact ∷ ToExpr a ⇒ a → a → Doc AnsiStyle
- diffExprCompactString ∷ ToExpr a ⇒ a → a → String
- ansiDocToString ∷ Doc AnsiStyle → String
- assertBool ∷ HasCallStack ⇒ String → Bool → Assertion
- assertFailure ∷ HasCallStack ⇒ String → IO a
- assertColorFailure ∷ HasCallStack ⇒ String → IO a
- shouldBeExpr ∷ (HasCallStack, ToExpr a, Eq a) ⇒ a → a → IO ()
- shouldBeRight ∷ (HasCallStack, Show a, Show b, Eq b) ⇒ Either a b → b → Expectation
- shouldBeLeft ∷ (HasCallStack, Show a, Eq a, Show b) ⇒ Either a b → a → Expectation
- shouldBeRightExpr ∷ (HasCallStack, ToExpr a, Eq b, ToExpr b) ⇒ Either a b → b → Expectation
- shouldBeLeftExpr ∷ (HasCallStack, ToExpr a, ToExpr b, Eq a) ⇒ Either a b → a → Expectation
- expectRight ∷ (HasCallStack, Show a) ⇒ Either a b → IO b
- expectRightDeep ∷ (HasCallStack, Show a, NFData b) ⇒ Either a b → IO b
- expectRightDeep_ ∷ (HasCallStack, Show a, NFData b) ⇒ Either a b → IO ()
- expectRightExpr ∷ (HasCallStack, ToExpr a) ⇒ Either a b → IO b
- expectRightDeepExpr ∷ (HasCallStack, ToExpr a, NFData b) ⇒ Either a b → IO b
- expectRightDeepExpr_ ∷ (HasCallStack, ToExpr a, NFData b) ⇒ Either a b → IO ()
- expectLeft ∷ (HasCallStack, Show b) ⇒ Either a b → IO a
- expectLeftExpr ∷ (HasCallStack, ToExpr b) ⇒ Either a b → IO a
- expectLeftDeep ∷ (HasCallStack, NFData a, Show b) ⇒ Either a b → IO a
- expectLeftDeep_ ∷ (HasCallStack, NFData a, Show b) ⇒ Either a b → IO ()
- expectLeftDeepExpr ∷ (HasCallStack, ToExpr b, NFData a) ⇒ Either a b → IO a
- expectLeftDeepExpr_ ∷ (HasCallStack, ToExpr b, NFData a) ⇒ Either a b → IO ()
- expectJust ∷ HasCallStack ⇒ Maybe a → IO a
- expectJustDeep ∷ (HasCallStack, NFData a) ⇒ Maybe a → IO a
- expectJustDeep_ ∷ (HasCallStack, NFData a) ⇒ Maybe a → IO ()
- expectNothing ∷ (HasCallStack, Show a) ⇒ Maybe a → IO ()
- tracedDiscard ∷ String → a
Documentation
module Test.Hspec
module Test.Hspec.QuickCheck
void ∷ Functor f ⇒ f a → f () #
void valueIO action.
Examples
Replace the contents of a Maybe Int
>>>void NothingNothing
>>>void (Just 3)Just ()
Replace the contents of an Either Int IntEither Int ()
>>>void (Left 8675309)Left 8675309
>>>void (Right 8675309)Right ()
Replace every element of a list with unit:
>>>void [1,2,3][(),(),()]
Replace the second element of a pair with unit:
>>>void (1,2)(1,())
Discard the result of an IO action:
>>>mapM print [1,2]1 2 [(),()]
>>>void $ mapM print [1,2]1 2
newtype NonEmptyList a Source #
NonEmpty xs: guarantees that xs is non-empty.
Constructors
| NonEmpty | |
Fields
| |
Instances
(==>) ∷ Testable prop ⇒ Bool → prop → Property infixr 0 Source #
Implication for properties: The resulting property holds if
the first argument is False (in which case the test case is discarded),
or if the given property holds. Note that using implication carelessly can
severely skew test case distribution: consider using cover to make sure
that your test data is still good quality.
Result represents the test result
Constructors
| Success | A successful test run |
Fields
| |
| GaveUp | Given up |
Fields
| |
| Failure | A failed test run |
Fields
| |
| NoExpectedFailure | A property that should have failed did not |
Fields
| |
class Testable prop where Source #
The class of properties, i.e., types which QuickCheck knows how to test.
Typically a property will be a function returning Bool or Property.
Minimal complete definition
Methods
property ∷ prop → Property Source #
Convert the thing to a property.
propertyForAllShrinkShow ∷ Gen a → (a → [a]) → (a → [String]) → (a → prop) → Property Source #
Optional; used internally in order to improve shrinking.
Tests a property but also quantifies over an extra value
(with a custom shrink and show function).
The Testable instance for functions defines
propertyForAllShrinkShow in a way that improves shrinking.
class Arbitrary a where Source #
Random generation and shrinking of values.
QuickCheck provides Arbitrary instances for most types in base,
except those which incur extra dependencies.
For a wider range of Arbitrary instances see the
quickcheck-instances
package.
Minimal complete definition
Methods
A generator for values of the given type.
It is worth spending time thinking about what sort of test data
you want - good generators are often the difference between
finding bugs and not finding them. You can use sample,
label and classify to check the quality of your test data.
There is no generic arbitrary implementation included because we don't
know how to make a high-quality one. If you want one, consider using the
testing-feat or
generic-random packages.
The QuickCheck manual goes into detail on how to write good generators. Make sure to look at it, especially if your type is recursive!
Produces a (possibly) empty list of all the possible immediate shrinks of the given value.
The default implementation returns the empty list, so will not try to
shrink the value. If your data type has no special invariants, you can
enable shrinking by defining shrink = , but by customising
the behaviour of genericShrinkshrink you can often get simpler counterexamples.
Most implementations of shrink should try at least three things:
- Shrink a term to any of its immediate subterms.
You can use
subtermsto do this. - Recursively apply
shrinkto all immediate subterms. You can userecursivelyShrinkto do this. - Type-specific shrinkings such as replacing a constructor by a simpler constructor.
For example, suppose we have the following implementation of binary trees:
data Tree a = Nil | Branch a (Tree a) (Tree a)
We can then define shrink as follows:
shrink Nil = [] shrink (Branch x l r) = -- shrink Branch to Nil [Nil] ++ -- shrink to subterms [l, r] ++ -- recursively shrink subterms [Branch x' l' r' | (x', l', r') <- shrink (x, l, r)]
There are a couple of subtleties here:
- QuickCheck tries the shrinking candidates in the order they
appear in the list, so we put more aggressive shrinking steps
(such as replacing the whole tree by
Nil) before smaller ones (such as recursively shrinking the subtrees). - It is tempting to write the last line as
[Branch x' l' r' | x' <- shrink x, l' <- shrink l, r' <- shrink r]but this is the wrong thing! It will force QuickCheck to shrinkx,landrin tandem, and shrinking will stop once one of the three is fully shrunk.
There is a fair bit of boilerplate in the code above.
We can avoid it with the help of some generic functions.
The function genericShrink tries shrinking a term to all of its
subterms and, failing that, recursively shrinks the subterms.
Using it, we can define shrink as:
shrink x = shrinkToNil x ++ genericShrink x
where
shrinkToNil Nil = []
shrinkToNil (Branch _ l r) = [Nil]genericShrink is a combination of subterms, which shrinks
a term to any of its subterms, and recursivelyShrink, which shrinks
all subterms of a term. These may be useful if you need a bit more
control over shrinking than genericShrink gives you.
A final gotcha: we cannot define shrink as simply shrink x = Nil:genericShrink xNil to Nil, and shrinking will go into an
infinite loop.
If all this leaves you bewildered, you might try shrink = genericShrinkGeneric for your type. However, if your data type has any
special invariants, you will need to check that genericShrink can't break those invariants.
Instances
Generation of random shrinkable, showable functions.
To generate random values of type Fun a bFunction a
A generator for values of type a.
The third-party packages
QuickCheck-GenT
and
quickcheck-transformer
provide monad transformer versions of Gen.
Instances
sized ∷ (Int → Gen a) → Gen a Source #
Used to construct generators that depend on the size parameter.
For example, listOf, which uses the size parameter as an upper bound on
length of lists it generates, can be defined like this:
listOf :: Gen a -> Gen [a]
listOf gen = sized $ \n ->
do k <- choose (0,n)
vectorOf k genYou can also do this using getSize.
Returns the size parameter. Used to construct generators that depend on the size parameter.
For example, listOf, which uses the size parameter as an upper bound on
length of lists it generates, can be defined like this:
listOf :: Gen a -> Gen [a] listOf gen = do n <- getSize k <- choose (0,n) vectorOf k gen
You can also do this using sized.
resize ∷ HasCallStack ⇒ Int → Gen a → Gen a Source #
Overrides the size parameter. Returns a generator which uses the given size instead of the runtime-size parameter.
scale ∷ (Int → Int) → Gen a → Gen a Source #
Adjust the size parameter, by transforming it with the given function.
choose ∷ Random a ⇒ (a, a) → Gen a Source #
Generates a random element in the given inclusive range.
For integral and enumerated types, the specialised variants of
choose below run much quicker.
chooseBoundedIntegral ∷ (Bounded a, Integral a) ⇒ (a, a) → Gen a Source #
A fast implementation of choose for bounded integral types.
generate ∷ Gen a → IO a Source #
Run a generator. The size passed to the generator is always 30;
if you want another size then you should explicitly use resize.
suchThatMap ∷ Gen a → (a → Maybe b) → Gen b Source #
Generates a value for which the given function returns a Just, and then
applies the function.
suchThatMaybe ∷ Gen a → (a → Bool) → Gen (Maybe a) Source #
Tries to generate a value that satisfies a predicate.
If it fails to do so after enough attempts, returns Nothing.
oneof ∷ HasCallStack ⇒ [Gen a] → Gen a Source #
Randomly uses one of the given generators. The input list must be non-empty.
frequency ∷ HasCallStack ⇒ [(Int, Gen a)] → Gen a Source #
Chooses one of the given generators, with a weighted random distribution. The input list must be non-empty.
elements ∷ HasCallStack ⇒ [a] → Gen a Source #
Generates one of the given values. The input list must be non-empty.
growingElements ∷ HasCallStack ⇒ [a] → Gen a Source #
Takes a list of elements of increasing size, and chooses among an initial segment of the list. The size of this initial segment increases with the size parameter. The input list must be non-empty.
listOf ∷ Gen a → Gen [a] Source #
Generates a list of random length. The maximum length depends on the size parameter.
listOf1 ∷ Gen a → Gen [a] Source #
Generates a non-empty list of random length. The maximum length depends on the size parameter.
infiniteListOf ∷ Gen a → Gen [a] Source #
Generates an infinite list.
class CoArbitrary a where Source #
Used for random generation of functions.
You should consider using Fun instead, which
can show the generated functions as strings.
If you are using a recent GHC, there is a default definition of
coarbitrary using genericCoarbitrary, so if your type has a
Generic instance it's enough to say
instance CoArbitrary MyType
You should only use genericCoarbitrary for data types where
equality is structural, i.e. if you can't have two different
representations of the same value. An example where it's not
safe is sets implemented using binary search trees: the same
set can be represented as several different trees.
Here you would have to explicitly define
coarbitrary s = coarbitrary (toList s).
Minimal complete definition
Nothing
Methods
coarbitrary ∷ a → Gen b → Gen b Source #
Used to generate a function of type a -> b.
The first argument is a value, the second a generator.
You should use variant to perturb the random generator;
the goal is that different values for the first argument will
lead to different calls to variant. An example will help:
instance CoArbitrary a => CoArbitrary [a] where coarbitrary [] =variant0 coarbitrary (x:xs) =variant1 . coarbitrary (x,xs)
Instances
| CoArbitrary A | |
Defined in Test.QuickCheck.Poly | |
| CoArbitrary B | |
Defined in Test.QuickCheck.Poly | |
| CoArbitrary C | |
Defined in Test.QuickCheck.Poly | |
| CoArbitrary OrdA | |
Defined in Test.QuickCheck.Poly | |
| CoArbitrary OrdB | |
Defined in Test.QuickCheck.Poly | |
| CoArbitrary OrdC | |
Defined in Test.QuickCheck.Poly | |
| CoArbitrary Key | Since: aeson-2.0.3.0 |
Defined in Data.Aeson.Key | |
| CoArbitrary Value | Since: aeson-2.0.3.0 |
Defined in Data.Aeson.Types.Internal | |
| CoArbitrary ByteArray | Since: quickcheck-instances-0.3.28 |
Defined in Test.QuickCheck.Instances.Primitive | |
| CoArbitrary ByteString64 | |
Defined in Data.ByteString.Base64.Type Methods coarbitrary ∷ ByteString64 → Gen b → Gen b Source # | |
| CoArbitrary ByteString | |
Defined in Test.QuickCheck.Instances.ByteString Methods coarbitrary ∷ ByteString → Gen b → Gen b Source # | |
| CoArbitrary ByteString | |
Defined in Test.QuickCheck.Instances.ByteString Methods coarbitrary ∷ ByteString → Gen b → Gen b Source # | |
| CoArbitrary ShortByteString | |
Defined in Test.QuickCheck.Instances.ByteString Methods coarbitrary ∷ ShortByteString → Gen b → Gen b Source # | |
| CoArbitrary IntSet | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Void | |
Defined in Test.QuickCheck.Instances.Void | |
| CoArbitrary All | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Any | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Version | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Newline | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary NewlineMode | |
Defined in Test.QuickCheck.Arbitrary Methods coarbitrary ∷ NewlineMode → Gen b → Gen b Source # | |
| CoArbitrary Int16 | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Int32 | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Int64 | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Int8 | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Word16 | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Word32 | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Word64 | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Word8 | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Ordering | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary CalendarTime | |
Defined in Test.QuickCheck.Instances.OldTime Methods coarbitrary ∷ CalendarTime → Gen b → Gen b Source # | |
| CoArbitrary ClockTime | |
Defined in Test.QuickCheck.Instances.OldTime | |
| CoArbitrary Day | |
Defined in Test.QuickCheck.Instances.OldTime | |
| CoArbitrary Month | |
Defined in Test.QuickCheck.Instances.OldTime | |
| CoArbitrary TimeDiff | |
Defined in Test.QuickCheck.Instances.OldTime | |
| CoArbitrary Scientific | |
Defined in Test.QuickCheck.Instances.Scientific Methods coarbitrary ∷ Scientific → Gen b → Gen b Source # | |
| CoArbitrary Text | |
Defined in Test.QuickCheck.Instances.Text | |
| CoArbitrary Text | |
Defined in Test.QuickCheck.Instances.Text | |
| CoArbitrary ShortText | |
Defined in Test.QuickCheck.Instances.Text.Short | |
| CoArbitrary CalendarDiffDays | |
Defined in Test.QuickCheck.Instances.Time Methods coarbitrary ∷ CalendarDiffDays → Gen b → Gen b Source # | |
| CoArbitrary Day | |
Defined in Test.QuickCheck.Instances.Time | |
| CoArbitrary Month | |
Defined in Test.QuickCheck.Instances.Time | |
| CoArbitrary Quarter | |
Defined in Test.QuickCheck.Instances.Time | |
| CoArbitrary QuarterOfYear | |
Defined in Test.QuickCheck.Instances.Time Methods coarbitrary ∷ QuarterOfYear → Gen b → Gen b Source # | |
| CoArbitrary DayOfWeek | |
Defined in Test.QuickCheck.Instances.Time | |
| CoArbitrary AbsoluteTime | |
Defined in Test.QuickCheck.Instances.Time Methods coarbitrary ∷ AbsoluteTime → Gen b → Gen b Source # | |
| CoArbitrary DiffTime | |
Defined in Test.QuickCheck.Instances.Time | |
| CoArbitrary NominalDiffTime | |
Defined in Test.QuickCheck.Instances.Time Methods coarbitrary ∷ NominalDiffTime → Gen b → Gen b Source # | |
| CoArbitrary SystemTime | |
Defined in Test.QuickCheck.Instances.Time Methods coarbitrary ∷ SystemTime → Gen b → Gen b Source # | |
| CoArbitrary UTCTime | |
Defined in Test.QuickCheck.Instances.Time | |
| CoArbitrary UniversalTime | |
Defined in Test.QuickCheck.Instances.Time Methods coarbitrary ∷ UniversalTime → Gen b → Gen b Source # | |
| CoArbitrary CalendarDiffTime | |
Defined in Test.QuickCheck.Instances.Time Methods coarbitrary ∷ CalendarDiffTime → Gen b → Gen b Source # | |
| CoArbitrary LocalTime | |
Defined in Test.QuickCheck.Instances.Time | |
| CoArbitrary TimeOfDay | |
Defined in Test.QuickCheck.Instances.Time | |
| CoArbitrary TimeZone | |
Defined in Test.QuickCheck.Instances.Time | |
| CoArbitrary ZonedTime | |
Defined in Test.QuickCheck.Instances.Time | |
| CoArbitrary UUID | |
Defined in Test.QuickCheck.Instances.UUID | |
| CoArbitrary Integer | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Natural | |
Defined in Test.QuickCheck.Instances.Natural | |
| CoArbitrary () | |
Defined in Test.QuickCheck.Arbitrary Methods coarbitrary ∷ () → Gen b → Gen b Source # | |
| CoArbitrary Bool | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Char | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Double | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Float | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Int | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary Word | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary v ⇒ CoArbitrary (KeyMap v) | Since: aeson-2.0.3.0 |
Defined in Data.Aeson.KeyMap | |
| CoArbitrary a ⇒ CoArbitrary (Complex a) | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary a ⇒ CoArbitrary (First a) | |
Defined in Test.QuickCheck.Instances.Semigroup | |
| CoArbitrary a ⇒ CoArbitrary (Last a) | |
Defined in Test.QuickCheck.Instances.Semigroup | |
| CoArbitrary a ⇒ CoArbitrary (Max a) | |
Defined in Test.QuickCheck.Instances.Semigroup | |
| CoArbitrary a ⇒ CoArbitrary (Min a) | |
Defined in Test.QuickCheck.Instances.Semigroup | |
| CoArbitrary a ⇒ CoArbitrary (WrappedMonoid a) | |
Defined in Test.QuickCheck.Instances.Semigroup Methods coarbitrary ∷ WrappedMonoid a → Gen b → Gen b Source # | |
| CoArbitrary a ⇒ CoArbitrary (CI a) | |
Defined in Test.QuickCheck.Instances.CaseInsensitive | |
| CoArbitrary a ⇒ CoArbitrary (IntMap a) | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary a ⇒ CoArbitrary (Seq a) | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary a ⇒ CoArbitrary (Set a) | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary a ⇒ CoArbitrary (Tree a) | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary a ⇒ CoArbitrary (NonEmpty a) | |
Defined in Test.QuickCheck.Instances.Semigroup | |
| CoArbitrary a ⇒ CoArbitrary (Identity a) | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary a ⇒ CoArbitrary (First a) | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary a ⇒ CoArbitrary (Last a) | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary a ⇒ CoArbitrary (Dual a) | |
Defined in Test.QuickCheck.Arbitrary | |
| (Arbitrary a, CoArbitrary a) ⇒ CoArbitrary (Endo a) | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary a ⇒ CoArbitrary (Product a) | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary a ⇒ CoArbitrary (Sum a) | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary a ⇒ CoArbitrary (ZipList a) | |
Defined in Test.QuickCheck.Arbitrary | |
| (Integral a, CoArbitrary a) ⇒ CoArbitrary (Ratio a) | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary (Hashed a) | |
Defined in Test.QuickCheck.Instances.Hashable | |
| CoArbitrary a ⇒ CoArbitrary (Maybe a) | Since: quickcheck-instances-0.3.24 |
Defined in Test.QuickCheck.Instances.Strict | |
| CoArbitrary a ⇒ CoArbitrary (HashSet a) | |
| CoArbitrary a ⇒ CoArbitrary (Vector a) | |
Defined in Test.QuickCheck.Instances.Vector | |
| (Prim a, CoArbitrary a) ⇒ CoArbitrary (Vector a) | Since: quickcheck-instances-0.3.32 |
Defined in Test.QuickCheck.Instances.Vector | |
| (Storable a, CoArbitrary a) ⇒ CoArbitrary (Vector a) | |
Defined in Test.QuickCheck.Instances.Vector | |
| CoArbitrary a ⇒ CoArbitrary (Vector a) | Since: quickcheck-instances-0.3.33 |
Defined in Test.QuickCheck.Instances.Vector | |
| (Unbox a, CoArbitrary a) ⇒ CoArbitrary (Vector a) | |
Defined in Test.QuickCheck.Instances.Vector | |
| CoArbitrary a ⇒ CoArbitrary (Maybe a) | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary a ⇒ CoArbitrary (Solo a) | |
Defined in Test.QuickCheck.Instances.Solo | |
| CoArbitrary a ⇒ CoArbitrary [a] | |
Defined in Test.QuickCheck.Arbitrary Methods coarbitrary ∷ [a] → Gen b → Gen b Source # | |
| (Ix i, IArray UArray a, CoArbitrary i, CoArbitrary a) ⇒ CoArbitrary (UArray i a) | |
Defined in Test.QuickCheck.Instances.Array | |
| HasResolution a ⇒ CoArbitrary (Fixed a) | |
Defined in Test.QuickCheck.Arbitrary | |
| (CoArbitrary k, CoArbitrary v) ⇒ CoArbitrary (Map k v) | |
Defined in Test.QuickCheck.Arbitrary | |
| (Ix i, CoArbitrary i, CoArbitrary a) ⇒ CoArbitrary (Array i a) | |
Defined in Test.QuickCheck.Instances.Array | |
| (CoArbitrary a, CoArbitrary b) ⇒ CoArbitrary (Either a b) | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary (Proxy a) | |
Defined in Test.QuickCheck.Instances.Tagged | |
| (CoArbitrary a, CoArbitrary b) ⇒ CoArbitrary (Either a b) | Since: quickcheck-instances-0.3.24 |
Defined in Test.QuickCheck.Instances.Strict | |
| (CoArbitrary a, CoArbitrary b) ⇒ CoArbitrary (These a b) | Since: quickcheck-instances-0.3.24 |
Defined in Test.QuickCheck.Instances.Strict | |
| (CoArbitrary a, CoArbitrary b) ⇒ CoArbitrary (Pair a b) | Since: quickcheck-instances-0.3.24 |
Defined in Test.QuickCheck.Instances.Strict | |
| (CoArbitrary a, CoArbitrary b) ⇒ CoArbitrary (These a b) | Since: quickcheck-instances-0.3.23 |
Defined in Test.QuickCheck.Instances.These | |
| (CoArbitrary k, CoArbitrary v) ⇒ CoArbitrary (HashMap k v) | |
| (CoArbitrary a, CoArbitrary b) ⇒ CoArbitrary (a, b) | |
Defined in Test.QuickCheck.Arbitrary Methods coarbitrary ∷ (a, b) → Gen b0 → Gen b0 Source # | |
| (Arbitrary a, CoArbitrary b) ⇒ CoArbitrary (a → b) | |
Defined in Test.QuickCheck.Arbitrary Methods coarbitrary ∷ (a → b) → Gen b0 → Gen b0 Source # | |
| CoArbitrary a ⇒ CoArbitrary (Const a b) | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary (f a) ⇒ CoArbitrary (Alt f a) | |
Defined in Test.QuickCheck.Arbitrary | |
| CoArbitrary b ⇒ CoArbitrary (Tagged a b) | |
Defined in Test.QuickCheck.Instances.Tagged | |
| CoArbitrary a ⇒ CoArbitrary (Constant a b) | |
Defined in Test.QuickCheck.Arbitrary | |
| (CoArbitrary a, CoArbitrary b, CoArbitrary c) ⇒ CoArbitrary (a, b, c) | |
Defined in Test.QuickCheck.Arbitrary Methods coarbitrary ∷ (a, b, c) → Gen b0 → Gen b0 Source # | |
| (CoArbitrary a, CoArbitrary b, CoArbitrary c, CoArbitrary d) ⇒ CoArbitrary (a, b, c, d) | |
Defined in Test.QuickCheck.Arbitrary Methods coarbitrary ∷ (a, b, c, d) → Gen b0 → Gen b0 Source # | |
| (CoArbitrary a, CoArbitrary b, CoArbitrary c, CoArbitrary d, CoArbitrary e) ⇒ CoArbitrary (a, b, c, d, e) | |
Defined in Test.QuickCheck.Arbitrary Methods coarbitrary ∷ (a, b, c, d, e) → Gen b0 → Gen b0 Source # | |
class Arbitrary2 (f ∷ Type → Type → Type) where Source #
Lifting of the Arbitrary class to binary type constructors.
Minimal complete definition
Methods
liftArbitrary2 ∷ Gen a → Gen b → Gen (f a b) Source #
liftShrink2 ∷ (a → [a]) → (b → [b]) → f a b → [f a b] Source #
Instances
| Arbitrary2 Either | |
Defined in Test.QuickCheck.Arbitrary | |
| Arbitrary2 Either | Since: quickcheck-instances-0.3.24 |
Defined in Test.QuickCheck.Instances.Strict | |
| Arbitrary2 These | Since: quickcheck-instances-0.3.24 |
Defined in Test.QuickCheck.Instances.Strict | |
| Arbitrary2 Pair | Since: quickcheck-instances-0.3.24 |
Defined in Test.QuickCheck.Instances.Strict | |
| Arbitrary2 These | Since: quickcheck-instances-0.3.23 |
Defined in Test.QuickCheck.Instances.These | |
| Arbitrary2 (,) | |
Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary2 ∷ Gen a → Gen b → Gen (a, b) Source # liftShrink2 ∷ (a → [a]) → (b → [b]) → (a, b) → [(a, b)] Source # | |
| Arbitrary2 (Const ∷ Type → Type → Type) | |
Defined in Test.QuickCheck.Arbitrary | |
| Arbitrary2 (Tagged ∷ Type → Type → Type) | |
Defined in Test.QuickCheck.Instances.Tagged | |
| Arbitrary2 (Constant ∷ Type → Type → Type) | |
Defined in Test.QuickCheck.Arbitrary | |
class Arbitrary1 (f ∷ Type → Type) where Source #
Lifting of the Arbitrary class to unary type constructors.
Minimal complete definition
Instances
| Arbitrary1 KeyMap | Since: aeson-2.0.3.0 |
Defined in Data.Aeson.KeyMap | |
| Arbitrary1 First | |
Defined in Test.QuickCheck.Instances.Semigroup | |
| Arbitrary1 Last | |
Defined in Test.QuickCheck.Instances.Semigroup | |
| Arbitrary1 Max | |
Defined in Test.QuickCheck.Instances.Semigroup | |
| Arbitrary1 Min | |
Defined in Test.QuickCheck.Instances.Semigroup | |
| Arbitrary1 WrappedMonoid | |
Defined in Test.QuickCheck.Instances.Semigroup Methods liftArbitrary ∷ Gen a → Gen (WrappedMonoid a) Source # liftShrink ∷ (a → [a]) → WrappedMonoid a → [WrappedMonoid a] Source # | |
| Arbitrary1 IntMap | WARNING: The same warning as for |
Defined in Test.QuickCheck.Arbitrary | |
| Arbitrary1 Seq | |
Defined in Test.QuickCheck.Arbitrary | |
| Arbitrary1 Tree | |
Defined in Test.QuickCheck.Arbitrary | |
| Arbitrary1 NonEmpty | |
Defined in Test.QuickCheck.Instances.Semigroup | |
| Arbitrary1 Identity | |
Defined in Test.QuickCheck.Arbitrary | |
| Arbitrary1 ZipList | |
Defined in Test.QuickCheck.Arbitrary | |
| Arbitrary1 Maybe | Since: quickcheck-instances-0.3.24 |
Defined in Test.QuickCheck.Instances.Strict | |
| Arbitrary1 Vector | |
Defined in Test.QuickCheck.Instances.Vector | |
| Arbitrary1 Maybe | |
Defined in Test.QuickCheck.Arbitrary | |
| Arbitrary1 Solo | |
Defined in Test.QuickCheck.Instances.Solo | |
| Arbitrary1 [] | |
Defined in Test.QuickCheck.Arbitrary | |
| (Ord k, Arbitrary k) ⇒ Arbitrary1 (Map k) | |
Defined in Test.QuickCheck.Arbitrary | |
| (Num i, Ix i, Arbitrary i) ⇒ Arbitrary1 (Array i) | |
Defined in Test.QuickCheck.Instances.Array | |
| Arbitrary a ⇒ Arbitrary1 (Either a) | |
Defined in Test.QuickCheck.Arbitrary | |
| Arbitrary1 (Proxy ∷ Type → Type) | |
Defined in Test.QuickCheck.Instances.Tagged | |
| Arbitrary a ⇒ Arbitrary1 (Either a) | Since: quickcheck-instances-0.3.24 |
Defined in Test.QuickCheck.Instances.Strict | |
| Arbitrary a ⇒ Arbitrary1 (These a) | Since: quickcheck-instances-0.3.24 |
Defined in Test.QuickCheck.Instances.Strict | |
| Arbitrary a ⇒ Arbitrary1 (Pair a) | Since: quickcheck-instances-0.3.24 |
Defined in Test.QuickCheck.Instances.Strict | |
| Arbitrary a ⇒ Arbitrary1 (These a) | Since: quickcheck-instances-0.3.23 |
Defined in Test.QuickCheck.Instances.These | |
| Arbitrary1 f ⇒ Arbitrary1 (Lift f) | |
Defined in Test.QuickCheck.Instances.Transformer | |
| Arbitrary1 m ⇒ Arbitrary1 (MaybeT m) | |
Defined in Test.QuickCheck.Instances.Transformer | |
| (Ord k, Arbitrary k) ⇒ Arbitrary1 (OMap k) | |
Defined in Data.TreeDiff.OMap | |
| (Hashable k, Eq k, Arbitrary k) ⇒ Arbitrary1 (HashMap k) | |
| Arbitrary a ⇒ Arbitrary1 ((,) a) | |
Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary ∷ Gen a0 → Gen (a, a0) Source # liftShrink ∷ (a0 → [a0]) → (a, a0) → [(a, a0)] Source # | |
| Arbitrary a ⇒ Arbitrary1 (Const a ∷ Type → Type) | |
Defined in Test.QuickCheck.Arbitrary | |
| Arbitrary1 (Tagged a) | |
Defined in Test.QuickCheck.Instances.Tagged | |
| (Arbitrary1 f, Arbitrary1 g) ⇒ Arbitrary1 (These1 f g) | Since: quickcheck-instances-0.3.23 |
Defined in Test.QuickCheck.Instances.These | |
| Arbitrary1 f ⇒ Arbitrary1 (Backwards f) | |
Defined in Test.QuickCheck.Instances.Transformer | |
| Arbitrary a ⇒ Arbitrary1 (Constant a ∷ Type → Type) | |
Defined in Test.QuickCheck.Arbitrary | |
| Arbitrary1 f ⇒ Arbitrary1 (Reverse f) | |
Defined in Test.QuickCheck.Instances.Transformer | |
| (Arbitrary1 f, Arbitrary1 g) ⇒ Arbitrary1 (Product f g) | |
Defined in Test.QuickCheck.Arbitrary | |
| (Arbitrary1 f, Arbitrary1 g) ⇒ Arbitrary1 (Sum f g) | |
Defined in Test.QuickCheck.Instances.Transformer | |
| CoArbitrary a ⇒ Arbitrary1 ((->) a) | |
Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary ∷ Gen a0 → Gen (a -> a0) Source # liftShrink ∷ (a0 → [a0]) → (a -> a0) → [a -> a0] Source # | |
| (Arbitrary1 f, Arbitrary1 g) ⇒ Arbitrary1 (Compose f g) | |
Defined in Test.QuickCheck.Arbitrary | |
arbitrary1 ∷ (Arbitrary1 f, Arbitrary a) ⇒ Gen (f a) Source #
shrink1 ∷ (Arbitrary1 f, Arbitrary a) ⇒ f a → [f a] Source #
arbitrary2 ∷ (Arbitrary2 f, Arbitrary a, Arbitrary b) ⇒ Gen (f a b) Source #
genericShrink ∷ (Generic a, RecursivelyShrink (Rep a), GSubterms (Rep a) a) ⇒ a → [a] Source #
Shrink a term to any of its immediate subterms, and also recursively shrink all subterms.
recursivelyShrink ∷ (Generic a, RecursivelyShrink (Rep a)) ⇒ a → [a] Source #
Recursively shrink all immediate subterms.
shrinkList ∷ (a → [a]) → [a] → [[a]] Source #
Shrink a list of values given a shrinking function for individual values.
applyArbitrary2 ∷ (Arbitrary a, Arbitrary b) ⇒ (a → b → r) → Gen r Source #
Apply a binary function to random arguments.
applyArbitrary3 ∷ (Arbitrary a, Arbitrary b, Arbitrary c) ⇒ (a → b → c → r) → Gen r Source #
Apply a ternary function to random arguments.
applyArbitrary4 ∷ (Arbitrary a, Arbitrary b, Arbitrary c, Arbitrary d) ⇒ (a → b → c → d → r) → Gen r Source #
Apply a function of arity 4 to random arguments.
arbitrarySizedIntegral ∷ Integral a ⇒ Gen a Source #
Generates an integral number. The number can be positive or negative and its maximum absolute value depends on the size parameter.
arbitrarySizedNatural ∷ Integral a ⇒ Gen a Source #
Generates a natural number. The number's maximum value depends on the size parameter.
arbitrarySizedFractional ∷ Fractional a ⇒ Gen a Source #
Uniformly generates a fractional number. The number can be positive or negative and its maximum absolute value depends on the size parameter.
arbitraryBoundedIntegral ∷ (Bounded a, Integral a) ⇒ Gen a Source #
Generates an integral number. The number is chosen uniformly from
the entire range of the type. You may want to use
arbitrarySizedBoundedIntegral instead.
arbitraryBoundedRandom ∷ (Bounded a, Random a) ⇒ Gen a Source #
Generates an element of a bounded type. The element is chosen from the entire range of the type.
arbitraryBoundedEnum ∷ (Bounded a, Enum a) ⇒ Gen a Source #
Generates an element of a bounded enumeration.
arbitrarySizedBoundedIntegral ∷ (Bounded a, Integral a) ⇒ Gen a Source #
Generates an integral number from a bounded domain. The number is chosen from the entire range of the type, but small numbers are generated more often than big numbers. Inspired by demands from Phil Wadler.
arbitraryUnicodeChar ∷ Gen Char Source #
Generates any Unicode character (but not a surrogate)
arbitraryASCIIChar ∷ Gen Char Source #
Generates a random ASCII character (0-127).
arbitraryPrintableChar ∷ Gen Char Source #
Generates a printable Unicode character.
shrinkNothing ∷ a → [a] Source #
Returns no shrinking alternatives.
shrinkMap ∷ Arbitrary a ⇒ (a → b) → (b → a) → b → [b] Source #
Map a shrink function to another domain. This is handy if your data type has special invariants, but is almost isomorphic to some other type.
shrinkOrderedList :: (Ord a, Arbitrary a) => [a] -> [[a]] shrinkOrderedList = shrinkMap sort id shrinkSet :: (Ord a, Arbitrary a) => Set a -> [Set a] shrinkSet = shrinkMap fromList toList
shrinkMapBy ∷ (a → b) → (b → a) → (a → [a]) → b → [b] Source #
Non-overloaded version of shrinkMap.
shrinkIntegral ∷ Integral a ⇒ a → [a] Source #
Shrink an integral number.
shrinkBoundedEnum ∷ (Bounded a, Enum a, Eq a) ⇒ a → [a] Source #
Shrink an element of a bounded enumeration.
Example
data MyEnum = E0 | E1 | E2 | E3 | E4 | E5 | E6 | E7 | E8 | E9 deriving (Bounded, Enum, Eq, Ord, Show)
>>>shrinkBoundedEnum E9[E0,E5,E7,E8]
>>>shrinkBoundedEnum E5[E0,E3,E4]
>>>shrinkBoundedEnum E0[]
shrinkRealFrac ∷ RealFrac a ⇒ a → [a] Source #
Shrink a fraction, preferring numbers with smaller
numerators or denominators. See also shrinkDecimal.
shrinkDecimal ∷ RealFrac a ⇒ a → [a] Source #
Shrink a real number, preferring numbers with shorter
decimal representations. See also shrinkRealFrac.
genericCoarbitrary ∷ (Generic a, GCoArbitrary (Rep a)) ⇒ a → Gen b → Gen b Source #
Generic CoArbitrary implementation.
(><) ∷ (Gen a → Gen a) → (Gen a → Gen a) → Gen a → Gen a Source #
Combine two generator perturbing functions, for example the
results of calls to variant or coarbitrary.
coarbitraryIntegral ∷ Integral a ⇒ a → Gen b → Gen b Source #
A coarbitrary implementation for integral numbers.
coarbitraryReal ∷ Real a ⇒ a → Gen b → Gen b Source #
A coarbitrary implementation for real numbers.
coarbitraryShow ∷ Show a ⇒ a → Gen b → Gen b Source #
coarbitrary helper for lazy people :-).
coarbitraryEnum ∷ Enum a ⇒ a → Gen b → Gen b Source #
A coarbitrary implementation for enums.
infiniteList ∷ Arbitrary a ⇒ Gen [a] Source #
Generates an infinite list.
newtype PrintableString Source #
PrintableString: generates a printable unicode String.
The string will not contain surrogate pairs.
Constructors
| PrintableString | |
Fields | |
Instances
| Arbitrary PrintableString | |
Defined in Test.QuickCheck.Modifiers Methods | |
| Read PrintableString | |
Defined in Test.QuickCheck.Modifiers Methods readsPrec ∷ Int → ReadS PrintableString # readList ∷ ReadS [PrintableString] # | |
| Show PrintableString | |
Defined in Test.QuickCheck.Modifiers Methods showsPrec ∷ Int → PrintableString → ShowS # show ∷ PrintableString → String # showList ∷ [PrintableString] → ShowS # | |
| Eq PrintableString | |
Defined in Test.QuickCheck.Modifiers Methods (==) ∷ PrintableString → PrintableString → Bool # (/=) ∷ PrintableString → PrintableString → Bool # | |
| Ord PrintableString | |
Defined in Test.QuickCheck.Modifiers Methods compare ∷ PrintableString → PrintableString → Ordering # (<) ∷ PrintableString → PrintableString → Bool # (<=) ∷ PrintableString → PrintableString → Bool # (>) ∷ PrintableString → PrintableString → Bool # (>=) ∷ PrintableString → PrintableString → Bool # | |
newtype UnicodeString Source #
UnicodeString: generates a unicode String.
The string will not contain surrogate pairs.
Constructors
| UnicodeString | |
Fields | |
Instances
| Arbitrary UnicodeString | |
Defined in Test.QuickCheck.Modifiers | |
| Read UnicodeString | |
Defined in Test.QuickCheck.Modifiers Methods readsPrec ∷ Int → ReadS UnicodeString # readList ∷ ReadS [UnicodeString] # | |
| Show UnicodeString | |
Defined in Test.QuickCheck.Modifiers Methods showsPrec ∷ Int → UnicodeString → ShowS # show ∷ UnicodeString → String # showList ∷ [UnicodeString] → ShowS # | |
| Eq UnicodeString | |
Defined in Test.QuickCheck.Modifiers | |
| Ord UnicodeString | |
Defined in Test.QuickCheck.Modifiers Methods compare ∷ UnicodeString → UnicodeString → Ordering # (<) ∷ UnicodeString → UnicodeString → Bool # (<=) ∷ UnicodeString → UnicodeString → Bool # (>) ∷ UnicodeString → UnicodeString → Bool # (>=) ∷ UnicodeString → UnicodeString → Bool # | |
newtype ASCIIString Source #
ASCIIString: generates an ASCII string.
Constructors
| ASCIIString | |
Fields | |
Instances
| Arbitrary ASCIIString | |
Defined in Test.QuickCheck.Modifiers | |
| Read ASCIIString | |
Defined in Test.QuickCheck.Modifiers Methods readsPrec ∷ Int → ReadS ASCIIString # readList ∷ ReadS [ASCIIString] # | |
| Show ASCIIString | |
Defined in Test.QuickCheck.Modifiers Methods showsPrec ∷ Int → ASCIIString → ShowS # show ∷ ASCIIString → String # showList ∷ [ASCIIString] → ShowS # | |
| Eq ASCIIString | |
Defined in Test.QuickCheck.Modifiers | |
| Ord ASCIIString | |
Defined in Test.QuickCheck.Modifiers Methods compare ∷ ASCIIString → ASCIIString → Ordering # (<) ∷ ASCIIString → ASCIIString → Bool # (<=) ∷ ASCIIString → ASCIIString → Bool # (>) ∷ ASCIIString → ASCIIString → Bool # (>=) ∷ ASCIIString → ASCIIString → Bool # max ∷ ASCIIString → ASCIIString → ASCIIString # min ∷ ASCIIString → ASCIIString → ASCIIString # | |
class ShrinkState s a where Source #
Shrinking _ x: allows for maintaining a state during shrinking.
Constructors
| Shrinking s a |
Smart _ x: tries a different order when shrinking.
Shrink2 x: allows 2 shrinking steps at the same time when shrinking x
Constructors
| Shrink2 | |
Fields
| |
Instances
| Functor Shrink2 | |
| Arbitrary a ⇒ Arbitrary (Shrink2 a) | |
| Enum a ⇒ Enum (Shrink2 a) | |
Defined in Test.QuickCheck.Modifiers | |
| Num a ⇒ Num (Shrink2 a) | |
| Read a ⇒ Read (Shrink2 a) | |
| Integral a ⇒ Integral (Shrink2 a) | |
Defined in Test.QuickCheck.Modifiers | |
| Real a ⇒ Real (Shrink2 a) | |
Defined in Test.QuickCheck.Modifiers Methods toRational ∷ Shrink2 a → Rational # | |
| Show a ⇒ Show (Shrink2 a) | |
| Eq a ⇒ Eq (Shrink2 a) | |
| Ord a ⇒ Ord (Shrink2 a) | |
Defined in Test.QuickCheck.Modifiers | |
Small x: generates values of x drawn from a small range.
The opposite of Large.
Instances
| Functor Small | |
| Integral a ⇒ Arbitrary (Small a) | |
| Enum a ⇒ Enum (Small a) | |
Defined in Test.QuickCheck.Modifiers | |
| Ix a ⇒ Ix (Small a) | |
Defined in Test.QuickCheck.Modifiers | |
| Num a ⇒ Num (Small a) | |
| Read a ⇒ Read (Small a) | |
| Integral a ⇒ Integral (Small a) | |
Defined in Test.QuickCheck.Modifiers | |
| Real a ⇒ Real (Small a) | |
Defined in Test.QuickCheck.Modifiers Methods toRational ∷ Small a → Rational # | |
| Show a ⇒ Show (Small a) | |
| Eq a ⇒ Eq (Small a) | |
| Ord a ⇒ Ord (Small a) | |
Large x: by default, QuickCheck generates Ints drawn from a small
range. Large Int gives you values drawn from the entire range instead.
Instances
| Functor Large | |
| (Integral a, Bounded a) ⇒ Arbitrary (Large a) | |
| Enum a ⇒ Enum (Large a) | |
Defined in Test.QuickCheck.Modifiers | |
| Ix a ⇒ Ix (Large a) | |
Defined in Test.QuickCheck.Modifiers | |
| Num a ⇒ Num (Large a) | |
| Read a ⇒ Read (Large a) | |
| Integral a ⇒ Integral (Large a) | |
Defined in Test.QuickCheck.Modifiers | |
| Real a ⇒ Real (Large a) | |
Defined in Test.QuickCheck.Modifiers Methods toRational ∷ Large a → Rational # | |
| Show a ⇒ Show (Large a) | |
| Eq a ⇒ Eq (Large a) | |
| Ord a ⇒ Ord (Large a) | |
newtype NonPositive a Source #
NonPositive x: guarantees that x <= 0.
Constructors
| NonPositive | |
Fields
| |
Instances
| Functor NonPositive | |
Defined in Test.QuickCheck.Modifiers | |
| (Num a, Ord a, Arbitrary a) ⇒ Arbitrary (NonPositive a) | |
Defined in Test.QuickCheck.Modifiers | |
| Enum a ⇒ Enum (NonPositive a) | |
Defined in Test.QuickCheck.Modifiers Methods succ ∷ NonPositive a → NonPositive a # pred ∷ NonPositive a → NonPositive a # toEnum ∷ Int → NonPositive a # fromEnum ∷ NonPositive a → Int # enumFrom ∷ NonPositive a → [NonPositive a] # enumFromThen ∷ NonPositive a → NonPositive a → [NonPositive a] # enumFromTo ∷ NonPositive a → NonPositive a → [NonPositive a] # enumFromThenTo ∷ NonPositive a → NonPositive a → NonPositive a → [NonPositive a] # | |
| Read a ⇒ Read (NonPositive a) | |
Defined in Test.QuickCheck.Modifiers Methods readsPrec ∷ Int → ReadS (NonPositive a) # readList ∷ ReadS [NonPositive a] # readPrec ∷ ReadPrec (NonPositive a) # readListPrec ∷ ReadPrec [NonPositive a] # | |
| Show a ⇒ Show (NonPositive a) | |
Defined in Test.QuickCheck.Modifiers Methods showsPrec ∷ Int → NonPositive a → ShowS # show ∷ NonPositive a → String # showList ∷ [NonPositive a] → ShowS # | |
| Eq a ⇒ Eq (NonPositive a) | |
Defined in Test.QuickCheck.Modifiers | |
| Ord a ⇒ Ord (NonPositive a) | |
Defined in Test.QuickCheck.Modifiers Methods compare ∷ NonPositive a → NonPositive a → Ordering # (<) ∷ NonPositive a → NonPositive a → Bool # (<=) ∷ NonPositive a → NonPositive a → Bool # (>) ∷ NonPositive a → NonPositive a → Bool # (>=) ∷ NonPositive a → NonPositive a → Bool # max ∷ NonPositive a → NonPositive a → NonPositive a # min ∷ NonPositive a → NonPositive a → NonPositive a # | |
newtype NonNegative a Source #
NonNegative x: guarantees that x >= 0.
Constructors
| NonNegative | |
Fields
| |
Instances
| Functor NonNegative | |
Defined in Test.QuickCheck.Modifiers | |
| (Num a, Ord a, Arbitrary a) ⇒ Arbitrary (NonNegative a) | |
Defined in Test.QuickCheck.Modifiers | |
| Enum a ⇒ Enum (NonNegative a) | |
Defined in Test.QuickCheck.Modifiers Methods succ ∷ NonNegative a → NonNegative a # pred ∷ NonNegative a → NonNegative a # toEnum ∷ Int → NonNegative a # fromEnum ∷ NonNegative a → Int # enumFrom ∷ NonNegative a → [NonNegative a] # enumFromThen ∷ NonNegative a → NonNegative a → [NonNegative a] # enumFromTo ∷ NonNegative a → NonNegative a → [NonNegative a] # enumFromThenTo ∷ NonNegative a → NonNegative a → NonNegative a → [NonNegative a] # | |
| Read a ⇒ Read (NonNegative a) | |
Defined in Test.QuickCheck.Modifiers Methods readsPrec ∷ Int → ReadS (NonNegative a) # readList ∷ ReadS [NonNegative a] # readPrec ∷ ReadPrec (NonNegative a) # readListPrec ∷ ReadPrec [NonNegative a] # | |
| Show a ⇒ Show (NonNegative a) | |
Defined in Test.QuickCheck.Modifiers Methods showsPrec ∷ Int → NonNegative a → ShowS # show ∷ NonNegative a → String # showList ∷ [NonNegative a] → ShowS # | |
| Eq a ⇒ Eq (NonNegative a) | |
Defined in Test.QuickCheck.Modifiers | |
| Ord a ⇒ Ord (NonNegative a) | |
Defined in Test.QuickCheck.Modifiers Methods compare ∷ NonNegative a → NonNegative a → Ordering # (<) ∷ NonNegative a → NonNegative a → Bool # (<=) ∷ NonNegative a → NonNegative a → Bool # (>) ∷ NonNegative a → NonNegative a → Bool # (>=) ∷ NonNegative a → NonNegative a → Bool # max ∷ NonNegative a → NonNegative a → NonNegative a # min ∷ NonNegative a → NonNegative a → NonNegative a # | |
NonZero x: guarantees that x /= 0.
Constructors
| NonZero | |
Fields
| |
Instances
| Functor NonZero | |
| (Num a, Eq a, Arbitrary a) ⇒ Arbitrary (NonZero a) | |
| Enum a ⇒ Enum (NonZero a) | |
Defined in Test.QuickCheck.Modifiers | |
| Read a ⇒ Read (NonZero a) | |
| Show a ⇒ Show (NonZero a) | |
| Eq a ⇒ Eq (NonZero a) | |
| Ord a ⇒ Ord (NonZero a) | |
Defined in Test.QuickCheck.Modifiers | |
Negative x: guarantees that x < 0.
Constructors
| Negative | |
Fields
| |
Instances
| Functor Negative | |
| (Num a, Ord a, Arbitrary a) ⇒ Arbitrary (Negative a) | |
| Enum a ⇒ Enum (Negative a) | |
Defined in Test.QuickCheck.Modifiers | |
| Read a ⇒ Read (Negative a) | |
| Show a ⇒ Show (Negative a) | |
| Eq a ⇒ Eq (Negative a) | |
| Ord a ⇒ Ord (Negative a) | |
Defined in Test.QuickCheck.Modifiers | |
Positive x: guarantees that x > 0.
Constructors
| Positive | |
Fields
| |
Instances
| Functor Positive | |
| (Num a, Ord a, Arbitrary a) ⇒ Arbitrary (Positive a) | |
| Enum a ⇒ Enum (Positive a) | |
Defined in Test.QuickCheck.Modifiers | |
| Read a ⇒ Read (Positive a) | |
| Show a ⇒ Show (Positive a) | |
| Eq a ⇒ Eq (Positive a) | |
| Ord a ⇒ Ord (Positive a) | |
Defined in Test.QuickCheck.Modifiers | |
newtype SortedList a Source #
Sorted xs: guarantees that xs is sorted.
Instances
| Functor SortedList | |
Defined in Test.QuickCheck.Modifiers | |
| (Arbitrary a, Ord a) ⇒ Arbitrary (SortedList a) | |
Defined in Test.QuickCheck.Modifiers | |
| Read a ⇒ Read (SortedList a) | |
Defined in Test.QuickCheck.Modifiers Methods readsPrec ∷ Int → ReadS (SortedList a) # readList ∷ ReadS [SortedList a] # readPrec ∷ ReadPrec (SortedList a) # readListPrec ∷ ReadPrec [SortedList a] # | |
| Show a ⇒ Show (SortedList a) | |
Defined in Test.QuickCheck.Modifiers Methods showsPrec ∷ Int → SortedList a → ShowS # show ∷ SortedList a → String # showList ∷ [SortedList a] → ShowS # | |
| Eq a ⇒ Eq (SortedList a) | |
Defined in Test.QuickCheck.Modifiers | |
| Ord a ⇒ Ord (SortedList a) | |
Defined in Test.QuickCheck.Modifiers Methods compare ∷ SortedList a → SortedList a → Ordering # (<) ∷ SortedList a → SortedList a → Bool # (<=) ∷ SortedList a → SortedList a → Bool # (>) ∷ SortedList a → SortedList a → Bool # (>=) ∷ SortedList a → SortedList a → Bool # max ∷ SortedList a → SortedList a → SortedList a # min ∷ SortedList a → SortedList a → SortedList a # | |
data InfiniteList a Source #
InfiniteList xs _: guarantees that xs is an infinite list.
When a counterexample is found, only prints the prefix of xs
that was used by the program.
Here is a contrived example property:
prop_take_10 :: InfiniteList Char -> Bool prop_take_10 (InfiniteList xs _) = or [ x == 'a' | x <- take 10 xs ]
In the following counterexample, the list must start with "bbbbbbbbbb" but
the remaining (infinite) part can contain anything:
>>>quickCheck prop_take_10*** Failed! Falsified (after 1 test and 14 shrinks): "bbbbbbbbbb" ++ ...
Constructors
| InfiniteList | |
Fields
| |
Instances
| Arbitrary a ⇒ Arbitrary (InfiniteList a) | |
Defined in Test.QuickCheck.Modifiers | |
| Show a ⇒ Show (InfiniteList a) | |
Defined in Test.QuickCheck.Modifiers Methods showsPrec ∷ Int → InfiniteList a → ShowS # show ∷ InfiniteList a → String # showList ∷ [InfiniteList a] → ShowS # | |
newtype OrderedList a Source #
Ordered xs: guarantees that xs is ordered.
Constructors
| Ordered | |
Fields
| |
Instances
| Functor OrderedList | |
Defined in Test.QuickCheck.Modifiers | |
| (Ord a, Arbitrary a) ⇒ Arbitrary (OrderedList a) | |
Defined in Test.QuickCheck.Modifiers | |
| Read a ⇒ Read (OrderedList a) | |
Defined in Test.QuickCheck.Modifiers Methods readsPrec ∷ Int → ReadS (OrderedList a) # readList ∷ ReadS [OrderedList a] # readPrec ∷ ReadPrec (OrderedList a) # readListPrec ∷ ReadPrec [OrderedList a] # | |
| Show a ⇒ Show (OrderedList a) | |
Defined in Test.QuickCheck.Modifiers Methods showsPrec ∷ Int → OrderedList a → ShowS # show ∷ OrderedList a → String # showList ∷ [OrderedList a] → ShowS # | |
| Eq a ⇒ Eq (OrderedList a) | |
Defined in Test.QuickCheck.Modifiers | |
| Ord a ⇒ Ord (OrderedList a) | |
Defined in Test.QuickCheck.Modifiers Methods compare ∷ OrderedList a → OrderedList a → Ordering # (<) ∷ OrderedList a → OrderedList a → Bool # (<=) ∷ OrderedList a → OrderedList a → Bool # (>) ∷ OrderedList a → OrderedList a → Bool # (>=) ∷ OrderedList a → OrderedList a → Bool # max ∷ OrderedList a → OrderedList a → OrderedList a # min ∷ OrderedList a → OrderedList a → OrderedList a # | |
Fixed x: as x, but will not be shrunk.
Instances
| Functor Fixed | |
| Arbitrary a ⇒ Arbitrary (Fixed a) | |
| Enum a ⇒ Enum (Fixed a) | |
Defined in Test.QuickCheck.Modifiers | |
| Num a ⇒ Num (Fixed a) | |
| Read a ⇒ Read (Fixed a) | |
| Integral a ⇒ Integral (Fixed a) | |
Defined in Test.QuickCheck.Modifiers | |
| Real a ⇒ Real (Fixed a) | |
Defined in Test.QuickCheck.Modifiers Methods toRational ∷ Fixed a → Rational # | |
| Show a ⇒ Show (Fixed a) | |
| Eq a ⇒ Eq (Fixed a) | |
| Ord a ⇒ Ord (Fixed a) | |
Blind x: as x, but x does not have to be in the Show class.
Instances
| Functor Blind | |
| Arbitrary a ⇒ Arbitrary (Blind a) | |
| Enum a ⇒ Enum (Blind a) | |
Defined in Test.QuickCheck.Modifiers | |
| Num a ⇒ Num (Blind a) | |
| Integral a ⇒ Integral (Blind a) | |
Defined in Test.QuickCheck.Modifiers | |
| Real a ⇒ Real (Blind a) | |
Defined in Test.QuickCheck.Modifiers Methods toRational ∷ Blind a → Rational # | |
| Show (Blind a) | |
| Eq a ⇒ Eq (Blind a) | |
| Ord a ⇒ Ord (Blind a) | |
class Function a where Source #
The class Function a is used for random generation of showable
functions of type a -> b.
There is a default implementation for function, which you can use
if your type has structural equality. Otherwise, you can normally
use functionMap or functionShow.
Minimal complete definition
Nothing
Methods
Instances
| Function A | |
| Function B | |
| Function C | |
| Function OrdA | |
| Function OrdB | |
| Function OrdC | |
| Function Key | Since: aeson-2.0.3.0 |
| Function Value | Since: aeson-2.0.3.0 |
| Function ByteArray | Since: quickcheck-instances-0.3.28 |
| Function ByteString64 | |
Defined in Data.ByteString.Base64.Type Methods function ∷ (ByteString64 → b) → ByteString64 :-> b Source # | |
| Function ByteString | |
Defined in Test.QuickCheck.Instances.ByteString Methods function ∷ (ByteString → b) → ByteString :-> b Source # | |
| Function ByteString | |
Defined in Test.QuickCheck.Instances.ByteString Methods function ∷ (ByteString → b) → ByteString :-> b Source # | |
| Function ShortByteString | |
Defined in Test.QuickCheck.Instances.ByteString Methods function ∷ (ShortByteString → b) → ShortByteString :-> b Source # | |
| Function IntSet | |
| Function Void | |
| Function All | |
| Function Any | |
| Function Newline | |
| Function NewlineMode | |
Defined in Test.QuickCheck.Function Methods function ∷ (NewlineMode → b) → NewlineMode :-> b Source # | |
| Function Int16 | |
| Function Int32 | |
| Function Int64 | |
| Function Int8 | |
| Function Word16 | |
| Function Word32 | |
| Function Word64 | |
| Function Word8 | |
| Function Ordering | |
| Function Scientific | |
Defined in Test.QuickCheck.Instances.Scientific Methods function ∷ (Scientific → b) → Scientific :-> b Source # | |
| Function Text | |
| Function Text | |
| Function ShortText | |
| Function CalendarDiffDays | |
Defined in Test.QuickCheck.Instances.Time Methods function ∷ (CalendarDiffDays → b) → CalendarDiffDays :-> b Source # | |
| Function Day | |
| Function Month | |
| Function Quarter | |
| Function QuarterOfYear | |
Defined in Test.QuickCheck.Instances.Time Methods function ∷ (QuarterOfYear → b) → QuarterOfYear :-> b Source # | |
| Function DayOfWeek | |
| Function DiffTime | |
| Function NominalDiffTime | |
Defined in Test.QuickCheck.Instances.Time Methods function ∷ (NominalDiffTime → b) → NominalDiffTime :-> b Source # | |
| Function SystemTime | |
Defined in Test.QuickCheck.Instances.Time Methods function ∷ (SystemTime → b) → SystemTime :-> b Source # | |
| Function UTCTime | |
| Function CalendarDiffTime | |
Defined in Test.QuickCheck.Instances.Time Methods function ∷ (CalendarDiffTime → b) → CalendarDiffTime :-> b Source # | |
| Function UUID | |
| Function Integer | |
| Function Natural | |
| Function () | |
Defined in Test.QuickCheck.Function | |
| Function Bool | |
| Function Char | |
| Function Double | |
| Function Float | |
| Function Int | |
| Function Word | |
| Function v ⇒ Function (KeyMap v) | Since: aeson-2.0.3.0 |
| (RealFloat a, Function a) ⇒ Function (Complex a) | |
| Function a ⇒ Function (First a) | |
| Function a ⇒ Function (Last a) | |
| Function a ⇒ Function (Max a) | |
| Function a ⇒ Function (Min a) | |
| Function a ⇒ Function (WrappedMonoid a) | |
Defined in Test.QuickCheck.Instances.Semigroup Methods function ∷ (WrappedMonoid a → b) → WrappedMonoid a :-> b Source # | |
| (FoldCase a, Function a) ⇒ Function (CI a) | |
| Function a ⇒ Function (IntMap a) | |
| Function a ⇒ Function (Seq a) | |
| (Ord a, Function a) ⇒ Function (Set a) | |
| Function a ⇒ Function (Tree a) | |
| Function a ⇒ Function (NonEmpty a) | |
| Function a ⇒ Function (Identity a) | |
| Function a ⇒ Function (First a) | |
| Function a ⇒ Function (Last a) | |
| Function a ⇒ Function (Dual a) | |
| Function a ⇒ Function (Product a) | |
| Function a ⇒ Function (Sum a) | |
| (Integral a, Function a) ⇒ Function (Ratio a) | |
| Function a ⇒ Function (Maybe a) | Since: quickcheck-instances-0.3.24 |
| (Hashable a, Eq a, Function a) ⇒ Function (HashSet a) | |
| Function a ⇒ Function (Vector a) | |
| (Prim a, Function a) ⇒ Function (Vector a) | Since: quickcheck-instances-0.3.32 |
| (Storable a, Function a) ⇒ Function (Vector a) | |
| Function a ⇒ Function (Vector a) | Since: quickcheck-instances-0.3.33 |
| (Unbox a, Function a) ⇒ Function (Vector a) | |
| Function a ⇒ Function (Maybe a) | |
| Function a ⇒ Function (Solo a) | |
| Function a ⇒ Function [a] | |
Defined in Test.QuickCheck.Function | |
| HasResolution a ⇒ Function (Fixed a) | |
| (Ord a, Function a, Function b) ⇒ Function (Map a b) | |
| (Function a, Function b) ⇒ Function (Either a b) | |
| Function (Proxy a) | |
| (Function a, Function b) ⇒ Function (Either a b) | Since: quickcheck-instances-0.3.24 |
| (Function a, Function b) ⇒ Function (These a b) | Since: quickcheck-instances-0.3.24 |
| (Function a, Function b) ⇒ Function (Pair a b) | Since: quickcheck-instances-0.3.24 |
| (Function a, Function b) ⇒ Function (These a b) | Since: quickcheck-instances-0.3.23 |
| (Hashable k, Eq k, Function k, Function v) ⇒ Function (HashMap k v) | |
| (Function a, Function b) ⇒ Function (a, b) | |
Defined in Test.QuickCheck.Function | |
| Function a ⇒ Function (Const a b) | |
| Function (f a) ⇒ Function (Alt f a) | |
| Function b ⇒ Function (Tagged a b) | |
| (Function a, Function b, Function c) ⇒ Function (a, b, c) | |
Defined in Test.QuickCheck.Function | |
| (Function a, Function b, Function c, Function d) ⇒ Function (a, b, c, d) | |
Defined in Test.QuickCheck.Function | |
| (Function a, Function b, Function c, Function d, Function e) ⇒ Function (a, b, c, d, e) | |
Defined in Test.QuickCheck.Function | |
| (Function a, Function b, Function c, Function d, Function e, Function f) ⇒ Function (a, b, c, d, e, f) | |
Defined in Test.QuickCheck.Function | |
| (Function a, Function b, Function c, Function d, Function e, Function f, Function g) ⇒ Function (a, b, c, d, e, f, g) | |
Defined in Test.QuickCheck.Function | |
pattern Fn2 ∷ (a → b → c) → Fun (a, b) c Source #
A modifier for testing binary functions.
prop_zipWith :: Fun (Int, Bool) Char -> [Int] -> [Bool] -> Bool prop_zipWith (Fn2 f) xs ys = zipWith f xs ys == [ f x y | (x, y) <- zip xs ys]
pattern Fn ∷ (a → b) → Fun a b Source #
A modifier for testing functions.
prop :: Fun String Integer -> Bool
prop (Fn f) = f "banana" == f "monkey"
|| f "banana" == f "elephant"functionRealFrac ∷ RealFrac a ⇒ (a → b) → a :-> b Source #
functionIntegral ∷ Integral a ⇒ (a → b) → a :-> b Source #
functionVoid ∷ (∀ b. void → b) → void :-> c Source #
functionMap ∷ Function b ⇒ (a → b) → (b → a) → (a → c) → a :-> c Source #
applyFun ∷ Fun a b → a → b Source #
Extracts the value of a function.
Fn is the pattern equivalent of this function.
prop :: Fun String Integer -> Bool
prop f = applyFun f "banana" == applyFun f "monkey"
|| applyFun f "banana" == applyFun f "elephant"applyFun2 ∷ Fun (a, b) c → a → b → c Source #
Extracts the value of a binary function.
Fn2 is the pattern equivalent of this function.
prop_zipWith :: Fun (Int, Bool) Char -> [Int] -> [Bool] -> Bool prop_zipWith f xs ys = zipWith (applyFun2 f) xs ys == [ applyFun2 f x y | (x, y) <- zip xs ys]
applyFun3 ∷ Fun (a, b, c) d → a → b → c → d Source #
Extracts the value of a ternary function. Fn3 is the
pattern equivalent of this function.
data Confidence Source #
The statistical parameters used by checkCoverage.
Constructors
| Confidence | |
Fields
| |
Instances
| Show Confidence | |
Defined in Test.QuickCheck.State Methods showsPrec ∷ Int → Confidence → ShowS # show ∷ Confidence → String # showList ∷ [Confidence] → ShowS # | |
If a property returns Discard, the current test case is discarded,
the same as if a precondition was false.
An example is the definition of ==>:
(==>) :: Testable prop => Bool -> prop -> Property False ==> _ = property Discard True ==> p = property p
Constructors
| Discard |
The type of properties.
Instances
| Testable Property | |||||
| Example Property | |||||
Defined in Test.Hspec.Core.QuickCheck Associated Types
Methods evaluateExample ∷ Property → Params → (ActionWith (Arg Property) → IO ()) → ProgressCallback → IO Result Source # | |||||
| Example (a → Property) | |||||
Defined in Test.Hspec.Core.QuickCheck Associated Types
Methods evaluateExample ∷ (a → Property) → Params → (ActionWith (Arg (a → Property)) → IO ()) → ProgressCallback → IO Result Source # | |||||
| type Arg Property | |||||
Defined in Test.Hspec.Core.QuickCheck | |||||
| type Arg (a → Property) | |||||
Defined in Test.Hspec.Core.QuickCheck | |||||
ioProperty ∷ Testable prop ⇒ IO prop → Property Source #
Do I/O inside a property.
Warning: any random values generated inside of the argument to ioProperty
will not currently be shrunk. For best results, generate all random values
before calling ioProperty, or use idempotentIOProperty if that is safe.
idempotentIOProperty ∷ Testable prop ⇒ IO prop → Property Source #
Do I/O inside a property.
Warning: during shrinking, the I/O may not always be re-executed.
Instead, the I/O may be executed once and then its result retained.
If this is not acceptable, use ioProperty instead.
coerceWitness ∷ Typeable a ⇒ Witness → a Source #
mapSize ∷ Testable prop ⇒ (Int → Int) → prop → Property Source #
Adjust the test case size for a property, by transforming it with the given function.
Arguments
| ∷ Testable prop | |
| ⇒ (a → [a]) |
|
| → a | The original argument |
| → (a → prop) | |
| → Property |
Shrinks the argument to a property if it fails. Shrinking is done automatically for most types. This function is only needed when you want to override the default behavior.
noShrinking ∷ Testable prop ⇒ prop → Property Source #
Disables shrinking for a property altogether.
Only quantification inside the call to noShrinking is affected.
counterexample ∷ Testable prop ⇒ String → prop → Property Source #
Adds the given string to the counterexample if the property fails.
printTestCase ∷ Testable prop ⇒ String → prop → Property Source #
Adds the given string to the counterexample if the property fails.
whenFail ∷ Testable prop ⇒ IO () → prop → Property Source #
Performs an IO action after the last failure of a property.
whenFail' ∷ Testable prop ⇒ IO () → prop → Property Source #
Performs an IO action every time a property fails. Thus,
if shrinking is done, this can be used to keep track of the
failures along the way.
verbose ∷ Testable prop ⇒ prop → Property Source #
Prints out the generated test case every time the property is tested.
Only variables quantified over inside the verbose are printed.
Note: for technical reasons, the test case is printed out after
the property is tested. To debug a property that goes into an
infinite loop, use within to add a timeout instead.
verboseShrinking ∷ Testable prop ⇒ prop → Property Source #
Prints out the generated test case every time the property fails, including during shrinking.
Only variables quantified over inside the verboseShrinking are printed.
Note: for technical reasons, the test case is printed out after
the property is tested. To debug a property that goes into an
infinite loop, use within to add a timeout instead.
expectFailure ∷ Testable prop ⇒ prop → Property Source #
Indicates that a property is supposed to fail. QuickCheck will report an error if it does not fail.
once ∷ Testable prop ⇒ prop → Property Source #
Modifies a property so that it only will be tested once.
Opposite of again.
again ∷ Testable prop ⇒ prop → Property Source #
Modifies a property so that it will be tested repeatedly.
Opposite of once.
withMaxSuccess ∷ Testable prop ⇒ Int → prop → Property Source #
Configures how many times a property will be tested.
For example,
quickCheck (withMaxSuccess 1000 p)
will test p up to 1000 times.
withDiscardRatio ∷ Testable prop ⇒ Int → prop → Property Source #
Configures how many times a property is allowed to be discarded before failing.
For example,
quickCheck (withDiscardRatio 10 p)
will allow p to fail up to 10 times per successful test.
withMaxShrinks ∷ Testable prop ⇒ Int → prop → Property Source #
Configure the maximum number of times a property will be shrunk.
For example,
quickCheck (withMaxShrinks 100 p)
will cause p to only attempt 100 shrinks on failure.
withMaxSize ∷ Testable prop ⇒ Int → prop → Property Source #
Configure the maximum size a property will be tested at.
witness ∷ (Typeable a, Show a, Testable prop) ⇒ a → prop → Property Source #
Return a value in the witnesses field of the Result returned by quickCheckResult. Witnesses
are returned outer-most first.
In ghci, for example:
>>>[Wit x] <- fmap witnesses . quickCheckResult $ \ x -> witness x $ x == (0 :: Int)*** Failed! Falsified (after 2 tests): 1>>>x1>>>:t xx :: Int
checkCoverage ∷ Testable prop ⇒ prop → Property Source #
Check that all coverage requirements defined by cover and coverTable
are met, using a statistically sound test, and fail if they are not met.
Ordinarily, a failed coverage check does not cause the property to fail.
This is because the coverage requirement is not tested in a statistically
sound way. If you use cover to express that a certain value must appear 20%
of the time, QuickCheck will warn you if the value only appears in 19 out of
100 test cases - but since the coverage varies randomly, you may have just
been unlucky, and there may not be any real problem with your test
generation.
When you use checkCoverage, QuickCheck uses a statistical test to account
for the role of luck in coverage failures. It will run as many tests as
needed until it is sure about whether the coverage requirements are met. If a
coverage requirement is not met, the property fails.
Example:
quickCheck (checkCoverage prop_foo)
checkCoverageWith ∷ Testable prop ⇒ Confidence → prop → Property Source #
Check coverage requirements using a custom confidence level.
See stdConfidence.
An example of making the statistical test less stringent in order to improve performance:
quickCheck (checkCoverageWith stdConfidence{certainty = 10^6} prop_foo)stdConfidence ∷ Confidence Source #
The standard parameters used by checkCoverage: certainty = 10^9,
tolerance = 0.9. See Confidence for the meaning of the parameters.
label ∷ Testable prop ⇒ String → prop → Property Source #
Attaches a label to a test case. This is used for reporting test case distribution.
For example:
prop_reverse_reverse :: [Int] -> Property
prop_reverse_reverse xs =
label ("length of input is " ++ show (length xs)) $
reverse (reverse xs) === xs>>>quickCheck prop_reverse_reverse+++ OK, passed 100 tests: 7% length of input is 7 6% length of input is 3 5% length of input is 4 4% length of input is 6 ...
Each use of label in your property results in a separate
table of test case distribution in the output. If this is
not what you want, use tabulate.
collect ∷ (Show a, Testable prop) ⇒ a → prop → Property Source #
Attaches a label to a test case. This is used for reporting test case distribution.
collect x = label (show x)
For example:
prop_reverse_reverse :: [Int] -> Property
prop_reverse_reverse xs =
collect (length xs) $
reverse (reverse xs) === xs>>>quickCheck prop_reverse_reverse+++ OK, passed 100 tests: 7% 7 6% 3 5% 4 4% 6 ...
Each use of collect in your property results in a separate
table of test case distribution in the output. If this is
not what you want, use tabulate.
Arguments
| ∷ Testable prop | |
| ⇒ Bool |
|
| → String | Label. |
| → prop | |
| → Property |
Reports how many test cases satisfy a given condition.
For example:
prop_sorted_sort :: [Int] -> Property prop_sorted_sort xs = sorted xs ==> classify (length xs > 1) "non-trivial" $ sort xs === xs
>>>quickCheck prop_sorted_sort+++ OK, passed 100 tests (22% non-trivial).
Arguments
| ∷ Testable prop | |
| ⇒ Double | The required percentage (0-100) of test cases. |
| → Bool |
|
| → String | Label for the test case class. |
| → prop | |
| → Property |
Checks that at least the given proportion of successful test cases belong to the given class. Discarded tests (i.e. ones with a false precondition) do not affect coverage.
Note: If the coverage check fails, QuickCheck prints out a warning, but
the property does not fail. To make the property fail, use checkCoverage.
For example:
prop_sorted_sort :: [Int] -> Property prop_sorted_sort xs = sorted xs ==> cover 50 (length xs > 1) "non-trivial" $ sort xs === xs
>>>quickCheck prop_sorted_sort+++ OK, passed 100 tests; 135 discarded (26% non-trivial). Only 26% non-trivial, but expected 50%
tabulate ∷ Testable prop ⇒ String → [String] → prop → Property Source #
Collects information about test case distribution into a table.
The arguments to tabulate are the table's name and a list of values
associated with the current test case. After testing, QuickCheck prints the
frequency of all collected values. The frequencies are expressed as a
percentage of the total number of values collected.
You should prefer tabulate to label when each test case is associated
with a varying number of values. Here is a (not terribly useful) example,
where the test data is a list of integers and we record all values that
occur in the list:
prop_sorted_sort :: [Int] -> Property prop_sorted_sort xs = sorted xs ==> tabulate "List elements" (map show xs) $ sort xs === xs
>>>quickCheck prop_sorted_sort+++ OK, passed 100 tests; 1684 discarded. List elements (109 in total): 3.7% 0 3.7% 17 3.7% 2 3.7% 6 2.8% -6 2.8% -7
Here is a more useful example. We are testing a chatroom, where the user can log in, log out, or send a message:
data Command = LogIn | LogOut | SendMessage String deriving (Data, Show) instance Arbitrary Command where ...
There are some restrictions on command sequences; for example, the user must
log in before doing anything else. The function valid :: [Command] -> Bool
checks that a command sequence is allowed. Our property then has the form:
prop_chatroom :: [Command] -> Property
prop_chatroom cmds =
valid cmds ==>
...The use of ==> may skew test case distribution. We use collect to see the
length of the command sequences, and tabulate to get the frequencies of the
individual commands:
prop_chatroom :: [Command] -> Property
prop_chatroom cmds =
wellFormed cmds LoggedOut ==>
'collect' (length cmds) $
'tabulate' "Commands" (map (show . 'Data.Data.toConstr') cmds) $
...>>>quickCheckWith stdArgs{maxDiscardRatio = 1000} prop_chatroom+++ OK, passed 100 tests; 2775 discarded: 60% 0 20% 1 15% 2 3% 3 1% 4 1% 5 Commands (68 in total): 62% LogIn 22% SendMessage 16% LogOut
coverTable ∷ Testable prop ⇒ String → [(String, Double)] → prop → Property Source #
Checks that the values in a given table appear a certain proportion of
the time. A call to coverTable table [(x1, p1), ..., (xn, pn)] asserts
that of the values in table, x1 should appear at least p1 percent of
the time that table appears, x2 at least p2 percent of the time that
table appears, and so on.
Note: If the coverage check fails, QuickCheck prints out a warning, but
the property does not fail. To make the property fail, use checkCoverage.
Continuing the example from the tabular combinator...
data Command = LogIn | LogOut | SendMessage String deriving (Data, Show)
prop_chatroom :: [Command] -> Property
prop_chatroom cmds =
wellFormed cmds LoggedOut ==>
'tabulate' "Commands" (map (show . 'Data.Data.toConstr') cmds) $
......we can add a coverage requirement as follows, which checks that LogIn,
LogOut and SendMessage each occur at least 25% of the time:
prop_chatroom :: [Command] -> Property
prop_chatroom cmds =
wellFormed cmds LoggedOut ==>
coverTable "Commands" [("LogIn", 25), ("LogOut", 25), ("SendMessage", 25)] $
'tabulate' "Commands" (map (show . 'Data.Data.toConstr') cmds) $
... property goes here ...>>>quickCheck prop_chatroom+++ OK, passed 100 tests; 2909 discarded: 56% 0 17% 1 10% 2 6% 3 5% 4 3% 5 3% 7 Commands (111 in total): 51.4% LogIn 30.6% SendMessage 18.0% LogOut Table 'Commands' had only 18.0% LogOut, but expected 25.0%
within ∷ Testable prop ⇒ Int → prop → Property Source #
Considers a property failed if it does not complete within the given number of microseconds.
Note: if the property times out, variables quantified inside the
within will not be printed. Therefore, you should use within
only in the body of your property.
Good: prop_foo a b c = within 1000000 ...
Bad: prop_foo = within 1000000 $ \a b c -> ...
Bad: prop_foo a b c = ...; main = quickCheck (within 1000000 prop_foo)
discardAfter ∷ Testable prop ⇒ Int → prop → Property Source #
Discards the test case if it does not complete within the given number of microseconds. This can be useful when testing algorithms that have pathological cases where they run extremely slowly.
forAll ∷ (Show a, Testable prop) ⇒ Gen a → (a → prop) → Property Source #
Explicit universal quantification: uses an explicitly given test case generator.
forAllShow ∷ Testable prop ⇒ Gen a → (a → String) → (a → prop) → Property Source #
Like forAll, but with an explicitly given show function.
forAllBlind ∷ Testable prop ⇒ Gen a → (a → prop) → Property Source #
Like forAll, but without printing the generated value.
forAllShrink ∷ (Show a, Testable prop) ⇒ Gen a → (a → [a]) → (a → prop) → Property Source #
Like forAll, but tries to shrink the argument for failing test cases.
forAllShrinkShow ∷ Testable prop ⇒ Gen a → (a → [a]) → (a → String) → (a → prop) → Property Source #
Like forAllShrink, but with an explicitly given show function.
forAllShrinkBlind ∷ Testable prop ⇒ Gen a → (a → [a]) → (a → prop) → Property Source #
Like forAllShrink, but without printing the generated value.
(.&.) ∷ (Testable prop1, Testable prop2) ⇒ prop1 → prop2 → Property infixr 1 Source #
Nondeterministic choice: p1 .&. p2 picks randomly one of
p1 and p2 to test. If you test the property 100 times it
makes 100 random choices.
(.&&.) ∷ (Testable prop1, Testable prop2) ⇒ prop1 → prop2 → Property infixr 1 Source #
Conjunction: p1 .&&. p2 passes if both p1 and p2 pass.
(.||.) ∷ (Testable prop1, Testable prop2) ⇒ prop1 → prop2 → Property infixr 1 Source #
Disjunction: p1 .||. p2 passes unless p1 and p2 simultaneously fail.
(===) ∷ (Eq a, Show a) ⇒ a → a → Property infix 4 Source #
Like ==, but prints a counterexample when it fails.
(=/=) ∷ (Eq a, Show a) ⇒ a → a → Property infix 4 Source #
Like /=, but prints a counterexample when it fails.
total ∷ NFData a ⇒ a → Property Source #
Checks that a value is total, i.e., doesn't crash when evaluated.
Args specifies arguments to the QuickCheck driver
Constructors
| Args | |
Fields
| |
Instances
quickCheck ∷ Testable prop ⇒ prop → IO () Source #
Tests a property and prints the results to stdout.
By default up to 100 tests are performed, which may not be enough
to find all bugs. To run more tests, use withMaxSuccess.
If you want to get the counterexample as a Haskell value, rather than just printing it, try the quickcheck-with-counterexamples package.
quickCheckWith ∷ Testable prop ⇒ Args → prop → IO () Source #
Tests a property, using test arguments, and prints the results to stdout.
quickCheckResult ∷ Testable prop ⇒ prop → IO Result Source #
Tests a property, produces a test result, and prints the results to stdout.
quickCheckWithResult ∷ Testable prop ⇒ Args → prop → IO Result Source #
Tests a property, using test arguments, produces a test result, and prints the results to stdout.
recheck ∷ Testable prop ⇒ Result → prop → IO () Source #
Re-run a property with the seed and size that failed in a run of quickCheckResult.
verboseCheck ∷ Testable prop ⇒ prop → IO () Source #
Tests a property and prints the results and all test cases generated to stdout.
This is just a convenience function that means the same as quickCheck . verbose
Note: for technical reasons, the test case is printed out after
the property is tested. To debug a property that goes into an
infinite loop, use within to add a timeout instead.
verboseCheckWith ∷ Testable prop ⇒ Args → prop → IO () Source #
Tests a property, using test arguments, and prints the results and all test cases generated to stdout.
This is just a convenience function that combines quickCheckWith and verbose.
Note: for technical reasons, the test case is printed out after
the property is tested. To debug a property that goes into an
infinite loop, use within to add a timeout instead.
verboseCheckResult ∷ Testable prop ⇒ prop → IO Result Source #
Tests a property, produces a test result, and prints the results and all test cases generated to stdout.
This is just a convenience function that combines quickCheckResult and verbose.
Note: for technical reasons, the test case is printed out after
the property is tested. To debug a property that goes into an
infinite loop, use within to add a timeout instead.
verboseCheckWithResult ∷ Testable prop ⇒ Args → prop → IO Result Source #
Tests a property, using test arguments, produces a test result, and prints the results and all test cases generated to stdout.
This is just a convenience function that combines quickCheckWithResult and verbose.
Note: for technical reasons, the test case is printed out after
the property is tested. To debug a property that goes into an
infinite loop, use within to add a timeout instead.
polyQuickCheck ∷ Name → ExpQ Source #
Test a polymorphic property, defaulting all type variables to Integer.
Invoke as $(, where polyQuickCheck 'prop)prop is a property.
Note that just evaluating quickCheck prop()!
$( means the same as
polyQuickCheck 'prop)quickCheck $(monomorphic 'prop)polyQuickCheck,
you will have to combine quickCheckWith and monomorphic yourself.
If you want to use polyQuickCheck in the same file where you defined the
property, the same scoping problems pop up as in quickCheckAll:
see the note there about return [].
polyVerboseCheck ∷ Name → ExpQ Source #
Test a polymorphic property, defaulting all type variables to Integer.
This is just a convenience function that combines verboseCheck and monomorphic.
If you want to use polyVerboseCheck in the same file where you defined the
property, the same scoping problems pop up as in quickCheckAll:
see the note there about return [].
monomorphic ∷ Name → ExpQ Source #
Monomorphise an arbitrary property by defaulting all type variables to Integer.
For example, if f has type Ord a => [a] -> [a]$( has type monomorphic 'f)[.Integer] -> [Integer]
If you want to use monomorphic in the same file where you defined the
property, the same scoping problems pop up as in quickCheckAll:
see the note there about return [].
forAllProperties ∷ Q Exp Source #
Test all properties in the current module, using a custom
quickCheck function. The same caveats as with quickCheckAll
apply.
$ has type forAllProperties(.
An example invocation is Property -> IO Result) -> IO Bool$,
which does the same thing as forAllProperties quickCheckResult$.quickCheckAll
forAllProperties has the same issue with scoping as quickCheckAll:
see the note there about return [].
allProperties ∷ Q Exp Source #
List all properties in the current module.
$ has type allProperties[(.String, Property)]
allProperties has the same issue with scoping as quickCheckAll:
see the note there about return [].
quickCheckAll ∷ Q Exp Source #
Test all properties in the current module.
The name of the property must begin with prop_.
Polymorphic properties will be defaulted to Integer.
Returns True if all tests succeeded, False otherwise.
To use quickCheckAll, add a definition to your module along
the lines of
return [] runTests = $quickCheckAll
and then execute runTests.
Note: the bizarre return [] in the example above is needed on
GHC 7.8 and later; without it, quickCheckAll will not be able to find
any of the properties. For the curious, the return [] is a
Template Haskell splice that makes GHC insert the empty list
of declarations at that point in the program; GHC typechecks
everything before the return [] before it starts on the rest
of the module, which means that the later call to quickCheckAll
can see everything that was defined before the return []. Yikes!
verboseCheckAll ∷ Q Exp Source #
Test all properties in the current module.
This is just a convenience function that combines quickCheckAll and verbose.
verboseCheckAll has the same issue with scoping as quickCheckAll:
see the note there about return [].
labelledExamples ∷ Testable prop ⇒ prop → IO () Source #
Given a property, which must use label, collect, classify or cover
to associate labels with test cases, find an example test case for each possible label.
The example test cases are minimised using shrinking.
For example, suppose we test delete x xsx occurs in xs:
prop_delete :: Int -> [Int] -> Property prop_delete x xs = classify (count x xs == 0) "count x xs == 0" $ classify (count x xs == 1) "count x xs == 1" $ classify (count x xs >= 2) "count x xs >= 2" $ counterexample (show (delete x xs)) $ count x (delete x xs) == max 0 (count x xs-1) where count x xs = length (filter (== x) xs)
labelledExamples generates three example test cases, one for each label:
>>>labelledExamples prop_delete*** Found example of count x xs == 0 0 [] [] *** Found example of count x xs == 1 0 [0] [] *** Found example of count x xs >= 2 5 [5,5] [5] +++ OK, passed 100 tests: 78% count x xs == 0 21% count x xs == 1 1% count x xs >= 2
labelledExamplesWith ∷ Testable prop ⇒ Args → prop → IO () Source #
A variant of labelledExamples that takes test arguments.
labelledExamplesResult ∷ Testable prop ⇒ prop → IO Result Source #
A variant of labelledExamples that returns a result.
labelledExamplesWithResult ∷ Testable prop ⇒ Args → prop → IO Result Source #
A variant of labelledExamples that takes test arguments and returns a result.
when ∷ Applicative f ⇒ Bool → f () → f () #
Conditional execution of Applicative expressions. For example,
Examples
when debug (putStrLn "Debugging")
will output the string Debugging if the Boolean value debug
is True, and otherwise do nothing.
>>>putStr "pi:" >> when False (print 3.14159)pi:
unless ∷ Applicative f ⇒ Bool → f () → f () #
The reverse of when.
Examples
>>>do x <- getLineunless (x == "hi") (putStrLn "hi!") comingupwithexamplesisdifficult hi!
>>>unless (pi > exp 1) NothingJust ()
replicateM ∷ Applicative m ⇒ Int → m a → m [a] #
replicateM n actact n times,
and then returns the list of results.
replicateM n (pure x) == replicate n xExamples
>>>replicateM 3 getLinehi heya hiya ["hi","heya","hiya"]
>>>import Control.Monad.State>>>runState (replicateM 3 $ state $ \s -> (s, s + 1)) 1([1,2,3],4)
replicateM_ ∷ Applicative m ⇒ Int → m a → m () #
ledgerTestMain ∷ Spec → IO () Source #
A class of types that can be fully evaluated.
Since: deepseq-1.1.0.0
Instances
| NFData Key | |
Defined in Data.Aeson.Key | |
| NFData JSONPathElement | |
Defined in Data.Aeson.Types.Internal Methods rnf ∷ JSONPathElement → () # | |
| NFData Value | |
Defined in Data.Aeson.Types.Internal | |
| NFData AdjacencyIntMap | |
Defined in Algebra.Graph.AdjacencyIntMap Methods rnf ∷ AdjacencyIntMap → () # | |
| NFData ByteArray | Since: deepseq-1.4.7.0 |
Defined in Control.DeepSeq | |
| NFData ByteString64 | |
Defined in Data.ByteString.Base64.Type Methods rnf ∷ ByteString64 → () # | |
| NFData Buffer | Like the Since: bytestring-0.12.2.0 |
Defined in Data.ByteString.Builder.Internal | |
| NFData BufferRange | Since: bytestring-0.12.2.0 |
Defined in Data.ByteString.Builder.Internal Methods rnf ∷ BufferRange → () # | |
| NFData ByteString | |
Defined in Data.ByteString.Internal.Type Methods rnf ∷ ByteString → () # | |
| NFData ByteString | |
Defined in Data.ByteString.Lazy.Internal Methods rnf ∷ ByteString → () # | |
| NFData ShortByteString | |
Defined in Data.ByteString.Short.Internal Methods rnf ∷ ShortByteString → () # | |
| NFData XPrv | |
Defined in Cardano.Crypto.Wallet | |
| NFData XPub | |
Defined in Cardano.Crypto.Wallet | |
| NFData XSignature | |
Defined in Cardano.Crypto.Wallet Methods rnf ∷ XSignature → () # | |
| NFData EncryptedKey | |
Defined in Cardano.Crypto.Wallet.Encrypted Methods rnf ∷ EncryptedKey → () # | |
| NFData Signature | |
Defined in Cardano.Crypto.Wallet.Encrypted | |
| NFData XPub | |
Defined in Cardano.Crypto.Wallet.Pure | |
| NFData ChainCode | |
Defined in Cardano.Crypto.Wallet.Types | |
| NFData PointCompressed | |
Defined in Crypto.Math.Edwards25519 Methods rnf ∷ PointCompressed → () # | |
| NFData Signature | |
Defined in Crypto.Math.Edwards25519 | |
| NFData Seed | |
Defined in Cardano.Crypto.Seed | |
| NFData Point | |
Defined in Cardano.Crypto.VRF.Simple | |
| NFData Proof | |
Defined in Cardano.Crypto.VRF.Praos | |
| NFData SignKey | |
Defined in Cardano.Crypto.VRF.Praos | |
| NFData VerKey | |
Defined in Cardano.Crypto.VRF.Praos | |
| NFData Proof | |
Defined in Cardano.Crypto.VRF.PraosBatchCompat | |
| NFData SignKey | |
Defined in Cardano.Crypto.VRF.PraosBatchCompat | |
| NFData VerKey | |
Defined in Cardano.Crypto.VRF.PraosBatchCompat | |
| NFData ProtocolMagicId | |
Defined in Cardano.Crypto.ProtocolMagic Methods rnf ∷ ProtocolMagicId → () # | |
| NFData RequiresNetworkMagic | |
Defined in Cardano.Crypto.ProtocolMagic Methods rnf ∷ RequiresNetworkMagic → () # | |
| NFData Raw | |
Defined in Cardano.Crypto.Raw | |
| NFData CompactRedeemVerificationKey | |
Defined in Cardano.Crypto.Signing.Redeem.Compact Methods rnf ∷ CompactRedeemVerificationKey → () # | |
| NFData RedeemSigningKey | |
Defined in Cardano.Crypto.Signing.Redeem.SigningKey Methods rnf ∷ RedeemSigningKey → () # | |
| NFData RedeemVerificationKey | |
Defined in Cardano.Crypto.Signing.Redeem.VerificationKey Methods rnf ∷ RedeemVerificationKey → () # | |
| NFData SigningKey | |
Defined in Cardano.Crypto.Signing.SigningKey Methods rnf ∷ SigningKey → () # | |
| NFData VerificationKey | |
Defined in Cardano.Crypto.Signing.VerificationKey Methods rnf ∷ VerificationKey → () # | |
| NFData Version | |
Defined in Cardano.Ledger.Binary.Version | |
| NFData AddrAttributes | |
Defined in Cardano.Chain.Common.AddrAttributes Methods rnf ∷ AddrAttributes → () # | |
| NFData HDAddressPayload | |
Defined in Cardano.Chain.Common.AddrAttributes Methods rnf ∷ HDAddressPayload → () # | |
| NFData AddrSpendingData | |
Defined in Cardano.Chain.Common.AddrSpendingData Methods rnf ∷ AddrSpendingData → () # | |
| NFData AddrType | |
Defined in Cardano.Chain.Common.AddrSpendingData | |
| NFData Address | |
Defined in Cardano.Chain.Common.Address | |
| NFData UnparsedFields | |
Defined in Cardano.Chain.Common.Attributes Methods rnf ∷ UnparsedFields → () # | |
| NFData BlockCount | |
Defined in Cardano.Chain.Common.BlockCount Methods rnf ∷ BlockCount → () # | |
| NFData ChainDifficulty | |
Defined in Cardano.Chain.Common.ChainDifficulty Methods rnf ∷ ChainDifficulty → () # | |
| NFData CompactAddress | |
Defined in Cardano.Chain.Common.Compact Methods rnf ∷ CompactAddress → () # | |
| NFData Lovelace | |
Defined in Cardano.Chain.Common.Lovelace | |
| NFData LovelacePortion | |
Defined in Cardano.Chain.Common.LovelacePortion Methods rnf ∷ LovelacePortion → () # | |
| NFData NetworkMagic | |
Defined in Cardano.Chain.Common.NetworkMagic Methods rnf ∷ NetworkMagic → () # | |
| NFData TxFeePolicy | |
Defined in Cardano.Chain.Common.TxFeePolicy Methods rnf ∷ TxFeePolicy → () # | |
| NFData TxSizeLinear | |
Defined in Cardano.Chain.Common.TxSizeLinear Methods rnf ∷ TxSizeLinear → () # | |
| NFData State | |
| NFData Environment | |
Defined in Cardano.Chain.Delegation.Validation.Interface Methods rnf ∷ Environment → () # | |
| NFData State | |
| NFData Environment | |
Defined in Cardano.Chain.Delegation.Validation.Scheduling Methods rnf ∷ Environment → () # | |
| NFData ScheduledDelegation | |
Defined in Cardano.Chain.Delegation.Validation.Scheduling Methods rnf ∷ ScheduledDelegation → () # | |
| NFData State | |
| NFData SscPayload | |
Defined in Cardano.Chain.Ssc Methods rnf ∷ SscPayload → () # | |
| NFData SscProof | |
Defined in Cardano.Chain.Ssc | |
| NFData UTxO | |
Defined in Cardano.Chain.UTxO.UTxO | |
| NFData ProposalBody | |
Defined in Cardano.Chain.Update.Proposal Methods rnf ∷ ProposalBody → () # | |
| NFData CandidateProtocolUpdate | |
Defined in Cardano.Chain.Update.Validation.Endorsement Methods rnf ∷ CandidateProtocolUpdate → () # | |
| NFData Endorsement | |
Defined in Cardano.Chain.Update.Validation.Endorsement Methods rnf ∷ Endorsement → () # | |
| NFData State | |
Defined in Cardano.Chain.Update.Validation.Interface | |
| NFData ApplicationVersion | |
Defined in Cardano.Chain.Update.Validation.Registration Methods rnf ∷ ApplicationVersion → () # | |
| NFData ProtocolUpdateProposal | |
Defined in Cardano.Chain.Update.Validation.Registration Methods rnf ∷ ProtocolUpdateProposal → () # | |
| NFData SoftwareUpdateProposal | |
Defined in Cardano.Chain.Update.Validation.Registration Methods rnf ∷ SoftwareUpdateProposal → () # | |
| NFData Environment | |
Defined in Cardano.Chain.Update.Validation.Voting Methods rnf ∷ Environment → () # | |
| NFData RegistrationEnvironment | |
Defined in Cardano.Chain.Update.Validation.Voting Methods rnf ∷ RegistrationEnvironment → () # | |
| NFData Addr | |
Defined in Cardano.Ledger.Address | |
| NFData BootstrapAddress | |
Defined in Cardano.Ledger.Address Methods rnf ∷ BootstrapAddress → () # | |
| NFData CompactAddr | |
Defined in Cardano.Ledger.Address Methods rnf ∷ CompactAddr → () # | |
| NFData RewardAccount | |
Defined in Cardano.Ledger.Address Methods rnf ∷ RewardAccount → () # | |
| NFData Withdrawals | |
Defined in Cardano.Ledger.Address Methods rnf ∷ Withdrawals → () # | |
| NFData ActiveSlotCoeff | |
Defined in Cardano.Ledger.BaseTypes Methods rnf ∷ ActiveSlotCoeff → () # | |
| NFData Anchor | |
Defined in Cardano.Ledger.BaseTypes | |
| NFData BlocksMade | |
Defined in Cardano.Ledger.BaseTypes Methods rnf ∷ BlocksMade → () # | |
| NFData CertIx | |
Defined in Cardano.Ledger.BaseTypes | |
| NFData DnsName | |
Defined in Cardano.Ledger.BaseTypes | |
| NFData Globals | |
Defined in Cardano.Ledger.BaseTypes | |
| NFData Network | |
Defined in Cardano.Ledger.BaseTypes | |
| NFData NonNegativeInterval | |
Defined in Cardano.Ledger.BaseTypes Methods rnf ∷ NonNegativeInterval → () # | |
| NFData Nonce | |
Defined in Cardano.Ledger.BaseTypes | |
| NFData Port | |
Defined in Cardano.Ledger.BaseTypes | |
| NFData PositiveInterval | |
Defined in Cardano.Ledger.BaseTypes Methods rnf ∷ PositiveInterval → () # | |
| NFData PositiveUnitInterval | |
Defined in Cardano.Ledger.BaseTypes Methods rnf ∷ PositiveUnitInterval → () # | |
| NFData ProtVer | |
Defined in Cardano.Ledger.BaseTypes | |
| NFData TxIx | |
Defined in Cardano.Ledger.BaseTypes | |
| NFData UnitInterval | |
Defined in Cardano.Ledger.BaseTypes Methods rnf ∷ UnitInterval → () # | |
| NFData Url | |
Defined in Cardano.Ledger.BaseTypes | |
| NFData Coin | |
Defined in Cardano.Ledger.Coin | |
| NFData DeltaCoin | |
Defined in Cardano.Ledger.Coin | |
| NFData PoolCert | |
Defined in Cardano.Ledger.Core.TxCert | |
| NFData Ptr | |
Defined in Cardano.Ledger.Credential | |
| NFData SlotNo32 | |
Defined in Cardano.Ledger.Credential | |
| NFData StakeReference | |
Defined in Cardano.Ledger.Credential Methods rnf ∷ StakeReference → () # | |
| NFData DRep | |
Defined in Cardano.Ledger.DRep | |
| NFData DRepState | |
Defined in Cardano.Ledger.DRep | |
| NFData GenDelegPair | |
Defined in Cardano.Ledger.Hashes Methods rnf ∷ GenDelegPair → () # | |
| NFData GenDelegs | |
Defined in Cardano.Ledger.Hashes | |
| NFData HashHeader | |
Defined in Cardano.Ledger.Hashes Methods rnf ∷ HashHeader → () # | |
| NFData ScriptHash | |
Defined in Cardano.Ledger.Hashes Methods rnf ∷ ScriptHash → () # | |
| NFData TxAuxDataHash | |
Defined in Cardano.Ledger.Hashes Methods rnf ∷ TxAuxDataHash → () # | |
| NFData BootstrapWitness | |
Defined in Cardano.Ledger.Keys.Bootstrap Methods rnf ∷ BootstrapWitness → () # | |
| NFData ChainCode | |
Defined in Cardano.Ledger.Keys.Bootstrap | |
| NFData Metadatum | |
Defined in Cardano.Ledger.Metadata | |
| NFData CostModel | |
Defined in Cardano.Ledger.Plutus.CostModels | |
| NFData CostModels | |
Defined in Cardano.Ledger.Plutus.CostModels Methods rnf ∷ CostModels → () # | |
| NFData PlutusDebugInfo | |
Defined in Cardano.Ledger.Plutus.Evaluate Methods rnf ∷ PlutusDebugInfo → () # | |
| NFData PlutusWithContext | |
Defined in Cardano.Ledger.Plutus.Evaluate Methods rnf ∷ PlutusWithContext → () # | |
| NFData ExUnits | |
Defined in Cardano.Ledger.Plutus.ExUnits | |
| NFData Prices | |
Defined in Cardano.Ledger.Plutus.ExUnits | |
| NFData Language | |
Defined in Cardano.Ledger.Plutus.Language | |
| NFData PlutusBinary | |
Defined in Cardano.Ledger.Plutus.Language Methods rnf ∷ PlutusBinary → () # | |
| NFData TxOutSource | |
Defined in Cardano.Ledger.Plutus.TxInfo Methods rnf ∷ TxOutSource → () # | |
| NFData Reward | |
Defined in Cardano.Ledger.Rewards | |
| NFData RewardType | |
Defined in Cardano.Ledger.Rewards Methods rnf ∷ RewardType → () # | |
| NFData CommitteeAuthorization | |
Defined in Cardano.Ledger.State.CertState Methods rnf ∷ CommitteeAuthorization → () # | |
| NFData FutureGenDeleg | |
Defined in Cardano.Ledger.State.CertState Methods rnf ∷ FutureGenDeleg → () # | |
| NFData InstantaneousRewards | |
Defined in Cardano.Ledger.State.CertState Methods rnf ∷ InstantaneousRewards → () # | |
| NFData Obligations | |
Defined in Cardano.Ledger.State.CertState Methods rnf ∷ Obligations → () # | |
| NFData ChainAccountState | |
Defined in Cardano.Ledger.State.ChainAccount Methods rnf ∷ ChainAccountState → () # | |
| NFData IndividualPoolStake | |
Defined in Cardano.Ledger.State.PoolDistr Methods rnf ∷ IndividualPoolStake → () # | |
| NFData PoolDistr | |
Defined in Cardano.Ledger.State.PoolDistr | |
| NFData SnapShot | |
Defined in Cardano.Ledger.State.SnapShots | |
| NFData SnapShots | |
Defined in Cardano.Ledger.State.SnapShots | |
| NFData Stake | |
Defined in Cardano.Ledger.State.SnapShots | |
| NFData PoolMetadata | |
Defined in Cardano.Ledger.State.StakePool Methods rnf ∷ PoolMetadata → () # | |
| NFData StakePoolParams | |
Defined in Cardano.Ledger.State.StakePool Methods rnf ∷ StakePoolParams → () # | |
| NFData StakePoolRelay | |
Defined in Cardano.Ledger.State.StakePool Methods rnf ∷ StakePoolRelay → () # | |
| NFData StakePoolState | |
Defined in Cardano.Ledger.State.StakePool Methods rnf ∷ StakePoolState → () # | |
| NFData TxId | |
Defined in Cardano.Ledger.TxIn | |
| NFData TxIn | |
Defined in Cardano.Ledger.TxIn | |
| NFData PlutusArgs Source # | |
Defined in Test.Cardano.Ledger.Plutus.ScriptTestContext Methods rnf ∷ PlutusArgs → () # | |
| NFData ScriptTestContext Source # | |
Defined in Test.Cardano.Ledger.Plutus.ScriptTestContext Methods rnf ∷ ScriptTestContext → () # | |
| NFData BlockNo | |
Defined in Cardano.Slotting.Block | |
| NFData EpochInterval | |
Defined in Cardano.Slotting.Slot Methods rnf ∷ EpochInterval → () # | |
| NFData EpochNo | |
Defined in Cardano.Slotting.Slot | |
| NFData EpochSize | |
Defined in Cardano.Slotting.Slot | |
| NFData SlotNo | |
Defined in Cardano.Slotting.Slot | |
| NFData IntSet | |
Defined in Data.IntSet.Internal | |
| NFData PublicKey | |
Defined in Crypto.PubKey.Ed25519 | |
| NFData SecretKey | |
Defined in Crypto.PubKey.Ed25519 | |
| NFData Signature | |
Defined in Crypto.PubKey.Ed25519 | |
| NFData Void | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData ThreadId | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData All | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData Any | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData TypeRep | NOTE: Prior to Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData Unique | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData Version | Since: deepseq-1.3.0.0 |
Defined in Control.DeepSeq | |
| NFData Fingerprint | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq Methods rnf ∷ Fingerprint → () # | |
| NFData CBool | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| NFData CChar | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CClock | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CDouble | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CFile | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CFloat | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CFpos | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CInt | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CIntMax | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CIntPtr | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CJmpBuf | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CLLong | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CLong | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CPtrdiff | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CSChar | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CSUSeconds | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq Methods rnf ∷ CSUSeconds → () # | |
| NFData CShort | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CSigAtomic | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq Methods rnf ∷ CSigAtomic → () # | |
| NFData CSize | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CTime | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CUChar | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CUInt | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CUIntMax | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CUIntPtr | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CULLong | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CULong | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CUSeconds | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CUShort | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData CWchar | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData MaskingState | Since: deepseq-1.4.4.0 |
Defined in Control.DeepSeq Methods rnf ∷ MaskingState → () # | |
| NFData ExitCode | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData Int16 | |
Defined in Control.DeepSeq | |
| NFData Int32 | |
Defined in Control.DeepSeq | |
| NFData Int64 | |
Defined in Control.DeepSeq | |
| NFData Int8 | |
Defined in Control.DeepSeq | |
| NFData CallStack | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData SrcLoc | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData Word16 | |
Defined in Control.DeepSeq | |
| NFData Word32 | |
Defined in Control.DeepSeq | |
| NFData Word64 | |
Defined in Control.DeepSeq | |
| NFData Word8 | |
Defined in Control.DeepSeq | |
| NFData Module | Since: deepseq-1.4.8.0 |
Defined in Control.DeepSeq | |
| NFData Ordering | |
Defined in Control.DeepSeq | |
| NFData TyCon | NOTE: Prior to Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData Half | |
Defined in Numeric.Half.Internal | |
| NFData FailureReason | |
Defined in Test.Hspec.Core.Example Methods rnf ∷ FailureReason → () # | |
| NFData IPv4 | |
Defined in Cardano.Ledger.Orphans | |
| NFData IPv6 | |
Defined in Cardano.Ledger.Orphans | |
| NFData InvalidPosException | |
Defined in Text.Megaparsec.Pos Methods rnf ∷ InvalidPosException → () # | |
| NFData Pos | |
Defined in Text.Megaparsec.Pos | |
| NFData SourcePos | |
Defined in Text.Megaparsec.Pos | |
| NFData Bytes | |
Defined in Data.ByteArray.Bytes | |
| NFData URI | |
Defined in Network.URI | |
| NFData URIAuth | |
Defined in Network.URI | |
| NFData OsChar | |
Defined in System.OsString.Internal.Types | |
| NFData OsString | |
Defined in System.OsString.Internal.Types | |
| NFData PosixChar | |
Defined in System.OsString.Internal.Types | |
| NFData PosixString | |
Defined in System.OsString.Internal.Types Methods rnf ∷ PosixString → () # | |
| NFData WindowsChar | |
Defined in System.OsString.Internal.Types Methods rnf ∷ WindowsChar → () # | |
| NFData WindowsString | |
Defined in System.OsString.Internal.Types Methods rnf ∷ WindowsString → () # | |
| NFData SrcSpan | |
Defined in PlutusCore.Annotation | |
| NFData SrcSpans | |
Defined in PlutusCore.Annotation | |
| NFData UnliftingError | |
Defined in PlutusCore.Builtin.Result Methods rnf ∷ UnliftingError → () # | |
| NFData UnliftingEvaluationError | |
Defined in PlutusCore.Builtin.Result Methods rnf ∷ UnliftingEvaluationError → () # | |
| NFData Data | |
Defined in PlutusCore.Data | |
| NFData DeBruijn | |
Defined in PlutusCore.DeBruijn.Internal | |
| NFData FakeNamedDeBruijn | |
Defined in PlutusCore.DeBruijn.Internal Methods rnf ∷ FakeNamedDeBruijn → () # | |
| NFData FreeVariableError | |
Defined in PlutusCore.DeBruijn.Internal Methods rnf ∷ FreeVariableError → () # | |
| NFData Index | |
Defined in PlutusCore.DeBruijn.Internal | |
| NFData NamedDeBruijn | |
Defined in PlutusCore.DeBruijn.Internal Methods rnf ∷ NamedDeBruijn → () # | |
| NFData NamedTyDeBruijn | |
Defined in PlutusCore.DeBruijn.Internal Methods rnf ∷ NamedTyDeBruijn → () # | |
| NFData TyDeBruijn | |
Defined in PlutusCore.DeBruijn.Internal Methods rnf ∷ TyDeBruijn → () # | |
| NFData DefaultFun | |
Defined in PlutusCore.Default.Builtins Methods rnf ∷ DefaultFun → () # | |
| NFData ParserError | |
Defined in PlutusCore.Error Methods rnf ∷ ParserError → () # | |
| NFData ParserErrorBundle | |
Defined in PlutusCore.Error Methods rnf ∷ ParserErrorBundle → () # | |
| NFData CkUserError | |
Defined in PlutusCore.Evaluation.Machine.Ck | |
| NFData CostModelApplyError | |
Defined in PlutusCore.Evaluation.Machine.CostModelInterface Methods rnf ∷ CostModelApplyError → () # | |
| NFData Coefficient0 | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ Coefficient0 → () # | |
| NFData Coefficient00 | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ Coefficient00 → () # | |
| NFData Coefficient01 | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ Coefficient01 → () # | |
| NFData Coefficient02 | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ Coefficient02 → () # | |
| NFData Coefficient1 | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ Coefficient1 → () # | |
| NFData Coefficient10 | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ Coefficient10 → () # | |
| NFData Coefficient11 | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ Coefficient11 → () # | |
| NFData Coefficient12 | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ Coefficient12 → () # | |
| NFData Coefficient2 | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ Coefficient2 → () # | |
| NFData Coefficient20 | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ Coefficient20 → () # | |
| NFData ExpModCostingFunction | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ ExpModCostingFunction → () # | |
| NFData Intercept | |
| NFData ModelConstantOrLinear | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ ModelConstantOrLinear → () # | |
| NFData ModelConstantOrOneArgument | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ ModelConstantOrOneArgument → () # | |
| NFData ModelConstantOrTwoArguments | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ ModelConstantOrTwoArguments → () # | |
| NFData ModelFiveArguments | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ ModelFiveArguments → () # | |
| NFData ModelFourArguments | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ ModelFourArguments → () # | |
| NFData ModelOneArgument | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ ModelOneArgument → () # | |
| NFData ModelSixArguments | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ ModelSixArguments → () # | |
| NFData ModelSubtractedSizes | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ ModelSubtractedSizes → () # | |
| NFData ModelThreeArguments | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ ModelThreeArguments → () # | |
| NFData ModelTwoArguments | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ ModelTwoArguments → () # | |
| NFData OneVariableLinearFunction | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ OneVariableLinearFunction → () # | |
| NFData OneVariableQuadraticFunction | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ OneVariableQuadraticFunction → () # | |
| NFData Slope | |
| NFData TwoVariableLinearFunction | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ TwoVariableLinearFunction → () # | |
| NFData TwoVariableQuadraticFunction | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ TwoVariableQuadraticFunction → () # | |
| NFData ExBudget | |
Defined in PlutusCore.Evaluation.Machine.ExBudget | |
| NFData ExRestrictingBudget | |
Defined in PlutusCore.Evaluation.Machine.ExBudget Methods rnf ∷ ExRestrictingBudget → () # | |
| NFData ExCPU | |
Defined in PlutusCore.Evaluation.Machine.ExMemory | |
| NFData ExMemory | |
Defined in PlutusCore.Evaluation.Machine.ExMemory | |
| NFData Name | |
Defined in PlutusCore.Name.Unique | |
| NFData TyName | |
Defined in PlutusCore.Name.Unique | |
| NFData Unique | |
Defined in PlutusCore.Name.Unique | |
| NFData K | |
Defined in PlutusCore.Value | |
| NFData Quantity | |
Defined in PlutusCore.Value | |
| NFData Value | |
Defined in PlutusCore.Value | |
| NFData Version | |
Defined in PlutusCore.Version | |
| NFData CountingSt | |
Defined in UntypedPlutusCore.Evaluation.Machine.Cek.ExBudgetMode Methods rnf ∷ CountingSt → () # | |
| NFData RestrictingSt | |
Defined in UntypedPlutusCore.Evaluation.Machine.Cek.ExBudgetMode Methods rnf ∷ RestrictingSt → () # | |
| NFData CekUserError | |
Defined in UntypedPlutusCore.Evaluation.Machine.Cek.Internal Methods rnf ∷ CekUserError → () # | |
| NFData StepKind | |
| NFData Filler | |
Defined in PlutusCore.Flat.Filler | |
| NFData SatInt | |
Defined in Data.SatInt | |
| NFData EvaluationContext | |
Defined in PlutusLedgerApi.Common.Eval Methods rnf ∷ EvaluationContext → () # | |
| NFData ScriptForEvaluation | |
Defined in PlutusLedgerApi.Common.SerialisedScript Methods rnf ∷ ScriptForEvaluation → () # | |
| NFData ScriptNamedDeBruijn | |
Defined in PlutusLedgerApi.Common.SerialisedScript Methods rnf ∷ ScriptNamedDeBruijn → () # | |
| NFData PlutusLedgerLanguage | |
Defined in PlutusLedgerApi.Common.Versions Methods rnf ∷ PlutusLedgerLanguage → () # | |
| NFData Address | |
Defined in PlutusLedgerApi.V1.Address | |
| NFData LedgerBytes | |
Defined in PlutusLedgerApi.V1.Bytes Methods rnf ∷ LedgerBytes → () # | |
| NFData ScriptContext | |
Defined in Cardano.Ledger.Plutus.Language Methods rnf ∷ ScriptContext → () # | |
| NFData Credential | |
Defined in PlutusLedgerApi.V1.Credential Methods rnf ∷ Credential → () # | |
| NFData StakingCredential | |
Defined in PlutusLedgerApi.V1.Credential Methods rnf ∷ StakingCredential → () # | |
| NFData PubKeyHash | |
Defined in PlutusLedgerApi.V1.Crypto Methods rnf ∷ PubKeyHash → () # | |
| NFData DCert | |
Defined in PlutusLedgerApi.V1.DCert | |
| NFData Address | |
Defined in PlutusLedgerApi.V1.Data.Address | |
| NFData Credential | |
Defined in PlutusLedgerApi.V1.Data.Credential Methods rnf ∷ Credential → () # | |
| NFData StakingCredential | |
Defined in PlutusLedgerApi.V1.Data.Credential Methods rnf ∷ StakingCredential → () # | |
| NFData DCert | |
Defined in PlutusLedgerApi.V1.Data.DCert | |
| NFData DiffMilliSeconds | |
Defined in PlutusLedgerApi.V1.Data.Time Methods rnf ∷ DiffMilliSeconds → () # | |
| NFData POSIXTime | |
Defined in PlutusLedgerApi.V1.Data.Time | |
| NFData RedeemerPtr | |
Defined in PlutusLedgerApi.V1.Data.Tx Methods rnf ∷ RedeemerPtr → () # | |
| NFData ScriptTag | |
Defined in PlutusLedgerApi.V1.Data.Tx | |
| NFData TxId | |
Defined in PlutusLedgerApi.V1.Data.Tx | |
| NFData TxOutRef | |
Defined in PlutusLedgerApi.V1.Data.Tx | |
| NFData AssetClass | |
Defined in PlutusLedgerApi.V1.Data.Value Methods rnf ∷ AssetClass → () # | |
| NFData CurrencySymbol | |
Defined in PlutusLedgerApi.V1.Data.Value Methods rnf ∷ CurrencySymbol → () # | |
| NFData TokenName | |
Defined in PlutusLedgerApi.V1.Data.Value | |
| NFData Datum | |
Defined in PlutusLedgerApi.V1.Scripts | |
| NFData DatumHash | |
Defined in PlutusLedgerApi.V1.Scripts | |
| NFData Redeemer | |
Defined in PlutusLedgerApi.V1.Scripts | |
| NFData RedeemerHash | |
Defined in PlutusLedgerApi.V1.Scripts Methods rnf ∷ RedeemerHash → () # | |
| NFData ScriptError | |
Defined in PlutusLedgerApi.V1.Scripts Methods rnf ∷ ScriptError → () # | |
| NFData ScriptHash | |
Defined in PlutusLedgerApi.V1.Scripts Methods rnf ∷ ScriptHash → () # | |
| NFData DiffMilliSeconds | |
Defined in PlutusLedgerApi.V1.Time Methods rnf ∷ DiffMilliSeconds → () # | |
| NFData POSIXTime | |
Defined in PlutusLedgerApi.V1.Time | |
| NFData RedeemerPtr | |
Defined in PlutusLedgerApi.V1.Tx Methods rnf ∷ RedeemerPtr → () # | |
| NFData ScriptTag | |
Defined in PlutusLedgerApi.V1.Tx | |
| NFData TxId | |
Defined in PlutusLedgerApi.V1.Tx | |
| NFData TxOut | |
Defined in PlutusLedgerApi.V1.Tx | |
| NFData TxOutRef | |
Defined in PlutusLedgerApi.V1.Tx | |
| NFData AssetClass | |
Defined in PlutusLedgerApi.V1.Value Methods rnf ∷ AssetClass → () # | |
| NFData CurrencySymbol | |
Defined in PlutusLedgerApi.V1.Value Methods rnf ∷ CurrencySymbol → () # | |
| NFData TokenName | |
Defined in PlutusLedgerApi.V1.Value | |
| NFData Value | |
Defined in PlutusLedgerApi.V1.Value | |
| NFData ScriptContext | |
Defined in Cardano.Ledger.Plutus.Language Methods rnf ∷ ScriptContext → () # | |
| NFData OutputDatum | |
Defined in PlutusLedgerApi.V2.Data.Tx Methods rnf ∷ OutputDatum → () # | |
| NFData OutputDatum | |
Defined in PlutusLedgerApi.V2.Tx Methods rnf ∷ OutputDatum → () # | |
| NFData TxOut | |
Defined in PlutusLedgerApi.V2.Tx | |
| NFData ScriptContext | |
Defined in Cardano.Ledger.Plutus.Language Methods rnf ∷ ScriptContext → () # | |
| NFData TxId | |
Defined in PlutusLedgerApi.V3.Data.Tx | |
| NFData TxOutRef | |
Defined in PlutusLedgerApi.V3.Data.Tx | |
| NFData MintValue | |
Defined in PlutusLedgerApi.V3.MintValue | |
| NFData TxId | |
Defined in PlutusLedgerApi.V3.Tx | |
| NFData TxOutRef | |
Defined in PlutusLedgerApi.V3.Tx | |
| NFData BuiltinByteStringHex | |
Defined in PlutusTx.Builtins.HasOpaque Methods rnf ∷ BuiltinByteStringHex → () # | |
| NFData BuiltinByteStringUtf8 | |
Defined in PlutusTx.Builtins.HasOpaque Methods rnf ∷ BuiltinByteStringUtf8 → () # | |
| NFData BuiltinBLS12_381_G1_Element | |
Defined in PlutusTx.Builtins.Internal Methods rnf ∷ BuiltinBLS12_381_G1_Element → () # | |
| NFData BuiltinBLS12_381_G2_Element | |
Defined in PlutusTx.Builtins.Internal Methods rnf ∷ BuiltinBLS12_381_G2_Element → () # | |
| NFData BuiltinBLS12_381_MlResult | |
Defined in PlutusTx.Builtins.Internal Methods rnf ∷ BuiltinBLS12_381_MlResult → () # | |
| NFData BuiltinByteString | |
Defined in PlutusTx.Builtins.Internal Methods rnf ∷ BuiltinByteString → () # | |
| NFData BuiltinData | |
Defined in PlutusTx.Builtins.Internal Methods rnf ∷ BuiltinData → () # | |
| NFData CovLoc | |
Defined in PlutusTx.Coverage | |
| NFData CoverageAnnotation | |
Defined in PlutusTx.Coverage Methods rnf ∷ CoverageAnnotation → () # | |
| NFData CoverageData | |
Defined in PlutusTx.Coverage Methods rnf ∷ CoverageData → () # | |
| NFData CoverageIndex | |
Defined in PlutusTx.Coverage Methods rnf ∷ CoverageIndex → () # | |
| NFData CoverageMetadata | |
Defined in PlutusTx.Coverage Methods rnf ∷ CoverageMetadata → () # | |
| NFData CoverageReport | |
Defined in PlutusTx.Coverage Methods rnf ∷ CoverageReport → () # | |
| NFData Metadata | |
Defined in PlutusTx.Coverage | |
| NFData TextDetails | |
Defined in Text.PrettyPrint.Annotated.HughesPJ Methods rnf ∷ TextDetails → () # | |
| NFData Doc | |
Defined in Text.PrettyPrint.HughesPJ | |
| NFData StdGen | |
Defined in System.Random.Internal | |
| NFData Scientific | |
Defined in Data.Scientific Methods rnf ∷ Scientific → () # | |
| NFData UnicodeException | |
Defined in Data.Text.Encoding.Error Methods rnf ∷ UnicodeException → () # | |
| NFData Text | |
| NFData Text | |
Defined in Data.Text.Lazy | |
| NFData ShortText | |
Defined in Data.Text.Short.Internal | |
| NFData Month | |
Defined in Data.Time.Calendar.Month | |
| NFData Quarter | |
Defined in Data.Time.Calendar.Quarter | |
| NFData QuarterOfYear | |
Defined in Data.Time.Calendar.Quarter Methods rnf ∷ QuarterOfYear → () # | |
| NFData NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime Methods rnf ∷ NominalDiffTime → () # | |
| NFData UTCTime | |
Defined in Data.Time.Clock.Internal.UTCTime | |
| NFData LocalTime | |
Defined in Data.Time.LocalTime.Internal.LocalTime | |
| NFData ZonedTime | |
Defined in Data.Time.LocalTime.Internal.ZonedTime | |
| NFData EditExpr | |
Defined in Data.TreeDiff.Expr | |
| NFData Expr | |
Defined in Data.TreeDiff.Expr | |
| NFData UUID | |
Defined in Data.UUID.Types.Internal | |
| NFData Integer | |
Defined in Control.DeepSeq | |
| NFData Natural | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData () | |
Defined in Control.DeepSeq | |
| NFData Bool | |
Defined in Control.DeepSeq | |
| NFData Char | |
Defined in Control.DeepSeq | |
| NFData Double | |
Defined in Control.DeepSeq | |
| NFData Float | |
Defined in Control.DeepSeq | |
| NFData Int | |
Defined in Control.DeepSeq | |
| NFData Word | |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData (Only a) | |
Defined in Data.Tuple.Only | |
| NFData v ⇒ NFData (KeyMap v) | |
Defined in Data.Aeson.KeyMap | |
| NFData a ⇒ NFData (IResult a) | |
Defined in Data.Aeson.Types.Internal | |
| NFData a ⇒ NFData (Result a) | |
Defined in Data.Aeson.Types.Internal | |
| NFData a ⇒ NFData (Graph a) | |
Defined in Algebra.Graph | |
| NFData a ⇒ NFData (AdjacencyMap a) | |
Defined in Algebra.Graph.AdjacencyMap Methods rnf ∷ AdjacencyMap a → () # | |
| NFData a ⇒ NFData (AdjacencyMap a) | |
Defined in Algebra.Graph.NonEmpty.AdjacencyMap Methods rnf ∷ AdjacencyMap a → () # | |
| NFData a ⇒ NFData (Relation a) | |
Defined in Algebra.Graph.Relation | |
| NFData a ⇒ NFData (Relation a) | |
Defined in Algebra.Graph.Relation.Symmetric | |
| NFData a ⇒ NFData (Graph a) | |
Defined in Algebra.Graph.Undirected | |
| NFData (MutableByteArray s) | Since: deepseq-1.4.8.0 |
Defined in Control.DeepSeq Methods rnf ∷ MutableByteArray s → () # | |
| NFData a ⇒ NFData (Complex a) | |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData (First a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData (Last a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData (Max a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData (Min a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData m ⇒ NFData (WrappedMonoid m) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq Methods rnf ∷ WrappedMonoid m → () # | |
| NFData (SigDSIGN EcdsaSecp256k1DSIGN) | |
Defined in Cardano.Crypto.DSIGN.EcdsaSecp256k1 Methods rnf ∷ SigDSIGN EcdsaSecp256k1DSIGN → () # | |
| NFData (SigDSIGN Ed25519DSIGN) | |
Defined in Cardano.Crypto.DSIGN.Ed25519 Methods rnf ∷ SigDSIGN Ed25519DSIGN → () # | |
| NFData (SigDSIGN MockDSIGN) | |
Defined in Cardano.Crypto.DSIGN.Mock | |
| NFData (SigDSIGN SchnorrSecp256k1DSIGN) | |
Defined in Cardano.Crypto.DSIGN.SchnorrSecp256k1 Methods rnf ∷ SigDSIGN SchnorrSecp256k1DSIGN → () # | |
| NFData (SignKeyDSIGN EcdsaSecp256k1DSIGN) | |
Defined in Cardano.Crypto.DSIGN.EcdsaSecp256k1 Methods rnf ∷ SignKeyDSIGN EcdsaSecp256k1DSIGN → () # | |
| NFData (SignKeyDSIGN Ed25519DSIGN) | |
Defined in Cardano.Crypto.DSIGN.Ed25519 Methods rnf ∷ SignKeyDSIGN Ed25519DSIGN → () # | |
| NFData (SignKeyDSIGN Ed448DSIGN) | |
Defined in Cardano.Crypto.DSIGN.Ed448 Methods rnf ∷ SignKeyDSIGN Ed448DSIGN → () # | |
| NFData (SignKeyDSIGN MockDSIGN) | |
Defined in Cardano.Crypto.DSIGN.Mock Methods rnf ∷ SignKeyDSIGN MockDSIGN → () # | |
| NFData (SignKeyDSIGN SchnorrSecp256k1DSIGN) | |
Defined in Cardano.Crypto.DSIGN.SchnorrSecp256k1 Methods rnf ∷ SignKeyDSIGN SchnorrSecp256k1DSIGN → () # | |
| NFData (SignKeyDSIGNM Ed25519DSIGN) | |
Defined in Cardano.Crypto.DSIGN.Ed25519 Methods rnf ∷ SignKeyDSIGNM Ed25519DSIGN → () # | |
| NFData (VerKeyDSIGN EcdsaSecp256k1DSIGN) | |
Defined in Cardano.Crypto.DSIGN.EcdsaSecp256k1 Methods rnf ∷ VerKeyDSIGN EcdsaSecp256k1DSIGN → () # | |
| NFData (VerKeyDSIGN Ed25519DSIGN) | |
Defined in Cardano.Crypto.DSIGN.Ed25519 Methods rnf ∷ VerKeyDSIGN Ed25519DSIGN → () # | |
| NFData (VerKeyDSIGN Ed448DSIGN) | |
Defined in Cardano.Crypto.DSIGN.Ed448 Methods rnf ∷ VerKeyDSIGN Ed448DSIGN → () # | |
| NFData (VerKeyDSIGN MockDSIGN) | |
Defined in Cardano.Crypto.DSIGN.Mock Methods rnf ∷ VerKeyDSIGN MockDSIGN → () # | |
| NFData (VerKeyDSIGN SchnorrSecp256k1DSIGN) | |
Defined in Cardano.Crypto.DSIGN.SchnorrSecp256k1 Methods rnf ∷ VerKeyDSIGN SchnorrSecp256k1DSIGN → () # | |
| (NFData (SigDSIGN d), NFData (VerKeyDSIGN d)) ⇒ NFData (SigKES (CompactSingleKES d)) | |
Defined in Cardano.Crypto.KES.CompactSingle Methods rnf ∷ SigKES (CompactSingleKES d) → () # | |
| (NFData (SigKES d), NFData (VerKeyKES d)) ⇒ NFData (SigKES (CompactSumKES h d)) | |
Defined in Cardano.Crypto.KES.CompactSum Methods rnf ∷ SigKES (CompactSumKES h d) → () # | |
| NFData (SigDSIGN d) ⇒ NFData (SigKES (SingleKES d)) | |
Defined in Cardano.Crypto.KES.Single | |
| (NFData (SigKES d), NFData (VerKeyKES d)) ⇒ NFData (SigKES (SumKES h d)) | |
Defined in Cardano.Crypto.KES.Sum | |
| NFData (SignKeyDSIGNM d) ⇒ NFData (SignKeyKES (CompactSingleKES d)) | |
Defined in Cardano.Crypto.KES.CompactSingle Methods rnf ∷ SignKeyKES (CompactSingleKES d) → () # | |
| (NFData (SignKeyKES d), NFData (VerKeyKES d)) ⇒ NFData (SignKeyKES (CompactSumKES h d)) | |
Defined in Cardano.Crypto.KES.CompactSum Methods rnf ∷ SignKeyKES (CompactSumKES h d) → () # | |
| NFData (SignKeyDSIGNM d) ⇒ NFData (SignKeyKES (SingleKES d)) | |
Defined in Cardano.Crypto.KES.Single Methods rnf ∷ SignKeyKES (SingleKES d) → () # | |
| (NFData (SignKeyKES d), NFData (VerKeyKES d)) ⇒ NFData (SignKeyKES (SumKES h d)) | |
Defined in Cardano.Crypto.KES.Sum Methods rnf ∷ SignKeyKES (SumKES h d) → () # | |
| NFData (VerKeyDSIGN d) ⇒ NFData (VerKeyKES (CompactSingleKES d)) | |
Defined in Cardano.Crypto.KES.CompactSingle Methods rnf ∷ VerKeyKES (CompactSingleKES d) → () # | |
| NFData (VerKeyKES (CompactSumKES h d)) | |
Defined in Cardano.Crypto.KES.CompactSum Methods rnf ∷ VerKeyKES (CompactSumKES h d) → () # | |
| NFData (VerKeyDSIGN d) ⇒ NFData (VerKeyKES (SingleKES d)) | |
Defined in Cardano.Crypto.KES.Single | |
| NFData (VerKeyKES (SumKES h d)) | |
Defined in Cardano.Crypto.KES.Sum | |
| NFData (MLockedSizedBytes n) | |
Defined in Cardano.Crypto.Libsodium.MLockedBytes.Internal Methods rnf ∷ MLockedSizedBytes n → () # | |
| NFData (MLockedSeed n) | |
Defined in Cardano.Crypto.Libsodium.MLockedSeed Methods rnf ∷ MLockedSeed n → () # | |
| NFData (MLockedForeignPtr a) | |
Defined in Cardano.Crypto.Libsodium.Memory.Internal Methods rnf ∷ MLockedForeignPtr a → () # | |
| NFData (PackedBytes n) | |
Defined in Cardano.Crypto.PackedBytes Methods rnf ∷ PackedBytes n → () # | |
| NFData (PinnedSizedBytes n) | |
Defined in Cardano.Crypto.PinnedSizedBytes Methods rnf ∷ PinnedSizedBytes n → () # | |
| NFData (CertVRF SimpleVRF) | |
Defined in Cardano.Crypto.VRF.Simple | |
| NFData (CertVRF PraosVRF) | |
Defined in Cardano.Crypto.VRF.Praos | |
| NFData (CertVRF PraosBatchCompatVRF) | |
Defined in Cardano.Crypto.VRF.PraosBatchCompat Methods rnf ∷ CertVRF PraosBatchCompatVRF → () # | |
| NFData (OutputVRF v) | |
Defined in Cardano.Crypto.VRF.Class | |
| NFData (SignKeyVRF SimpleVRF) | |
Defined in Cardano.Crypto.VRF.Simple Methods rnf ∷ SignKeyVRF SimpleVRF → () # | |
| NFData (SignKeyVRF PraosVRF) | |
Defined in Cardano.Crypto.VRF.Praos Methods rnf ∷ SignKeyVRF PraosVRF → () # | |
| NFData (SignKeyVRF PraosBatchCompatVRF) | |
Defined in Cardano.Crypto.VRF.PraosBatchCompat Methods rnf ∷ SignKeyVRF PraosBatchCompatVRF → () # | |
| NFData (VerKeyVRF SimpleVRF) | |
Defined in Cardano.Crypto.VRF.Simple | |
| NFData (VerKeyVRF PraosVRF) | |
Defined in Cardano.Crypto.VRF.Praos | |
| NFData (VerKeyVRF PraosBatchCompatVRF) | |
Defined in Cardano.Crypto.VRF.PraosBatchCompat Methods rnf ∷ VerKeyVRF PraosBatchCompatVRF → () # | |
| NFData a ⇒ NFData (AProtocolMagic a) | |
Defined in Cardano.Crypto.ProtocolMagic Methods rnf ∷ AProtocolMagic a → () # | |
| NFData (RedeemSignature a) | |
Defined in Cardano.Crypto.Signing.Redeem.Signature Methods rnf ∷ RedeemSignature a → () # | |
| NFData (Signature a) | |
Defined in Cardano.Crypto.Signing.Signature | |
| NFData a ⇒ NFData (Sized a) | |
Defined in Cardano.Ledger.Binary.Decoding.Sized | |
| NFData h ⇒ NFData (Attributes h) | |
Defined in Cardano.Chain.Common.Attributes Methods rnf ∷ Attributes h → () # | |
| NFData a ⇒ NFData (MerkleNode a) | |
Defined in Cardano.Chain.Common.Merkle Methods rnf ∷ MerkleNode a → () # | |
| NFData (MerkleRoot a) | |
Defined in Cardano.Chain.Common.Merkle Methods rnf ∷ MerkleRoot a → () # | |
| NFData a ⇒ NFData (MerkleTree a) | |
Defined in Cardano.Chain.Common.Merkle Methods rnf ∷ MerkleTree a → () # | |
| NFData a ⇒ NFData (AProposal a) | |
Defined in Cardano.Chain.Update.Proposal | |
| NFData a ⇒ NFData (AVote a) | |
Defined in Cardano.Chain.Update.Vote | |
| NFData a ⇒ NFData (NonZero a) | |
Defined in Cardano.Ledger.BaseTypes.NonZero | |
| NFData (CompactForm Coin) | |
Defined in Cardano.Ledger.Coin Methods rnf ∷ CompactForm Coin → () # | |
| NFData (CompactForm DeltaCoin) | |
Defined in Cardano.Ledger.Coin Methods rnf ∷ CompactForm DeltaCoin → () # | |
| NFData (PParamsHKD Identity era) ⇒ NFData (PParams era) | |
Defined in Cardano.Ledger.Core.PParams | |
| NFData (PParamsHKD StrictMaybe era) ⇒ NFData (PParamsUpdate era) | |
Defined in Cardano.Ledger.Core.PParams Methods rnf ∷ PParamsUpdate era → () # | |
| NFData (Credential r) | |
Defined in Cardano.Ledger.Credential Methods rnf ∷ Credential r → () # | |
| NFData (NoUpdate a) | |
Defined in Cardano.Ledger.HKD | |
| NFData (KeyHash r) | |
Defined in Cardano.Ledger.Hashes | |
| NFData (SafeHash i) | |
Defined in Cardano.Ledger.Hashes | |
| NFData (VRFVerKeyHash r) | |
Defined in Cardano.Ledger.Hashes Methods rnf ∷ VRFVerKeyHash r → () # | |
| NFData (VKey kd) | |
Defined in Cardano.Ledger.Keys.Internal | |
| NFData (WitVKey kr) | |
Defined in Cardano.Ledger.Keys.WitVKey | |
| NFData t ⇒ NFData (MemoBytes t) | |
Defined in Cardano.Ledger.MemoBytes.Internal | |
| NFData (Data era) | |
Defined in Cardano.Ledger.Plutus.Data | |
| NFData (PlutusData era) | |
Defined in Cardano.Ledger.Plutus.Data Methods rnf ∷ PlutusData era → () # | |
| NFData a ⇒ NFData (ExUnits' a) | |
Defined in Cardano.Ledger.Plutus.ExUnits | |
| NFData (PlutusScriptContext l) ⇒ NFData (LegacyPlutusArgs l) | |
Defined in Cardano.Ledger.Plutus.Language Methods rnf ∷ LegacyPlutusArgs l → () # | |
| NFData (Plutus l) | |
Defined in Cardano.Ledger.Plutus.Language | |
| NFData (PlutusArgs 'PlutusV1) | |
Defined in Cardano.Ledger.Plutus.Language Methods rnf ∷ PlutusArgs 'PlutusV1 → () # | |
| NFData (PlutusArgs 'PlutusV2) | |
Defined in Cardano.Ledger.Plutus.Language Methods rnf ∷ PlutusArgs 'PlutusV2 → () # | |
| NFData (PlutusArgs 'PlutusV3) | |
Defined in Cardano.Ledger.Plutus.Language Methods rnf ∷ PlutusArgs 'PlutusV3 → () # | |
| NFData (PlutusArgs 'PlutusV4) | |
Defined in Cardano.Ledger.Plutus.Language Methods rnf ∷ PlutusArgs 'PlutusV4 → () # | |
| NFData (PlutusRunnable l) | |
Defined in Cardano.Ledger.Plutus.Language Methods rnf ∷ PlutusRunnable l → () # | |
| NFData (CommitteeState era) | |
Defined in Cardano.Ledger.State.CertState Methods rnf ∷ CommitteeState era → () # | |
| NFData (Accounts era) ⇒ NFData (DState era) | |
Defined in Cardano.Ledger.State.CertState | |
| NFData (PState era) | |
Defined in Cardano.Ledger.State.CertState | |
| NFData (PParams era) ⇒ NFData (FuturePParams era) | |
Defined in Cardano.Ledger.State.Governance Methods rnf ∷ FuturePParams era → () # | |
| (Era era, NFData (Script era)) ⇒ NFData (ScriptsProvided era) | |
Defined in Cardano.Ledger.State.UTxO Methods rnf ∷ ScriptsProvided era → () # | |
| (Era era, NFData (TxOut era)) ⇒ NFData (UTxO era) | |
Defined in Cardano.Ledger.State.UTxO | |
| NFData (KeyPair kd) Source # | |
Defined in Test.Cardano.Ledger.Core.KeyPair | |
| NFData a ⇒ NFData (WithOrigin a) | |
Defined in Cardano.Slotting.Slot Methods rnf ∷ WithOrigin a → () # | |
| NFData a ⇒ NFData (StrictMaybe a) | |
Defined in Data.Maybe.Strict Methods rnf ∷ StrictMaybe a → () # | |
| NFData a ⇒ NFData (StrictSeq a) | |
Defined in Data.Sequence.Strict | |
| NFData a ⇒ NFData (SCC a) | |
Defined in Data.Graph | |
| NFData a ⇒ NFData (IntMap a) | |
Defined in Data.IntMap.Internal | |
| NFData a ⇒ NFData (Digit a) | |
Defined in Data.Sequence.Internal | |
| NFData a ⇒ NFData (Elem a) | |
Defined in Data.Sequence.Internal | |
| NFData a ⇒ NFData (FingerTree a) | |
Defined in Data.Sequence.Internal Methods rnf ∷ FingerTree a → () # | |
| NFData a ⇒ NFData (Node a) | |
Defined in Data.Sequence.Internal | |
| NFData a ⇒ NFData (Seq a) | |
Defined in Data.Sequence.Internal | |
| NFData a ⇒ NFData (Set a) | |
Defined in Data.Set.Internal | |
| NFData a ⇒ NFData (Tree a) | |
| NFData (Context a) | |
Defined in Crypto.Hash.Types | |
| NFData (Digest a) | |
Defined in Crypto.Hash.Types | |
| NFData1 f ⇒ NFData (Fix f) | |
| NFData a ⇒ NFData (DNonEmpty a) | |
Defined in Data.DList.DNonEmpty.Internal | |
| NFData a ⇒ NFData (DList a) | |
Defined in Data.DList.Internal | |
| NFData a ⇒ NFData (NonEmpty a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData (Identity a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData (First a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData (Last a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData (Down a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData (Dual a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData (Product a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData (Sum a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData (ZipList a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData (IORef a) | NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData (MVar a) | NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData (FunPtr a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData (Ptr a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData (Ratio a) | |
Defined in Control.DeepSeq | |
| NFData (StableName a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq Methods rnf ∷ StableName a → () # | |
| NFData a ⇒ NFData (Hashed a) | |
Defined in Data.Hashable.Class | |
| NFData a ⇒ NFData (ErrorFancy a) | |
Defined in Text.Megaparsec.Error Methods rnf ∷ ErrorFancy a → () # | |
| NFData t ⇒ NFData (ErrorItem t) | |
Defined in Text.Megaparsec.Error | |
| NFData s ⇒ NFData (PosState s) | |
Defined in Text.Megaparsec.State | |
| NFData (CaserBuiltin uni) | |
Defined in PlutusCore.Builtin.Case Methods rnf ∷ CaserBuiltin uni → () # | |
| NFData (BuiltinSemanticsVariant DefaultFun) | |
Defined in PlutusCore.Default.Builtins Methods rnf ∷ BuiltinSemanticsVariant DefaultFun → () # | |
| NFData (BuiltinRuntime val) | |
Defined in PlutusCore.Builtin.Runtime Methods rnf ∷ BuiltinRuntime val → () # | |
| NFData ann ⇒ NFData (Kind ann) | |
Defined in PlutusCore.Core.Type | |
| NFData a ⇒ NFData (Normalized a) | |
Defined in PlutusCore.Core.Type Methods rnf ∷ Normalized a → () # | |
| NFData a ⇒ NFData (ExpectedShapeOr a) | |
Defined in PlutusCore.Error Methods rnf ∷ ExpectedShapeOr a → () # | |
| NFData ann ⇒ NFData (UniqueError ann) | |
Defined in PlutusCore.Error Methods rnf ∷ UniqueError ann → () # | |
| AllArgumentModels NFData f ⇒ NFData (BuiltinCostModelBase f) | |
Defined in PlutusCore.Evaluation.Machine.BuiltinCostModel Methods rnf ∷ BuiltinCostModelBase f → () # | |
| NFData model ⇒ NFData (CostingFun model) | |
Defined in PlutusCore.Evaluation.Machine.CostingFun.Core Methods rnf ∷ CostingFun model → () # | |
| NFData (MachineError fun) | |
Defined in PlutusCore.Evaluation.Machine.Exception Methods rnf ∷ MachineError fun → () # | |
| NFData a ⇒ NFData (EvaluationResult a) | |
Defined in PlutusCore.Evaluation.Result Methods rnf ∷ EvaluationResult a → () # | |
| Closed uni ⇒ NFData (SomeTypeIn uni) | |
Defined in Universe.Core Methods rnf ∷ SomeTypeIn uni → () # | |
| AllBF NFData f CekMachineCostsBase ⇒ NFData (CekMachineCostsBase f) | |
Defined in UntypedPlutusCore.Evaluation.Machine.Cek.CekMachineCosts Methods rnf ∷ CekMachineCostsBase f → () # | |
| NFData fun ⇒ NFData (CekExTally fun) | |
Defined in UntypedPlutusCore.Evaluation.Machine.Cek.ExBudgetMode Methods rnf ∷ CekExTally fun → () # | |
| NFData fun ⇒ NFData (TallyingSt fun) | |
Defined in UntypedPlutusCore.Evaluation.Machine.Cek.ExBudgetMode Methods rnf ∷ TallyingSt fun → () # | |
| NFData fun ⇒ NFData (ExBudgetCategory fun) | |
Defined in UntypedPlutusCore.Evaluation.Machine.Cek.Internal Methods rnf ∷ ExBudgetCategory fun → () # | |
| NFData a ⇒ NFData (PostAligned a) | |
Defined in PlutusCore.Flat.Filler Methods rnf ∷ PostAligned a → () # | |
| NFData a ⇒ NFData (PreAligned a) | |
Defined in PlutusCore.Flat.Filler Methods rnf ∷ PreAligned a → () # | |
| NFData (Extended a) | |
Defined in PlutusLedgerApi.V1.Data.Interval | |
| NFData (Interval a) | |
Defined in PlutusLedgerApi.V1.Data.Interval | |
| NFData (LowerBound a) | |
Defined in PlutusLedgerApi.V1.Data.Interval Methods rnf ∷ LowerBound a → () # | |
| NFData (UpperBound a) | |
Defined in PlutusLedgerApi.V1.Data.Interval Methods rnf ∷ UpperBound a → () # | |
| NFData a ⇒ NFData (Extended a) | |
Defined in PlutusLedgerApi.V1.Interval | |
| NFData a ⇒ NFData (Interval a) | |
Defined in PlutusLedgerApi.V1.Interval | |
| NFData a ⇒ NFData (LowerBound a) | |
Defined in PlutusLedgerApi.V1.Interval Methods rnf ∷ LowerBound a → () # | |
| NFData a ⇒ NFData (UpperBound a) | |
Defined in PlutusLedgerApi.V1.Interval Methods rnf ∷ UpperBound a → () # | |
| NFData a ⇒ NFData (AnnotDetails a) | |
Defined in Text.PrettyPrint.Annotated.HughesPJ Methods rnf ∷ AnnotDetails a → () # | |
| NFData a ⇒ NFData (Doc a) | |
Defined in Text.PrettyPrint.Annotated.HughesPJ | |
| NFData a ⇒ NFData (Array a) | |
Defined in Data.Primitive.Array | |
| NFData (PrimArray a) | |
Defined in Data.Primitive.PrimArray | |
| NFData a ⇒ NFData (SmallArray a) | |
Defined in Data.Primitive.SmallArray Methods rnf ∷ SmallArray a → () # | |
| NFData a ⇒ NFData (Leaf a) | |
Defined in Data.RAList.Tree.Internal | |
| NFData g ⇒ NFData (StateGen g) | |
Defined in System.Random.Internal | |
| NFData g ⇒ NFData (AtomicGen g) | |
Defined in System.Random.Stateful | |
| NFData g ⇒ NFData (IOGen g) | |
Defined in System.Random.Stateful | |
| NFData g ⇒ NFData (STGen g) | |
Defined in System.Random.Stateful | |
| NFData g ⇒ NFData (TGen g) | |
Defined in System.Random.Stateful | |
| NFData a ⇒ NFData (Maybe a) | |
Defined in Data.Strict.Maybe | |
| NFData a ⇒ NFData (Edit a) | |
Defined in Data.TreeDiff.List | |
| NFData v ⇒ NFData (Val v) | |
Defined in Data.TreeDiff.OMap | |
| NFData a ⇒ NFData (HashSet a) | |
Defined in Data.HashSet.Internal | |
| NFData a ⇒ NFData (Vector a) | |
Defined in Data.Vector | |
| NFData (Vector a) | |
Defined in Data.Vector.Primitive | |
| NFData (Vector a) | |
Defined in Data.Vector.Storable | |
| NFData a ⇒ NFData (Vector a) | |
Defined in Data.Vector.Strict | |
| NFData (Vector a) | |
Defined in Data.Vector.Unboxed.Base | |
| NFData a ⇒ NFData (Doc a) | |
Defined in Text.PrettyPrint.Annotated.WL | |
| NFData a ⇒ NFData (SimpleDoc a) | |
Defined in Text.PrettyPrint.Annotated.WL | |
| NFData a ⇒ NFData (Maybe a) | |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData (Solo a) | Since: deepseq-1.4.6.0 |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData [a] | |
Defined in Control.DeepSeq | |
| (NFData e, NFData a) ⇒ NFData (Graph e a) | |
Defined in Algebra.Graph.Labelled | |
| (NFData a, NFData e) ⇒ NFData (AdjacencyMap e a) | |
Defined in Algebra.Graph.Labelled.AdjacencyMap Methods rnf ∷ AdjacencyMap e a → () # | |
| (NFData i, NFData r) ⇒ NFData (IResult i r) | |
Defined in Data.Attoparsec.Internal.Types | |
| NFData (Fixed a) | Since: deepseq-1.3.0.0 |
Defined in Control.DeepSeq | |
| (NFData a, NFData b) ⇒ NFData (Arg a b) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| (NFData a, NFData b) ⇒ NFData (Bimap a b) | |
Defined in Data.Bimap | |
| NFData (SigDSIGN v) ⇒ NFData (SignedDSIGN v a) | |
Defined in Cardano.Crypto.DSIGN.Class Methods rnf ∷ SignedDSIGN v a → () # | |
| NFData (Hash h a) | |
Defined in Cardano.Crypto.Hash.Class | |
| NFData (AbstractHash algo a) | |
Defined in Cardano.Crypto.Hashing Methods rnf ∷ AbstractHash algo a → () # | |
| (NFData k, NFData v) ⇒ NFData (OMap k v) | |
Defined in Data.OMap.Strict | |
| (NFData b, NFData a) ⇒ NFData (Annotated b a) | |
Defined in Cardano.Ledger.Binary.Decoding.Annotated | |
| NFData a ⇒ NFData (BoundedRatio b a) | |
Defined in Cardano.Ledger.BaseTypes | |
| NFData a ⇒ NFData (Mismatch r a) | |
Defined in Cardano.Ledger.BaseTypes | |
| NFData (VoidEraRule rule era) | |
Defined in Cardano.Ledger.Core.Era Methods rnf ∷ VoidEraRule rule era → () # | |
| (NFData k, NFData a) ⇒ NFData (Map k a) | |
Defined in Data.Map.Internal | |
| (NFData a, NFData b) ⇒ NFData (Array a b) | |
Defined in Control.DeepSeq | |
| (NFData a, NFData b) ⇒ NFData (Either a b) | |
Defined in Control.DeepSeq | |
| NFData (Proxy a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData (TypeRep a) | Since: deepseq-1.4.8.0 |
Defined in Control.DeepSeq | |
| NFData (STRef s a) | NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| (NFData (Token s), NFData e) ⇒ NFData (ParseError s e) | |
Defined in Text.Megaparsec.Error Methods rnf ∷ ParseError s e → () # | |
| (NFData s, NFData (Token s), NFData e) ⇒ NFData (ParseErrorBundle s e) | |
Defined in Text.Megaparsec.Error Methods rnf ∷ ParseErrorBundle s e → () # | |
| (NFData s, NFData (ParseError s e)) ⇒ NFData (State s e) | |
Defined in Text.Megaparsec.State | |
| (NFData k, NFData a) ⇒ NFData (MonoidalHashMap k a) | |
Defined in Data.HashMap.Monoidal Methods rnf ∷ MonoidalHashMap k a → () # | |
| (NFData k, NFData a) ⇒ NFData (MonoidalMap k a) | |
Defined in Data.Map.Monoidal Methods rnf ∷ MonoidalMap k a → () # | |
| (Bounded fun, Enum fun) ⇒ NFData (BuiltinsRuntime fun val) | |
Defined in PlutusCore.Builtin.Runtime Methods rnf ∷ BuiltinsRuntime fun val → () # | |
| (NFData structural, NFData operational) ⇒ NFData (EvaluationError structural operational) | |
Defined in PlutusCore.Evaluation.Error Methods rnf ∷ EvaluationError structural operational → () # | |
| (NFData err, NFData cause) ⇒ NFData (ErrorWithCause err cause) | |
Defined in PlutusCore.Evaluation.ErrorWithCause Methods rnf ∷ ErrorWithCause err cause → () # | |
| (Closed uni, Everywhere uni NFData) ⇒ NFData (ValueOf uni a) | |
Defined in Universe.Core | |
| (NFData ann, Closed uni) ⇒ NFData (TypeErrorExt uni ann) | |
Defined in PlutusIR.Error Methods rnf ∷ TypeErrorExt uni ann → () # | |
| (NFData k, NFData v) ⇒ NFData (Map k v) | |
Defined in PlutusTx.AssocMap | |
| NFData (MutablePrimArray s a) | |
Defined in Data.Primitive.PrimArray Methods rnf ∷ MutablePrimArray s a → () # | |
| NFData (f a) ⇒ NFData (Node f a) | |
Defined in Data.RAList.Tree.Internal | |
| (NFData a, NFData b) ⇒ NFData (Either a b) | |
Defined in Data.Strict.Either | |
| (NFData a, NFData b) ⇒ NFData (These a b) | |
Defined in Data.Strict.These | |
| (NFData a, NFData b) ⇒ NFData (Pair a b) | |
Defined in Data.Strict.Tuple | |
| (NFData a, NFData b) ⇒ NFData (These a b) | Since: these-0.7.1 |
Defined in Data.These | |
| (NFData k, NFData v) ⇒ NFData (OMap k v) | |
Defined in Data.TreeDiff.OMap | |
| (NFData k, NFData v) ⇒ NFData (HashMap k v) | |
Defined in Data.HashMap.Internal | |
| (NFData k, NFData v) ⇒ NFData (Leaf k v) | |
Defined in Data.HashMap.Internal | |
| (NFData e, NFData a) ⇒ NFData (Validation e a) | |
Defined in Validation Methods rnf ∷ Validation e a → () # | |
| NFData (MVector s a) | |
Defined in Data.Vector.Unboxed.Base | |
| (NFData a, NFData b) ⇒ NFData (a, b) | |
Defined in Control.DeepSeq | |
| NFData (a → b) | This instance is for convenience and consistency with Since: deepseq-1.3.0.0 |
Defined in Control.DeepSeq | |
| NFData a ⇒ NFData (Const a b) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| NFData (a :~: b) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| (NFData ann, NFData tyname, Closed uni) ⇒ NFData (Type tyname uni ann) | |
Defined in PlutusCore.Core.Type | |
| (NFData fun, NFData ann, Closed uni, Everywhere uni NFData, NFData ParserError) ⇒ NFData (Error uni fun ann) | |
Defined in PlutusCore.Error | |
| (NFData machineCosts, Bounded fun, Enum fun) ⇒ NFData (MachineParameters machineCosts fun val) | |
Defined in PlutusCore.Evaluation.Machine.MachineParameters Methods rnf ∷ MachineParameters machineCosts fun val → () # | |
| (NFData machineCosts, Bounded fun, Enum fun) ⇒ NFData (MachineVariantParameters machineCosts fun val) | |
Defined in PlutusCore.Evaluation.Machine.MachineParameters Methods rnf ∷ MachineVariantParameters machineCosts fun val → () # | |
| NFData b ⇒ NFData (Tagged s b) | |
Defined in Data.Tagged | |
| (NFData (f a), NFData (g a), NFData a) ⇒ NFData (These1 f g a) | Available always Since: these-1.2 |
Defined in Data.Functor.These | |
| (NFData (kv k), NFData (vv v)) ⇒ NFData (KVVector kv vv (k, v)) | |
Defined in Data.VMap.KVVector | |
| (NFData a1, NFData a2, NFData a3) ⇒ NFData (a1, a2, a3) | |
Defined in Control.DeepSeq | |
| (NFData (f a), NFData (g a)) ⇒ NFData (Product f g a) | Note: in Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| (NFData (f a), NFData (g a)) ⇒ NFData (Sum f g a) | Note: in Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| NFData (a :~~: b) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| (Closed uni, NFData ann, NFData term, NFData fun) ⇒ NFData (TypeError term uni fun ann) | |
Defined in PlutusCore.Error | |
| (NFData name, Everywhere uni NFData, NFData fun, NFData ann, Closed uni) ⇒ NFData (Program name uni fun ann) | |
Defined in UntypedPlutusCore.Core.Type | |
| (NFData name, NFData fun, NFData ann, Everywhere uni NFData, Closed uni) ⇒ NFData (Term name uni fun ann) | |
Defined in UntypedPlutusCore.Core.Type | |
| (NFData (kv k), NFData (vv v)) ⇒ NFData (VMap kv vv k v) | |
| (NFData a1, NFData a2, NFData a3, NFData a4) ⇒ NFData (a1, a2, a3, a4) | |
Defined in Control.DeepSeq | |
| NFData (f (g a)) ⇒ NFData (Compose f g a) | Note: in Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| (NFData tyname, NFData name, Everywhere uni NFData, NFData fun, NFData ann, Closed uni) ⇒ NFData (Program tyname name uni fun ann) | |
Defined in PlutusCore.Core.Type | |
| (NFData tyname, NFData name, NFData fun, NFData ann, Everywhere uni NFData, Closed uni) ⇒ NFData (Term tyname name uni fun ann) | |
Defined in PlutusCore.Core.Type | |
| (NFData tyname, NFData name, Closed uni, Everywhere uni NFData, NFData fun, NFData ann) ⇒ NFData (NormCheckError tyname name uni fun ann) | |
Defined in PlutusCore.Error Methods rnf ∷ NormCheckError tyname name uni fun ann → () # | |
| (NFData a1, NFData a2, NFData a3, NFData a4, NFData a5) ⇒ NFData (a1, a2, a3, a4, a5) | |
Defined in Control.DeepSeq | |
| (NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6) ⇒ NFData (a1, a2, a3, a4, a5, a6) | |
Defined in Control.DeepSeq | |
| (NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7) ⇒ NFData (a1, a2, a3, a4, a5, a6, a7) | |
Defined in Control.DeepSeq | |
| (NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7, NFData a8) ⇒ NFData (a1, a2, a3, a4, a5, a6, a7, a8) | |
Defined in Control.DeepSeq | |
| (NFData a1, NFData a2, NFData a3, NFData a4, NFData a5, NFData a6, NFData a7, NFData a8, NFData a9) ⇒ NFData (a1, a2, a3, a4, a5, a6, a7, a8, a9) | |
Defined in Control.DeepSeq | |
Expr
toExpr converts a Haskell value into
untyped Haskell-like syntax tree, Expr.
>>>toExpr ((1, Just 2) :: (Int, Maybe Int))App "_\215_" [App "1" [],App "Just" [App "2" []]]
Minimal complete definition
Nothing
Methods
listToExpr ∷ [a] → Expr Source #
Instances
| ToExpr Key | |
| ToExpr Value | |
| ToExpr ByteArray | Since: tree-diff-0.2.2 |
| ToExpr ByteString |
|
Defined in Data.TreeDiff.Class | |
| ToExpr ByteString |
|
Defined in Data.TreeDiff.Class | |
| ToExpr ShortByteString |
|
Defined in Data.TreeDiff.Class | |
| ToExpr Version | |
| ToExpr CBORBytes | |
| ToExpr HexBytes | |
| ToExpr Addr Source # | |
| ToExpr BootstrapAddress Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr CompactAddr Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr RewardAccount Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr Withdrawals Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr Anchor Source # | |
| ToExpr BlocksMade Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr CertIx Source # | |
| ToExpr DnsName Source # | |
| ToExpr Network Source # | |
| ToExpr NonNegativeInterval Source # | |
Defined in Test.Cardano.Ledger.TreeDiff Methods toExpr ∷ NonNegativeInterval → Expr Source # listToExpr ∷ [NonNegativeInterval] → Expr Source # | |
| ToExpr Nonce Source # | |
| ToExpr Port Source # | |
| ToExpr PositiveInterval Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr ProtVer Source # | |
| ToExpr TxIx Source # | |
| ToExpr UnitInterval Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr Url Source # | |
| ToExpr Coin Source # | |
| ToExpr DeltaCoin Source # | |
| ToExpr PoolCert Source # | |
| ToExpr Ptr Source # | |
| ToExpr SlotNo32 Source # | |
| ToExpr StakeReference Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr DRep Source # | |
| ToExpr DRepState Source # | |
| ToExpr GenDelegPair Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr GenDelegs Source # | |
| ToExpr ScriptHash Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr TxAuxDataHash Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr BootstrapWitness Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr ChainCode Source # | |
| ToExpr CostModel Source # | |
| ToExpr CostModels Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr ExUnits Source # | |
| ToExpr Prices Source # | |
| ToExpr Language Source # | |
| ToExpr PlutusBinary Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr TxOutSource Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr CommitteeAuthorization Source # | |
Defined in Test.Cardano.Ledger.TreeDiff Methods | |
| ToExpr FutureGenDeleg Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr InstantaneousRewards Source # | |
Defined in Test.Cardano.Ledger.TreeDiff Methods | |
| ToExpr ChainAccountState Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr IndividualPoolStake Source # | |
Defined in Test.Cardano.Ledger.TreeDiff Methods toExpr ∷ IndividualPoolStake → Expr Source # listToExpr ∷ [IndividualPoolStake] → Expr Source # | |
| ToExpr PoolDistr Source # | |
| ToExpr SnapShot Source # | |
| ToExpr SnapShots Source # | |
| ToExpr Stake Source # | |
| ToExpr PoolMetadata Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr StakePoolParams Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr StakePoolRelay Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr StakePoolState Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr TxId Source # | |
| ToExpr TxIn Source # | |
| ToExpr BlockNo | |
| ToExpr EpochInterval Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr EpochNo | |
| ToExpr EpochSize | |
| ToExpr SlotNo | |
| ToExpr Term | |
| ToExpr IntSet | |
| ToExpr Assign | |
| ToExpr CDDL | |
| ToExpr GenericArg | |
Defined in Codec.CBOR.Cuddle.CDDL | |
| ToExpr GenericParam | |
Defined in Codec.CBOR.Cuddle.CDDL | |
| ToExpr Group | |
| ToExpr GroupEntry | |
Defined in Codec.CBOR.Cuddle.CDDL | |
| ToExpr GroupEntryVariant | |
Defined in Codec.CBOR.Cuddle.CDDL | |
| ToExpr GrpChoice | |
| ToExpr MemberKey | |
| ToExpr Name | |
| ToExpr OccurrenceIndicator | |
Defined in Codec.CBOR.Cuddle.CDDL Methods toExpr ∷ OccurrenceIndicator → Expr Source # listToExpr ∷ [OccurrenceIndicator] → Expr Source # | |
| ToExpr RangeBound | |
Defined in Codec.CBOR.Cuddle.CDDL | |
| ToExpr Rule | |
| ToExpr TopLevel | |
| ToExpr TyOp | |
| ToExpr Type0 | |
| ToExpr Type1 | |
| ToExpr Type2 | |
| ToExpr TypeOrGroup | |
Defined in Codec.CBOR.Cuddle.CDDL | |
| ToExpr Value | |
| ToExpr ValueVariant | |
Defined in Codec.CBOR.Cuddle.CDDL | |
| ToExpr CtlOp | |
| ToExpr Comment | |
| ToExpr Void | |
| ToExpr Int16 | |
| ToExpr Int32 | |
| ToExpr Int64 | |
| ToExpr Int8 | |
| ToExpr Word16 | |
| ToExpr Word32 | |
| ToExpr Word64 | |
| ToExpr Word8 | |
| ToExpr Ordering | |
| ToExpr IPv4 | |
| ToExpr IPv6 | |
| ToExpr Scientific |
|
Defined in Data.TreeDiff.Class | |
| ToExpr Text |
|
| ToExpr Text |
|
| ToExpr Day |
|
| ToExpr UTCTime | |
| ToExpr Expr | |
| ToExpr UUID |
|
| ToExpr Integer | |
| ToExpr Natural | |
| ToExpr () | |
Defined in Data.TreeDiff.Class | |
| ToExpr Bool | |
| ToExpr Char |
|
| ToExpr Double | |
| ToExpr Float | |
| ToExpr Int | |
| ToExpr Word | |
| ToExpr a ⇒ ToExpr (KeyMap a) | |
| ToExpr a ⇒ ToExpr (First a) | |
| ToExpr a ⇒ ToExpr (Last a) | |
| ToExpr a ⇒ ToExpr (Max a) | |
| ToExpr a ⇒ ToExpr (Min a) | |
| ToExpr a ⇒ ToExpr (Sized a) | |
| ToExpr a ⇒ ToExpr (NonZero a) Source # | |
| ToExpr (CompactForm Coin) Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr (CompactForm DeltaCoin) Source # | |
Defined in Test.Cardano.Ledger.TreeDiff Methods toExpr ∷ CompactForm DeltaCoin → Expr Source # listToExpr ∷ [CompactForm DeltaCoin] → Expr Source # | |
| ToExpr (PParamsHKD Identity era) ⇒ ToExpr (PParams era) Source # | |
| ToExpr (PParamsHKD StrictMaybe era) ⇒ ToExpr (PParamsUpdate era) Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr (Credential keyrole) Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr (NoUpdate a) Source # | |
| ToExpr (KeyHash keyrole) Source # | |
| ToExpr (SafeHash i) Source # | |
| ToExpr (VRFVerKeyHash keyrole) Source # | |
Defined in Test.Cardano.Ledger.TreeDiff Methods toExpr ∷ VRFVerKeyHash keyrole → Expr Source # listToExpr ∷ [VRFVerKeyHash keyrole] → Expr Source # | |
| ToExpr (VKey r) Source # | |
| ToExpr (WitVKey kr) Source # | |
| ToExpr t ⇒ ToExpr (MemoBytes t) Source # | |
| ToExpr (BinaryData era) Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr (Data era) Source # | |
| ToExpr (Datum era) Source # | |
| ToExpr (PlutusData era) Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr (Plutus l) Source # | |
| ToExpr (CommitteeState era) Source # | |
Defined in Test.Cardano.Ledger.TreeDiff | |
| ToExpr (Accounts era) ⇒ ToExpr (DState era) Source # | |
| ToExpr (PState era) Source # | |
| (Era era, ToExpr (Script era)) ⇒ ToExpr (ScriptsProvided era) Source # | |
Defined in Test.Cardano.Ledger.TreeDiff Methods toExpr ∷ ScriptsProvided era → Expr Source # listToExpr ∷ [ScriptsProvided era] → Expr Source # | |
| ToExpr (TxOut era) ⇒ ToExpr (UTxO era) Source # | |
| ToExpr (KeyPair r) Source # | |
| ToExpr x ⇒ ToExpr (WithOrigin x) | |
Defined in Test.Cardano.Slotting.TreeDiff | |
| ToExpr a ⇒ ToExpr (StrictMaybe a) | |
Defined in Test.Cardano.Ledger.Binary.TreeDiff | |
| ToExpr a ⇒ ToExpr (StrictSeq a) | |
| ToExpr v ⇒ ToExpr (IntMap v) | |
| ToExpr v ⇒ ToExpr (Seq v) | |
| ToExpr k ⇒ ToExpr (Set k) | |
| ToExpr a ⇒ ToExpr (Tree a) | |
| ToExpr a ⇒ ToExpr (NonEmpty a) | |
| ToExpr a ⇒ ToExpr (Identity a) |
|
| ToExpr a ⇒ ToExpr (First a) | |
| ToExpr a ⇒ ToExpr (Last a) | |
| ToExpr a ⇒ ToExpr (Dual a) | |
| ToExpr a ⇒ ToExpr (Product a) | |
| ToExpr a ⇒ ToExpr (Sum a) | |
| ToExpr a ⇒ ToExpr (ZipList a) | |
| (ToExpr a, Integral a) ⇒ ToExpr (Ratio a) |
|
| ToExpr a ⇒ ToExpr (Hashed a) | |
| ToExpr a ⇒ ToExpr (Maybe a) | |
| ToExpr k ⇒ ToExpr (HashSet k) | |
| ToExpr a ⇒ ToExpr (Vector a) | |
| (ToExpr a, Prim a) ⇒ ToExpr (Vector a) | |
| (ToExpr a, Storable a) ⇒ ToExpr (Vector a) | |
| (ToExpr a, Unbox a) ⇒ ToExpr (Vector a) | |
| ToExpr a ⇒ ToExpr (Maybe a) | |
| ToExpr a ⇒ ToExpr [a] | |
Defined in Data.TreeDiff.Class | |
| HasResolution a ⇒ ToExpr (Fixed a) | |
| DSIGNAlgorithm c ⇒ ToExpr (SignedDSIGN c index) | |
Defined in Test.Cardano.Ledger.Binary.TreeDiff Methods toExpr ∷ SignedDSIGN c index → Expr Source # listToExpr ∷ [SignedDSIGN c index] → Expr Source # | |
| ToExpr (Hash c index) | |
| ToExpr a ⇒ ToExpr (Mismatch r a) Source # | |
| ToExpr (VoidEraRule rule era) Source # | |
Defined in Test.Cardano.Ledger.TreeDiff Methods toExpr ∷ VoidEraRule rule era → Expr Source # listToExpr ∷ [VoidEraRule rule era] → Expr Source # | |
| (ToExpr k, ToExpr v) ⇒ ToExpr (Map k v) | |
| (ToExpr a, ToExpr b) ⇒ ToExpr (Either a b) | |
| ToExpr (Proxy a) | |
| (ToExpr a, ToExpr b) ⇒ ToExpr (Either a b) | |
| (ToExpr a, ToExpr b) ⇒ ToExpr (These a b) | |
| (ToExpr a, ToExpr b) ⇒ ToExpr (Pair a b) | |
| (ToExpr a, ToExpr b) ⇒ ToExpr (These a b) | |
| (ToExpr k, ToExpr v) ⇒ ToExpr (HashMap k v) | |
| (ToExpr a, ToExpr b) ⇒ ToExpr (a, b) | |
Defined in Data.TreeDiff.Class | |
| ToExpr a ⇒ ToExpr (Const a b) | |
| ToExpr a ⇒ ToExpr (Tagged t a) | |
| (ToExpr a, ToExpr b, ToExpr c) ⇒ ToExpr (a, b, c) | |
Defined in Data.TreeDiff.Class | |
| (Vector kv k, Vector vv v, ToExpr k, ToExpr v) ⇒ ToExpr (VMap kv vv k v) | |
| (ToExpr a, ToExpr b, ToExpr c, ToExpr d) ⇒ ToExpr (a, b, c, d) | |
Defined in Data.TreeDiff.Class | |
| (ToExpr a, ToExpr b, ToExpr c, ToExpr d, ToExpr e) ⇒ ToExpr (a, b, c, d, e) | |
Defined in Data.TreeDiff.Class | |
ansiExprString ∷ ToExpr a ⇒ a → String Source #
diffExprString ∷ ToExpr a ⇒ a → a → String Source #
diffExprCompactString ∷ ToExpr a ⇒ a → a → String Source #
Expectations
Arguments
| ∷ HasCallStack | |
| ⇒ String | The message that is displayed if the assertion fails |
| → Bool | The condition |
| → Assertion |
Asserts that the specified condition holds.
Arguments
| ∷ HasCallStack | |
| ⇒ String | A message that is displayed with the assertion failure |
| → IO a |
Unconditionally signals that a failure has occurred.
assertColorFailure ∷ HasCallStack ⇒ String → IO a Source #
Similar to assertFailure, except hspec will not interfer with any escape sequences
that indicate color output.
Non-standard expectations
shouldBeExpr ∷ (HasCallStack, ToExpr a, Eq a) ⇒ a → a → IO () infix 1 Source #
shouldBeRight ∷ (HasCallStack, Show a, Show b, Eq b) ⇒ Either a b → b → Expectation infix 1 Source #
shouldBeLeft ∷ (HasCallStack, Show a, Eq a, Show b) ⇒ Either a b → a → Expectation infix 1 Source #
shouldBeRightExpr ∷ (HasCallStack, ToExpr a, Eq b, ToExpr b) ⇒ Either a b → b → Expectation infix 1 Source #
Same as shouldBeExpr, except it checks that the value is Right
shouldBeLeftExpr ∷ (HasCallStack, ToExpr a, ToExpr b, Eq a) ⇒ Either a b → a → Expectation infix 1 Source #
Same as shouldBeExpr, except it checks that the value is Left
expectRight ∷ (HasCallStack, Show a) ⇒ Either a b → IO b Source #
Return value on the Right and fail otherwise.
Difference from shouldSatisfy action isRightexpectRight
will force the content of the Right to WHNF and return it. This expectation will also
show the content of the Left when expectation fails.
expectRightDeep ∷ (HasCallStack, Show a, NFData b) ⇒ Either a b → IO b Source #
Same as expectRight, but also evaluate the returned value to NF
expectRightDeep_ ∷ (HasCallStack, Show a, NFData b) ⇒ Either a b → IO () Source #
Same as expectRightDeep, but discards the result
expectRightExpr ∷ (HasCallStack, ToExpr a) ⇒ Either a b → IO b Source #
Same as expectRight, but use ToExpr instead of Show
expectRightDeepExpr ∷ (HasCallStack, ToExpr a, NFData b) ⇒ Either a b → IO b Source #
Same as expectRightDeep, but use ToExpr instead of Show
expectRightDeepExpr_ ∷ (HasCallStack, ToExpr a, NFData b) ⇒ Either a b → IO () Source #
Same as expectRightDeepExpr, but discard the contents of Right
expectLeft ∷ (HasCallStack, Show b) ⇒ Either a b → IO a Source #
Return value on the Left an fail otherwise
Difference from shouldSatisfy action isLeftexpectLeft will
force the content of the Left to WHNF and and return it. This expectation will also
show the content of the Right when expectation fails.
expectLeftExpr ∷ (HasCallStack, ToExpr b) ⇒ Either a b → IO a Source #
Same as expectLeft, but use ToExpr instead of Show
expectLeftDeep ∷ (HasCallStack, NFData a, Show b) ⇒ Either a b → IO a Source #
Same as expectLeft, but also evaluate the returned value to NF
expectLeftDeep_ ∷ (HasCallStack, NFData a, Show b) ⇒ Either a b → IO () Source #
Same as expectLeftDeep, but discards the result
expectLeftDeepExpr ∷ (HasCallStack, ToExpr b, NFData a) ⇒ Either a b → IO a Source #
Same as expectLeftDeep, but use ToExpr instead of Show
expectLeftDeepExpr_ ∷ (HasCallStack, ToExpr b, NFData a) ⇒ Either a b → IO () Source #
Same as expectLeftDeepExpr, but discard the contents of Left
expectJust ∷ HasCallStack ⇒ Maybe a → IO a Source #
Return value from the Just an fail otherwise
Difference from shouldSatisfy action isJustexpectJust will force the
content of the Just to WHNF and it will also return it.
expectJustDeep ∷ (HasCallStack, NFData a) ⇒ Maybe a → IO a Source #
Same as expectJust, but will force the value to NF
expectJustDeep_ ∷ (HasCallStack, NFData a) ⇒ Maybe a → IO () Source #
Same as expectJustDeep, but will discard the forced contents of Just
expectNothing ∷ (HasCallStack, Show a) ⇒ Maybe a → IO () Source #
Same as shouldSatisfy action isNothing
Miscellanous helpers
tracedDiscard ∷ String → a Source #
Same as discard but outputs a debug trace message