220 7180 article Path: news.gmane.org!not-for-mail From: lefevreremy@gmail.com Newsgroups: gmane.comp.lang.c++.isocpp.proposals Subject: Re: "count_while" and "count_until" algorithms Date: Tue, 8 Oct 2013 13:50:20 -0700 (PDT) Lines: 71 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> <2a52a3ad-4fe6-4f77-870c-2a26c2e10e52@isocpp.org> Reply-To: std-proposals@isocpp.org NNTP-Posting-Host: plane.gmane.org Mime-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_Part_315_7708016.1381265420537" X-Trace: ger.gmane.org 1381265419 10805 80.91.229.3 (8 Oct 2013 20:50:19 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Tue, 8 Oct 2013 20:50:19 +0000 (UTC) To: std-proposals@isocpp.org Original-X-From: std-proposals+bncBCN7B34JVEARBDPA2GJAKGQEQ26IXGI@isocpp.org Tue Oct 08 22:50:24 2013 Return-path: Envelope-to: gclcip-std-proposals@m.gmane.org Original-Received: from mail-ie0-f199.google.com ([209.85.223.199]) by plane.gmane.org with esmtp (Exim 4.69) (envelope-from ) id 1VTeEZ-0004Fq-IC for gclcip-std-proposals@m.gmane.org; Tue, 08 Oct 2013 22:50:23 +0200 Original-Received: by mail-ie0-f199.google.com with SMTP id ar20sf1377814iec.10 for ; Tue, 08 Oct 2013 13:50:22 -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=/yQJHeFUB9JT6QgeA1jgWbMMmatjY3My51P3wyZjl7c=; b=g3lzNS1w9+IlVCiupi+0ACKj+kB3Utl0wLoIaSAfBlzIPKWavobs1by/lvu80Ttki5 Q+wvC+dXWyCMsUsWO9Y2dmMhu871o2RvbWu70k56PW20wfHK8ujNUlhr1iJBfQMW/+Uq 8p9tdju6WzTjqIa/poe5oDGBqPzzEJXswMP5tecnklC+TfLREPQ7K6NfyA/XhsXrPbrc QTWItgG8rm5fyER+2nGc6kSh0vhwaCWhXNSanxMVBk6CoHhyp3O4y7VPA8xz5JbbE53V Dl81YMqNSsi6H/vw29iNTecNl/EtX2dwHcplkETBH7+yCDfmxRjPSbgKjLaGk05xVDvy 2WcQ== X-Received: by 10.42.126.72 with SMTP id d8mr2063465ics.4.1381265422338; Tue, 08 Oct 2013 13:50:22 -0700 (PDT) X-BeenThere: std-proposals@isocpp.org Original-Received: by 10.50.1.68 with SMTP id 4ls3809626igk.22.canary; Tue, 08 Oct 2013 13:50:21 -0700 (PDT) X-Received: by 10.50.66.161 with SMTP id g1mr172960igt.5.1381265421859; Tue, 08 Oct 2013 13:50:21 -0700 (PDT) In-Reply-To: <2a52a3ad-4fe6-4f77-870c-2a26c2e10e52@isocpp.org> X-Original-Sender: lefevreremy@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:7180 Archived-At: ------=_Part_315_7708016.1381265420537 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: quoted-printable That was I mentioned by inelegant way... I am not a big fan of std::pair.= =20 But I should maybe change my mind on it.=20 Le mardi 8 octobre 2013 22:47:28 UTC+2, Evgeny Panasyuk a =C3=A9crit : > > 9 oct 2013 =D0=B3., 0:42:56 UTC+4 lefev...@gmail.com: >> >> @Evgeny: Yes, I see the advantage to return both count and iterator, but= =20 >> I didn't find an elegant way to do it for the moment. >> > > Alexander Stepanov used std::pair for that purpose at his "Efficient=20 > Programming with Components" lectures -=20 > http://www.youtube.com/watch?v=3DaIHAEYyoTUc&list=3DPLHxtyCq_WDLXryyw91la= hwdtpZsmo4BGD(by the way, these lectures are very inspirational). > --=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_315_7708016.1381265420537 Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: quoted-printable
That was I mentioned by inelegant way... I am not a big fa= n of std::pair. But I should maybe change my mind on it.

Le mardi 8= octobre 2013 22:47:28 UTC+2, Evgeny Panasyuk a =C3=A9crit :
 9 oct 2013 = =D0=B3., 0:42:56 UTC+4 lefev...@gmail.com:
@Evgeny: Yes, I see the advantage to return both count and iter= ator, but I didn't find an elegant way to do it for the moment.

Alexander Stepanov used std::pair for that purpose at h= is "Efficient Programming with Components" lectures - http://www.youtube.com/watch?v=3DaIHAEYyoTUc&= amp;list=3DPLHxtyCq_WDLXryyw91lahwdtpZsmo4BGD (by the way, these l= ectures are very inspirational).

--
 
---
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_315_7708016.1381265420537-- .