@ekaitz_zarraga Do you care how it's ordered if access is in O(1)?
@Gargron Nope but I'm wondering about the implementation.
AFAIK the implementation of *hash* tables is based on the order randomness of the *hash*. If they are insertion-ordered, how do they implement that?
I don't care in a practical level but in a philosophical level. :psyduck:
Gregory's Server
@Gargron Nope but I'm wondering about the implementation.
AFAIK the implementation of *hash* tables is based on the order randomness of the *hash*. If they are insertion-ordered, how do they implement that?
I don't care in a practical level but in a philosophical level. :psyduck: