模糊的模板,Code Warrior

时间:2009-09-11 22:38:13

标签: c++ templates portability compilation

以下代码在Visual C ++和gcc中编译,但在Code Warrior

时失败

抱怨是对模板的调用是模糊的 - 不能在doIt(M *)和doIt(M const *)之间做出决定,即使在每种情况下,参数都是明确的成本或非常量。令人激动的是,如果我提供第二个模板参数,它会认为它不再含糊不清。

template< typename T1, typename T2 >
T1 const* doIt( T2 const* );

template< typename T1, typename T2 >
T1* doIt( T2* );

class M {};
class N : public M {};

void f()
{
   M* m1 = NULL;
   M const* m2 = NULL;

   doIt<N>( m1 );    // Fail
   doIt<N>( m2 );    // Fail
   doIt<N,M>( m1 );  // OK
   doIt<N,M>( m2 );  // OK

}

这是Code Warrior编译器的错误吗? (或者使用gcc / Visual C ++时出错)。

1 个答案:

答案 0 :(得分:5)

codewarrior编译器出错。

这是应该发生的事情:

template< typename T1, typename T2 >
T1 const* doIt( T2 const* );   // 1

template< typename T1, typename T2 >
T1* doIt( T2* );  // 2

class M {};
class N : public M {};

void f()
{
  M* m1 = 0;
  M const* m2 = 0;

  doIt<N>( m1 );    
  // In the above call - the compiler does the following (post argument deduction)
  //  1) create a viable set of functions  { N* doIt1<N,M>(const M*) , N* doIt2<N, M>(M*) }
  //  2) check the conversion sequences - M* -> M* is better than M* -> const M*
  //  Since doIt2 has a "better" conversion sequence (hard to beat identity) it wins - no ambiguity


  doIt<N>( m2 );    
  // 1) Viable functions: { doIt1<N,M>(const M*), doIt2<N,const M>(const M*) }
  // 2) Conversion Sequence Ranking: both do identity - so both are good
  // 3) Check to see if the "mother" template of either candidate is more specialized
  //     - Since doIt1 theoretically matches fewer types than doIt2, it is unambiguously more specialized (the standard specifies an algorithm to check this)
  //     - so doIt1 wins
}

希望有所帮助。