Logo

Programming-Idioms

  • Haskell
  • Ruby
  • Perl

Idiom #334 Combine 2 maps

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.

%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.merge(b)

Each duplicate-key entry’s value overwrites the previous value, unless a given block specifies other behavior.
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.
New implementation...
< > ⌨
programming-idioms.org 
%c = (%a, %b);
c = a.merge(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}
Map<K, V> c = new HashMap<>(a);
c.putAll(b);
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;

c = {**a, **b}
c = a | b