mirror/zig
1
0
Fork 0
mirror of https://github.com/ziglang/zig.git synced 2026-01-21 06:45:24 +00:00
Code Issues Packages Projects Releases Wiki Activity

implemented efficient heapreplace

Browse Source
This commit is contained in:
Bhargav Srinivasan 2020-09-22 02:12:35 -07:00
parent 1345f87f4e
commit a5140cc902
1 changed files with 7 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
lib/std/priority_queue.zig
View File

@ -204,8 +204,13 @@ pub fn PriorityQueue(comptime T: type) type {
pub fn update(self: *Self, elem: T, new_elem: T) !void {
var update_index: usize = linearSearch(elem, self.items);
assert (update_index >= 0 and update_index < self.items.len);
_ = self.removeIndex(update_index);
try self.add(new_elem);
// Heapreplace:
// replace the item: self.items[update_index]= new_elem;
// swap the new item to the top of the heap: std.mem.swap(heap[0], heap[update_index]);
// sift up or down: which has been generically implemented as sift down: siftDown(self, 0)
self.items[update_index] = new_elem;
std.mem.swap(T, &self.items[0], &self.items[update_index]);
siftDown(self, 0);
}
pub const Iterator = struct {