GoogleTest初探(1)

// Returns true if m and n have no common divisors except 1.
bool MutuallyPrime(int m, int n) { ... }

// Returns the smallest prime common divisor of m and n,
// or 1 when m and n are mutually prime.
int SmallestPrimeCommonDivisor(int m, int n) { ... }

// A predicate-formatter for asserting that two integers are mutually prime.
::testing::AssertionResult AssertMutuallyPrime(const char* m_expr,
                                               const char* n_expr,
                                               int m,
                                               int n) 
{
  if (MutuallyPrime(m, n)) return ::testing::AssertionSuccess();

  return ::testing::AssertionFailure() << m_expr << " and " << n_expr
      << " (" << m << " and " << n << ") are not mutually prime, "
      << "as they have a common divisor " << SmallestPrimeCommonDivisor(m, n);
}

EXPECT_PRED_FORMAT2(AssertMutuallyPrime, b, c);

b and c (4 and 10) are not mutually prime, as they have a common divisor 2.

::testing::StaticAssertTypeEq<T1, T2>();