diff options
Diffstat (limited to 'lib/std/event/loop.zig')
| -rw-r--r-- | lib/std/event/loop.zig | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/lib/std/event/loop.zig b/lib/std/event/loop.zig index 0c4895b895..8fd7df0d6f 100644 --- a/lib/std/event/loop.zig +++ b/lib/std/event/loop.zig @@ -773,7 +773,7 @@ pub const Loop = struct { self.delay_queue.waiters.insert(&entry); // Speculatively wake up the timer thread when we add a new entry. - // If the timer thread is sleeping on a longer entry, we need to + // If the timer thread is sleeping on a longer entry, we need to // interrupt it so that our entry can be expired in time. self.delay_queue.event.set(); } @@ -785,7 +785,7 @@ pub const Loop = struct { thread: *std.Thread, event: std.AutoResetEvent, is_running: bool, - + /// Initialize the delay queue by spawning the timer thread /// and starting any timer resources. fn init(self: *DelayQueue) !void { @@ -800,7 +800,7 @@ pub const Loop = struct { }; } - /// Entry point for the timer thread + /// Entry point for the timer thread /// which waits for timer entries to expire and reschedules them. fn run(self: *DelayQueue) void { const loop = @fieldParentPtr(Loop, "delay_queue", self); @@ -848,12 +848,12 @@ pub const Loop = struct { const entry = self.peekExpiringEntry() orelse return null; if (entry.expires > now) return null; - + assert(self.entries.remove(&entry.node)); return entry; } - - /// Returns an estimate for the amount of time + + /// Returns an estimate for the amount of time /// to wait until the next waiting entry expires. fn nextExpire(self: *Waiters) ?u64 { const entry = self.peekExpiringEntry() orelse return null; |