Safe Haskell	Safe-Inferred
Language	Haskell2010

Test.LessArbitrary

Synopsis

class StartingState s => LessArbitrary s a where
- lessArbitrary :: CostGen s a
oneof :: HasCallStack => [CostGen s a] -> CostGen s a
choose :: Random a => (a, a) -> CostGen s a
budgetChoose :: CostGen s Int
newtype CostGen s a = CostGen {
- runCostGen :: StateT (Cost, s) Gen a
}
(<$$$>) :: (a -> b) -> CostGen s a -> CostGen s b
($$$?) :: HasCallStack => CostGen s a -> CostGen s a -> CostGen s a
currentBudget :: CostGen s Cost
fasterArbitrary :: forall s a. LessArbitrary s a => Gen a
genericLessArbitrary :: (Generic a, GLessArbitrary s (Rep a)) => CostGen s a
genericLessArbitraryMonoid :: (Generic a, GLessArbitrary s (Rep a), Monoid a) => CostGen s a
flatLessArbitrary :: Arbitrary a => CostGen s a
spend :: Cost -> CostGen s ()
withCost :: forall s a. StartingState s => Int -> CostGen s a -> Gen a
elements :: [a] -> CostGen s a
forAll :: CostGen s a -> (a -> CostGen s b) -> CostGen s b
sizedCost :: LessArbitrary s a => CostGen s a -> Gen a
class StartingState s where
- startingState :: s

Documentation

class StartingState s => LessArbitrary s a where Source #

Minimal complete definition

Nothing

Methods

lessArbitrary :: CostGen s a Source #

default lessArbitrary :: (Generic a, GLessArbitrary s (Rep a)) => CostGen s a Source #

Instances

Instances details

StartingState s => LessArbitrary s Scientific Source #
Instance details Defined in Test.LessArbitrary Methods lessArbitrary :: CostGen s Scientific Source #
StartingState s => LessArbitrary s Integer Source #
Instance details Defined in Test.LessArbitrary Methods lessArbitrary :: CostGen s Integer Source #
StartingState s => LessArbitrary s Bool Source #
Instance details Defined in Test.LessArbitrary Methods lessArbitrary :: CostGen s Bool Source #
StartingState s => LessArbitrary s Char Source #
Instance details Defined in Test.LessArbitrary Methods lessArbitrary :: CostGen s Char Source #
StartingState s => LessArbitrary s Double Source #
Instance details Defined in Test.LessArbitrary Methods lessArbitrary :: CostGen s Double Source #
StartingState s => LessArbitrary s Int Source #
Instance details Defined in Test.LessArbitrary Methods lessArbitrary :: CostGen s Int Source #
(LessArbitrary s k, Ord k) => LessArbitrary s (Set k) Source #
Instance details Defined in Test.LessArbitrary Methods lessArbitrary :: CostGen s (Set k) Source #
LessArbitrary s a => LessArbitrary s (Vector a) Source #
Instance details Defined in Test.LessArbitrary Methods lessArbitrary :: CostGen s (Vector a) Source #
LessArbitrary s a => LessArbitrary s [a] Source #
Instance details Defined in Test.LessArbitrary Methods lessArbitrary :: CostGen s [a] Source #
(LessArbitrary s k, Eq k, Ord k, Hashable k, LessArbitrary s v) => LessArbitrary s (HashMap k v) Source #
Instance details Defined in Test.LessArbitrary Methods lessArbitrary :: CostGen s (HashMap k v) Source #
(LessArbitrary s k, LessArbitrary s v) => LessArbitrary s (k, v) Source #
Instance details Defined in Test.LessArbitrary Methods lessArbitrary :: CostGen s (k, v) Source #

oneof :: HasCallStack => [CostGen s a] -> CostGen s a Source #

choose :: Random a => (a, a) -> CostGen s a Source #

budgetChoose :: CostGen s Int Source #

Choose but only up to the budget (for array and list sizes)

newtype CostGen s a Source #

Constructors

CostGen
Fields runCostGen :: StateT (Cost, s) Gen a

Instances

Instances details

MonadState s (CostGen s) Source #
Instance details Defined in Test.LessArbitrary Methods get :: CostGen s s # put :: s -> CostGen s () # state :: (s -> (a, s)) -> CostGen s a #
MonadFix (CostGen s) Source #
Instance details Defined in Test.LessArbitrary Methods mfix :: (a -> CostGen s a) -> CostGen s a #
Applicative (CostGen s) Source #
Instance details Defined in Test.LessArbitrary Methods pure :: a -> CostGen s a # (<>) :: CostGen s (a -> b) -> CostGen s a -> CostGen s b # liftA2 :: (a -> b -> c) -> CostGen s a -> CostGen s b -> CostGen s c # (>) :: CostGen s a -> CostGen s b -> CostGen s b # (<*) :: CostGen s a -> CostGen s b -> CostGen s a #
Functor (CostGen s) Source #
Instance details Defined in Test.LessArbitrary Methods fmap :: (a -> b) -> CostGen s a -> CostGen s b # (<$) :: a -> CostGen s b -> CostGen s a #
Monad (CostGen s) Source #
Instance details Defined in Test.LessArbitrary Methods (>>=) :: CostGen s a -> (a -> CostGen s b) -> CostGen s b # (>>) :: CostGen s a -> CostGen s b -> CostGen s b # return :: a -> CostGen s a #
(Testable a, LessArbitrary s a) => Testable (CostGen s a) Source #
Instance details Defined in Test.LessArbitrary Methods property :: CostGen s a -> Property # propertyForAllShrinkShow :: Gen a0 -> (a0 -> [a0]) -> (a0 -> [String]) -> (a0 -> CostGen s a) -> Property #

(<$$$>) :: (a -> b) -> CostGen s a -> CostGen s b Source #

($$$?) :: HasCallStack => CostGen s a -> CostGen s a -> CostGen s a Source #

currentBudget :: CostGen s Cost Source #

fasterArbitrary :: forall s a. LessArbitrary s a => Gen a Source #

genericLessArbitrary :: (Generic a, GLessArbitrary s (Rep a)) => CostGen s a Source #

genericLessArbitraryMonoid :: (Generic a, GLessArbitrary s (Rep a), Monoid a) => CostGen s a Source #

flatLessArbitrary :: Arbitrary a => CostGen s a Source #

spend :: Cost -> CostGen s () Source #

withCost :: forall s a. StartingState s => Int -> CostGen s a -> Gen a Source #

elements :: [a] -> CostGen s a Source #

forAll :: CostGen s a -> (a -> CostGen s b) -> CostGen s b Source #

sizedCost :: LessArbitrary s a => CostGen s a -> Gen a Source #

class StartingState s where Source #

Methods

startingState :: s Source #

Instances

Instances details

StartingState () Source #
Instance details Defined in Test.LessArbitrary Methods startingState :: () Source #