| definition: |
bfsStrategy :: Strategy a bfsStrategy t = allBFS [t] |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Breadth-first search strategy. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_) |-> _}
|
| name: |
bfsStrategy |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
SearchTree a -> ValueSequence a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |