Boost logo

Boost :

From: Daniel Wallin (dalwan01_at_[hidden])
Date: 2004-09-12 09:35:36


David Abrahams wrote:
> Daniel Wallin <dalwan01_at_[hidden]> writes:
>
>
>>David Abrahams wrote:
>>
>>>Daniel Wallin <dalwan01_at_[hidden]> writes:
>>>
>>>>I have been toying with a more general solution to this problem, where
>>>>one can do things like:
>>>>
>>>> check_dereference<T, is_convertible<mpl::_, U&> >
>>>> check_add<T, T, is_convertible<mpl::_, T> >
>>>>
>>>>etc.
>>>
>>>That *might* be impressive if I could tell what those expressions
>>>were
>>>supposed to mean ;-)
>>
>>The metafunction class
>
>
> I don't see a metafunction class here. Don't you mean "lambda expression?"

Maybe. I was trying to describe the formal argument. So I guess
something like:

   template<class T, class U, class Predicate>
   struct check_add;

     Where Predicate is a unary metafunction class or a lambda
     expression.

??

[snip]
> Oh, very nice! Now it's impressive. :-)

:) So, anyone interested in this?

-- 
Daniel Wallin

Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk