| definition: |
dfsStrategy :: Strategy a dfsStrategy (Fail d) = failVS d dfsStrategy (Value x) = addVS x emptyVS dfsStrategy (Or x y) = dfsStrategy x |++| dfsStrategy y |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- Depth-first search strategy. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Fail}) |-> _ || ({Value}) |-> _ || ({Or}) |-> _}
|
| name: |
dfsStrategy |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
SearchTree a -> ValueSequence a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |