docjazither

docjazither

Hi OGs,
How can I delete the 1st pair in a map ?
Thank you

Showing Posts 1 to 10

msimonborg

msimonborg

AFAIK maps are unordered, so there is no “first”. You could enumerate over it, collecting all but the first in the enumeration, but I think it would be an arbitrary selection so I’m not sure there’s much difference between that and Map.delete(map, random_key)

docjazither

docjazither OP

In this situation, my keys are atoms or lists, or at least I need to iterate through a map except 1st one, maybe something like Enum.each(map, fn key, value -> if key == Enum.at(map,0) do end end ?

msimonborg

msimonborg

map
|> Enum.to_list()
|> tl()
|> Enum.into(%{})

A simple way but maybe not most performant and doesn’t solve the problem I stated above

adamu

adamu

Please post your code showing how your map is constructed. As @msimonborg said, there is no such concept of the “first” item in a map.

docjazither

docjazither OP

Actually, I can do this trick [ first_key_to_delete | _] = Enum.to_list(my_map) thanks to @msimonborg

msimonborg

msimonborg

Just for the sake of experiment, try the following in iex

m1 = Enum.map(1..100, &{&1, &1}) |> Map.new()
m2 = Enum.map(1..1000, &{&1, &1}) |> Map.new()
Enum.at(m1, 0) == Enum.at(m2, 0)

There is no consistent concept of the “first” in a map, otherwise this should return true no matter how large or small you make the range. If you are trying to skip or remove the first pair of a map, you will most likely get inconsistent results as the size and composition of the map changes.

mindok

mindok

One option for deterministic behaviour is to sort the keys before picking the first one to use for the delete.

joaoevangelista

joaoevangelista

map
|> Enum.sort() # use deafult erlang ordering
|> tl() # get the tail, the rest but the first
|> Map.new()

Check also Enum.sort_by/3 for custom ordering

Kurisu

Kurisu

Which key do you call the first key of a map and how you know it is still the first key ? I think that’s what the other replies are trying to tell you.

iex(13)> %{a: 1, b: 2} == %{b: 2, a: 1}
true

You can see that for Elixir even if I invert the order of the above maps there are considered to be the same map.

iex(14)> %{b: 2, a: 1}
%{a: 1, b: 2}

And above you can notice that when Elixir is evaluating %{b: 2, a: 1} it sorts the keys differently. So if one thinks that :b will always be the first key, he could be totally wrong.

I think it’s better to know the name of the key you want actually to be deleted when manipulating maps.

docjazither

docjazither OP

Ah yep, in this case, all the keys’ properties are quite similar, and I just want to delete first one, that’s all

Where Next? Top

Trending in Questions Top

Blokh
Hey guys, I’ve got a huge CSV ( around 10 GB ) that needs to be processed hourly Do you guys have any suggestions what is the best prac...
New
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

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
Damirados
Hello everyone. After busy few months I am happy to announce v0.1.0 of Emerge & Solve. They are GUI (Emerge) and State management (S...
New
netoum
Corex is an accessible, unstyled UI component library for Phoenix that integrates Zag.js state machines using Vanilla JavaScript and Live...
New

We're in Beta

About us Mission Statement

Options

Thread Display Mode




Thread Preview

Skip Thread Previews