|
Boost : |
From: JOAQUIN LOPEZ MU?Z (joaquin_at_[hidden])
Date: 2004-01-17 13:04:23
Some months ago there was a discussion about how to
implement so called "sequence sets", list-like
containers with fast lookup:
http://lists.boost.org/MailArchives/boost/msg28508.php
As an example of the extensibility of indexed_set
through the implementation of new index types, I've wrote
a fast sketch of a new index type called "sequenced",
by which efficient sequence sets are easily defined
// sequence of ints with sorted index
typedef indexed_set<
int,
index_list<
unique<identity<int> >, // fast lookup
sequenced<> // list-like interface
>
> sequenced_set;
The full example can be found at
http://tinyurl.com/3dto3
Please note that this is not part of the official
indexed_set library, but it could make it into
it if there is interest.
Joaquín M López Muñoz
Telefónica, Investigación y Desarrollo
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk