definition: |
eltsFM :: FM _ elt -> [elt] eltsFM fm = foldFM (\ _ elt rest -> elt : rest) [] fm |
demand: |
argument 1 |
deterministic: |
deterministic operation |
documentation: |
--- Retrieves a list of elements contained in finite map. --- The list is ordered --- by the initially given irreflexive order predicate on keys. |
failfree: |
_ |
indeterministic: |
referentially transparent operation |
infix: |
no fixity defined |
iotype: |
{(_) |-> _} |
name: |
eltsFM |
precedence: |
no precedence defined |
result-values: |
_ |
signature: |
FM a b -> [b] |
solution-complete: |
operation might suspend on free variables |
terminating: |
yes |
totally-defined: |
reducible on all ground data terms |