220 7159 <073f3b97-b32c-404e-949f-7f08847541a1@isocpp.org> article
Path: news.gmane.org!not-for-mail
From: =?UTF-8?Q?R=C3=B3bert_D=C3=A1vid?= <lrdxgm@gmail.com>
Newsgroups: gmane.comp.lang.c++.isocpp.proposals
Subject: Re: "count_while" and "count_until" algorithms
Date: Tue, 8 Oct 2013 13:18:42 -0700 (PDT)
Lines: 46
Approved: news@gmane.org
Message-ID: <073f3b97-b32c-404e-949f-7f08847541a1@isocpp.org>
References: <CAOpASk64dV+3ZUW+Z8wcEqug_oSaztvJp1zsDB_QdAxi+fwcsA@mail.gmail.com>
Reply-To: std-proposals@isocpp.org
NNTP-Posting-Host: plane.gmane.org
Mime-Version: 1.0
Content-Type: multipart/alternative; 
	boundary="----=_Part_543_9961887.1381263522712"
X-Trace: ger.gmane.org 1381263523 20679 80.91.229.3 (8 Oct 2013 20:18:43 GMT)
X-Complaints-To: usenet@ger.gmane.org
NNTP-Posting-Date: Tue, 8 Oct 2013 20:18:43 +0000 (UTC)
To: std-proposals@isocpp.org
Original-X-From: std-proposals+bncBDMKHJ4B6MARBJGR2GJAKGQE3BS3MJA@isocpp.org Tue Oct 08 22:18:47 2013
Return-path: <std-proposals+bncBDMKHJ4B6MARBJGR2GJAKGQE3BS3MJA@isocpp.org>
Envelope-to: gclcip-std-proposals@m.gmane.org
Original-Received: from mail-oa0-f70.google.com ([209.85.219.70])
	by plane.gmane.org with esmtp (Exim 4.69)
	(envelope-from <std-proposals+bncBDMKHJ4B6MARBJGR2GJAKGQE3BS3MJA@isocpp.org>)
	id 1VTdjx-0003aX-KH
	for gclcip-std-proposals@m.gmane.org; Tue, 08 Oct 2013 22:18:45 +0200
Original-Received: by mail-oa0-f70.google.com with SMTP id g12sf28723777oah.1
        for <gclcip-std-proposals@m.gmane.org>; Tue, 08 Oct 2013 13:18:44 -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=VTqzlVT/EPOePFqSEB8I0z8JW8T0tWVSP0WBD2c3d9E=;
        b=gcx3Jkp+y7zvmNRlm3aLseTPozjSwG2ZkxPGFRviAGIrZwvSNzMQmfA0gtKLsVaQJR
         saMw3cbxPfl5Pk9+wlTLzbN+UYUI12vYX6W5awKGhgXpGh2SofunNb2DasZM32aqNtd9
         9LRbwIf6+WnDmNN+oIQPO8IwQh6WOpDfI6h8ZYW8ilbB5f8BKiUeaoA5Ee6KTQiuG2sE
         ngKx3pfFF7F5LfRX8eDLOK1GN8Hj/eTvOW3A7rH5uvDNzTWE/Ib5Joq2/oUdNpcpNj9H
         YE0plZcDgAMLSOTzWNqO/gSxqgFD9Mzs1+M2Upkd5z9Kc2kb7ViG4nFshgNu80q44FdR
         JrMA==
X-Received: by 10.50.73.37 with SMTP id i5mr19245133igv.2.1381263524577;
        Tue, 08 Oct 2013 13:18:44 -0700 (PDT)
X-BeenThere: std-proposals@isocpp.org
Original-Received: by 10.50.18.9 with SMTP id s9ls3943510igd.26.canary; Tue, 08 Oct
 2013 13:18:44 -0700 (PDT)
X-Received: by 10.50.22.35 with SMTP id a3mr1061794igf.17.1381263524046;
        Tue, 08 Oct 2013 13:18:44 -0700 (PDT)
In-Reply-To: <CAOpASk64dV+3ZUW+Z8wcEqug_oSaztvJp1zsDB_QdAxi+fwcsA@mail.gmail.com>
X-Original-Sender: lrdxgm@gmail.com
Precedence: list
Mailing-list: list std-proposals@isocpp.org; contact std-proposals+owners@isocpp.org
List-ID: <std-proposals.isocpp.org>
X-Google-Group-Id: 399137483710
List-Post: <http://groups.google.com/a/isocpp.org/group/std-proposals/post>, <mailto:std-proposals@isocpp.org>
List-Help: <http://support.google.com/a/isocpp.org/bin/topic.py?topic=25838>, <mailto:std-proposals+help@isocpp.org>
List-Archive: <http://groups.google.com/a/isocpp.org/group/std-proposals/>
List-Subscribe: <http://groups.google.com/a/isocpp.org/group/std-proposals/subscribe>,
 <mailto:std-proposals+subscribe@isocpp.org>
List-Unsubscribe: <http://groups.google.com/a/isocpp.org/group/std-proposals/subscribe>,
 <mailto:googlegroups-manage+399137483710+unsubscribe@googlegroups.com>
Xref: news.gmane.org gmane.comp.lang.c++.isocpp.proposals:7159
Archived-At: <http://permalink.gmane.org/gmane.comp.lang.c++.isocpp.proposals/7159>

------=_Part_543_9961887.1381263522712
Content-Type: text/plain; charset=ISO-8859-1

Isn't this the same as a find_if followed by substracting 'first'? (What 
can be even faster than the proposed implementation for random access 
iterators, if the substraction is cheaper than incrementing a number from 0 
to the actual value.)

Probably still useful for "weaker" iterators.

Regard

-- 

--- 
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 email 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/.

------=_Part_543_9961887.1381263522712
Content-Type: text/html; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">Isn't this the same as a find_if followed by substracting =
'first'? (What can be even faster than the proposed implementation for rand=
om access iterators, if the substraction is cheaper than incrementing a num=
ber from 0 to the actual value.)<br><br>Probably still useful for "weaker" =
iterators.<br><br>Regard<br></div>

<p></p>

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

------=_Part_543_9961887.1381263522712--

.