| author | |
| committer | |
| log | 5bfd9238de82b8f66ba4834bcf7aa120e42fe6ca |
| tree | fe1a573d430cc15d8d15ff3a4d04f8adbbe85fa5 |
| parent | 9a09ebb1b92f33913bdcc16e9d978fb6e5a820f1 |
2 files changed, 0 insertions(+), 10 deletions(-)
lib/std/priority_dequeue.zig-5| ... | @@ -377,11 +377,6 @@ pub fn PriorityDequeue(comptime T: type) type { | ... | @@ -377,11 +377,6 @@ pub fn PriorityDequeue(comptime T: type) type { |
| 377 | self.items = try self.allocator.realloc(self.items, better_capacity); | 377 | self.items = try self.allocator.realloc(self.items, better_capacity); |
| 378 | } | 378 | } |
| 379 | 379 | ||
| 380 | pub fn resize(self: *Self, new_len: usize) !void { | ||
| 381 | try self.ensureCapacity(new_len); | ||
| 382 | self.len = new_len; | ||
| 383 | } | ||
| 384 | |||
| 385 | /// Reduce allocated capacity to `new_len`. | 380 | /// Reduce allocated capacity to `new_len`. |
| 386 | pub fn shrinkAndFree(self: *Self, new_len: usize) void { | 381 | pub fn shrinkAndFree(self: *Self, new_len: usize) void { |
| 387 | assert(new_len <= self.items.len); | 382 | assert(new_len <= self.items.len); |
lib/std/priority_queue.zig-5| ... | @@ -187,11 +187,6 @@ pub fn PriorityQueue(comptime T: type) type { | ... | @@ -187,11 +187,6 @@ pub fn PriorityQueue(comptime T: type) type { |
| 187 | self.items = try self.allocator.realloc(self.items, better_capacity); | 187 | self.items = try self.allocator.realloc(self.items, better_capacity); |
| 188 | } | 188 | } |
| 189 | 189 | ||
| 190 | pub fn resize(self: *Self, new_len: usize) !void { | ||
| 191 | try self.ensureCapacity(new_len); | ||
| 192 | self.len = new_len; | ||
| 193 | } | ||
| 194 | |||
| 195 | /// Reduce allocated capacity to `new_len`. | 190 | /// Reduce allocated capacity to `new_len`. |
| 196 | pub fn shrinkAndFree(self: *Self, new_len: usize) void { | 191 | pub fn shrinkAndFree(self: *Self, new_len: usize) void { |
| 197 | assert(new_len <= self.items.len); | 192 | assert(new_len <= self.items.len); |