[phobos] [Fwd: Re: What functions could be added to std.algorithm?]

[Andrei Alexandrescu]

Hello all,

I've followed Philippe's work lately, which seems to be of good quality. 
I suggest we add him to the roster; he could add great value to the 
likes of std.algorithm. Please reply either to me or the group with your 
vote and other thoughts before Tue 23:59:59'99'' CST.


Andrei

-------- Original Message --------
Subject: 	Re: What functions could be added to std.algorithm?
Date: 	Mon, 2 Aug 2010 21:32:29 +0200
From: 	Philippe Sigaud <philippe.sigaud at gmail.com>
Reply-To: 	digitalmars.D <digitalmars-d at puremagic.com>
Organization: 	Digital Mars
To: 	digitalmars.D <digitalmars-d at puremagic.com>
Newsgroups: 	digitalmars.D
References: 	<i33gdn$epd$1 at digitalmars.com>
<i33up0$15jr$1 at digitalmars.com>
<mailman.80.1280673176.13841.digitalmars-d at puremagic.com>
<i34p9o$2i42$1 at digitalmars.com>



On Sun, Aug 1, 2010 at 23:34, Andrei Alexandrescu
<SeeWebsiteForEmail at erdani.org <mailto:SeeWebsiteForEmail at erdani.org>>
wrote:


     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.


I'd be quite happy to join the Phobos' devs, if they accept me!

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).

http://d.puremagic.com/issues/show_bug.cgi?id=4535



     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.

     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*


That reminds me I've some questions to ask on recursive containers
(graphs, trees). I'll try to make a post about it.