Zig 0.17.0-dev (Split by item)

Shortcut keys
?
Show these tips
S
Focus search field
Esc
Clear focus & close tips
U
Jump to source code
↑
Move up in search results
↓
Move down in search results
↵
Go to active search result
This is an example of documentation generated by ZigDoc, an alternative to Zig's built-in Auto Doc feature. See also examples in other modes/formats. The project being documented here (as the example) is the Zig standard library. Public Function

sort

Public Function
std.mem.sort
pub fn sort(
    comptime T: type,
    items: []T,
    context: anytype,
    comptime lessThanFn: fn (@TypeOf(context), lhs: T, rhs: T) bool,
) void

Sorts a slice in-place using a stable algorithm (maintains relative order of equal elements). Average time complexity: O(n log n), worst case: O(n log n) Space complexity: O(log n) for recursive calls

For slice of primitives with default ordering, consider using std.sort.block directly. For unstable but potentially faster sorting, see sortUnstable.

Params

  • T: type
  • items: []T
  • context
  • lessThanFn: fn (@TypeOf(context), lhs: T, rhs: T) bool

File

mem.zig:632
632
633
634
635
636
637
638
639
pub fn sort(
    comptime T: type,
    items: []T,
    context: anytype,
    comptime lessThanFn: fn (@TypeOf(context), lhs: T, rhs: T) bool,
) void {
    std.sort.block(T, items, context, lessThanFn);
}