boostorg/integer
1
0
Fork 1
mirror of https://github.com/boostorg/integer.git synced 2025-07-30 04:37:13 +02:00
Code Issues Packages Projects Releases Wiki Activity

Fix failures when used with an expression-template enabled number type such as the gmpxx clases. Add additional concept check for integer code using gmp classes. Fixes #4139.

Browse Source 
[SVN r61837]
This commit is contained in:
John Maddock
2010-05-07 15:36:09 +00:00
committed by Peter Dimov
parent 7c528c325e
commit 5174291e08
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
include/boost/math/common_factor_rt.hpp
View File

@ -78,8 +78,8 @@ namespace detail
RingType RingType
gcd_euclidean gcd_euclidean
( (
RingType a, RingType a,
RingType b RingType b
) )
{ {
// Avoid repeated construction // Avoid repeated construction
@ -116,7 +116,7 @@ namespace detail
IntegerType const zero = static_cast<IntegerType>( 0 ); IntegerType const zero = static_cast<IntegerType>( 0 );
IntegerType const result = gcd_euclidean( a, b ); IntegerType const result = gcd_euclidean( a, b );
return ( result < zero ) ? -result : result; return ( result < zero ) ? static_cast<IntegerType>(-result) : result;
} }
// Greatest common divisor for unsigned binary integers // Greatest common divisor for unsigned binary integers
@ -212,7 +212,7 @@ namespace detail
IntegerType const zero = static_cast<IntegerType>( 0 ); IntegerType const zero = static_cast<IntegerType>( 0 );
IntegerType const result = lcm_euclidean( a, b ); IntegerType const result = lcm_euclidean( a, b );
return ( result < zero ) ? -result : result; return ( result < zero ) ? static_cast<IntegerType>(-result) : result;
} }
// Function objects to find the best way of computing GCD or LCM // Function objects to find the best way of computing GCD or LCM