<div class="gmail_quote">On Sun, Aug 1, 2010 at 23:34, Andrei Alexandrescu <span dir="ltr"><<a href="mailto:SeeWebsiteForEmail@erdani.org">SeeWebsiteForEmail@erdani.org</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div class="im"><br></div></blockquote>
I agree that all of the functions you suggested deserve a place in std.algorithm (or std.range). Please add one bugzilla entry or better yet let me know if you'd like to join Phobos's devs (subject to team approval) so you can add them yourself.<br>
</blockquote><div><br></div><div>I'd be quite happy to join the Phobos' devs, if they accept me!</div><div><br></div><div>In any case, as Jonathan said, all() and any() are 'bug' 4405. And takeWhile is 4535 (as per you suggestion, I added it a few days ago).</div>
<div><br></div><div><a href="http://d.puremagic.com/issues/show_bug.cgi?id=4535">http://d.puremagic.com/issues/show_bug.cgi?id=4535</a></div><div> </div><div><br></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<br>
Also, I agree that std.algorithm has gotten a bit large. Any sensible ideas for addressing that should be discussed. Off the top of my head, I'm thinking that mutators vs. non-mutators could be a possible criterion for separation.<br>
<br>
BTW, it warms my heart to see that our std.algorithm is the fourth Google hit when searching for std::algorithm (or std.algorithm, which seems to produce the same results). I feel std.container can be a similarly compelling offering. *cough*RBTree*cough*Steve*cough*<br>
</blockquote><div><br></div><div>That reminds me I've some questions to ask on recursive containers (graphs, trees). I'll try to make a post about it.</div><div><br></div><div><br></div></div>