CurryInfo: base-3.4.0 / Control.Search.SearchTree.allValuesIDSwith
definition: 
|
allValuesIDSwith :: Int -> (Int -> Int) -> SearchTree a -> [a] allValuesIDSwith initdepth incrdepth = allValuesWith (idsStrategyWith initdepth incrdepth) |
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Return all values in a search tree via iterative-deepening search. The first argument is the initial depth bound and the second argument is a function to increase the depth in each iteration. |
|
failfree:
|
(_, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_) |-> {allValuesWith}}
|
|
name:
|
allValuesIDSwith |
|
precedence:
|
no precedence defined |
|
result-values:
|
{allValuesWith}
|
|
signature:
|
Prelude.Int -> (Prelude.Int -> Prelude.Int) -> SearchTree a -> [a] |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
possibly non-reducible on same data term |