CurryInfo: finite-map-3.0.0 / Data.FiniteMap.elemFM

definition:
elemFM :: Eq key => key -> FM key _ -> Bool
key `elemFM` fm = isJust (lookupFM fm key)
demand:
argument 3
deterministic:
deterministic operation
documentation:
--- Does given map contain given key?
failfree:
(_, _, _)
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{(_,_,_) |-> {False,True}}
name:
elemFM
precedence:
no precedence defined
result-values:
{False,True}
signature:
Prelude.Eq a => a -> FM a b -> Prelude.Bool
solution-complete:
operation might suspend on free variables
terminating:
yes
totally-defined:
reducible on all ground data terms