zig

commit 370793a36b3de34ead8456553a2aa2c56f0d3de8 (tree)
parent 9a3dacc00ed805cb70b3b656f28de73185206b13
Author: VÖRÖSKŐI András <voroskoi@gmail.com>
Date:   Mon, 25 Jul 2022 06:57:04 +0200

PriorityDequeue: use compareFn in update() method

Diffstat:
M
lib/std/priority_dequeue.zig
 | 
7
++++++-

1 file changed, 6 insertions(+), 1 deletion(-)
diff --git a/lib/std/priority_dequeue.zig b/lib/std/priority_dequeue.zig
@@ -391,7 +391,12 @@ pub fn PriorityDequeue(comptime T: type, comptime Context: type, comptime compar
         }
 
         pub fn update(self: *Self, elem: T, new_elem: T) !void {
-            var old_index: usize = std.mem.indexOfScalar(T, self.items[0..self.len], elem) orelse return error.ElementNotFound;
+            const old_index = blk: {
+                for (self.items) |item, idx| {
+                    if (compareFn(self.context, item, elem).compare(.eq)) break :blk idx;
+                }
+                return error.ElementNotFound;
+            };
             _ = self.removeIndex(old_index);
             self.addUnchecked(new_elem);
         }