模板之小试牛刀---我有点明白为什么这么多人骂c++了(补，补充一些骂点)

上一篇使用了enum来模拟编译时常数，但是c++编译时的常数也是有类型的（c仅仅只有int和double。什么？你居然不知道c语言中sizeof('1')==sizeof(1)？）。所以很多编译器吐出海量的警告是很正常的。不过谁让哥心软，要兼容vc6呢？唉，于是又准备了若干宏，给大家选择编译，另外把代码的版式也规整了一下。如果想在一些比较不标准的编译器上通过编译，那么就要做好接受警告的心理准备。如果你是一位boost综合症的重症患者，是否会觉得下面的菜很合自己的胃口呢？

 

(选择宏STATIC_CONST：选择enum或者static const作为编译期常数定义的方法。前者本质只支持int并且英特尔编译器在做负数转换的时候常常会挂，用作bool判断时编译器会警告，警告的形式各有不同，但是几乎所有的编译器都支持，不报错，兼容性最佳。后者很精确，但是vc6不支持.....)

 

 

上菜咯。

#include <iostream> using namespace std; //#define STATIC_CONST(type, name, value) static const type name = type(value) //Try the one below if your compiler doesn't support static const. #define STATIC_CONST(type, name, value) enum {name = type(value)} //Some compiler will crash so be careful! Warning comes if size_t is not used! STATIC_CONST(size_t, stop_tag, -1); /* Binary search between [M1,M2]*/ template< size_t N, size_t M1 , size_t M2 > //Assert M1<=M2<=N struct sqrt_check { protected: STATIC_CONST(size_t, middle, (M1 + M2)/2); STATIC_CONST(bool, end, (M1 * M1 == N || M2 * M2 == N || M1 == middle || middle * middle == N)); STATIC_CONST(bool, selector, middle * middle > N); public: STATIC_CONST(size_t, result,( N == M1 * M1 ? M1 : N == M2 * M2 ? M2 : M1 == middle ? //|M1-M2|=1, which means M1*M1 <= N < =M2*M2 M1 : N == middle * middle ? //Bsearch begin! middle : selector ? sqrt_check<end ? stop_tag : N, end ? stop_tag : M1, end ? stop_tag : middle>::result : sqrt_check<end ? stop_tag : N, end ? stop_tag : middle, end ? stop_tag : M2>::result) ); }; template<> struct sqrt_check< stop_tag, stop_tag, stop_tag > { STATIC_CONST(size_t, result, stop_tag); //Stop here! }; template < size_t N, size_t M1, size_t M2 > struct sqrt_check_newton { protected: STATIC_CONST(size_t, next, (M1 + N/M1)/2); //newton iterator method STATIC_CONST(bool, end, (next == M1 || next == M2 || next * next== N)); public: STATIC_CONST(size_t, result,( (N == next * next || M1 == next) ? //Fixed Point 不动点 next : M2 == next ? //|M1-M2|=1, which means M1*M1 <= N < =M2*M2 来回摆动 (M2 + M1)/2: sqrt_check_newton<(end ? stop_tag : N), (end ? stop_tag : next), (end ? stop_tag : M1)>::result) ); }; template<> struct sqrt_check_newton< stop_tag, stop_tag, stop_tag > { STATIC_CONST(size_t, result, stop_tag); //Stop here! }; /* Get the sqrt result of N*/ template < size_t N > struct sqrt_nature { // STATIC_CONST(size_t, result, (sqrt_check<N, 1, N/2+1>::result)); //begin searching between [1, N/2+1] STATIC_CONST(size_t, result, (sqrt_check_newton<N, N/2, N>::result)); STATIC_CONST(bool, square, result * result == N); }; template <> struct sqrt_nature< 1 > { STATIC_CONST(size_t, result, 1); STATIC_CONST(bool, square, true); }; template <> struct sqrt_nature< 0 > { STATIC_CONST(size_t, result, 0); STATIC_CONST(bool, square, true); }; /* Check if N % D == 0*/ template< size_t N, size_t D > struct prime_check { protected: STATIC_CONST(bool, mod, N % D == 0); public: STATIC_CONST(bool, prime, ( D == 1 ? true : mod ? false : prime_check<mod ? stop_tag : N , mod ? stop_tag : D - 1>::prime) ); }; template<> struct prime_check< stop_tag , stop_tag > { STATIC_CONST(bool, prime, false); }; /* Check if N is a prime*/ template< size_t N > struct prime_nature { STATIC_CONST(bool, prime, (prime_check<N, sqrt_nature<N>::result>::prime)); STATIC_CONST(bool, composite, !prime); }; template<> struct prime_nature<1> { STATIC_CONST(bool, prime, false); STATIC_CONST(bool, composite, false); }; /* Get the count of prime smaller than N.*/ template< size_t N > struct prime_count_nature { STATIC_CONST(size_t, prime_count, (prime_count_nature<N-1>::prime_count + (prime_nature<N>::prime ? 1 : 0))); STATIC_CONST(size_t, composite_count, N - prime_count - 1); }; template<> struct prime_count_nature< 1 > { STATIC_CONST(size_t, prime_count, 0); STATIC_CONST(size_t, composite_count, 0); }; /* The following 4 macros are used for test. You can uncomment any of 4.*/ #define test(x)/ do{/ if (bool(prime_nature<x>::prime)) / cout<<x<<endl;/ }while(false) //#define test(x) cout<<prime_count_nature<x>::prime_count<<endl //#define test(x) cout<<x<<' '<<(bool(prime_nature<x>::prime) ? "Yes" : "No")<<endl //#define test(x) cout<<x<<' ' <<sqrt_nature<x>::result<<endl /*Test from 1 to N*/ template< size_t N > struct test_nature:public test_nature< N-1 > { test_nature():test_nature< N-1 >(){test(N);} }; template<> struct test_nature< 1 > { test_nature(){test(1);} }; int main() { test_nature<200> x; //vc6.0 will crash for nesting template over 225 // test(8); return 0; }  

 

事实上使用enum时想滤掉那些警告也不是不行，只要你愿意接受把代码变得难懂10倍，到处充斥着莫名其妙的强制转换，呵呵。

 

偷偷告诉你一个小秘密：哥的vc6标准版编译器吐了412个警告，重定向的文件长达1M.

（全剧终。）

 

后记：哥已经休息很长时间了，最近可能又要开忙起来了。这个博客也许很久都不会更新，有问题请留言。