undefined | Better HN

0 pointsKingMob9y ago0 comments

...unless it's a hashmap inside a hashmap. Or named fields in an object holding pointers that use no keys after compilation.

The point being that hierarchical structures in programming languages abstract away from the underlying representation, and you can use them without knowing the details. (Though you should probably know anyway, so you understand your Big-O tradeoffs.)

0 comments

aidenn09y ago

A hashmap inside of a hashmap is just as much of a tree as an array inside of an array (which for a 2 element array describes a binary tree).

j / k navigate · click thread line to collapse

0 pointsKingMob9y ago0 comments

...unless it's a hashmap inside a hashmap. Or named fields in an object holding pointers that use no keys after compilation.

0 comments

aidenn09y ago

A hashmap inside of a hashmap is just as much of a tree as an array inside of an array (which for a 2 element array describes a binary tree).

j / k navigate · click thread line to collapse