Be concise.
Be useful.
All contributions dictatorially edited by webmasters to match personal tastes.
Please do not paste any copyright violating material.
Please try to avoid dependencies to third-party libraries and frameworks.
type Integer_Comparator is not null access function (Left, Right : Integer) return Boolean; package Integer_Vectors is new Vectors (Positive, Integer); use Integer_Vectors; procedure Sort_Using_Comparator (V : in out Vector; C : Integer_Comparator) is package Vector_Sorting is new Generic_Sorting (C.all); use Vector_Sorting; begin Sort (V); end Sort_Using_Comparator;
(sort c items)
struct is_less { bool operator () (int a, int b){ return a < b; } }; int main(){ std::vector<int> items = {1337, 666, -666, 0, 0, 666, -666}; std::sort(items.begin(), items.end(), is_less()); std::vector<int> expected = {-666, -666, 0, 0, 666, 666, 1337}; assert(items.size() == expected.size()); for (size_t i = 0; i < items.size(); i++){ assert(items[i] == expected[i]); } return 0; }
Array.Sort(items, c);
items.sort(c);
Enum.sort(items, c)
lists:sort(C, List).
type ItemsSorter struct { items []Item c func(x, y Item) bool } func (s ItemsSorter) Len() int { return len(s.items) } func (s ItemsSorter) Less(i, j int) bool { return s.c(s.items[i], s.items[j]) } func (s ItemsSorter) Swap(i, j int) { s.items[i], s.items[j] = s.items[j], s.items[i] } func sortItems(items []Item, c func(x, y Item) bool) { sorter := ItemsSorter{ items, c, } sort.Sort(sorter) }
items.sort(c);
items.sortWith(c)
table.sort(items,c)
uasort($items, $c);
sub c { $a <=> $b; } my @result = sort c @items;
items.sort(key=c)
items.sort!(&c)
items.sort!{|a,b| a-b }
items.sort_by(c);
| c | c := [ :a :b | a size <= b size ]. " example c for strings " #('a' 'aaa' 'a' 'aaaa') asSortedCollection: c. " => SortedCollection('a' 'a' 'aaa' 'aaaa') "