220 7193 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 14:11:00 -0700 (PDT) Lines: 97 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_544_25828889.1381266660714" X-Trace: ger.gmane.org 1381266660 24556 80.91.229.3 (8 Oct 2013 21:11:00 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Tue, 8 Oct 2013 21:11:00 +0000 (UTC) To: std-proposals@isocpp.org Original-X-From: std-proposals+bncBC54TLGKR4LBBZXJ2GJAKGQETIQDKXA@isocpp.org Tue Oct 08 23:11:05 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 1VTeYZ-0006mi-Vh for gclcip-std-proposals@m.gmane.org; Tue, 08 Oct 2013 23:11:04 +0200 Original-Received: by mail-ob0-f198.google.com with SMTP id va2sf4585266obc.1 for ; Tue, 08 Oct 2013 14:11:03 -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=Tfh2kuIPp+gLgAXe6GG9JluHn35Bl9y1kT5CpVSBd6o=; b=iYQBmrm1E3oO9zDRzt0jIdUOhBqcP6ZI5ALKWbyIsxNB2GOo5X0M7GUDOc+7XwvPe/ CrUASUWjCbMz/iSRDKaB0a4uN4f/0+sriW4XuccyklcpBnCaSBODcunH2YuAlaYj7PX0 wg4eXLnnkdph3c/yG+IbBgjwOh4kJHgXal8ovrdsabp7MJTHiVSdLm3ZVhUeZAJLtGSP 7fOI1Bt4t2zLh7exvprvpzR50Y+Xl+R9T06uU7pNITiCCRFGf+0qLtn87HmVslKj02cY ymLrQZrIggIJQx4fwXtL4OqZhSZlf4nczGP5NksUELW8gTX2jND5jN5fsA56G+sSRIGU ucCA== X-Received: by 10.50.73.37 with SMTP id i5mr19373380igv.2.1381266662922; Tue, 08 Oct 2013 14:11:02 -0700 (PDT) X-BeenThere: std-proposals@isocpp.org Original-Received: by 10.50.136.170 with SMTP id qb10ls671022igb.37.gmail; Tue, 08 Oct 2013 14:11:02 -0700 (PDT) X-Received: by 10.50.109.170 with SMTP id ht10mr1074770igb.14.1381266662237; Tue, 08 Oct 2013 14:11:02 -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:7193 Archived-At: ------=_Part_544_25828889.1381266660714 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: quoted-printable 9 oct 2013 =D0=B3., 1:00:37 UTC+4 Daniel Kr=C3=BCgler: > > 2013/10/8 Evgeny Panasyuk >:=20 > > Alexander Stepanov used std::pair for that purpose at his "Efficient=20 > > Programming with Components" lectures=20 > Actually the Library does this already at several occasions:=20 > Yes, that is why I inclined to std::pair, though personally I like=20 type-rich approach. =20 > See also=20 > http://cplusplus.github.io/LWG/lwg-active.html#2242=20 > for another miss of useful information.=20 > Unfortunately,=20 > http://cplusplus.github.io/LWG/lwg-closed.html#1313=20 > was declared NAD. I think I will re-raise it soon.=20 > That is unfortunate. But I am not sure how it can be fixed. New algorithm= =20 or breaking change? I remember that Alexander Stepanov mentioned that issue in "Efficient=20 Programming with Components". He said something like: "First they throw away counted ranges for C++98. In= =20 C++11 they tried to return something, but did it wrong." (maybe I will=20 find link a bit later). --=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_544_25828889.1381266660714 Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: quoted-printable
9 oct 2013 =D0=B3., 1:00:37 UTC+4 Daniel Kr=C3=BCgler= :
2013/10/8 Evgeny Panasyuk <= ;evgeny....@gmail.com>:
> Alexander Stepanov used std::pair for that purpose at his "Efficie= nt
> Programming with Components" lectures
Actually the Library does this already at several occasions:

Yes, that is why I inclined to std::pair, though = personally I like type-rich approach.
 
See also
http://cplusplus.github.io/LWG/lwg-active.html#2242
for another miss of useful information.
Unfortunately,
http://cplusplus.github.io/LWG/lwg-closed.html#1313
was declared NAD. I think I will re-raise it soon.

That is unfortunate. But I am not sure how it can= be fixed. New algorithm or breaking change?

I remember that Alexand= er Stepanov mentioned that issue in "Efficient Programming with Components"= ..
He said something like: "First they throw away counted ra= nges for C++98. In C++11 they tried to return something, bu= t did it wrong."  (maybe I will find lin= k a bit later).

--
 
---
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_544_25828889.1381266660714-- .