https://aklepatc.dreamwidth.org/1143.html

Prefix trees are known as an alternative implementation for dictionaries/maps. Applied like this, they sometimes significantly outperform hash tables. In particular, it works well when key space consists of thousands not-very-long strings. I saw this in action as a part of a smart order router code at a big sell-side firm where the keys were US ( Read more... )

This post is about non-obvious, cool things we can do with Go channels. I want the material to be readable by my Java, C#, Python and C++ friends (you know who you are ;) So the first half of the post is a basic presentation of Go channels. Also, Go code that I show here is not as idiomatic as it should be for a production code in a Go shop. Again ( Read more... )