hpopp

hpopp

To simplify some tasks at work, I wrote and published this package yesterday. It’s a simple macro that enables Access behaviour on structs.

https://github.com/codedge-llc/accessible

So, while I know this goes directly against core design decisions, it makes it extremely simple to perform deeply nested gets/updates on complex structs. This is something I could see myself using on every major project from now on.

I’ve found relatively little discussion about it, so I’m wondering, have I done something dirty?

Showing Posts 1 to 7

christhekeele

christhekeele

I think core’s design decision in this regard is twofold:

  • The compile-time guarantees of struct.field access should be strongly encouraged over the runtime struct[:field] form
  • The creator of the struct might have a different vision for what Access might mean for their data-structure

This is why it’s not a part of core—I don’t think that means that it should be avoided within your own structs, though, especially if they nest other data-structures you intend for your struct’s users to interact with manually.

An example of the second point might be a Conn struct that represents key/value access to an external system, like redis or an API. It’s going to want to define Access for itself, but with radically different intentions than exposing its actual literal fields.

mariusbutuc

mariusbutuc

I ended up here from trying to ask a new question: Where can one find details on the reasoning behind why Structs in Elixir do not implement the Access behaviour?

As a first, rookie take on this, I started with something like

  # `Struct`s don't implement the `Access` behaviour.
  #
  # TODO: Similar patterns exist throughout the codebase. Re-evaluate if
  #       `get_in_struct/2` and `put_in_struct/3` are the desired approach.
  #
  # Allow for something similar to `put_in` for `Struct`.
  @spec put_in_struct(struct(), nonempty_list(atom()), term()) :: struct()
  defp put_in_struct(struct, location, value) do
    locator = Enum.map(location, &Access.key/1)
    put_in(struct, locator, value)
  end

  # Allow for something similar to `get_in` for `Struct`.
  @spec get_in_struct(struct(), nonempty_list(atom())) :: term()
  defp get_in_struct(struct, location) do
    locator = Enum.map(location, &Access.key/1)
    get_in(struct, locator)
  end

Digging deeper, my current understanding is that this approach is not Elixir-idiomatic. Instead, it is the Access behaviour that “should” be implemented.

Is this understanding aligned with the Elixir community’s best practices?

If so, since this link is out of date*, where can one find an example of implementing the Access behaviour for Structs?

christhekeele

christhekeele

I believe the approach documented here is now the way to do this.

mguimas

mguimas

You can use put_in and get_in on structs like shown by Dogbert in Elixir: best practice to extract data from nested structs on Stackoverflow.

lkuty

lkuty

Looks like it is for protocols, not behaviours. I think I will use struct_access to avoid copy/pasting:

@behaviour Access
defdelegate get(v, key, default), to: Map
defdelegate fetch(v, key), to: Map
defdelegate get_and_update(v, key, func), to: Map
defdelegate pop(v, key), to: Map

Note that the pop function might better be implemented as below to silently ignore the request to delete the key. Or we might want to raise.

def pop(v, key), do: {v[key], v}
ndan

ndan

You can try macros maybe.

import Maybe
event = %Event{user: %User{name: "John"}}
maybe(event.user.name) # => "John"

It’s a slightly modified version of maybe from phoenix_base by Daniel Berkompas

ndan

ndan

Starting from Elixir 1.17, you can traverse structs using the Kernel.get_in/1 macro

# In case any of the keys returns nil, then nil will be returned and get_in/1 won't traverse any further.
get_in(struct.foo.bar)
— 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
nseaSeb
Hello, I know there is an approach for handling lists that allows for optimized traversal, but I can’t recall the specific method (somet...
New
brecabral
Documentation While reading the Scoped Routes section, I noticed that the documentation currently refers to a problem without explainin...
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
asweet-confluent
I recently noticed that Elixir’s Logger defaults its primary log level to :debug when no :logger, :level application configuration is pre...
New

Other Trending Topics Top

JesseHerrick
Hey, I’m Jesse and I’m the main contributor behind Dexter, a full-featured, lightning-fast Elixir LSP optimized for large codebases. It s...
New
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
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
mhanberg
Hi everyone! The first release candidate for the Expert language server project is now available! We’ve published a press release detai...
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

We're in Beta

About us Mission Statement

Options

Thread Display Mode




Thread Preview

Skip Thread Previews