220 7187 <79e2df66-c96a-407b-8d31-0df45ea76d71@isocpp.org> article Path: news.gmane.org!not-for-mail From: Evgeny Panasyuk Newsgroups: gmane.comp.lang.c++.isocpp.proposals Subject: Re: "count_while" and "count_until" algorithms Date: Tue, 8 Oct 2013 14:02:04 -0700 (PDT) Lines: 66 Approved: news@gmane.org Message-ID: <79e2df66-c96a-407b-8d31-0df45ea76d71@isocpp.org> References: <2602b3fd-fccd-459b-be1a-93a12005dc5c@isocpp.org> <231e6ef1-599d-4877-be6c-55e85e5a4e41@isocpp.org> <6e15fc38-8be3-4e74-ade9-e25a8d0e0509@isocpp.org> <2d16db0e-fb46-4e1f-956f-db3407a6fb4c@isocpp.org> Reply-To: std-proposals@isocpp.org NNTP-Posting-Host: plane.gmane.org Mime-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_Part_561_28831654.1381266124987" X-Trace: ger.gmane.org 1381266128 18574 80.91.229.3 (8 Oct 2013 21:02:08 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Tue, 8 Oct 2013 21:02:08 +0000 (UTC) To: std-proposals@isocpp.org Original-X-From: std-proposals+bncBC54TLGKR4LBBTXF2GJAKGQEWAUB3HY@isocpp.org Tue Oct 08 23:02:13 2013 Return-path: Envelope-to: gclcip-std-proposals@m.gmane.org Original-Received: from mail-ob0-f198.google.com ([209.85.214.198]) by plane.gmane.org with esmtp (Exim 4.69) (envelope-from ) id 1VTePw-00020M-47 for gclcip-std-proposals@m.gmane.org; Tue, 08 Oct 2013 23:02:08 +0200 Original-Received: by mail-ob0-f198.google.com with SMTP id va2sf4596994obc.9 for ; Tue, 08 Oct 2013 14:02:07 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=date:from:to:message-id:in-reply-to:references:subject:mime-version :x-original-sender:reply-to:precedence:mailing-list:list-id :list-post:list-help:list-archive:list-subscribe:list-unsubscribe :content-type; bh=i61qxUD8Uii7KFrhis4Bzsu1MFr75MWa9JYJuHu5F58=; b=tFtJZM4CL8G8ti8iFFe3dgcrIXmboaR5t61jMNs0lRIyYAhZjss4bDBjZDliEQT4j0 /nhzSca8ntWLqdCBmP/itDnM2Jo3d/65pi8YYXlbkDTNpl8zXQO1oOh52cDrZcmL7fIK 1Ro9tYLmgiGIBZfVDrJFBe6m6LvN57Xq6z86fmXSzG20D8oxWcQvgcGvSjgqH+ltQi7G sJ5JOfcM2A9BzdnToIl67en0sBBc6sgsFiy6dHwBsGnhdMpA3J0HhbQPPpQjyfOGICms w0k9hoALio1EGiNYWsZUDQdgniDDFzug2QgAQxGtAqvtCB7G3vC4hSHv+zFwE959HlGW R0Kw== X-Received: by 10.43.52.200 with SMTP id vn8mr2017387icb.21.1381266127081; Tue, 08 Oct 2013 14:02:07 -0700 (PDT) X-BeenThere: std-proposals@isocpp.org Original-Received: by 10.50.92.69 with SMTP id ck5ls3752722igb.20.canary; Tue, 08 Oct 2013 14:02:06 -0700 (PDT) X-Received: by 10.50.9.33 with SMTP id w1mr175756iga.12.1381266126567; Tue, 08 Oct 2013 14:02:06 -0700 (PDT) In-Reply-To: <2d16db0e-fb46-4e1f-956f-db3407a6fb4c@isocpp.org> X-Original-Sender: evgeny.panasyuk@gmail.com Precedence: list Mailing-list: list std-proposals@isocpp.org; contact std-proposals+owners@isocpp.org List-ID: X-Google-Group-Id: 399137483710 List-Post: , List-Help: , List-Archive: List-Subscribe: , List-Unsubscribe: , Xref: news.gmane.org gmane.comp.lang.c++.isocpp.proposals:7187 Archived-At: ------=_Part_561_28831654.1381266124987 Content-Type: text/plain; charset=KOI8-R Content-Transfer-Encoding: quoted-printable 9 oct 2013 =C7., 0:56:01 UTC+4 Vlad from Moscow: > > I want to change the name in the context of my proposal of=20 > std::accumulate_first_if that there will be a common name for such types = of=20 > algorithms. > Actually I think it is better to change name of accumulate_first_if to=20 accumulate_while. =20 > By the way using std::find_if with a predicate resolves the two tasks:=20 > returning the count and the last iterator. > I think terse notation does matter.=20 --=20 ---=20 You received this message because you are subscribed to the Google Groups "= ISO C++ Standard - Future Proposals" group. To unsubscribe from this group and stop receiving emails from it, send an e= mail to std-proposals+unsubscribe@isocpp.org. To post to this group, send email to std-proposals@isocpp.org. Visit this group at http://groups.google.com/a/isocpp.org/group/std-proposa= ls/. ------=_Part_561_28831654.1381266124987 Content-Type: text/html; charset=KOI8-R Content-Transfer-Encoding: quoted-printable
9 oct 2013 =C7., 0:56:01 UTC+4 Vlad from Moscow:
I want to cha= nge the name in the context of my proposal of std::accumulate_first_if that= there will be a common name for such types of algorithms.

Actually I think it is better to change name of accumulate= _first_if to accumulate_while.
 
By the way using std::find_if with a = predicate resolves the two tasks: returning the count and the last iterator= ..

I think terse notation does matter.
=

--
 
---
You received this message because you are subscribed to the Google Groups &= quot;ISO C++ Standard - Future Proposals" group.
To unsubscribe from this group and stop receiving emails from it, send an e= mail to std-proposals+unsubscribe@isocpp.org.
To post to this group, send email to std-proposals@isocpp.org.
Visit this group at http://groups.google.com/a/isocpp.org/group/std-proposals/<= /a>.
------=_Part_561_28831654.1381266124987-- .