From: Dan W. (danw_at_[hidden])
Date: 2004-01-08 14:30:01
Anatoli Tubman wrote:
> The right (i.e. compile-time-fast) way do do this is not with mpl::list but
> with mpl::map. To my knowledge, such a beast does not currently exist, but it
> can be done. See e.g. here:
mpl::hash_map might be easier to come up with, having mpl::list already...
> Sorry for a long Google cache link; I can't seem to find the real thing now.
> With this, comparison and merge are probably O(n) instead of O(n^2) that we
> have with mpl::list. I don't know whether it will significantly improve
> compilation time.
... and it should be closer to O(1)
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk