[boost] [math][pool]random][rational]: (somewhat) different implementations of the same algorithm.

From: Yuriy Koblents-Mishke (yurakm_at_[hidden])
Date: 2006-05-07 17:04:42

1. The Euclide algorithm for the greatest common divisor (gcd) currently is
implemented by at least four different boost libraries.

Is it a good idea to edit the libraries to replace the redundant codes by
#include?

2. I have few codes implementing different variants of the Stein algorithm
for gcd. The codes, as tested using gcc 3.4.2 / mingw with the the
optimization flag O3 under Win XP on AMD Athlon 64 3500+, are generally
faster than the Euclide codes in Boost. One of the codes is about 90%
faster.

Is it a good idea to put the codes in Boost?