CurryInfo: base-3.4.0 / Control.Search.AllValues.getAllFailures
definition: 
|
getAllFailures :: a -- ^ an expression ´e´ (e.g., a generator
-- evaluable to various values)
-> (a -> Bool) -- ^ a constraint ´c´ that should not be satisfied
-> IO [a] -- ^ list of all values of `e`
-- such that `(c e)` is not provable
getAllFailures generator test = do
xs <- getAllValues generator
failures <- mapM (naf test) xs
return $ concat failures
|
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
failfree:
|
(_, _) |
|
indeterministic:
|
might be indeterministic |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_) |-> _}
|
|
name:
|
getAllFailures |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
a -> (a -> Prelude.Bool) -> Prelude.IO [a] |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
possibly non-reducible on same data term |