From: David Abrahams (david.abrahams_at_[hidden])
Date: 2001-07-20 15:13:38
----- Original Message -----
From: "Vesa Karvonen" <vesa.karvonen_at_[hidden]>
> I think that with the proposed metaprogramming facilities for tuple
> such as being able to iterate over the types of the elements of a tuple,
> functionality could be implemented on top of tuple.
Clearly, it *could be*... at least on top of tuple's private implementation
details. I don't think the public interface described in the documentation
exposes quite enough to do what I want.
> [In C++, there is no *compile-time* ordering for types, so the best a
> compile-time map implementation could do is linear time search.
That's fine, since it's linear at compile-time.
> However, if
> you want to reduce template recursion depth, you might still want to use a
> balanced tree and perform an exhaustive search.]
Nah, my tuples will be small.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk