98 lines
		
	
	
		
			3.0 KiB
		
	
	
	
		
			Plaintext
		
	
	
	
	
	
			
		
		
	
	
			98 lines
		
	
	
		
			3.0 KiB
		
	
	
	
		
			Plaintext
		
	
	
	
	
	
| //  Boost common_factor_ct.hpp header file  ----------------------------------//
 | |
| 
 | |
| //  (C) Copyright Daryle Walker and Stephen Cleary 2001-2002.
 | |
| //  Distributed under the Boost Software License, Version 1.0. (See
 | |
| //  accompanying file LICENSE_1_0.txt or copy at
 | |
| //  http://www.boost.org/LICENSE_1_0.txt)
 | |
| 
 | |
| //  See http://www.boost.org for updates, documentation, and revision history. 
 | |
| 
 | |
| #ifndef BOOST_MATH_COMMON_FACTOR_CT_HPP
 | |
| #define BOOST_MATH_COMMON_FACTOR_CT_HPP
 | |
| 
 | |
| #include <boost/math_fwd.hpp>  // self include
 | |
| #include <boost/config.hpp>  // for BOOST_STATIC_CONSTANT, etc.
 | |
| #include <boost/mpl/integral_c.hpp>
 | |
| 
 | |
| namespace boost
 | |
| {
 | |
| namespace math
 | |
| {
 | |
| 
 | |
| //  Implementation details  --------------------------------------------------//
 | |
| 
 | |
| namespace detail
 | |
| {
 | |
|     // Build GCD with Euclid's recursive algorithm
 | |
|     template < static_gcd_type Value1, static_gcd_type Value2 >
 | |
|     struct static_gcd_helper_t
 | |
|     {
 | |
|     private:
 | |
|         BOOST_STATIC_CONSTANT( static_gcd_type, new_value1 = Value2 );
 | |
|         BOOST_STATIC_CONSTANT( static_gcd_type, new_value2 = Value1 % Value2 );
 | |
| 
 | |
|         #ifndef __BORLANDC__
 | |
|         #define BOOST_DETAIL_GCD_HELPER_VAL(Value) static_cast<static_gcd_type>(Value)
 | |
|         #else
 | |
|         typedef static_gcd_helper_t  self_type;
 | |
|         #define BOOST_DETAIL_GCD_HELPER_VAL(Value)  (self_type:: Value )
 | |
|         #endif
 | |
| 
 | |
|         typedef static_gcd_helper_t< BOOST_DETAIL_GCD_HELPER_VAL(new_value1),
 | |
|          BOOST_DETAIL_GCD_HELPER_VAL(new_value2) >  next_step_type;
 | |
| 
 | |
|         #undef BOOST_DETAIL_GCD_HELPER_VAL
 | |
| 
 | |
|     public:
 | |
|         BOOST_STATIC_CONSTANT( static_gcd_type, value = next_step_type::value );
 | |
|     };
 | |
| 
 | |
|     // Non-recursive case
 | |
|     template < static_gcd_type Value1 >
 | |
|     struct static_gcd_helper_t< Value1, 0UL >
 | |
|     {
 | |
|         BOOST_STATIC_CONSTANT( static_gcd_type, value = Value1 );
 | |
|     };
 | |
| 
 | |
|     // Build the LCM from the GCD
 | |
|     template < static_gcd_type Value1, static_gcd_type Value2 >
 | |
|     struct static_lcm_helper_t
 | |
|     {
 | |
|         typedef static_gcd_helper_t<Value1, Value2>  gcd_type;
 | |
| 
 | |
|         BOOST_STATIC_CONSTANT( static_gcd_type, value = Value1 / gcd_type::value
 | |
|          * Value2 );
 | |
|     };
 | |
| 
 | |
|     // Special case for zero-GCD values
 | |
|     template < >
 | |
|     struct static_lcm_helper_t< 0UL, 0UL >
 | |
|     {
 | |
|         BOOST_STATIC_CONSTANT( static_gcd_type, value = 0UL );
 | |
|     };
 | |
| 
 | |
| }  // namespace detail
 | |
| 
 | |
| 
 | |
| //  Compile-time greatest common divisor evaluator class declaration  --------//
 | |
| 
 | |
| template < static_gcd_type Value1, static_gcd_type Value2 >
 | |
| struct static_gcd : public mpl::integral_c<static_gcd_type, (detail::static_gcd_helper_t<Value1, Value2>::value) >
 | |
| {
 | |
| };  // boost::math::static_gcd
 | |
| 
 | |
| 
 | |
| //  Compile-time least common multiple evaluator class declaration  ----------//
 | |
| 
 | |
| template < static_gcd_type Value1, static_gcd_type Value2 >
 | |
| struct static_lcm : public mpl::integral_c<static_gcd_type, (detail::static_lcm_helper_t<Value1, Value2>::value) >
 | |
| {
 | |
| };  // boost::math::static_lcm
 | |
| 
 | |
| 
 | |
| }  // namespace math
 | |
| }  // namespace boost
 | |
| 
 | |
| 
 | |
| #endif  // BOOST_MATH_COMMON_FACTOR_CT_HPP
 | 
