On 10/21/2015 09:13 AM, Andrea Fontana wrote:
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.
As I also replied to Russel, I am now discussing semantics of container
values. -- Andrei
