220 7463 <18f34d4f-27c7-487f-a2f2-18d3e0a38f7b@isocpp.org> article Path: news.gmane.org!not-for-mail From: Vlad from Moscow Newsgroups: gmane.comp.lang.c++.isocpp.proposals Subject: Re: Re: To add the method append for all sequential containers that have method push_back Date: Wed, 23 Oct 2013 17:16:38 -0700 (PDT) Lines: 79 Approved: news@gmane.org Message-ID: <18f34d4f-27c7-487f-a2f2-18d3e0a38f7b@isocpp.org> References: <4167b82e-a3cc-44ce-9825-b52514bc1531@isocpp.org> <357325b0-cec5-4d22-ad56-9bb66f76b458@isocpp.org> <983ff074-5d8c-488a-b06c-49d53d5b7a5b@isocpp.org> <369298d9-3f8b-405a-8bfe-ae209372a26f@isocpp.org> <5266DEEC.7090805@gmail.com> <7c9a2637-65d8-4d54-bd3c-b46c0c22b34f@isocpp.org> <70a718dd-eca7-4845-8e9c-0313581ed453@isocpp.org> <6b9f62b2-21b1-4c62-a815-217d77a59a23@isocpp.org> <0e98fae6-2dc5-4e50-8659-5334012c4dd4@isocpp.org> <0d945506-2a09-4645-a68e-ada2b9898aa9@isocpp.org> <69dd52d3-c35e-4391-b998-d1a35c4599d6@isocpp.org> <0001b7d6-42ab-4f47-8104-1c5e93ecfbc4@isocpp.org> <03ecdc90-1973-4e34-82c9-ab0043241a2b@isocpp.org> <94c6cdf1-e640-4cc9-9c4b-e2605610a715@isocpp.org> <8e3f0b94-b0a3-43e2-9a2c-853734b9d6c3@isocpp.org> Reply-To: std-proposals@isocpp.org NNTP-Posting-Host: plane.gmane.org Mime-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_Part_4424_20151755.1382573798855" X-Trace: ger.gmane.org 1382573796 21274 80.91.229.3 (24 Oct 2013 00:16:36 GMT) X-Complaints-To: usenet@ger.gmane.org NNTP-Posting-Date: Thu, 24 Oct 2013 00:16:36 +0000 (UTC) To: std-proposals@isocpp.org Original-X-From: std-proposals+bncBCXLLRHD7IDRBZ6NUGJQKGQEFSXEC6A@isocpp.org Thu Oct 24 02:16:41 2013 Return-path: Envelope-to: gclcip-std-proposals@m.gmane.org Original-Received: from mail-vb0-f69.google.com ([209.85.212.69]) by plane.gmane.org with esmtp (Exim 4.69) (envelope-from ) id 1VZ8bQ-0006x2-LB for gclcip-std-proposals@m.gmane.org; Thu, 24 Oct 2013 02:16:40 +0200 Original-Received: by mail-vb0-f69.google.com with SMTP id e12sf3729621vbg.4 for ; Wed, 23 Oct 2013 17:16:39 -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=w4thd76F/oEEO5OrrxJ063hytr6aFkCXThn6B6i5rMY=; b=LodWQZoONh8G8CcleQv+cCAIgidteJxEUaiuubvqm/5wUOoWInrksrlQ/BsCyKB5p2 92OjHawMI6pNVrRFRnqKLK7eeSSFVETrkIRCpu1nD4KwFkbxeenw632DBQAV/TQNHxPJ WfZsDZZVIp/pBhXiMkS09sKX86/IepOVqVNSWHmss2hPtZ+X1Y4e9roCt+EpoAUeJR3g DuG5CN0hCXJaC6cuU7gAgwbcOcnEpRsuoOtjy5MfasKZAOHBivNd/oA7lEQVerF4y4yv iDeKO1+CG/zHhhVlx9F0YHJNXrLIf9U5ThI1EeNr+MjjBoB1wxq9eYzp7khE7mNVDvcX vBDw== X-Received: by 10.236.32.74 with SMTP id n50mr4206555yha.13.1382573799820; Wed, 23 Oct 2013 17:16:39 -0700 (PDT) X-BeenThere: std-proposals@isocpp.org Original-Received: by 10.49.12.103 with SMTP id x7ls708782qeb.14.gmail; Wed, 23 Oct 2013 17:16:39 -0700 (PDT) X-Received: by 10.49.82.69 with SMTP id g5mr282qey.24.1382573799391; Wed, 23 Oct 2013 17:16:39 -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:7463 Archived-At: ------=_Part_4424_20151755.1382573798855 Content-Type: text/plain; charset=KOI8-R Content-Transfer-Encoding: quoted-printable It is a bad analogy. Algorithm are some sort of tasks that have usually=20 preconditions. You can not for example use binary_search with non-ordered= =20 sequenses. So lower_bound is not a general function as you think. It is=20 very specific function. =20 =DE=C5=D4=D7=C5=D2=C7, 24 =CF=CB=D4=D1=C2=D2=D1 2013 =C7., 4:10:43 UTC+4 = =D0=CF=CC=D8=DA=CF=D7=C1=D4=C5=CC=D8 Evgeny Panasyuk=20 =CE=C1=D0=C9=D3=C1=CC: > They will think so by analogy with other similar general functions as for= =20 >> example advance that can be used with any type of iterators (except outp= ut=20 >> iterators). >> > > Generic function does not imply that it should work for everything.=20 > std::lower_bound does not work for input iterators.std::sort works only= =20 > for random access. > =20 > --=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_4424_20151755.1382573798855 Content-Type: text/html; charset=KOI8-R Content-Transfer-Encoding: quoted-printable
It is a bad analogy. Algorithm are some sort of tasks= that have usually preconditions. You can not for example use binary_search= with non-ordered sequenses. So lower_bound is not a general function as yo= u think. It is very specific function.
 

=DE= =C5=D4=D7=C5=D2=C7, 24 =CF=CB=D4=D1=C2=D2=D1 2013 =C7., 4:10:43 UTC+4 = =D0=CF=CC=D8=DA=CF=D7=C1=D4=C5=CC=D8 Evgeny Panasyuk =CE=C1=D0=C9=D3=C1=CC:=
They will think so by analogy with other simila= r general functions as for example advance that can be used with any type o= f iterators (except output iterators).

Generic function does not imply that it should work for everything.

std::lower_bound does not work = for input iterators.

std::sort works only for random access.
 

--
 
---
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_4424_20151755.1382573798855-- .