pub fn peekMax(self: *const Self) ?T self: *const Self146
147
148
149
150
151 pub fn peekMax(self: *const Self) ?T {
if (self.len == 0) return null;
if (self.len == 1) return self.items[0];
if (self.len == 2) return self.items[1];
return self.bestItemAtIndices(1, 2, .gt).item;
}
Look at the largest element in the dequeue. Returns
nullif empty.