mirror of
https://github.com/rust-lang/rust.git
synced 2024-12-01 19:23:50 +00:00
51 lines
2.0 KiB
Plaintext
51 lines
2.0 KiB
Plaintext
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
|
--> $DIR/entry.rs:13:5
|
|
|
|
|
13 | if !m.contains_key(&k) { m.insert(k, v); }
|
|
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: consider using `m.entry(k).or_insert(v)`
|
|
|
|
|
note: lint level defined here
|
|
--> $DIR/entry.rs:5:9
|
|
|
|
|
5 | #![deny(map_entry)]
|
|
| ^^^^^^^^^
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
|
--> $DIR/entry.rs:20:5
|
|
|
|
|
20 | if !m.contains_key(&k) { foo(); m.insert(k, v); }
|
|
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: consider using `m.entry(k)`
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
|
--> $DIR/entry.rs:27:5
|
|
|
|
|
27 | if !m.contains_key(&k) { m.insert(k, v) } else { None };
|
|
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: consider using `m.entry(k)`
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
|
--> $DIR/entry.rs:34:5
|
|
|
|
|
34 | if m.contains_key(&k) { None } else { m.insert(k, v) };
|
|
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: consider using `m.entry(k)`
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
|
--> $DIR/entry.rs:41:5
|
|
|
|
|
41 | if !m.contains_key(&k) { foo(); m.insert(k, v) } else { None };
|
|
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: consider using `m.entry(k)`
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
|
--> $DIR/entry.rs:48:5
|
|
|
|
|
48 | if m.contains_key(&k) { None } else { foo(); m.insert(k, v) };
|
|
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: consider using `m.entry(k)`
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `BTreeMap`
|
|
--> $DIR/entry.rs:55:5
|
|
|
|
|
55 | if !m.contains_key(&k) { foo(); m.insert(k, v) } else { None };
|
|
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: consider using `m.entry(k)`
|
|
|
|
error: aborting due to 7 previous errors
|
|
|