windexoriginal

windexoriginal

I often find myself with code like this when applying a function that returns error tuples to an enumerable:

is_ok? = fn x -> 
  if x < 5, do: {:ok, x}, else: {:error, "too big"} 
end

Enum.reduce_while(1..5, {:ok, []}, fn v, {:ok, vs} ->
 case is_ok?.(v) do
  {:ok, v} -> {:cont, {:ok, [v | vs]}}
  {:error, _} = e -> {:halt, e}
 end
end)

But, if I write a simple collectable implementation for Tuple, I can write this instead:

for x < - 1..5, into: {:ok, []}, do: is_ok.(x)

I much prefer the second: it’s short, it’s clear, and I don’t mind too much that it iterates the whole enumerable every time. Is implementing a protocol for convenience on a built in type like this a good long term decision?

Showing Posts 1 to 8

Asd

Asd

If you implement collectable and you do

for x < - 1..1000000, into: {:ok, []}, do: is_ok.(x)

You will perform 999995 unnecessary operations

dimitarvp

dimitarvp

Your first code stops at the first error. Your second code doesn’t.

FlyingNoodle

FlyingNoodle

I much, much prefer the first version. I can immediately see what happens and understand.

I always prefer clarity over brevity. Always. Every. Single. Time.

mudasobwa

mudasobwa

Creator of Cure

Then you’d better change the accumulator, I guess

Enum.reduce(1..5, %{ok: [], errors: []}, fn v, vs ->
  key = if is_ok?.(v), do: :ok, else: :error
  Map.update!(vs, key, &[v | &1]}}
end)
dmitrykleymenov

dmitrykleymenov

How should this chunk behave? For me(if you implement `Collectable` protocol), the result should be something like:

{:ok, [], {:ok, :v1}, {:error, :reason}, ...}
al2o3cr

al2o3cr

My reading was that the Collectable implementation would check the shape of the block’s return value:

  • if it’s {:ok, value} and the accumulator is {:ok, values} then the new accumulator is {:ok, values ++ [value]} (or equivalent with reverse-at-the-end for performance)
  • if it’s {:ok, value} and the accumulator is anything else then the new accumulator is unchanged
  • if it’s {:error, e} then the new accumulator is {:error, e}

I don’t think I’d personally choose this approach, since it requires defining Collectable for all tuples but only actually cares about specific shapes

windexoriginal

windexoriginal OP

That is how I wrote the collectable implementation, and it would also raise an exception if it was given a tuple with an unexpected shape. Ultimately I agree with you and @FlyingNoodle that using a protocol isn’t a good approach.

I ended up creating a Result stuct with a collectable implementation with similar behavior.

@mudasobwa I should have been more clear in my examples. I used Enum.reduce_while/3 to illustrate that the desired outcome was that the first error encountered would be the result for the collectable.

dmitrykleymenov

dmitrykleymenov

Yeah, doesn’t seem like Collectable any more, significantly different from other implementations.

— All posts loaded —

Where Next? Top

Trending in Questions Top

RSP87
I’m working on a project that simulates the bumbl example in the programming phoenix book. It acts almost like an email client. We have a...
New
kszambelanczyk
Hello! Could someone please give me a help/sample code, how to delete a file from s3 using waffle/waffle_ecto from Phoenix app. I creat...
New
RemyXRenard
I’m seeing that a list inside a Kino.DataTable will be interpreted as a charlist, even if the Kino.configure() is set to charlists: :as_l...
New
velrest
So my question is quite simple and i have found no conclusive answer on forum, google or AI. Should we use :erlang.float for Integer to ...
New
samoloth
Hi, I’ve just set up an application with ash_authentication. There is only magic link strategy for now, so there is no confirmation add o...
New
FlyingNoodle
If a change or preparation module uses Ash.Changeset.get_argument/2 or Ash.Query.get_argument/2 (or any of the other get_argument functio...
New
ryanwinchester
apply_graft/2 doesn’t rewrite an add_many sub-workflow’s deps on an add step. Grafted jobs cancel with “upstream job was deleted” Version...
New

Other Trending Topics Top

mudasobwa
I am happy to introduce the very α version of the new programming language compiled to BEAM. Welcome Cure. It has literally three kille...
New
garrison
Hobbes is a low-level distributed database for the Elixir programming language. Hobbes provides a simple, safe, and scalable storage lay...
New
marciok
Hi there! We created Gust: A task orchestrator inspired by Airflow. For those who have never heard about Aiflow, it’s a Python-based wor...
New
jimsynz
Beam Bots (or just BB for short) is a framework for building fault-tolerant robotics applications in Elixir using familiar OTP patterns. ...
New
Dmk
Xamal is a deployment tool for Elixir apps that deploys native releases to bare metal servers over SSH. It’s a port of GitHub - basecamp/...
New
Damirados
Hello everyone. After busy few months I am happy to announce v0.1.0 of Emerge &amp; Solve. They are GUI (Emerge) and State management (S...
New

We're in Beta

About us Mission Statement

Options

Thread Display Mode




Thread Preview

Skip Thread Previews