Hi, I have a numerical algorithm for auto-differentiation of higher order derivatives. The algorithm works fine, and I want to optimize it now.
Is there a direct way to transform an expression tree into another one? For example, is it possible that every proto::plus< > node is transformed to it left child? I tried to solve this problem via protos build-in transforms without success. It seems that they are suited for evaluation of an existing tree, but I might be wrong. Best regards, Karsten _______________________________________________ proto mailing list proto@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/proto
