Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Yes, this name is basically a reflection of the fact that a hash table is an array, indexes of which get calculated by `hashof(key) % arr.length`.

It doesn’t mean HTs are the arrays which should be used to store seqint-indexed values.



No, that's an implementation detail which isn't actually true of the associative arrays in all of these languages. "Associative array" is the name for the interface, not the implementation. In theory it could be a hash trie or something, although I'm not aware of any implementations of any of these languages that uses anything but a hash table (which is, yes, fundamentally dependent on using an array).




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: