Re: [boost] How do you test complex transformations?

Subject: Re: [boost] How do you test complex transformations?
From: Vicente Botet (vicente.botet_at_[hidden])
Date: 2011-03-18 17:32:37

Mathias Gaunard-2 wrote:
> 
> On 18/03/2011 18:23, Vicente Botet wrote:
> 
>> One technique could be to make the transformation by hand and keep track
>> of
>> the input ->  output association.
>> Another technique consist in re-implementing the algorithm and check that
>> both implementations match.
> 
> Checking that both implementations match is not really possible if the 
> range of all inputs is big.
> 
> What we do to validate the precision of our math functions in the NT2 
> project is that we perform random tests and compare the results to that 
> obtained with a library that we know to be correct.
> 

Hi,

yes, I'm in the same situation, the samples are often generated randomly.

If you are developing new algorithms, this is equivalent to implement the
algorithm (possibly with less constraints) and compare the results. Of
course both implementation can be wrong.

If you didn't have a library that gives you the correct answer, do you think
that you will find re-implementing the transformation a good practice?

Best,
Vicente  

--
View this message in context: http://boost.2283326.n4.nabble.com/How-do-you-test-complex-transformations-tp3387869p3388509.html
Sent from the Boost - Dev mailing list archive at Nabble.com.