Commit dae516dbdffaf771e072679a76a6d48f3f0aa182 | zig

2 files changed, 9 insertions(+), 4 deletions(-)

lib/std/sort.zig+6-2

...	...	@@ -34,7 +34,9 @@ pub fn insertion(
34	34
35	35	/// Stable in-place sort. O(n) best case, O(pow(n, 2)) worst case.
36	36	/// O(1) memory (no allocator required).
37		/// Sorts in ascending order with respect to the given `lessThan` function.
	37	/// `context` must have methods `swap` and `lessThan`,
	38	/// which each take 2 `usize` parameters indicating the index of an item.
	39	/// Sorts in ascending order with respect to `lessThan`.
38	40	pub fn insertionContext(a: usize, b: usize, context: anytype) void {
39	41	assert(a <= b);
40	42
...	...	@@ -73,7 +75,9 @@ pub fn heap(
73	75
74	76	/// Unstable in-place sort. O(n*log(n)) best case, worst case and average case.
75	77	/// O(1) memory (no allocator required).
76		/// Sorts in ascending order with respect to the given `lessThan` function.
	78	/// `context` must have methods `swap` and `lessThan`,
	79	/// which each take 2 `usize` parameters indicating the index of an item.
	80	/// Sorts in ascending order with respect to `lessThan`.
77	81	pub fn heapContext(a: usize, b: usize, context: anytype) void {
78	82	assert(a <= b);
79	83	// build the heap in linear time.

lib/std/sort/pdq.zig+3-2

...	...	@@ -37,8 +37,9 @@ const Hint = enum {
37	37
38	38	/// Unstable in-place sort. O(n) best case, O(n*log(n)) worst case and average case.
39	39	/// O(log(n)) memory (no allocator required).
40		///
41		/// Sorts in ascending order with respect to the given `lessThan` function.
	40	/// `context` must have methods `swap` and `lessThan`,
	41	/// which each take 2 `usize` parameters indicating the index of an item.
	42	/// Sorts in ascending order with respect to `lessThan`.
42	43	pub fn pdqContext(a: usize, b: usize, context: anytype) void {
43	44	// slices of up to this length get sorted using insertion sort.
44	45	const max_insertion = 24;