LL | | } else {
LL | | None
LL | | };
- | |_____^
+ | |_____^ consider using `m.entry(k)`
|
= note: `-D clippy::map-entry` implied by `-D warnings`
-help: consider using `m.entry(k)`
- --> $DIR/entry_unfixable.rs:10:5
- |
-LL | / if !m.contains_key(&k) {
-LL | | m.insert(k, v)
-LL | | } else {
-LL | | None
-LL | | };
- | |_____^
error: usage of `contains_key` followed by `insert` on a `HashMap`
--> $DIR/entry_unfixable.rs:18:5
LL | | } else {
LL | | m.insert(k, v)
LL | | };
- | |_____^
- |
-help: consider using `m.entry(k)`
- --> $DIR/entry_unfixable.rs:18:5
- |
-LL | / if m.contains_key(&k) {
-LL | | None
-LL | | } else {
-LL | | m.insert(k, v)
-LL | | };
- | |_____^
+ | |_____^ consider using `m.entry(k)`
error: usage of `contains_key` followed by `insert` on a `HashMap`
--> $DIR/entry_unfixable.rs:26:5
LL | | } else {
LL | | None
LL | | };
- | |_____^
- |
-help: consider using `m.entry(k)`
- --> $DIR/entry_unfixable.rs:26:5
- |
-LL | / if !m.contains_key(&k) {
-LL | | foo();
-LL | | m.insert(k, v)
-LL | | } else {
-LL | | None
-LL | | };
- | |_____^
+ | |_____^ consider using `m.entry(k)`
error: usage of `contains_key` followed by `insert` on a `HashMap`
--> $DIR/entry_unfixable.rs:35:5
LL | | foo();
LL | | m.insert(k, v)
LL | | };
- | |_____^
- |
-help: consider using `m.entry(k)`
- --> $DIR/entry_unfixable.rs:35:5
- |
-LL | / if m.contains_key(&k) {
-LL | | None
-LL | | } else {
-LL | | foo();
-LL | | m.insert(k, v)
-LL | | };
- | |_____^
+ | |_____^ consider using `m.entry(k)`
error: usage of `contains_key` followed by `insert` on a `BTreeMap`
--> $DIR/entry_unfixable.rs:44:5
LL | | } else {
LL | | None
LL | | };
- | |_____^
- |
-help: consider using `m.entry(k)`
- --> $DIR/entry_unfixable.rs:44:5
- |
-LL | / if !m.contains_key(&k) {
-LL | | foo();
-LL | | m.insert(k, v)
-LL | | } else {
-LL | | None
-LL | | };
- | |_____^
+ | |_____^ consider using `m.entry(k)`
error: aborting due to 5 previous errors