]>
Commit | Line | Data |
---|---|---|
abe05a73 XL |
1 | |
2 | ||
ea8adc8c XL |
3 | #![allow(unused, needless_pass_by_value)] |
4 | ||
5 | #![warn(map_entry)] | |
6 | ||
7 | use std::collections::{BTreeMap, HashMap}; | |
8 | use std::hash::Hash; | |
9 | ||
10 | fn foo() {} | |
11 | ||
12 | fn insert_if_absent0<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) { | |
13 | if !m.contains_key(&k) { m.insert(k, v); } | |
14 | } | |
15 | ||
16 | fn insert_if_absent1<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) { | |
17 | if !m.contains_key(&k) { foo(); m.insert(k, v); } | |
18 | } | |
19 | ||
20 | fn insert_if_absent2<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) { | |
21 | if !m.contains_key(&k) { m.insert(k, v) } else { None }; | |
22 | } | |
23 | ||
24 | fn insert_if_present2<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) { | |
25 | if m.contains_key(&k) { None } else { m.insert(k, v) }; | |
26 | } | |
27 | ||
28 | fn insert_if_absent3<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) { | |
29 | if !m.contains_key(&k) { foo(); m.insert(k, v) } else { None }; | |
30 | } | |
31 | ||
32 | fn insert_if_present3<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) { | |
33 | if m.contains_key(&k) { None } else { foo(); m.insert(k, v) }; | |
34 | } | |
35 | ||
36 | fn insert_in_btreemap<K: Ord, V>(m: &mut BTreeMap<K, V>, k: K, v: V) { | |
37 | if !m.contains_key(&k) { foo(); m.insert(k, v) } else { None }; | |
38 | } | |
39 | ||
40 | fn insert_other_if_absent<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, o: K, v: V) { | |
41 | if !m.contains_key(&k) { m.insert(o, v); } | |
42 | } | |
43 | ||
44 | fn main() { | |
45 | } |