constrained-generators-0.2.0.0: Framework for generating constrained random data using a subset of first order logic
Safe HaskellSafe-Inferred
LanguageHaskell2010

Constrained.Examples.Tree

Documentation

allZeroTree ∷ Specification BaseFn (BinTree Int) Source #

isBST ∷ Specification BaseFn (BinTree Int) Source #

noChildrenSameTree ∷ Specification BaseFn (BinTree Int) Source #

type RoseFn = Fix (OneofL (TreeFn ': BaseFns)) Source #

isAllZeroTree ∷ Specification RoseFn (Tree Int) Source #

noSameChildrenTree ∷ Specification RoseFn (Tree Int) Source #

successiveChildren ∷ Specification RoseFn (Tree Int) Source #

successiveChildren8 ∷ Specification RoseFn (Tree Int) Source #

roseTreeList ∷ Specification RoseFn [Tree Int] Source #

roseTreePairs ∷ Specification RoseFn (Tree ([Int], [Int])) Source #

roseTreeMaybe ∷ Specification RoseFn (Tree (Maybe (Int, Int))) Source #

badTreeInteraction ∷ Specification RoseFn (Tree (Either Int Int)) Source #