Test.QuickCheck.RandomTree

Documentation

data Tree a

Constructors

Tree a [Tree a]

Instances

Eq a => Eq (Tree a)

Methods

(==) :: Tree a -> Tree a -> Bool

(/=) :: Tree a -> Tree a -> Bool

Show a => Show (Tree a)

Methods

showsPrec :: Int -> Tree a -> ShowS

show :: Tree a -> String

showList :: [Tree a] -> ShowS

Arbitrary a => Arbitrary (Tree a)

Methods

arbitrary :: Gen (Tree a)

shrink :: Tree a -> [Tree a]

type Rec a = RecT Gen a

newtype RecT m a

Constructors

RecT

Fields

• runRecT :: ReaderT Int (MaybeT m) a

Instances

MonadTrans RecT

Methods

lift :: Monad m => m a -> RecT m a

Monad m => Monad (RecT m)

Methods

(>>=) :: RecT m a -> (a -> RecT m b) -> RecT m b

(>>) :: RecT m a -> RecT m b -> RecT m b

return :: a -> RecT m a

fail :: String -> RecT m a

Functor m => Functor (RecT m)

Methods

fmap :: (a -> b) -> RecT m a -> RecT m b

(<$) :: a -> RecT m b -> RecT m a

(Functor m, Monad m) => Applicative (RecT m)

Methods

pure :: a -> RecT m a

(<*>) :: RecT m (a -> b) -> RecT m a -> RecT m b

(*>) :: RecT m a -> RecT m b -> RecT m b

(<*) :: RecT m a -> RecT m b -> RecT m a

MonadGen m => MonadGen (RecT m)

Methods

liftGen :: Gen a -> RecT m a

sized :: (Int -> RecT m a) -> RecT m a

class Monad m => MonadGen m where

Minimal complete definition

liftGen, sized

Methods

liftGen :: Gen a -> m a

sized :: (Int -> m a) -> m a

Instances

MonadGen Gen

Methods

liftGen :: Gen a -> Gen a

sized :: (Int -> Gen a) -> Gen a

MonadGen m => MonadGen (MaybeT m)

Methods

liftGen :: Gen a -> MaybeT m a

sized :: (Int -> MaybeT m a) -> MaybeT m a

MonadGen m => MonadGen (RecT m)

Methods

liftGen :: Gen a -> RecT m a

sized :: (Int -> RecT m a) -> RecT m a

MonadGen m => MonadGen (ReaderT * a m)

Methods

liftGen :: Gen a -> ReaderT * a m a

sized :: (Int -> ReaderT * a m a) -> ReaderT * a m a

elements :: MonadGen m => [a] -> m a

recForM :: MonadGen m => [a] -> (a -> RecT m b) -> RecT m [b]

recListFrom :: Int -> Rec a -> Rec [a]

recListFromTo :: Int -> Int -> Rec a -> Rec [a]

try :: Monad m => RecT m a -> RecT m (Maybe a)

consume :: Monad m => RecT m a -> RecT m a

choice :: MonadGen m => [RecT m a] -> RecT m a

runRec :: MonadGen m => RecT m a -> m (Maybe a)

data MyTree

Constructors

MyLeaf

TwoSubtrees MyTree MyTree

SomeSubtress [MyTree]

Instances

Show MyTree

Methods

showsPrec :: Int -> MyTree -> ShowS

show :: MyTree -> String

showList :: [MyTree] -> ShowS

putInBins :: Int -> Int -> Gen [Int]

prop_bin_length :: NonNegative Int -> Positive Int -> Property

prop_bin_sum :: NonNegative Int -> Positive Int -> Property

prop_rand_tree_size :: Property

prop_subtree_size :: NonNegative Int -> Positive Int -> Property

gen :: Gen (Tree Int, Int)

size :: Tree a -> Int

subtree_size :: Int -> Int -> Gen [Int]

make_node :: Int -> Gen (Int, Int)

make_struct :: Int -> [RecStruct] -> RecStruct

tree_of :: Num a => RecStruct -> Tree a

prop_tree_shape :: Property

subtrees :: Tree t -> [Tree t]

degree :: Tree t -> Int

root :: Tree t -> t

type NodeGen a b = b -> Int -> Gen (a, [b])

data RecStruct

Constructors

Leaf

Node RecStruct RecStruct RecStruct RecStruct RecStruct

recursive_struct' :: NodeGen a b -> (a -> [c] -> c) -> b -> Gen c

recursive_struct :: (Int -> Gen (a, Int)) -> (a -> [c] -> c) -> Gen c

tree_from' :: NodeGen a b -> b -> Gen (Tree a)

tree_from :: (Int -> Gen (a, Int)) -> Gen (Tree a)

tree_from_aux :: NodeGen a b -> b -> Int -> Gen (Tree a)

run_tests :: (PropName -> Property -> IO (a, Result)) -> IO ([a], Bool)