CurryInfo: searchtree-unsafe-3.0.0 / Control.Search.SearchTree.Unsafe.identicalVars
definition: 
|
identicalVars :: a -> a -> Bool identicalVars x y = maybe False (\xi -> maybe False (==xi) (lookupVarId y)) (lookupVarId x) |
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Tests whether both arguments are identical free variables. This function is only meaningful when applied to parts of a result of an encapsulated expression if the argument stems from a `Value` node of a SearchTree |
|
failfree:
|
(_, _) |
|
indeterministic:
|
might be indeterministic |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_) |-> _}
|
|
name:
|
identicalVars |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
a -> a -> Prelude.Bool |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
reducible on all ground data terms |