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

definition:
fmToListPreOrder :: FM key elt -> [(key,elt)]
fmToListPreOrder (FM _ fm) = pre fm []
   where
     pre EmptyFM xs = xs
     pre (BranchFM k x _ l r) xs = (k,x):pre l (pre r xs)
demand:
argument 1
deterministic:
deterministic operation
failfree:
_
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{({FM}) |-> _}
name:
fmToListPreOrder
precedence:
no precedence defined
result-values:
_
signature:
FM a b -> [(a, b)]
solution-complete:
operationally complete operation
terminating:
yes
totally-defined:
reducible on all ground data terms