GoLLRB

This tool can generate LLRB trees in Go (can also use as a lib): github.com/aybabtme/datagen Otherwise there's also github.com/petar/GoLLRB/llrb.

> Can you write, say, a heap or a read-black tree that can store wither ints and strings, that will embed the ints? I'm not sure I understand this sentence. Do you mean a union type? Or a generic datastructure? We all know Go doesn't have generics - that topic has been beaten to death, so let's not derail the discussion and just say this can be a valid reason for Go not fitting your use-case. But just for comparison, here's an implementation of a "generic" LLRB Tree in Go using interfaces and runtime reflection: https://github.com/petar/GoLLRB I suppose you could hand-write it to fit the value type of choice? Does that answer your question?

You could easily define an interface and write your red black tree once for all types, you'd just have to wrap basic types like int to conform if you want to add them (most often this sort of list is of a custom data type though). e.g. https://github.com/petar/gollrb So if you need a data structure like this, you can do it without much trouble without generics. Perhaps you don't feel that solution is as clean, but it's certainly pretty easy to do. NB that golang has not ruled out generics, it's just not something they felt compelled to put in initially, and not many people who use the language miss them.

People who write data structures just give up type-safety when doing so. They don't copy-paste code or write template processors, afaik. A Left-leaning Red-Black Tree, for example: http://gopkgdoc.appspot.com/pkg/github.com/petar/GoLLRB/llrb Holding up Eclipse as an example citing performance is perhaps not the best idea. And Chromium seems to do just fine (performance-wise) using IPC between renderer processes and the main process.