1 #![allow(unused, clippy::needless_pass_by_value)]
2 #![warn(clippy::map_entry)]
4 use std::collections::{BTreeMap, HashMap};
9 fn insert_if_absent0<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) {
10 if !m.contains_key(&k) {
15 fn insert_if_absent1<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) {
16 if !m.contains_key(&k) {
22 fn insert_if_absent2<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) {
23 if !m.contains_key(&k) {
30 fn insert_if_present2<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) {
31 if m.contains_key(&k) {
38 fn insert_if_absent3<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) {
39 if !m.contains_key(&k) {
47 fn insert_if_present3<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) {
48 if m.contains_key(&k) {
56 fn insert_in_btreemap<K: Ord, V>(m: &mut BTreeMap<K, V>, k: K, v: V) {
57 if !m.contains_key(&k) {
65 fn insert_other_if_absent<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, o: K, v: V) {
66 if !m.contains_key(&k) {