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

definition:
addToFM :: Eq key => FM key elt -> key -> elt  -> FM key elt
addToFM (FM le fm) key elt = FM le (addToFM' le fm key elt)
demand:
argument 2
deterministic:
deterministic operation
failfree:
(_, _, _, _)
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{(_,{FM},_,_) |-> {FM}}
name:
addToFM
precedence:
no precedence defined
result-values:
{FM}
signature:
Prelude.Eq a => FM a b -> a -> b -> FM a b
solution-complete:
operation might suspend on free variables
terminating:
possibly non-terminating
totally-defined:
possibly non-reducible on same data term