Be concise.
Be useful.
All contributions dictatorially edited by webmasters to match personal tastes.
Please do not paste any copyright violating material.
Please try to avoid dependencies to third-party libraries and frameworks.
final c = {...a, ...b};Spread and flatten the entries of maps a and b to construct a new copy as c. Duplicate keys will favor b over a.
c := make(M, len(a)+len(b))
for k, v := range a {
c[k] = v
}
for k, v := range b {
c[k] = v
}M is the map type of a and b
For any common key, the value from b overwrites the value from a.
For any common key, the value from b overwrites the value from a.
let c = {...a, ...b}Map<K, V> c = new HashMap<>(a);
c.putAll(b);"... If the map previously contained a mapping for the key, the old value is replaced by the specified value."
type
TKey = TSomeType;
TData = TSomeOtherType;
TMap = specialize TFPGMap<TKey, TData>;
...
c := TMap.Create;
for idx := 0 to a.count-1 do
begin
c.Add(a.keys[idx],a.data[idx]);
end;
for idx := 0 to b.count-1 do
begin
c.AddOrSetData(b.keys[idx],b.data[idx]);
end;
If a key exists in both a and b, the value of said key in c will be the value as in b.
%c = (%a, %b);Hash %c is assigned all the key-value pairs of %a then all the pairs of %b. The values of any duplicate keys in %b will overwrite those of %a.
c = {**a, **b}a, b, c are dicts.
For any common key, the value from b overwrites the value from a.
For any common key, the value from b overwrites the value from a.
c = a.merge(b)Each duplicate-key entry’s value overwrites the previous value, unless a given block specifies other behavior.