220 7172 article Path: news.gmane.org!not-for-mail From: Nevin Liber Newsgroups: gmane.comp.lang.c++.isocpp.proposals Subject: Re: Re: "count_while" and "count_until" algorithms Date: Tue, 8 Oct 2013 15:36:43 -0500 Lines: 67 Approved: news@gmane.org Message-ID: References: <2602b3fd-fccd-459b-be1a-93a12005dc5c@isocpp.org> Reply-To: std-proposals@isocpp.org NNTP-Posting-Host: plane.gmane.org Mime-Version: 1.0 Content-Type: multipart/alternative; boundary=047d7bdc093468486f04e840bcb2 X-Trace: ger.gmane.org 1381264643 1551 80.91.229.3 (8 Oct 2013 20:37:23 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Tue, 8 Oct 2013 20:37:23 +0000 (UTC) To: "std-proposals@isocpp.org" Original-X-From: std-proposals+bncBCE35H5S6IDBBA622GJAKGQESCNH7II@isocpp.org Tue Oct 08 22:37:26 2013 Return-path: Envelope-to: gclcip-std-proposals@m.gmane.org Original-Received: from mail-qc0-f197.google.com ([209.85.216.197]) by plane.gmane.org with esmtp (Exim 4.69) (envelope-from ) id 1VTe21-0005eQ-In for gclcip-std-proposals@m.gmane.org; Tue, 08 Oct 2013 22:37:25 +0200 Original-Received: by mail-qc0-f197.google.com with SMTP id r5sf17492394qcx.8 for ; Tue, 08 Oct 2013 13:37:24 -0700 (PDT) X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20130820; h=mime-version:sender:in-reply-to:references:from:date:message-id :subject:to:x-original-sender:x-original-authentication-results :reply-to:precedence:mailing-list:list-id:list-post:list-help :list-archive:list-subscribe:list-unsubscribe:content-type; bh=CGDrJltzlnKCXjgzcS7cQKu8P7+GwmjxBnrHIgaw7Iw=; b=miUzxE4oxQsgAK7DjLuLfuqL39NyA8AP8VvYqQIHgHvZEhngpIXlNAb9E0+8AHD7Yb I5HjNfY5nCcc2FgmEG/3WDtP9RHiSXa6YGfaeQP9I4r3/PswcC40aJyEJzbDCjxemG+M qnIexs2vu3AjumInoUuCxajMyjhsvQ5UMjJEfMUacWsxpFapzTcYelvjMOanNd1JLq2h HEGj1g6B8mQ9DqRMBx3xsV84nMOy6DiIT102HkPDxaMD/JI7txistXZQfdROe3FUSjvb bmcapMgQNKWbgIF3o+ewrnV5cTCKEi5uG3kyXV6aSBPStCZl1xwCjd5BH9cEW1Tb2dYH ZmlQ== X-Received: by 10.236.51.170 with SMTP id b30mr3487026yhc.45.1381264644284; Tue, 08 Oct 2013 13:37:24 -0700 (PDT) X-BeenThere: std-proposals@isocpp.org Original-Received: by 10.49.41.5 with SMTP id b5ls406235qel.70.gmail; Tue, 08 Oct 2013 13:37:23 -0700 (PDT) X-Received: by 10.224.5.137 with SMTP id 9mr6515761qav.65.1381264643667; Tue, 08 Oct 2013 13:37:23 -0700 (PDT) Original-Received: from mail-qc0-x22c.google.com (mail-qc0-x22c.google.com [2607:f8b0:400d:c01::22c]) by mx.google.com with ESMTPS id w9si6766068qap.131.1969.12.31.16.00.00 (version=TLSv1 cipher=ECDHE-RSA-RC4-SHA bits=128/128); Tue, 08 Oct 2013 13:37:23 -0700 (PDT) Received-SPF: pass (google.com: domain of nliber@gmail.com designates 2607:f8b0:400d:c01::22c as permitted sender) client-ip=2607:f8b0:400d:c01::22c; Original-Received: by mail-qc0-f172.google.com with SMTP id l13so6456024qcy.3 for ; Tue, 08 Oct 2013 13:37:23 -0700 (PDT) X-Received: by 10.49.84.6 with SMTP id u6mr4767403qey.79.1381264643334; Tue, 08 Oct 2013 13:37:23 -0700 (PDT) Original-Sender: nliber@gmail.com Original-Received: by 10.49.60.70 with HTTP; Tue, 8 Oct 2013 13:36:43 -0700 (PDT) In-Reply-To: <2602b3fd-fccd-459b-be1a-93a12005dc5c@isocpp.org> X-Original-Sender: nevin@eviloverlord.com X-Original-Authentication-Results: mx.google.com; spf=pass (google.com: domain of nliber@gmail.com designates 2607:f8b0:400d:c01::22c as permitted sender) smtp.mail=nliber@gmail.com; dkim=pass header.i=@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:7172 Archived-At: --047d7bdc093468486f04e840bcb2 Content-Type: text/plain; charset=ISO-8859-1 On 8 October 2013 15:33, wrote: > Yes, the behavior is like find_if + distance, but the performance is > better (except maybe for random access iterator). I propose a template > specialization for random access iterator in order to be at least as fast > as find_if + distance. > -1. You want to use overloading, not specializaton for iterator tags. I am planning on writing up contiguous_iterator_tag for Issaquah, which is a refinement of random access iterator, and would not perform as well if you used specialization. -- Nevin ":-)" Liber (847) 691-1404 -- --- 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/. --047d7bdc093468486f04e840bcb2 Content-Type: text/html; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable
On 8 October 2013 15:33, <lefevreremy@gmail.com&= gt; wrote:
=
Yes, the behavior is like find_if + distance, but the perf= ormance is better (except maybe for random access iterator). I propose a te= mplate specialization for random access iterator in order to be at least as= fast as find_if + distance.

-1.=A0 You want to use overloading, = not specializaton for iterator tags.=A0 I am planning on writing up contigu= ous_iterator_tag for Issaquah, which is a refinement of random access itera= tor, and would not perform as well if you used specialization.
--
=A0Nevin ":-)" Liber=A0 <mailto:nevin@eviloverlord.com= >=A0 (847) 691-1404

--
 
---
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>.
--047d7bdc093468486f04e840bcb2-- .