Subject: Re: [boost] Request for feedback - Map providing insertion order preserving iteration
From: Steven Watanabe (watanabesj_at_[hidden])
Date: 2009-08-24 13:32:10
Gautam Sewani wrote:
> We wanted to add a map to Boost C++ libraries which would allow
> iteration in the order in which elements were inserted, and would also
> provide logarithmic time retrieval. A simple design for this would be
> to have a balanced binary tree along with an auxiliary linked list of
> pointers to the keys in the tree. We would be grateful if you could
> provide feedback on the utility and design.
take a look at Boost.MultiIndex.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk