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