|
definition:
|
oneSolution :: Data a => (a -> Bool) -> Maybe a
oneSolution p = oneValue (invertPred p)
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
possibly non-deterministic operation
|
|
documentation:
|
--- Returns just one value satisfying a predicate.
--- If there is no such value, `Nothing` is returned
---
--- Note that this operation is not purely declarative since
--- the computed value depends on the ordering of the program rules.
--- Thus, this operation should be used only if the expression
--- has a single value.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
might be indeterministic
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_) |-> {Just,Nothing}}
|
|
name:
|
oneSolution
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{Just,Nothing}
|
|
signature:
|
Prelude.Data a => (a -> Prelude.Bool) -> Prelude.Maybe a
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|