Hi! As the title suggests, can someone help in giving an example about how we can loop over sets using recursion? I do know that the Enum functions exist, which are extremely helpful, however, I want to try experimenting with sets in a different way. I am quite confused over what the base case woul…

This is how to implement sum with recursion. def sum(list), do: sum(list, 0) def sum([], s), do: s def sum([head|tail], s), do: sum(tail, s + head) In more complex scenario, You pass the state of the iteration in a recursive way. [image] belteconti: {a, b, c} That is a tuple.

I get how we can do this using lists. However, how can we implement this with sets or maps?

Sets ( MapSet ) in Elixir are implemented using Maps . When you do this: [1, 2, 3] |> MapSet.new() |> Map.to_list() you will see, that the result is this [__struct__: MapSet, map: %{1 => [], 2 => [], 3 => []}, version: 2] That means, that the MapSet is just a map with some special keys (similar to…

MapSet.t() is @opaque which mean that You cannot rely on it’s internal representation, and that mean that your code can be broken any time (even in patch Elixir version). The only way to traverse set in the safe way is: set = MapSet.new([1, 2, 3]) recursive_sum(Enum.to_list(set)) But if you just…

For completeness, I just want to point out that MapSet.to_list ( MapSet — Elixir v1.12.3 ) also exists. That’s my go-to for enumerating sets.

Elixir Programming Language Forum

Looping over Sets using Recursion

Questions & Help Questions

stefanluptak November 9, 2021, 12:21pm 6

Yes, sorry. I forgot to mention that in my post. I updated it.