We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents 0a9c1be + 7b40448 commit 5f24975Copy full SHA for 5f24975
library/std/src/collections/mod.rs
@@ -268,7 +268,7 @@
268
//! not. Normally, this would require a `find` followed by an `insert`,
269
//! effectively duplicating the search effort on each insertion.
270
//!
271
-//! When a user calls `map.entry(&key)`, the map will search for the key and
+//! When a user calls `map.entry(key)`, the map will search for the key and
272
//! then yield a variant of the `Entry` enum.
273
274
//! If a `Vacant(entry)` is yielded, then the key *was not* found. In this case
0 commit comments