Sascha Krissler wrote:
Hello,
i am writing a multiple dispatch framework and as i am feeling scientific i am gonna try to add a predicate dispatch fearure to it. For that i need to build big nested expression template instances that represent the predicates, so that i cant evaluate them at the time of method invocation. As an additional feature i want to sort the predicates for specifity (one predicate is true at a subset of cases of another predicate and is as such more specific) and for that i need access to the parse tree of a lambda expression. Is there documentation available on this topic and does lambda have a public interface for that? Does it make sense to use lambda as a library for writing expression template algorithms? Thanks in advance
I don't think Boost.Lambda's expression template tree data structure is documented. I am actively working on a generic expression template framework called proto. It is already checked into Boost CVS as part of xpressive (see boost/xpressive/proto on CVS HEAD). It is also being used in the development of Spirit-2. I think it would be a very good fit for what you are trying to do. Unfortunately, the code is still in some flux, and as such is not documented. I have some read-me material you might find helpful, but nothing complete or comprehensive. Let me know, and I can send it along. -- Eric Niebler Boost Consulting www.boost-consulting.com