| definition: |
sortBy :: Eq a => (a -> a -> Bool) -> [a] -> [a] sortBy cmp xs = toList (foldr update (empty (\_ _->False) (==) cmp) xs) |
| demand: |
argument 3 |
| deterministic: |
deterministic operation |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_) |-> _}
|
| name: |
sortBy |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Eq a => (a -> a -> Prelude.Bool) -> [a] -> [a] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
possibly non-reducible on same data term |