2017-02-07 21:05:30 +01:00
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
2019-01-07 22:33:18 +01:00
|
|
|
--> $DIR/entry.rs:10:5
|
2017-02-07 21:05:30 +01:00
|
|
|
|
|
2018-12-27 16:57:55 +01:00
|
|
|
LL | / if !m.contains_key(&k) {
|
|
|
|
LL | | m.insert(k, v);
|
|
|
|
LL | | }
|
2018-12-10 06:27:19 +01:00
|
|
|
| |_____^ help: consider using: `m.entry(k).or_insert(v)`
|
2017-02-07 21:05:30 +01:00
|
|
|
|
|
2018-08-01 16:30:44 +02:00
|
|
|
= note: `-D clippy::map-entry` implied by `-D warnings`
|
2017-02-07 21:05:30 +01:00
|
|
|
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
2019-01-07 22:33:18 +01:00
|
|
|
--> $DIR/entry.rs:16:5
|
2017-02-07 21:05:30 +01:00
|
|
|
|
|
2018-12-27 16:57:55 +01:00
|
|
|
LL | / if !m.contains_key(&k) {
|
|
|
|
LL | | foo();
|
|
|
|
LL | | m.insert(k, v);
|
|
|
|
LL | | }
|
2018-12-10 06:27:19 +01:00
|
|
|
| |_____^ help: consider using: `m.entry(k)`
|
2017-02-07 21:05:30 +01:00
|
|
|
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
2019-01-07 22:33:18 +01:00
|
|
|
--> $DIR/entry.rs:23:5
|
2017-02-07 21:05:30 +01:00
|
|
|
|
|
2018-12-27 16:57:55 +01:00
|
|
|
LL | / if !m.contains_key(&k) {
|
|
|
|
LL | | m.insert(k, v)
|
|
|
|
LL | | } else {
|
|
|
|
LL | | None
|
|
|
|
LL | | };
|
2018-12-10 06:27:19 +01:00
|
|
|
| |_____^ help: consider using: `m.entry(k)`
|
2017-02-07 21:05:30 +01:00
|
|
|
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
2019-01-07 22:33:18 +01:00
|
|
|
--> $DIR/entry.rs:31:5
|
2017-02-07 21:05:30 +01:00
|
|
|
|
|
2018-12-27 16:57:55 +01:00
|
|
|
LL | / if m.contains_key(&k) {
|
|
|
|
LL | | None
|
|
|
|
LL | | } else {
|
|
|
|
LL | | m.insert(k, v)
|
|
|
|
LL | | };
|
2018-12-10 06:27:19 +01:00
|
|
|
| |_____^ help: consider using: `m.entry(k)`
|
2017-02-07 21:05:30 +01:00
|
|
|
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
2019-01-07 22:33:18 +01:00
|
|
|
--> $DIR/entry.rs:39:5
|
2017-02-07 21:05:30 +01:00
|
|
|
|
|
2018-12-27 16:57:55 +01:00
|
|
|
LL | / if !m.contains_key(&k) {
|
|
|
|
LL | | foo();
|
|
|
|
LL | | m.insert(k, v)
|
|
|
|
LL | | } else {
|
|
|
|
LL | | None
|
|
|
|
LL | | };
|
2018-12-10 06:27:19 +01:00
|
|
|
| |_____^ help: consider using: `m.entry(k)`
|
2017-02-07 21:05:30 +01:00
|
|
|
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
2019-01-07 22:33:18 +01:00
|
|
|
--> $DIR/entry.rs:48:5
|
2017-02-07 21:05:30 +01:00
|
|
|
|
|
2018-12-27 16:57:55 +01:00
|
|
|
LL | / if m.contains_key(&k) {
|
|
|
|
LL | | None
|
|
|
|
LL | | } else {
|
|
|
|
LL | | foo();
|
|
|
|
LL | | m.insert(k, v)
|
|
|
|
LL | | };
|
2018-12-10 06:27:19 +01:00
|
|
|
| |_____^ help: consider using: `m.entry(k)`
|
2017-02-07 21:05:30 +01:00
|
|
|
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `BTreeMap`
|
2019-01-07 22:33:18 +01:00
|
|
|
--> $DIR/entry.rs:57:5
|
2017-02-07 21:05:30 +01:00
|
|
|
|
|
2018-12-27 16:57:55 +01:00
|
|
|
LL | / if !m.contains_key(&k) {
|
|
|
|
LL | | foo();
|
|
|
|
LL | | m.insert(k, v)
|
|
|
|
LL | | } else {
|
|
|
|
LL | | None
|
|
|
|
LL | | };
|
2018-12-10 06:27:19 +01:00
|
|
|
| |_____^ help: consider using: `m.entry(k)`
|
2017-02-07 21:05:30 +01:00
|
|
|
|
2018-01-16 17:06:27 +01:00
|
|
|
error: aborting due to 7 previous errors
|
|
|
|
|