|
definition:
|
idsStrategyWith :: Int -> (Int -> Int) -> Strategy a
idsStrategyWith initdepth incrdepth st =
iterIDS initdepth (collectInBounds 0 initdepth st)
where
iterIDS _ Nil = emptyVS
iterIDS n (Cons x xs) = addVS x (iterIDS n xs)
iterIDS n (FCons fd xs) = failVS fd |++| iterIDS n xs
iterIDS n Abort = let newdepth = incrdepth n
in iterIDS newdepth (collectInBounds n newdepth st)
|
|
demand:
|
argument 3
|
|
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:
|
might be indeterministic
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_) |-> _}
|
|
name:
|
idsStrategyWith
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Prelude.Int -> (Prelude.Int -> Prelude.Int) -> SearchTree a
-> Control.Search.SearchTree.ValueSequence a
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|