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

 
limitSearchTree :: Int -> SearchTree a -> SearchTree a
limitSearchTree _ v@(Value _) = v
limitSearchTree _ f@(Fail _)  = f
limitSearchTree n (Or t1 t2)  =
  if n<0 then Fail (-1)
         else Or (limitSearchTree (n-1) t1) (limitSearchTree (n-1) t2)

 argument 2

 deterministic operation

 
| Limit the depth of a search tree. Branches which a depth larger
  than the first argument are replace by `Fail (-1)`.

 (_, _)

 referentially transparent operation

 no fixity defined

 {(_,{Value}) |-> {Value} || (_,{Fail}) |-> {Fail} || (_,{Or}) |-> {Fail,Or}}

 limitSearchTree

 no precedence defined

 _

 Prelude.Int -> SearchTree a -> SearchTree a

 operation might suspend on free variables

 possibly non-terminating

 possibly non-reducible on same data term