To be fair, Go includes a heap, list, and "ring" (circular doubly-linked list). I agree that Go should include a Set type modeled after its List. Sets are sim

To be fair, Go includes a heap, list, and "ring" (circular doubly-linked list). I agree that Go should include a Set type modeled after its List. Sets are simple and there's really just one way to implement them. My own is less than 40 lines; a simple set of tests are about 60 lines. For trees, graphs, etc. I do think it is fair to establish these as the domain of the community. These are more complex, and there is more variety.