From 2608835095488418568 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: f78e5,66d20309909372f6 X-Google-Attributes: gidf78e5,public From: Oleg Zabluda Subject: Re: STL and set_union algorithm question? (newbie to STL!) Date: 1998/04/16 Message-ID: <6h43d1$ijb@marianna.psu.edu>#1/1 X-Deja-AN: 344581858 Approved: Fergus Henderson References: <6g2te9$a7n$1@ukwsv3.ggr.co.uk> <35290568.2781@wizard.net> <352A9B77.2781E494@pratique.fr> <6gelt5$mpp@marianna.psu.edu> <35326714.15FB@wizard.net> <353428A1.4165@pratique.fr> X-Original-Date: 16 Apr 1998 01:02:25 -0400 X-Server-Date: 16 Apr 1998 05:13:58 GMT Organization: Penn State University, Center for Academic Computing X-Auth: PGPMoose V1.1 PGP comp.std.c++ iQBFAgUANTWs8uEDnX0m9pzZAQFXJQGAk8tgK5r4e1rUWwzpllHWNrw5ne/VXpPF eOivEb5V5ODt3OH+GGVV9Tz/JEc0MudE =ToRu Reply-To: zabluda@math.psu.edu (Oleg Zabluda) Newsgroups: comp.std.c++ Valentin Bonnard wrote: : James Kuyper writes: : > Matt Austern wrote: : > > I can't, though, understand wanting set<>::iterator to be a modifiable : > > iterator. The whole point of set<> (and all of the other associative : > : > If a non-const iterator were implementable for set<>, then (*i)=b should : > be the equivalent of erase(i) followed by an insert(b). : What you describe isn't exactly an iterator, as all iterator : operations are O(1), not O(ln(n)). Operations on insert_iterator, for example, can be O(anything). Oleg. -- Life is a sexually transmitted, 100% lethal disease. --- [ 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://reality.sgi.com/austern_mti/std-c++/faq.html ]