220 7190 article Path: news.gmane.org!not-for-mail From: Vlad from Moscow Newsgroups: gmane.comp.lang.c++.isocpp.proposals Subject: Re: "count_while" and "count_until" algorithms Date: Tue, 8 Oct 2013 14:08:50 -0700 (PDT) Lines: 86 Approved: news@gmane.org Message-ID: 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> <79e2df66-c96a-407b-8d31-0df45ea76d71@isocpp.org> Reply-To: std-proposals@isocpp.org NNTP-Posting-Host: plane.gmane.org Mime-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_Part_902_2570775.1381266530630" X-Trace: ger.gmane.org 1381266536 23112 80.91.229.3 (8 Oct 2013 21:08:56 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Tue, 8 Oct 2013 21:08:56 +0000 (UTC) To: std-proposals@isocpp.org Original-X-From: std-proposals+bncBCXLLRHD7IDRBZHI2GJAKGQEX42B6YY@isocpp.org Tue Oct 08 23:09:01 2013 Return-path: Envelope-to: gclcip-std-proposals@m.gmane.org Original-Received: from mail-ie0-f198.google.com ([209.85.223.198]) by plane.gmane.org with esmtp (Exim 4.69) (envelope-from ) id 1VTeWT-0005ec-Mv for gclcip-std-proposals@m.gmane.org; Tue, 08 Oct 2013 23:08:53 +0200 Original-Received: by mail-ie0-f198.google.com with SMTP id qd12sf28654160ieb.5 for ; Tue, 08 Oct 2013 14:08:52 -0700 (PDT) X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20130820; 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=Xac/sjNDl+dnIOQ2BOjAxyzo3rLF669wmM7TlsmAIzY=; b=XwVozGhl8dJ3e6nPWu5XFRhgWsKhV5/xuw6ML5j6KHHhQnFb1bPGGx+zdc/EDlFVPC blScvFFz2gYGQCNEh51J7Qb5yS5jFv2UtawnPQTa7t058jlD0777Mk9h/UwscoVuRYG6 pnEpYvZdol8Oj7xW+Jg0FiyEDMGDGh/wjcemvr9JF2zJDbWb+30mH4CJMEJyBCwVxN1p Wi+ASzDh2xvAMYUOwCN49aeCnv9t3uo9cVWw8/9/ReGV96Nef9JX9uE6yS7NIDJrgsvi LD21UYV+ipEt4w0iwE2Dh7x4UB+1SvTKgQckYsDY5lCSGBFtBTU0aTs38+d+ZwVHowX3 4HYQ== X-Received: by 10.43.152.202 with SMTP id kx10mr2084281icc.3.1381266532759; Tue, 08 Oct 2013 14:08:52 -0700 (PDT) X-BeenThere: std-proposals@isocpp.org Original-Received: by 10.50.112.135 with SMTP id iq7ls657397igb.34.gmail; Tue, 08 Oct 2013 14:08:52 -0700 (PDT) X-Received: by 10.50.44.2 with SMTP id a2mr1066915igm.6.1381266532052; Tue, 08 Oct 2013 14:08:52 -0700 (PDT) In-Reply-To: <79e2df66-c96a-407b-8d31-0df45ea76d71@isocpp.org> X-Original-Sender: vlad.moscow@mail.ru 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:7190 Archived-At: ------=_Part_902_2570775.1381266530630 Content-Type: text/plain; charset=KOI8-R Content-Transfer-Encoding: quoted-printable I would like to preserve the word "if" in such algorithms. We have for=20 example copy_if, count_if and so on. So we could include copy_first_if,=20 count_first_if and so on. It is a more consistent system of naming of=20 algorithms. =D3=D2=C5=C4=C1, 9 =CF=CB=D4=D1=C2=D2=D1 2013 =C7., 1:02:04 UTC+4 =D0=CF=CC= =D8=DA=CF=D7=C1=D4=C5=CC=D8 Evgeny Panasyuk=20 =CE=C1=D0=C9=D3=C1=CC: > 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_902_2570775.1381266530630 Content-Type: text/html; charset=KOI8-R Content-Transfer-Encoding: quoted-printable
I would like to preserve the word "if" in such algori= thms. We have for example copy_if, count_if and so on. So we could include = copy_first_if, count_first_if and so on. It is a more consistent system of = naming of algorithms.

=D3=D2=C5=C4=C1, 9 =CF=CB=D4=D1=C2=D2= =D1 2013 =C7., 1:02:04 UTC+4 =D0=CF=CC=D8=DA=CF=D7=C1=D4=C5=CC=D8 Evge= ny Panasyuk =CE=C1=D0=C9=D3=C1=CC:
9 oct 2013 =C7., 0:56:01 UTC+4 Vlad from Moscow:
I want to change the name in the co= ntext of my proposal of std::accumulate_first_if that there will be a commo= n name for such types of algorithms.

Actua= lly I think it is better to change name of accumulate_first_if to accumulat= e_while.
 
= By the way using std::find_if with a predicate resolves the two tasks: retu= rning the count and the last iterator.

I t= hink 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_902_2570775.1381266530630-- .