220 7202 <33630867-3ac2-4fa9-acc4-e5444397bc20@isocpp.org> article Path: news.gmane.org!not-for-mail From: Evgeny Panasyuk Newsgroups: gmane.comp.lang.c++.isocpp.proposals Subject: Re: Re: "count_while" and "count_until" algorithms Date: Tue, 8 Oct 2013 15:38:49 -0700 (PDT) Lines: 55 Approved: news@gmane.org Message-ID: <33630867-3ac2-4fa9-acc4-e5444397bc20@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> <1381268094.9101.48.camel@sara> <2946a4c1-2cdc-4c31-ad1b-bef0ce40873b@isocpp.org> Reply-To: std-proposals@isocpp.org NNTP-Posting-Host: plane.gmane.org Mime-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_Part_614_4583462.1381271929677" X-Trace: ger.gmane.org 1381271929 16807 80.91.229.3 (8 Oct 2013 22:38:49 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Tue, 8 Oct 2013 22:38:49 +0000 (UTC) To: std-proposals@isocpp.org Original-X-From: std-proposals+bncBC54TLGKR4LBB64S2KJAKGQET6WWG6I@isocpp.org Wed Oct 09 00:38:54 2013 Return-path: Envelope-to: gclcip-std-proposals@m.gmane.org Original-Received: from mail-ob0-f199.google.com ([209.85.214.199]) by plane.gmane.org with esmtp (Exim 4.69) (envelope-from ) id 1VTfvY-0001a1-Pp for gclcip-std-proposals@m.gmane.org; Wed, 09 Oct 2013 00:38:52 +0200 Original-Received: by mail-ob0-f199.google.com with SMTP id vb8sf5062587obc.10 for ; Tue, 08 Oct 2013 15:38:51 -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=/Qg07DAp9Fct+lK/STFhhXllMvAvYG67lTATJIpkSXY=; b=gGxg4zpA4LPVWUHg70LqUoePDlsSrIHdCiyL4Rqkel6Ph6PYAxsPeg8/c+MvyYrZoc k5sSURALhkXLUz6uuVTgICE3kPe7NLRlvJ5H2Ew0ipOtr5DjbvyTFs7iSZ3hiS45prkM wRF2Ddg/PuwZav2id8blEHPjnRRxHWaaB7RhTeboEEEumYgfcN0EYfY+nr3SdXh9gXCF F4H6dNivb2v5OybXI1y8wha3kiFoaq8xcrcu31QhD+VGEhc99V0oqXJmiQf0R4mjnXK6 7PmXH6iHjOMS3i3NbVVz6peas13/Ji4caHoj/s78A0EqL3EdBfpIx6+dvfwJzT4qfBVW Y2Pw== X-Received: by 10.42.240.66 with SMTP id kz2mr2277695icb.27.1381271931749; Tue, 08 Oct 2013 15:38:51 -0700 (PDT) X-BeenThere: std-proposals@isocpp.org Original-Received: by 10.50.126.39 with SMTP id mv7ls736674igb.41.gmail; Tue, 08 Oct 2013 15:38:51 -0700 (PDT) X-Received: by 10.50.22.35 with SMTP id a3mr1081062igf.17.1381271931122; Tue, 08 Oct 2013 15:38:51 -0700 (PDT) In-Reply-To: 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:7202 Archived-At: ------=_Part_614_4583462.1381271929677 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: quoted-printable 9 oct 2013 =D0=B3., 2:35:47 UTC+4 R=C3=A9my Lefevre : > > I agree one algorithm could be enough. But it should be more convenient t= o=20 > have both of them. C++11 added for example find_if_not that is exactly=20 > find_if + not1. > Alexander Stepanov talks about that specific issue ( std::find_if_not ):=20 http://www.youtube.com/watch?v=3DdUEA8fHx0r0&t=3D26m45s --=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_614_4583462.1381271929677 Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: quoted-printable
9 oct 2013 =D0=B3., 2:35:47 UTC+4 R=C3=A9my Lefevre :=
I agree one a= lgorithm could be enough. But it should be more convenient to have both of = them. C++11 added for example find_if_not that is exactly find_if + not1.

Alexander Stepanov talks about tha= t specific issue ( std::find_if_not ): http://www.youtube.com/watch?v=3DdUE= A8fHx0r0&t=3D26m45s

--
 
---
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_614_4583462.1381271929677-- .