please please don’t make it 2.0 yet! I’m still in the learning phase with the language itself! too overwhelming! 
soyjeansoy
belaustegui
If you need i18n or i10n in an Elixir project you’ll most likely use Gettext.
The provided macros and functions have their own benefits and downsides. But there is a way to combine them and get the best of both worlds.
djaouen
I was recently looking at a front-end video by FreeCodeCamp where they introduced the site https://codewars.com. I was surprised to see that they had some Elixir problems, but this post is not about one you can solve using Elixir on that site (at least not yet). Instead, it is about a JavaScript problem on that site that I had difficulty translating into Elixir code. This is because the problem (or, at the very least, the naive solution) requires in-place modification of a few variables within a loop. If you would like to see the problem, its statement, and how I came up with a naive Elixir solution using ETS tables, feel free to check it out here: https://danieljaouendevelopment.com/2023/09/09/elixir-codewars-problem/
Thanks for reading!
djaouen
As a side note, I have been using GitHub Copilot for a few months now and am amazed at how well it knows how to extend my code. I was typing up the solution not using ETS a moment ago, and it knew to filter out the nils from my Enum.with_index. Amazing!
cmo
Interesting that you consider using ETS the naive solution. I would use recursion or reduce for this type of thing.
cloudytoday
I think ETS is a serious overcomplication. It should be possible to solve it in a go with Enum.scan. Nice post though!
cloudytoday
I tried to solve it with parsing combinators in another language and I like how simple it came out to be. Sadly I’m not accustomed with NimbleParsec’s API so if anyone could post an Elixir solution with parsing combinators it would be awesome.
ryanwinchester
Interesting post, and thanks for sharing.
Although, I think the normal “naive” way to do this in Elixir would be to use a function from Enum module, or plain recursive functions like
defmodule Challenge do
def solution(string) do
squeeze(string, [])
end
defp squeeze(<<>>, acc), do: Enum.reverse(acc)
defp squeeze(<<c, rest::binary>>, [c | _] = acc), do: squeeze(rest, acc)
defp squeeze(<<c, rest::binary>>, acc), do: squeeze(rest, [c | acc])
end
djaouen
acalejos
NimbleOptions is a small but very powerful library that I think everyone should be aware of. It allows you to define powerful validation definitions to use with Keyword List options, and I have found it to be great!
Check out my latest blog post, where I share some advanced techniques that helped me when writing EXGBoost!