rrrr
How to "merge" / "map" two sparse maps into one?
What is Elixir way to “merge” / “map” two sparse maps onto one? I want to apply some function on both or single value from these maps. By “sparse” i mean that some keys are missing in another map. Like
a = %{1=>1, 2=>2, 4=>4}
b = %{0=>0, 1=>11, 2=>22, 5=>55}
looking for c=%{0=>f(0), 1=>f(1,11), …}
So far I have come with obtaining list of common keys and moving with it as index for both maps.
Closest built-in solution was Map.merge(map1, map2, fun), but it does not cover custom behavior when key is missing in one map.
Can solution be Stream’able?
Should I look for some non-default library?
Marked As Solved
LostKobrakai
Map.new(Map.keys(a) ++ Map.keys(b), fn key ->
case {Map.fetch(a, key), Map.fetch(b, key)} do
{:error, {:ok, val}} -> {key, f(val)}
{{:ok, val}, :error} -> {key, f(val)}
{{:ok, val_a}, {:ok, val_b}} -> {key, f(val_a, val_b)}
# {:error, :error} not possible
end
end)
Also Liked
Sorc96
Can you merge the maps first and then apply the function?
Map.merge(a, b, fn _key, value1, value2 -> {value1, value2} end)
|> Map.new(fn
{key, {value1, value2}} -> {key, f(value1, value2)}
{key, value} -> {key, f(value)}
end)
It could get a bit cleaner if Elixir had an equivalent of Ruby’s transform_values, then it wouldn’t be necessary to repeat the key manually.
I’m guessing you want to use Stream because of t hef function? In that case I think you could first use Stream.map and then convert the result back into a map.
hlx
map1 = %{a: 1, b: 2}
map2 = %{b: 1, c: 1}
fun = fn x, y -> x + y end
for {k1, v1} <- map1, {k2, v2} <- map2, reduce: %{} do
acc ->
if k1 == k2 do
Map.put(acc, k1, fun.(v1, v2))
else
acc
|> Map.put(k1, v1)
|> Map.put(k2, v2)
end
end
edit: after reviewing it myself this is not a great solution.
LostKobrakai
This one iterates map2 for each key/value pair in map1. That can become expensive rather quickly.
Last Post!
codeanpeace
I like how the case statement makes this approach very readable.
Just wanted to add that, depending on how often both maps contain overlapping keys, it could make sense to manually remove duplicated keys e.g. Map.keys(a) ++ Map.keys(b) |> Enum.uniq.
Map.new/2 already removes duplicated keys with the latest one prevailing. But that means it would unnecessarily run through the case statement twice whenever a key exists in both maps.
Trending in Questions
Other Trending Topics
Categories:
Sub Categories:
Forums
Popular Tags
- #ecto
- #liveview
- #troubleshooting
- #learning-elixir
- #deployment
- #library
- #erlang
- #testing
- #genserver
- #mix
- #absinthe
- #remote-other
- #otp
- #plug
- #how-to-question
- #macros
- #postgres
- #channels
- #elixirconf
- #exunit
- #discussion
- #code-sync
- #javascript
- #podcasts
- #onsite
- #dialyzer
- #docker
- #authentication
- #umbrella
- #full-time-contract
- #podcasts-by-brainlid
- #ecto-query
- #elixir-ls
- #phoenix_html
- #iex
- #blog-post
- #graphql
- #genstage
- #ai
- #websockets
- #elixirconf-us
- #supervisor
- #advent-of-code
- #distillery
- #processes
- #api
- #forms
- #metaprogramming
- #security
- #hex









