<br><br><div class="gmail_quote">On Wed, Jun 2, 2010 at 08:27, dennis luehring <span dir="ltr"><<a href="mailto:dl.soluz@gmx.net">dl.soluz@gmx.net</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
Am 30.05.2010 23:53, schrieb Philippe Sigaud:<div><div></div><div class="h5"><br>
<blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
There are some simple containers I'd like to see in std.containers:<br>
<br>
- a priority queue<br>
- a heap<br>
- a stack, a queue<br>
- a set<br>
<br>
Do people here also consider them as containers and useful ones in a standard<br>
library?<br>
<br>
Philippe<br>
</blockquote>
<br></div></div>
and a range based tree (something like <a href="http://tree.phi-sci.com/" target="_blank">http://tree.phi-sci.com/</a>)<br>
<br>
and what about graphs?<br></blockquote><div><br><br>I gave it a try some times ago. Here are the current modules:<br><br><a href="http://www.dsource.org/projects/dranges/wiki">http://www.dsource.org/projects/dranges/wiki</a> <br>
</div></div><br>(look into the tree and graph section and tell me what you think.)<br><br>There is a basic tree and basic graph, some consideration on recursive ranges and a bunch of graph algorithms (dijkstra, spanning tree, meta-graph, strongly connected components, etc). Also, ways to project a tree or graph into a linear range, by depth-first or breadth-first iteration.<br>
It's taken from an older project of mine,I will clean it up in the following weeks.<br><br>Philippe<br><br>