authorgravatar for git@zander.xyzZander Khan <git@zander.xyz> 2021-01-16 18:43:13+00:00
committergravatar for git@zander.xyzZander Khan <git@zander.xyz> 2021-01-16 18:43:13+00:00
loge1ab425bcead727a73e4512aeca1ba9112b2c88e
treea8ca372e937ab2d58f9aeba738fc77ad78437875
parentc6986f29f94ee404ae3a3221449dc4af5599ca1f

Fix slice length when updating

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

lib/std/priority_dequeue.zig+1-1
......@@ -389,7 +389,7 @@ pub fn PriorityDequeue(comptime T: type) type {
389389 }
390390
391391 pub fn update(self: *Self, elem: T, new_elem: T) !void {
392 var old_index: usize = std.mem.indexOfScalar(T, self.items[0 .. self.len - 1], elem) orelse return error.ElementNotFound;
392 var old_index: usize = std.mem.indexOfScalar(T, self.items[0..self.len], elem) orelse return error.ElementNotFound;
393393 _ = self.removeIndex(old_index);
394394 self.addUnchecked(new_elem);
395395 }
lib/std/priority_queue.zig+1-1
......@@ -199,7 +199,7 @@ pub fn PriorityQueue(comptime T: type) type {
199199 }
200200
201201 pub fn update(self: *Self, elem: T, new_elem: T) !void {
202 var update_index: usize = std.mem.indexOfScalar(T, self.items[0 .. self.len - 1], elem) orelse return error.ElementNotFound;
202 var update_index: usize = std.mem.indexOfScalar(T, self.items[0..self.len], elem) orelse return error.ElementNotFound;
203203 const old_elem: T = self.items[update_index];
204204 self.items[update_index] = new_elem;
205205 if (self.compareFn(new_elem, old_elem)) {