That actually sounds pretty much what I was looking for. However I can't seem to find the source in the sandbox (using the web interface). Haven't poked around there before so maybe I'm just stupid, but I can't find the actual header-file in http://cvs.sourceforge.net/viewcvs.py/boost-sandbox/boost-sandbox/libs/map/ Where can I find it? And how stable/complete is your implementation? Regards, Peter
-----Original Message----- From: boost-bounces@lists.boost.org [mailto:boost-bounces@lists.boost.org] On Behalf Of David B. Held Sent: den 17 mars 2004 19:54 To: boost@lists.boost.org Subject: [boost] Re: Is there any interest in this container?
"Peter Palotas" <peter@smartbusiness.nu> wrote in message news:auto-000000364385@statement.se...
I was wondering if there is any interest in a container that is a model of sequence (just like std::vector or std::list) and with an interface matching that of std::vector (maybe with minor differences due to effiency) but with different time complexities? [...]
Take a look at the policy-based map in the sandbox. I implement what I called "indexed nodes" which appear to give the complexity characteristics you describe. I'm not sure whether the indexed_set library soon to be reviewed also supports this feature or not, but given all the other features it has, I would be suprised if it didn't. ;)
Dave
--- Outgoing mail is certified Virus Free. Checked by AVG anti-virus system (http://www.grisoft.com). Version: 6.0.581 / Virus Database: 368 - Release Date: 2/9/2004
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost