1 #![allow(unused, clippy::needless_pass_by_value)]
2 #![warn(clippy::map_entry)]
4 use std::collections::{BTreeMap, HashMap};
9 fn insert_if_absent2<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) {
10 if !m.contains_key(&k) {
17 fn insert_if_present2<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) {
18 if m.contains_key(&k) {
25 fn insert_if_absent3<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) {
26 if !m.contains_key(&k) {
34 fn insert_if_present3<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) {
35 if m.contains_key(&k) {
43 fn insert_in_btreemap<K: Ord, V>(m: &mut BTreeMap<K, V>, k: K, v: V) {
44 if !m.contains_key(&k) {
53 fn insert_other_if_absent<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, o: K, v: V) {
54 if !m.contains_key(&k) {
59 // should not trigger, because the one uses different HashMap from another one
60 fn insert_from_different_map<K: Eq + Hash, V>(m: HashMap<K, V>, n: &mut HashMap<K, V>, k: K, v: V) {
61 if !m.contains_key(&k) {
66 // should not trigger, because the one uses different HashMap from another one
67 fn insert_from_different_map2<K: Eq + Hash, V>(m: &mut HashMap<K, V>, n: &mut HashMap<K, V>, k: K, v: V) {
68 if !m.contains_key(&k) {