Rory

Rory

Hi,

Been lurking here for a while (that is, via google), gotten a lot of help from people’s Q&As in the past, but I’ve gotten stuck on something that I don’t quite see an answer for in the documentation or the forums here. I feel like it’s something very simple, but I’m just not quite grokking how Access works.

I know how to access stuff in nested maps, but my question is specifically about stuff structured like this:
[ %StructFromAListOfStructs{ a_list_nested_in_that_struct: [ %{ some_attribute: "Blah blah blah" } ] }, ... ]

Each map/struct in this list has an attribute which returns a list of maps, and I want to access the keys in those nested lists.

Now if this was simply a nested map, I’d know what to do, but I get confused at this point. I’m sure if I studied the docs a little harder I could figure it out, but I figured I’d leverage the expertise here and hopefully save myself some time (thanks in advance!).

What I normally do in these sorts of situations is Enum.flat_map the list and then pipe into an Enum.map to access the attribute. But that’s two loops round what is (in my case) some very long lists. Is there a more efficient way to do this?

(BTW, this is not struct specific, just used that for convenience of self-commenting my example.)

Showing Posts 1 to 3

gregvaughn

gregvaughn

You likely want to use Kernel.get_in with some helpers from the Access module such as Access.at and Access.key. Your example is a bit too vague to offer any concrete example, but the hexdocs of those functions should get you going.

hst337

hst337

You could use get_in or Access as @gregvaughn said, but you’ll definitely come across some problems with structures and list traversal.

The best solution is to use library called Pathex. It works with structures better than Access does, plus it is more efficient.

So, with Pathex, your code for accessing this data would like this

use Pathex
import Pathex.Lenses

# Define the path
def path_to_data() do
  all() ~> path(:a_list_nested_in_that_struct) ~> all() ~> path(:some_attribute)
end

# Use the path
def get_data(list_of_lists) do
  Pathex.get(list_of_lists, path_to_data())
end

def set_data(list_of_lists, value) do
  Pathex.set(list_of_lists, path_to_data(), value)
end
Eiji

Eiji

@Rory You can use a nested reduce calls. The actual code would be different in each specific use case. For example if you want to take soonest date from such a nested data then you do not need to collect all elements and simply work on one single data, for example:

defmodule ToDo do
  defmodule List do
    defstruct ~w[items name]a

    defmodule Item do
      defstruct ~w[content date]a
    end
  end
end

defmodule Example do
  def get_data do
    [
      %ToDo.List{
        items: [
          %ToDo.List.Item{content: "Do X", date: ~D[2022-12-15]},
          %ToDo.List.Item{content: "Do Y", date: ~D[2022-12-16]},
          %ToDo.List.Item{content: "Do Z", date: ~D[2022-12-17]}
        ],
        name: "List A"
      },
      %ToDo.List{
        items: [
          %ToDo.List.Item{content: "Do X", date: ~D[2022-12-01]},
          %ToDo.List.Item{content: "Do Y", date: ~D[2022-12-02]},
          %ToDo.List.Item{content: "Do Z", date: ~D[2022-12-03]}
        ],
        name: "List B"
      },
      %ToDo.List{
        items: [
          %ToDo.List.Item{content: "Do X", date: ~D[2023-01-01]},
          %ToDo.List.Item{content: "Do Y", date: ~D[2023-01-02]},
          %ToDo.List.Item{content: "Do Z", date: ~D[2023-01-03]}
        ],
        name: "List C"
      }
    ]
  end

  def get_first_date(data) when is_list(data) do
    Enum.reduce(data, nil, fn %ToDo.List{items: items}, acc ->
      Enum.reduce(items || [], acc, fn
        %ToDo.List.Item{date: nil}, acc ->
          acc

        %ToDo.List.Item{date: date}, nil ->
          date

        %ToDo.List.Item{date: date}, acc ->
          if Date.compare(date, acc) == :lt, do: date, else: acc
      end)
    end)
  end
end

Example.get_data()
|> Example.get_first_date()
|> Date.diff(Date.utc_today())
|> then(&IO.puts("You have still #{&1} free days!"))
# You have still 20 free days!

Look how simple it’s to change. If we would like to take the opposite date then we all we need to do is to change 2 letters i.e. :lt to :gt (when comparing date with acc). If you want to return multiple dates in this example then all you need to do is to change a default acc from nil to [] (empty list) and replace two last nested reduce clauses to:

        %ToDo.List.Item{date: date}, acc ->
          [date | acc]

With nested reduce or alternatively simple pattern matching the whole list is iterated only once. See Enum.reduce/3 for more information.

— 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
kpanic
Hi everyone, I am toying with the idea of building a “match maker” for giving personal help to people that wants to start coding. I sta...
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
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
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
apz
I’m new to elixir and just tried to install the elixirLS extension for VScode(ium) and it is throwing some errors that I would like help ...
New

Other Trending Topics Top

GenericJam
Edit: 2026 May 15 - This post is archived. Mob is alive!! Main docs: mob v0.7.11 — Documentation A bit of explanation for the slightly c...
New
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

We're in Beta

About us Mission Statement

Options

Thread Display Mode




Thread Preview

Skip Thread Previews