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