declare
function Compare_Function (Left, Right : Item) return Boolean is (Left.P < Right.P);
package Item_Vector_Sorting is new Item_Vectors.Generic_Sorting (Compare_Function);
use Item_Vector_Sorting;
begin
Sort (Items);
end;
int compareProp (const void *a, const void *b)
{
return (*(const Item**)a)->p - (*(const Item**)b)->p;
}
qsort(items, N, sizeof(Item*), compareProp);
std::sort(begin(items), end(items), [](const auto& a, const auto& b) { return a.p < b.p; });
std::ranges::sort(items, {}, &Item::p);
struct {
bool operator()(const Item &lhs, const Item &rhs) const { return lhs.p < rhs.p; }
} custom_sort;
std::sort(begin(items), end(items), custom_sort);
System.Array.Sort(items, Comparer<Item>.Create((a, b) => a.p - b.p));
sort!("a.p < b.p")(items);
items.sort((a, b) => Comparable.compare(a.p, b.p));
items.sort((a, b) => (a.p).compareTo(b.p));
Enum.sort_by(items, &(&1.p))
sort_by_birth(ListOfMaps) ->
lists:sort(
fun(A, B) ->
maps:get(birth, A, undefined) =< maps:get(birth, B, undefined)
end, ListOfMaps).
sort_by_birth(ListOfRecords) -> lists:keysort(#item.birth, ListOfRecords).
type ItemPSorter []Item
func (s ItemPSorter) Len() int{ return len(s) }
func (s ItemPSorter) Less(i,j int) bool{ return s[i].p<s[j].p }
func (s ItemPSorter) Swap(i,j int) { s[i],s[j] = s[j],s[i] }
func sortItems(items []Item){
sorter := ItemPSorter(items)
sort.Sort(sorter)
}
compare := func(a, b Item) int {
return cmp.Compare(a.p, b.p)
}
slices.SortFunc(items, compare)
less := func(i, j int) bool {
return items[i].p < items[j].p
}
sort.Slice(items, less)
items.sort { x, y -> x.p <=> y.p }
sortBy (comparing p) items
items.sort(function(a,b) {
return compareFieldP(a.p, b.p);
});
Arrays.sort(items, new Comparator<Item>(){
public int compare(Item a, Item b){
return a.p - b.p;
}
});
Collections.sort(items, new Comparator<Item>(){
@Override
public int compare(Item a, Item b){
return a.p - b.p;
}
});
items.stream().sorted(Comparator.comparing(x -> x.p))
(sort #'< items :key #'p)
table.sort(items, function(a,b)
if a.p < b.p then return true end
end)
[items sortedArrayUsingDescriptors:@[[NSSortDescriptor sortDescriptorWithKey:@"p" ascending:YES]]]
function cmp($a, $b)
{
if ($a->p == $b->p) {
return 0;
}
return ($a->p < $b->p) ? -1 : 1;
}
usort($items, 'cmp');
type
TItem = class p: Integer; end;
TItems = specialize TFPGObjectList<TItem>;
var items: TItems;
function compare(const a, b: TItem): Integer;
begin
Result := a.p - b.p;
end;
begin
items := TItems.Create;
// Add items here.
items.Sort(@compare);
end.
@items = sort { $a->{p} cmp $b->{p} } @items;
items = sorted(items, key=lambda x: x.p)
items = sorted(items, key=attrgetter('p'))
items.sort_by_key(|x| x.p);
items.sort_by(|a,b| a.p.cmp(&b.p));
case class S(x: Int)
val items = List(S(3), S(4), S(2))
items.sortBy( item: S => item.x )
(define-struct item (p x y) #:transparent)
(define items (list (item 1 2 3) (item 0 0 0) (item 5 2 1)))
(sort items < #:key item-p)
items sorted: [:x :y | x p <= y p].
System.Array.Sort(items, Comparer(Of Item).Create(Function(a, b) a.p - b.p))
items.OrderBy(Function(x) x.p)