Tobias, I looked in your code and have an additional question. Compiletime complexity of the algorithm is exponential as I see it. Isn't it probably better to convert the first vector into a set and make set lookups with amortized constant time? Regards, Ovanes -----Original Message----- From: Tobias Schwinger [mailto:tschwinger@isonews2.com] Sent: Sonntag, 18. März 2007 14:55 To: boost-users@lists.boost.org Subject: Re: [Boost-users] [mpl] Implementing includes_if Scott Meyers wrote:
It will take me a few days to digest your comments
Hopefully not because they're confusing :-). I tried to increase conciseness with my second post.
(this is largely new territory for me), but I wanted to acknowledge your help now. Thanks very much.
Thanks too -- a reader who's new to the territory is most valuable to improve one's communication skills.
The problem comes down to that MPL can't know where one placeholder expression starts and where another one ends (denoted by uppercase identifiers, above):
Yes, I ran into this problem playing around as a result of the help posted earlier. As I said, it will take me a while to get a grasp on what you've done. I have to look a lot of stuff up and write a lot of test cases :-)
There's a slightly altered approach to this problem attached to this message for some additional fun. Regards, Tobias