220 7195 article Path: news.gmane.org!not-for-mail From: Vlad from Moscow Newsgroups: gmane.comp.lang.c++.isocpp.proposals Subject: Re: "count_while" and "count_until" algorithms Date: Tue, 8 Oct 2013 14:17:13 -0700 (PDT) Lines: 73 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> <2d16db0e-fb46-4e1f-956f-db3407a6fb4c@isocpp.org> <79e2df66-c96a-407b-8d31-0df45ea76d71@isocpp.org> Reply-To: std-proposals@isocpp.org NNTP-Posting-Host: plane.gmane.org Mime-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_Part_548_20245446.1381267033384" X-Trace: ger.gmane.org 1381267033 28824 80.91.229.3 (8 Oct 2013 21:17:13 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Tue, 8 Oct 2013 21:17:13 +0000 (UTC) To: std-proposals@isocpp.org Original-X-From: std-proposals+bncBCXLLRHD7IDRBWXM2GJAKGQEPUXWHAI@isocpp.org Tue Oct 08 23:17:18 2013 Return-path: Envelope-to: gclcip-std-proposals@m.gmane.org Original-Received: from mail-ie0-f200.google.com ([209.85.223.200]) by plane.gmane.org with esmtp (Exim 4.69) (envelope-from ) id 1VTeea-0001jL-Ca for gclcip-std-proposals@m.gmane.org; Tue, 08 Oct 2013 23:17:16 +0200 Original-Received: by mail-ie0-f200.google.com with SMTP id tp5sf28717562ieb.11 for ; Tue, 08 Oct 2013 14:17:15 -0700 (PDT) X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20130820; 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=Z2lntTcBUdOTsL94ZJqvL136cA3VE9nHtQuZX/xEEB4=; b=LmQ8zAq1xjnt2AgXAJFHACtpAed/wYv2/lMFBYqiW0w+F3S2N6rUcvAbJrgQ3BN0Ec WJe+zXJxSiyTWpBAI0fJJENbp5Tahicn4faW3d9D5GcItOB73ee4xUBzshtZwZWpPU1h 1dJQz83BNoaiiGWRU3kWvrhv807lkshipXgvVXLS+rcOHud+0WIq8KuDPkZBzVUlMNAa 85PFyC1I/kbGi9LDgAdPkpTtRlnXxqszeqa8FFarTjDQtM8EcnTJCAtrwBsqqGdxrJHG 0WmWBUtyfT6a0/jlT78WqjHZfVvK9+FokBWpdU+ve7Rf4aNcUSJgwad35Wnr12CA403K Do+w== X-Received: by 10.50.106.116 with SMTP id gt20mr19384688igb.0.1381267035300; Tue, 08 Oct 2013 14:17:15 -0700 (PDT) X-BeenThere: std-proposals@isocpp.org Original-Received: by 10.50.25.97 with SMTP id b1ls3980184igg.1.canary; Tue, 08 Oct 2013 14:17:14 -0700 (PDT) X-Received: by 10.50.25.98 with SMTP id b2mr1073596igg.3.1381267034714; Tue, 08 Oct 2013 14:17:14 -0700 (PDT) In-Reply-To: X-Original-Sender: vlad.moscow@mail.ru 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:7195 Archived-At: ------=_Part_548_20245446.1381267033384 Content-Type: text/plain; charset=KOI8-R Content-Transfer-Encoding: quoted-printable Yes...and adding word first will point out that they traverse only first=20 elements that satisfy the condition.:) =D3=D2=C5=C4=C1, 9 =CF=CB=D4=D1=C2=D2=D1 2013 =C7., 1:13:28 UTC+4 =D0=CF=CC= =D8=DA=CF=D7=C1=D4=C5=CC=D8 Evgeny Panasyuk=20 =CE=C1=D0=C9=D3=C1=CC: > 9 2013 =C7., 1:08:50 UTC+4 Vlad from Moscow : >> >> I would like to preserve the word "if" in such algorithms. We have for= =20 >> example copy_if, count_if and so on. So we could include copy_first_if,= =20 >> count_first_if and so on. It is a more consistent system of naming of=20 >> algorithms. >> > > Actually copy_if and count_if have different traversal semantic - they=20 > pass thru whole input range. > --=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_548_20245446.1381267033384 Content-Type: text/html; charset=KOI8-R Content-Transfer-Encoding: quoted-printable
Yes...and adding word first will point out that they = traverse only first elements that satisfy the condition.:)

= =D3=D2=C5=C4=C1, 9 =CF=CB=D4=D1=C2=D2=D1 2013 =C7., 1:13:28 UTC+4 =D0= =CF=CC=D8=DA=CF=D7=C1=D4=C5=CC=D8 Evgeny Panasyuk =CE=C1=D0=C9=D3=C1=CC:
9 2013 =C7., 1:08:50 = UTC+4 Vlad from Moscow :
= I would like to preserve the word "if" in such algorithms. We have for exam= ple copy_if, count_if and so on. So we could include copy_first_if, count_f= irst_if and so on. It is a more consistent system of naming of algorithms.<= /div>

Actually copy_if and count_if have differe= nt traversal semantic - they pass thru whole input range.

--
 
---
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_548_20245446.1381267033384-- .