| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Math.RandomTree.Algorithms
Description
Collects all functions pertaining to the creation of a random tree
- runTree :: ReaderStateRandom a -> Int -> Int -> Int -> Int -> StdGen -> Maybe a
- treeRecursion :: ReaderStateRandom (Tree Int)
- checkLowerBound :: ReaderStateRandom (Tree Int)
- getTree :: ReaderStateRandom (Tree Int)
- makeTree :: [String] -> Int -> Int -> Int -> Int -> Int -> Bool -> IO (PropertySuperTree String String)
Documentation
runTree :: ReaderStateRandom a -> Int -> Int -> Int -> Int -> StdGen -> Maybe a #
Run the monad transformer for the generation of a random tree. The minChildren value, if chosen, results in a leaf
treeRecursion :: ReaderStateRandom (Tree Int) #
The recursion for each step of the tree
checkLowerBound :: ReaderStateRandom (Tree Int) #
The check for the lower bound: if not fulfilled, returns Nothing
getTree :: ReaderStateRandom (Tree Int) #
Recursion which continues to make trees until the bounds are met