definition:
|
delListFromFM :: Eq key => FM key elt -> [key] -> FM key elt
delListFromFM (FM le fm) keys = FM le (foldl (delFromFM' le) fm keys)
|
demand:
|
argument 2
|
deterministic:
|
deterministic operation
|
documentation:
|
--- Deletes a list of keys from finite map.
--- Deletion doesn't complain if you try to delete something
--- which isn't there
|
failfree:
|
(_, _, _)
|
indeterministic:
|
referentially transparent operation
|
infix:
|
no fixity defined
|
iotype:
|
{(_,{FM},_) |-> {FM}}
|
name:
|
delListFromFM
|
precedence:
|
no precedence defined
|
result-values:
|
{FM}
|
signature:
|
Prelude.Eq a => FM a b -> [a] -> FM a b
|
solution-complete:
|
operation might suspend on free variables
|
terminating:
|
possibly non-terminating
|
totally-defined:
|
possibly non-reducible on same data term
|