From 1172018796520838786 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: f78e5,8d7ae4b2a3e77f8b X-Google-Attributes: gidf78e5,public X-Google-ArrivalTime: 2003-08-14 10:55:46 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!newsfeed.icl.net!newsfeed.fjserv.net!kibo.news.demon.net!mutlu.news.demon.net!demon!mail2news.demon.co.uk!devnull From: nesotto@cs.auc.dk ("Thorsten Ottosen") Newsgroups: comp.std.c++ Subject: Re: Why is there no range type in the standard library? Date: Thu, 14 Aug 2003 17:55:45 +0000 (UTC) Lines: 47 Approved: fjh@cs.mu.oz.au (Fergus Henderson , moderator of comp.std.c++) Message-ID: <3f3add91$0$14559$afc38c87@news.optusnet.com.au> References: <95e0e5ef.0308060330.28aefaae@posting.google.com> <3f37a6be$0$14560$afc38c87@news.optusnet.com.au> X-Trace: mail2news.demon.co.uk 1060883745 12311 10.0.0.1 (14 Aug 2003 17:55:45 GMT) X-Complaints-To: abuse@demon.net NNTP-Posting-Date: Thu, 14 Aug 2003 17:55:45 +0000 (UTC) X-Received: from mulga.cs.mu.oz.au ([128.250.1.22]) by news.demon.co.uk with esmtp (Exim 4.12) id 19nMK8-0003CQ-00 for mail2news@news.news.demon.net; Thu, 14 Aug 2003 17:55:44 +0000 X-Received: from localhost (localhost [[UNIX: localhost]]) by mulga.cs.mu.OZ.AU id DAA14103; Fri, 15 Aug 2003 03:55:40 +1000 (EST) X-Authentication-Warning: mulga.cs.mu.OZ.AU: fjh set sender to devnull@stump.algebra.com using -f X-Path: comp-std-cpp-robomod!not-for-mail X-Robomod: STUMP, ichudov@algebra.com (Igor Chudov) X-Delivered-To: std-c++@ucar.edu X-Newsgroups: comp.std.c++ X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2800.1158 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2800.1165 X-Spam-Status: No, hits=-4.7 required=5.0 tests=BAYES_10,PRIORITY_NO_NAME,QUOTED_EMAIL_TEXT,REFERENCES version=2.55 X-Spam-Checker-Version: SpamAssassin 2.55 (1.174.2.19-2003-05-19-exp) Xref: archiver1.google.com comp.std.c++:20619 "David Pearce" wrote in message news:bhctdv$sfh$1@harrier.doc.ic.ac.uk... > Hi, > > > Anyway, you can see some implementation in the boost sandbox:. Look for > > these files > > > > boost/sequence_algo/container_traits.hpp > > boost/sequence_algo/container_algo.hpp > > > > container_traits<> is the tool you need to treat types as iterator ranges. > > I have just been looking at this and I've got a question. It seems to > me that using these iterator ranges it should be possible to eliminate > the slightly annoying STL issue of e.g. std::set.find versus find(...) > by specialising the container algorithms. do you agree? is it the > intention to do this in container_algo ? yes. I agree that it would be a benefit and it ought to be done that way. it hasn't been done like that yet since I was annoyed by the need to include e.g to make the specialization. Had the standard only forward declared container templates, it would have been easy. When I asked Matt Austern about it, he instead recommended a header that includes everything which could then be precompiled no most systems. I guess the relative headers should just be included. Anyway, there is plenty of time to fix the issue since the working group will not consider new libs for one-and-a-half year. regards Thorsten --- [ comp.std.c++ is moderated. To submit articles, try just posting with ] [ your news-reader. If that fails, use mailto:std-c++@ncar.ucar.edu ] [ --- Please see the FAQ before posting. --- ] [ FAQ: http://www.jamesd.demon.co.uk/csc/faq.html ]