CurryInfo: searchtree-unsafe-3.0.0 / Control.Search.SearchTree.Unsafe.isDefined

definition:
 
isDefined :: a -> Bool
isDefined x = hasValue (someSearchTree x)
 where hasValue y = case y of Value _  -> True
                              Fail _   -> False
                              Or t1 t2 -> hasValue t1 || hasValue t2
demand:
 no demanded arguments
deterministic:
 deterministic operation
documentation:
 
Returns True iff the argument is defined, i.e., has a value.
failfree:
 _
indeterministic:
 might be indeterministic
infix:
 no fixity defined
iotype:
 {(_) |-> _}
name:
 isDefined
precedence:
 no precedence defined
result-values:
 _
signature:
 a -> Prelude.Bool
solution-complete:
 operation might suspend on free variables
terminating:
 yes
totally-defined:
 reducible on all ground data terms