Control.Search

Efficient size-based search for values satisfying/falsifying a lazy boolean predicate. See Control.Enumerable for defining enumerations of data types.

Searching

search :: (Enumerable a, Coolean cool) => Int -> (a -> cool) -> IO [a]

Lazily finds all values of or below a given size that satisfies this predicate.

sat :: (Enumerable a, Coolean cool) => Int -> (a -> cool) -> Bool

Is there a value of or below a given size that satisfies this predicate?

searchRaw :: (Enumerable a, Coolean cool) => Int -> (a -> cool) -> IO [(Bool, a)]

Lazily finds all values isomorphic to p (w.r.t. laziness) and returns them along with the result of p.

usearch :: Enumerable a => Int -> (a -> Bool) -> [a]

Unsafe search, the order in which values are found is non-deterministic for some predicates.

Testing properties

test :: (Coolean cool, Enumerable a, Show a) => (a -> cool) -> IO ()

SmallCheck-like test driver. Tests a property with gradually increasing sizes until a conunterexample is found.

testTime :: (Coolean cool, Enumerable a, Show a) => Int -> (a -> cool) -> IO ()

Stop testing after a given number of seconds

Options for parallel conjunction

data Options

Options for parallel conjunction strategies

Constructors

D

Sequential

O

Optimal Short-circuiting

F

Parallel (fair)

OF

Optimal Short-circuiting and fairness

OS

Optimal Short-circuiting and choice-subset detection

OSF

Subset choice short-circuiting

Instances

Enum Options

Methods

succ :: Options -> Options

pred :: Options -> Options

toEnum :: Int -> Options

fromEnum :: Options -> Int

enumFrom :: Options -> [Options]

enumFromThen :: Options -> Options -> [Options]

enumFromTo :: Options -> Options -> [Options]

enumFromThenTo :: Options -> Options -> Options -> [Options]

Eq Options

Methods

(==) :: Options -> Options -> Bool

(/=) :: Options -> Options -> Bool

Read Options

Methods

readsPrec :: Int -> ReadS Options

readList :: ReadS [Options]

readPrec :: ReadPrec Options

readListPrec :: ReadPrec [Options]

Show Options

Methods

showsPrec :: Int -> Options -> ShowS

show :: Options -> String

showList :: [Options] -> ShowS

sat' :: (Enumerable a, Coolean cool) => Options -> Int -> (a -> cool) -> Bool

search' :: (Enumerable a, Coolean cool) => Options -> Int -> (a -> cool) -> IO [a]

searchRaw' :: (Enumerable a, Coolean cool) => Options -> Int -> (a -> cool) -> IO [(Bool, a)]

test' :: (Coolean cool, Enumerable a, Show a) => Options -> (a -> cool) -> IO ()

Deep embedded boolean type

data Cool

Concurrent booleans. Writing properties with the Cool data type often yields faster searches compared to Bool.

Constructors

Atom Bool

Not Cool

And Cool Cool

Seq Cool Cool

Sequential conjunction, the second operator is not evaluated unless the first is true.

Instances

Show Cool

Methods

showsPrec :: Int -> Cool -> ShowS

show :: Cool -> String

showList :: [Cool] -> ShowS

Coolean Cool

Methods

toCool :: Cool -> Cool

toBool :: Cool -> Bool

isCool :: (a -> Cool) -> Bool

class Coolean b

Provides better interoperability between Bool and Cool by overloading operators.

Minimal complete definition

toCool, toBool, isCool

Instances

Coolean Bool

Methods

toCool :: Bool -> Cool

toBool :: Bool -> Bool

isCool :: (a -> Bool) -> Bool

Coolean Cool

Methods

toCool :: Cool -> Cool

toBool :: Cool -> Bool

isCool :: (a -> Cool) -> Bool

(&&&) :: (Coolean a, Coolean b) => a -> b -> Cool infixr 2

(|||) :: (Coolean a, Coolean b) => a -> b -> Cool

(==>) :: (Coolean a, Coolean b) => a -> b -> Cool

nott :: Coolean a => a -> Cool

true :: Cool

false :: Cool

Re-exported

module Control.Enumerable