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

definition:
eqFM :: (Eq key, Eq elt) => FM key elt -> FM key elt -> Bool
fm_1 `eqFM` fm_2 =
  (sizeFM   fm_1 == sizeFM   fm_2) &&   -- quick test
  (fmToList fm_1 == fmToList fm_2)
demand:
no demanded arguments
deterministic:
deterministic operation
documentation:
--- Do two given maps contain the same key/element pairs?
failfree:
(_, _, _, _)
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{(_,_,_,_) |-> _}
name:
eqFM
precedence:
no precedence defined
result-values:
_
signature:
(Prelude.Eq a, Prelude.Eq b) => FM a b -> FM a b -> Prelude.Bool
solution-complete:
operation might suspend on free variables
terminating:
possibly non-terminating
totally-defined:
reducible on all ground data terms