From -254982171171736894 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: f78e5,66d20309909372f6 X-Google-Attributes: gidf78e5,public From: Valentin Bonnard Subject: Re: STL and set_union algorithm question? (newbie to STL!) Date: 1998/04/16 Message-ID: <353428A1.4165@pratique.fr>#1/1 X-Deja-AN: 344526421 Approved: Fergus Henderson Content-Transfer-Encoding: 7bit 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> X-Original-Date: Wed, 15 Apr 1998 05:25:21 +0200 Content-Type: text/plain; charset=us-ascii Organization: Ecole Normale Superieure, Paris, France X-Auth: PGPMoose V1.1 PGP comp.std.c++ iQBFAgUANTVqIuEDnX0m9pzZAQHbhQF+P/3OW6XJkSVSr4a4hxMjKVz5JCCyxClb oMkIBMbJE5Fc6b6VGmYX+0TWZHzX7y/H =bu2q Mime-Version: 1.0 Reply-To: bonnardv@pratique.fr Newsgroups: comp.std.c++ 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)). -- Valentin Bonnard mailto:bonnardv@pratique.fr info about C++/a propos du C++: http://pages.pratique.fr/~bonnardv/ --- [ 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 ]