| definition: |
sortValuesBy :: (a -> a -> Bool) -> Values a -> [a] sortValuesBy leq s = sortBy leq (valuesOf s) |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Transforms a multiset of values into a list sorted by a given ordering --- on the values. As a consequence, the multiset of values --- is completely evaluated. --- In order to ensure that the result of this operation is independent of the --- evaluation order, the given ordering must be a total order. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> _}
|
| name: |
sortValuesBy |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(a -> a -> Prelude.Bool) -> Values a -> [a] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |