| definition: |
toList :: SetRBT a -> [a] toList = RBT.toList |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
Transforms a (red-black tree) set into an ordered list of its elements. |
| failfree: |
() |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{() |-> {toList}}
|
| name: |
toList |
| precedence: |
no precedence defined |
| result-values: |
{toList}
|
| signature: |
Data.RedBlackTree.RedBlackTree a -> [a] |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |