Commit 0787b11f19917ab4ae994cd12bc8ac5c96311683 | zig

author	Roman Frołow <rofrol@gmail.com> 2023-03-21 14:12:13+01:00
committer	GitHub <noreply@github.com> 2023-03-21 15:12:13+02:00
log	0787b11f19917ab4ae994cd12bc8ac5c96311683
tree	42fded92f85df835f21bc225ade11e0b46856675
parent	ec445fb6b8bb3f3d423cafa4f3a7860da65ca233
signature	Signed by PGP key 4AEE18F83AFDEB23

1 files changed, 8 insertions(+), 8 deletions(-)

lib/std/sort.zig+8-8

...	...	@@ -9,7 +9,7 @@ pub fn binarySearch(
9	9	key: anytype,
10	10	items: []const T,
11	11	context: anytype,
12		comptime compareFn: fn (context: @TypeOf(context), key: @TypeOf(key), mid: T) math.Order,
	12	comptime compareFn: fn (context: @TypeOf(context), key: @TypeOf(key), mid_item: T) math.Order,
13	13	) ?usize {
14	14	var left: usize = 0;
15	15	var right: usize = items.len;
...	...	@@ -79,14 +79,14 @@ test "binarySearch" {
79	79	return @This(){ .b = b, .e = e };
80	80	}
81	81
82		fn order(context: void, key: i32, mid: @This()) math.Order {
	82	fn order(context: void, key: i32, mid_item: @This()) math.Order {
83	83	_ = context;
84	84
85		if (key < mid.b) {
	85	if (key < mid_item.b) {
86	86	return .lt;
87	87	}
88	88
89		if (key > mid.e) {
	89	if (key > mid_item.e) {
90	90	return .gt;
91	91	}
92	92
...	...	@@ -1069,8 +1069,8 @@ fn binaryFirst(
1069	1069	const offset = size % 2;
1070	1070
1071	1071	size /= 2;
1072		const mid = items[curr + size];
1073		if (lessThan(context, mid, value)) {
	1072	const mid_item = items[curr + size];
	1073	if (lessThan(context, mid_item, value)) {
1074	1074	curr += size + offset;
1075	1075	}
1076	1076	}
...	...	@@ -1092,8 +1092,8 @@ fn binaryLast(
1092	1092	const offset = size % 2;
1093	1093
1094	1094	size /= 2;
1095		const mid = items[curr + size];
1096		if (!lessThan(context, value, mid)) {
	1095	const mid_item = items[curr + size];
	1096	if (!lessThan(context, value, mid_item)) {
1097	1097	curr += size + offset;
1098	1098	}
1099	1099	}