pub fn intersection<K: Eq + Hash, V: Merge>( left: &mut HashMap<K, V>, right: HashMap<K, V>, )
Merge recursively elements if the key is present in left and right.
left
right