Logo

Programming-Idioms

  • JS
  • Java
  • Python

Idiom #335 List to map

Create the map m containing all the elements e of the list a, using as key the field e.id.

m = dict((x.id, x) for x in a)

"... The dict() constructor can accept an iterator that returns a finite stream of (key, value) tuples"
m = {e.id:e for e in a}
let m = new Map(a.map(e => [e.id, e]))
import java.util.HashMap;
import java.util.Map;
Map<Integer, E> m = new HashMap<>();
a.forEach(e -> m.put(e.id, e));
import java.util.Map;
Map<Integer, E> m = a.stream()
    .collect(toMap(e -> e.id, e -> e));
import java.util.HashMap;
import java.util.Map;
Map<Integer, E> m = new HashMap<>();
for (E e : a) m.put(e.id, e);
var m = a.ToDictionary(e => e.id, e => e);
New implementation...
< > ⌨
programming-idioms.org 
m = dict((x.id, x) for x in a)
m = {e.id:e for e in a}
let m = new Map(a.map(e => [e.id, e]))
Map<Integer, E> m = new HashMap<>();
a.forEach(e -> m.put(e.id, e));
Map<Integer, E> m = a.stream()
    .collect(toMap(e -> e.id, e -> e));
Map<Integer, E> m = new HashMap<>();
for (E e : a) m.put(e.id, e);
var m = a.ToDictionary(e => e.id, e => e);
final m = {
  for (final e in a) e.id: e,
};
m := make(map[K]V, len(a))
for _, e := range a {
	m[e.id] = e
}
local m={}
for _,e in ipairs(a) do
 m[e.id]=e
end
type
  TList = specialize TFPGList<TData>;
  TMap = specialize TFPGMap<TKey, TData>;

var
  a: TList;
  m: TMap;
  idx: integer;

begin
  ....
  m := TMap.Create;
  for idx := 0 to a.count-1 do
  begin
    m.add(a.items[idx].e, a.items[idx]);
  end;
  ....
  m.Free;
  ....
foreach my $e (@a) {
    $m{$e->id) = $e;
}
m = a.group_by(&:id)
let mut m = HashMap::new();

for e in a {
	m.entry(e.id).or_insert_with(Vec::new).push(e);
}