CurryInfo: base-3.4.0 / Control.Search.SearchTree.someValueWith

definition: Info
 
someValueWith :: Strategy a -> a -> a
someValueWith strategy x = head (vsToList (strategy (someSearchTree x)))
demand: Info
 no demanded arguments
deterministic: Info
 deterministic operation
documentation: Info
 
Returns some value for an expression w.r.t. a search strategy.
A search strategy is an operation to traverse a search tree
and collect all values, e.g., 'dfsStrategy' or 'bfsStrategy'.

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. It fails if the expression has no value.
failfree: Info
 <FAILING>
indeterministic: Info
 referentially transparent operation
infix: Info
 no fixity defined
iotype: Info
 {(_,_) |-> _}
name: Info
 someValueWith
precedence: Info
 no precedence defined
result-values: Info
 _
signature: Info
 (SearchTree a -> ValueSequence a) -> a -> a
solution-complete: Info
 operation might suspend on free variables
terminating: Info
 yes
totally-defined: Info
 possibly non-reducible on same data term