Creating implementation for idiom 334 : Combine 2 maps

Idiom

# 334 Combine 2 maps

Created by

Lead paragraph

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.

New implementation

Language

Imports

Code

Documentation URL

Original attribution URL

Online runnable demo

Username

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.

Other implementations

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
}

Demo

let c = {...a, ...b}

import java.util.HashMap;
import java.util.Map;

Map<K, V> c = new HashMap<>(a);
c.putAll(b);

fgl

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}

Demo

c = a | b

Demo
Origin

c = a.merge(b)

Preview