|
|
Boost : |
From: David Abrahams (dave_at_[hidden])
Date: 2008-08-18 06:18:21
on Sun Aug 17 2008, "Phil Bouchard" <philippe-AT-fornux.com> wrote:
> "I think a huge container inside an application will always suffer from
> imperfections and this could be a decent alternative to the problem. A map
> mixed with a list, a vector mixed with a set or all four together offers an
> infinite set of properties.
>
> Let's put it this way. All new "unordered" and multiset containers could
> easily be implemented as:
> 1) superc1st<double, list, vector> s1;
> 2) superc2nd<string, double, map, vector> s2;
> 3) superc2nd<string, double, map, map> s3;
Sounds reminiscent of boost::graph::adjacency_list.
-- Dave Abrahams BoostPro Computing http://www.boostpro.com
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk