Norbert Hajagos (Mar 17 2026 at 16:53): Norbert Hajagos (Mar 17 2026 at 16:53):Hi! Was reading the Odin documentation as I've found Ginger Bill to be a person worth listening to, so I figured it's worth looking into his language. I saw Odin has unordered_remove.
- removes an element at a specific index. Unordered means it is
O(1), since it swaps the last element to the removed location - making the array be sorted differently.
I thought it would be worth including a fn like this in the stdlib. I can even say that it has slight perf benefints compared to the hand-implemented version, since that has 2 list accesses and I have no idea if that is a thing a compiler can optimize away.
But this gets into a more general question of what's the bar of having something in the builtins?
Or a more practical question for me: Should I be eyeing builtins to be added, or we'll add them once actual demand arises from them?
Brendan Hansknecht (Mar 17 2026 at 17:07):That is what we do for removing from a dictionary
Brendan Hansknecht (Mar 17 2026 at 17:07):So sounds reasonable as a built-in to list as well
Brendan Hansknecht (Mar 17 2026 at 17:08):Generally we add with demand, but many things get added earlly too
Last updated: Jun 16 2026 at 16:19 UTC