x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
ct_gcd_lcm.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\pool\detail\ct_gcd_lcm.hpp
旋转
特效
属性
历史版本
// Copyright (C) 2000 Stephen Cleary // // 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_POOL_CT_GCD_LCM_HPP #define BOOST_POOL_CT_GCD_LCM_HPP #include
#include
namespace boost { namespace details { namespace pool { // Compile-time calculation of greatest common divisor and least common multiple // // ct_gcd is a compile-time algorithm that calculates the greatest common // divisor of two unsigned integers, using Euclid's algorithm. // // assumes: A != 0 && B != 0 // #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION namespace details { template
struct ct_gcd_helper; template
struct ct_gcd_helper
{ BOOST_STATIC_CONSTANT(unsigned, A_mod_B_ = A % B); BOOST_STATIC_CONSTANT(unsigned, value = (::boost::details::pool::details::ct_gcd_helper< B, static_cast
(A_mod_B_), ::boost::type_traits::ice_eq
::value >::value) ); }; template
struct ct_gcd_helper
{ BOOST_STATIC_CONSTANT(unsigned, value = A); }; } // namespace details template
struct ct_gcd { BOOST_STATIC_ASSERT(A != 0 && B != 0); BOOST_STATIC_CONSTANT(unsigned, value = (::boost::details::pool::details::ct_gcd_helper
::value) ); }; #else // Thanks to Peter Dimov for providing this workaround! namespace details { template
struct ct_gcd2 { template
struct helper { BOOST_STATIC_CONSTANT(unsigned, value = ct_gcd2
::helper
::value); }; template<> struct helper<0> { BOOST_STATIC_CONSTANT(unsigned, value = A); }; }; } // namespace details template
struct ct_gcd { BOOST_STATIC_ASSERT(A != 0 && B != 0); enum { value = details::ct_gcd2
::helper
::value }; }; #endif // // ct_lcm is a compile-time algorithm that calculates the least common // multiple of two unsigned integers. // // assumes: A != 0 && B != 0 // template
struct ct_lcm { BOOST_STATIC_CONSTANT(unsigned, value = (A / ::boost::details::pool::ct_gcd
::value * B) ); }; } // namespace pool } // namespace details } // namespace boost #endif
ct_gcd_lcm.hpp
网页地址
文件地址
上一页 1/14
下一页
下载
( 2 KB )
Comments
Total ratings:
0
Average rating:
无评论
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.