Create the new map c containing all of the (key, value) entries of the two maps a and b.Explain what happens for keys existing in both a and b.
import java.util.HashMap; import java.util.Map;
Map<K, V> c = new HashMap<>(a); c.putAll(b);
final c = {...a, ...b};
c := make(M, len(a)+len(b)) for k, v := range a { c[k] = v } for k, v := range b { c[k] = v }
let c = {...a, ...b}
%c = (%a, %b);
c = {**a, **b}
c = a | b
c = a.merge(b)
No security, no password. Other people might choose the same nickname.