On Wednesday, 21 October 2015 at 11:05:12 UTC, Andrei Alexandrescu wrote:
I'll attempt to implement a few versions of each and see what they look like. The question here is what containers are of interest for D's standard library.

Andrei

Tree (binary, quad, octo, r/b, etc...), graph (directed, undirected, sparse, weighted, etc...) have my votes. They enable a lot of algorithms to be implemented.


Reply via email to