authorgravatar for jacobly@ziglang.orgJacob Young <jacobly@ziglang.org> 2023-01-02 03:35:56-05:00
committergravatar for jacobly@ziglang.orgJacob Young <jacobly@ziglang.org> 2023-02-21 00:27:12-05:00
log1a1598daf08fabe2b7e154dfb94f0f53e3577895
tree4423915e5fca9a17b3dcb7a919cc76c2fb81bdb3
parent064b355912dd85bd06ee87101066ed0db2783796

hash map: remove extra argument

1 files changed, 2 insertions(+), 2 deletions(-)

lib/std/hash_map.zig+2-2
......@@ -508,7 +508,7 @@ pub fn HashMap(
508508 /// If a new entry needs to be stored, this function asserts there
509509 /// is enough capacity to store it.
510510 pub fn getOrPutAssumeCapacityAdapted(self: *Self, key: anytype, ctx: anytype) GetOrPutResult {
511 return self.unmanaged.getOrPutAssumeCapacityAdapted(self.allocator, key, ctx);
511 return self.unmanaged.getOrPutAssumeCapacityAdapted(key, ctx);
512512 }
513513
514514 pub fn getOrPutValue(self: *Self, key: K, value: V) Allocator.Error!Entry {
......@@ -2130,7 +2130,7 @@ test "std.hash_map getOrPutAdapted" {
21302130 try testing.expectEqual(map.count(), keys.len);
21312131
21322132 inline for (keys, 0..) |key_str, i| {
2133 const result = try map.getOrPutAdapted(key_str, AdaptedContext{});
2133 const result = map.getOrPutAssumeCapacityAdapted(key_str, AdaptedContext{});
21342134 try testing.expect(result.found_existing);
21352135 try testing.expectEqual(real_keys[i], result.key_ptr.*);
21362136 try testing.expectEqual(@as(u64, i) * 2, result.value_ptr.*);