Writing bug free data structure implementations is hard. Doing it in a way that ...

		threeseed on July 4, 2015 \| parent \| context \| favorite \| on: Golang data structures Writing bug free data structure implementations is hard. Doing it in a way that is highly performant is extremely hard. The idea of cutting/pasting code seems pretty backwards to me compared to just using one of these libraries: http://java-performance.info/large-hashmap-overview-jdk-fast...

Thing is, in Go that library cannot be written generically.