Eric,
I've been too lazy to reply.
From: "Eric Friedman" <[EMAIL PROTECTED]>
Subject: Re: switch-based runtime type selection (for variant)
Date: Thu, 14 Aug 2003 02:09:41 -0400
Brian Simpson wrote:
> Eric,
> It sounds like you've become convinced that the switc
"Douglas Gregor" <[EMAIL PROTECTED]> wrote in message
news:<[EMAIL PROTECTED]>...
- Original Message -
From: "Brian Simpson" <[EMAIL PROTECTED]>
> The general case devolves into an else-if-then:
> Let us assume that we
Eric,
"Eric Friedman" <[EMAIL PROTECTED]> wrote in message
news:<[EMAIL PROTECTED]>...
Brian Simpson wrote:
> A fundamental problem encountered by boost::variant is that of
> invoking an overloaded function for the correct type, where the type >
is not known
unt
A fundamental problem encountered by boost::variant is that of invoking an
overloaded function for the correct type, where the type is not known until
runtime. As near as I can tell, all proposed solutions to this problem have
involved uncomfortable space or time tradeoffs. I have read several
"Aleksey Gurtovoy" <[EMAIL PROTECTED]> wrote in message
news:<[EMAIL PROTECTED]>...
FWIW, I've used a similar technique in MPL to do recursion unrolling
for the 'advance' algorithm:
http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/*checkout*/boost/boost/
boost/mpl/aux_/preprocessed/plain/advance_f
"Aleksey Gurtovoy" <[EMAIL PROTECTED]> wrote in message
news:<[EMAIL PROTECTED]>...
FWIW, I've used a similar technique in MPL to do recursion unrolling
for the 'advance' algorithm:
http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/*checkout*/boost/boost/
boost/mpl/aux_/preprocessed/plain/advance_f
