| definition: |
toPreOrderList :: Map k a -> [(k, a)]
toPreOrderList m = pre m []
where
pre Tip xs = xs
pre (Bin k x _ l r) xs = (k, x) : pre l (pre r xs)
|
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- Retrieves list of key/element pairs in preorder of the internal tree. --- Useful for lists that will be retransformed into a tree or to match --- any elements regardless of basic order. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_) |-> _}
|
| name: |
toPreOrderList |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Map a b -> [(a, b)] |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |