2017-02-07 20:05:30 +00:00
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
2018-12-10 05:27:19 +00:00
|
|
|
--> $DIR/entry.rs:19:5
|
2017-02-07 20:05:30 +00:00
|
|
|
|
|
2018-12-10 05:27:19 +00:00
|
|
|
19 | / if !m.contains_key(&k) {
|
|
|
|
20 | | m.insert(k, v);
|
|
|
|
21 | | }
|
|
|
|
| |_____^ help: consider using: `m.entry(k).or_insert(v)`
|
2017-02-07 20:05:30 +00:00
|
|
|
|
|
2018-08-01 14:30:44 +00:00
|
|
|
= note: `-D clippy::map-entry` implied by `-D warnings`
|
2017-02-07 20:05:30 +00:00
|
|
|
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
2018-12-10 05:27:19 +00:00
|
|
|
--> $DIR/entry.rs:25:5
|
2017-02-07 20:05:30 +00:00
|
|
|
|
|
2018-12-10 05:27:19 +00:00
|
|
|
25 | / if !m.contains_key(&k) {
|
|
|
|
26 | | foo();
|
|
|
|
27 | | m.insert(k, v);
|
|
|
|
28 | | }
|
|
|
|
| |_____^ help: consider using: `m.entry(k)`
|
2017-02-07 20:05:30 +00:00
|
|
|
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
2018-12-10 05:27:19 +00:00
|
|
|
--> $DIR/entry.rs:32:5
|
2017-02-07 20:05:30 +00:00
|
|
|
|
|
2018-12-10 05:27:19 +00:00
|
|
|
32 | / if !m.contains_key(&k) {
|
|
|
|
33 | | m.insert(k, v)
|
|
|
|
34 | | } else {
|
|
|
|
35 | | None
|
|
|
|
36 | | };
|
|
|
|
| |_____^ help: consider using: `m.entry(k)`
|
2017-02-07 20:05:30 +00:00
|
|
|
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
2018-12-10 05:27:19 +00:00
|
|
|
--> $DIR/entry.rs:40:5
|
2017-02-07 20:05:30 +00:00
|
|
|
|
|
2018-12-10 05:27:19 +00:00
|
|
|
40 | / if m.contains_key(&k) {
|
|
|
|
41 | | None
|
|
|
|
42 | | } else {
|
|
|
|
43 | | m.insert(k, v)
|
|
|
|
44 | | };
|
|
|
|
| |_____^ help: consider using: `m.entry(k)`
|
2017-02-07 20:05:30 +00:00
|
|
|
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
2018-12-10 05:27:19 +00:00
|
|
|
--> $DIR/entry.rs:48:5
|
2017-02-07 20:05:30 +00:00
|
|
|
|
|
2018-12-10 05:27:19 +00:00
|
|
|
48 | / if !m.contains_key(&k) {
|
|
|
|
49 | | foo();
|
|
|
|
50 | | m.insert(k, v)
|
|
|
|
51 | | } else {
|
|
|
|
52 | | None
|
|
|
|
53 | | };
|
|
|
|
| |_____^ help: consider using: `m.entry(k)`
|
2017-02-07 20:05:30 +00:00
|
|
|
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `HashMap`
|
2018-12-10 05:27:19 +00:00
|
|
|
--> $DIR/entry.rs:57:5
|
2017-02-07 20:05:30 +00:00
|
|
|
|
|
2018-12-10 05:27:19 +00:00
|
|
|
57 | / if m.contains_key(&k) {
|
|
|
|
58 | | None
|
|
|
|
59 | | } else {
|
|
|
|
60 | | foo();
|
|
|
|
61 | | m.insert(k, v)
|
|
|
|
62 | | };
|
|
|
|
| |_____^ help: consider using: `m.entry(k)`
|
2017-02-07 20:05:30 +00:00
|
|
|
|
|
|
|
error: usage of `contains_key` followed by `insert` on a `BTreeMap`
|
2018-12-10 05:27:19 +00:00
|
|
|
--> $DIR/entry.rs:66:5
|
2017-02-07 20:05:30 +00:00
|
|
|
|
|
2018-12-10 05:27:19 +00:00
|
|
|
66 | / if !m.contains_key(&k) {
|
|
|
|
67 | | foo();
|
|
|
|
68 | | m.insert(k, v)
|
|
|
|
69 | | } else {
|
|
|
|
70 | | None
|
|
|
|
71 | | };
|
|
|
|
| |_____^ help: consider using: `m.entry(k)`
|
2017-02-07 20:05:30 +00:00
|
|
|
|
2018-01-16 16:06:27 +00:00
|
|
|
error: aborting due to 7 previous errors
|
|
|
|
|