Re: Looping through an array with FOR EACH

[Benoît Minisini <benoit.minisini@xxxxxxxxxxxxxxxx>]

Le 17/01/2026 à 14:41, Gianluigi a écrit :
> Hi Benoit,
>
> So collections also guarantee insertion order.
> Also because you can only add, right?

No. As I explaines, the order comes from a specific feature added to the 
hash table. This feature is not mandatory for a hash table to be a hash 
table. I added it because it allows to use the hash table both as a hash 
table and a rudimentory ordered list. But it has a cost: 16 bytes by 
element!

> Speaking of adding, there was a mistake in the example (Add) that I took 
> the liberty of correcting.

You are welcome.

--
Benoît Minisini.