Ramda is a popular FP utility library for JavaScript. I’ve made Algo in a similar vein for Elixir.

Elixir already has an excellent standard library, and Enum along with Kernel.put_in and related functions go a long way. But I found that it’s still less than trivial to do a lot of transformations when working with nested maps and keyword lists, deep-merging data, or chunking lists based on adjacent elements. I haven’t found an Elixir library that conveniently packages all of that like Ramda, so I made Algo.

The idea is to replace common, boilerplatey code with more compact, more descriptive functions. For example, you could transform some nested map values like this:

normalised_user = Algo.evolve(user, %{
  profile: %{
    age: &String.to_integer/1
  },
  metadata: %{
    score: &round/1
  }
})

There are also functions like deep_merge_right for deep merging, each_depth_first for a depth-first traversal, and so on. The functions for nested data structures work on both maps and keyword lists.

Additionally, there is a bunch of functions for working with lists, for example:

iex> Algo.List.chunk_while_adjacent([1, 2, 3, 1, 2], fn left, right -> right == left + 1 end)
[[1, 2, 3], [1, 2]]

iex> Algo.List.get_permutations([1, 2, 3])
[[1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2], [3, 2, 1]]

I hope it’s useful.

Blog post with more details and examples: https://korban.net/posts/2026-05-20-algo-ramda-like-elixir-package

Docs: https://hexdocs.pm/algo
Hex package: https://hex.pm/packages/algo

Repo: