quickspec-0.9.6: Equational laws for free!

Safe Haskell	None

Test.QuickSpec.TestTree

Description

A data structure to represent refining a set of terms into equivalence classes by testing.

Documentation

data TestTree a Source

terms :: TestTree a -> [a]Source

union :: Ord r => [a -> r] -> TestTree a -> TestTree a -> TestTree aSource

test :: Ord r => [a -> r] -> [a] -> TestTree aSource

data TestResults a Source

cutOff :: Int -> Int -> TestTree a -> TestResults aSource

numTests :: TestResults a -> Int Source

numResults :: TestResults a -> Int Source

classes :: Ord a => TestResults a -> [[a]]Source

reps :: Ord a => TestResults a -> [a]Source

discrete :: Ord a => [a] -> TestResults aSource