| ... | @@ -434,7 +434,7 @@ pub fn HashMap( | ... | @@ -434,7 +434,7 @@ pub fn HashMap( |
| 434 | /// | 434 | /// |
| 435 | /// TODO: answer the question in these doc comments, does this | 435 | /// TODO: answer the question in these doc comments, does this |
| 436 | /// increase the unused capacity by one? | 436 | /// increase the unused capacity by one? |
| 437 | pub fn removeByPtr(self: *Self, key_ptr: *K) void { | 437 | pub fn removeByPtr(self: *Self, key_ptr: *const K) void { |
| 438 | self.unmanaged.removeByPtr(key_ptr); | 438 | self.unmanaged.removeByPtr(key_ptr); |
| 439 | } | 439 | } |
| 440 | | 440 | |
| ... | @@ -1269,7 +1269,7 @@ fn Custom( | ... | @@ -1269,7 +1269,7 @@ fn Custom( |
| 1269 | /// | 1269 | /// |
| 1270 | /// TODO: answer the question in these doc comments, does this | 1270 | /// TODO: answer the question in these doc comments, does this |
| 1271 | /// increase the unused capacity by one? | 1271 | /// increase the unused capacity by one? |
| 1272 | pub fn removeByPtr(self: *Self, key_ptr: *K) void { | 1272 | pub fn removeByPtr(self: *Self, key_ptr: *const K) void { |
| 1273 | // if @sizeOf(K) == 0 then there is at most one item in the hash | 1273 | // if @sizeOf(K) == 0 then there is at most one item in the hash |
| 1274 | // map, which is assumed to exist as key_ptr must be valid. This | 1274 | // map, which is assumed to exist as key_ptr must be valid. This |
| 1275 | // item must be at index 0. | 1275 | // item must be at index 0. |