about summary refs log tree commit diff
path: root/src/docs/map_entry.txt
diff options
context:
space:
mode:
Diffstat (limited to 'src/docs/map_entry.txt')
-rw-r--r--src/docs/map_entry.txt28
1 files changed, 0 insertions, 28 deletions
diff --git a/src/docs/map_entry.txt b/src/docs/map_entry.txt
deleted file mode 100644
index 20dba1798d0..00000000000
--- a/src/docs/map_entry.txt
+++ /dev/null
@@ -1,28 +0,0 @@
-### What it does
-Checks for uses of `contains_key` + `insert` on `HashMap`
-or `BTreeMap`.
-
-### Why is this bad?
-Using `entry` is more efficient.
-
-### Known problems
-The suggestion may have type inference errors in some cases. e.g.
-```
-let mut map = std::collections::HashMap::new();
-let _ = if !map.contains_key(&0) {
-    map.insert(0, 0)
-} else {
-    None
-};
-```
-
-### Example
-```
-if !map.contains_key(&k) {
-    map.insert(k, v);
-}
-```
-Use instead:
-```
-map.entry(k).or_insert(v);
-```
\ No newline at end of file