Comment by mischief6

> All parts of Go's simplicity push that seems to assume people don't need anything else other than Array Lists and hash maps.

you can see some of this in the work of the progenitors of Go.

quoth pike style, from rob pike:

Rule 4. Fancy algorithms are buggier than simple ones, and they're much harder to implement. Use simple algorithms as well as simple data structures.

      The following data structures are a complete list for almost all practical programs:

array linked list hash table binary tree

Of course, you must also be prepared to collect these into compound data structures. For instance, a symbol table might be implemented as a hash table containing linked lists of arrays of characters.

https://doc.cat-v.org/bell_labs/pikestyle