CurryInfo: redblacktree-3.0.0 / Data.Set.RBTree.sortBy
definition: 
|
sortBy :: Eq a => (a -> a -> Bool) -> [a] -> [a] sortBy = RBT.sortBy |
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Generic sort based on insertion into red-black trees. The first argument is the order for the elements. |
|
failfree:
|
<FAILING> |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_) |-> {sortBy}}
|
|
name:
|
sortBy |
|
precedence:
|
no precedence defined |
|
result-values:
|
{sortBy}
|
|
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 |