<br><div class="gmail_quote">On Mon, May 31, 2010 at 22:27, Mihail Strashun <span dir="ltr"><<a href="mailto:m.strashun@gmail.com" target="_blank">m.strashun@gmail.com</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;">
May be my question will be a bit naive, but what is about boost::multi_index approach? I find it brilliant for dividing container implementation from various container interfaces - things you guys are arguing here about a bit.<div>
<div></div><br></div></blockquote><div><br>My even more naive answer is that I neved had occasion to use it, as I think I quit C++ before this existed in Boost (but I may be wrong). I read the docs for multi-index once or twice, though. Did you use it recently?<br>
<br>Hey, I was re-reading Boost::MPL, Fusion and Graph recently and was thinking that it's be quite easier to do that in D.<br><br>Interestingly, on Boost 1.43 (may 6th):<br><br><div id="version_1_43_0.major_updates">
<h3><span class="link">Major Updates</span></h3>
<ul><li>
<span class="library"><a href="http://www.boost.org/libs/range/index.html">Range</a>:</span>
Boost.Range has
undergone extensive updates that it include all of the features
from the
recently reviewed Boost.RangeEx, from Neil Groves.
<ul><li>
Range-based version of the full STL iterator based
algorithms.
</li><li>
Range adaptors which can be combined with range-based
algorithms for
unprecedented expressiveness and efficiency.
</li><li>
New functions: irange, istream_range, join, combine.
</li></ul></li></ul><br><a href="http://www.boost.org/doc/libs/1_43_0/libs/range/doc/html/index.html">http://www.boost.org/doc/libs/1_43_0/libs/range/doc/html/index.html</a><br>
</div><br>Man, I didn't know they had it.<br></div></div>