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

definition:
lookupFM :: Eq key => FM key elt -> key -> Maybe elt
lookupFM (FM le fm) key = lookupFM' le fm key
demand:
argument 2
deterministic:
deterministic operation
documentation:
--- Retrieves element bound to given key
failfree:
(_, _, _)
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{(_,{FM},_) |-> {Just,Nothing}}
name:
lookupFM
precedence:
no precedence defined
result-values:
{Just,Nothing}
signature:
Prelude.Eq a => FM a b -> a -> Prelude.Maybe b
solution-complete:
operation might suspend on free variables
terminating:
yes
totally-defined:
reducible on all ground data terms