|
Boost Users : |
Subject: Re: [Boost-users] [proto] generation of adaptive precision floating-point geometric predicates
From: Andrew Durward (andrew.durward_at_[hidden])
Date: 2010-03-22 10:56:26
Hi Manjunath,
> See if the following works for you. I try to replace a # b with
> sum(#_approx(a,b), #_error(a,b)). The display_expr looked correct, but
> I didn't check very carefully.
Thanks much for your suggestion. However, I should have explained myself
better in my first message. In the case of multiplication, I would like to
expand the product according to the distributive law.
For example:
(a1 + a2 + ... + aN)*(b1 + b2 + ... + bM)
Becomes:
a1*b1 + ... + a1*bM + ... aN*b1 + ... + aN*bM
I can see how to accomplish this with a recursive metafunction but I'm not
sure how to express it using proto.
Thanks,
andrew
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net