// obviously e does NOT match the pattern
exmap repls;
bool match_p = e.match(pattern, repls);
- bug_on(match_p, "match(" << e << ", " << pattern << ") says \"Yes\"");
- bug_on(repls.size() != 0,
+ cbug_on(match_p, "match(" << e << ", " << pattern << ") says \"Yes\"");
+ cbug_on(repls.size() != 0,
"failed match have side effects: repls = " << repls);
}
ex pattern = pow(wild(0), -1)*pow(x, wild(2));
exmap repls;
bool match_p = e.match(pattern, repls);
- bug_on(!match_p, "false negative: " << e << " did not match "
+ cbug_on(!match_p, "false negative: " << e << " did not match "
<< pattern);
}
{
upoly r1, r2;
remainder_in_ring(r1, a, g);
- bug_on(!r1.empty(), "bug: " << label << " : gcd g = \"" << g <<
+ cbug_on(!r1.empty(), "bug: " << label << " : gcd g = \"" << g <<
"\"does not divide a =\"" << a << "\"");
remainder_in_ring(r2, b, g);
- bug_on(!r2.empty(), "bug: " << label << " : gcd g = \"" << g <<
+ cbug_on(!r2.empty(), "bug: " << label << " : gcd g = \"" << g <<
"\"does not divide b =\"" << b << "\"");
return true;
}
return false;
gcd_sanity_check(g, a, b, std::string("heur_gcd"));
- bug_on(g != g_check,
+ cbug_on(g != g_check,
"modular and heuristic GCD disagree: " <<
"a = \"" << a << "\", b = \"" << b << "\", " <<
"mod_gcd = \"" << g_check << "\", " <<
bool check() const
{
gcd_sanity_check(g, a, b, std::string("sr_gcd"));
- bug_on(g != g_check,
+ cbug_on(g != g_check,
"modular and PRS GCD disagree: " <<
"a = \"" << a << "\", b = \"" << b << "\", " <<
"mod_gcd = \"" << g_check << "\", " <<
upoly g_gin;
ex2upoly(g_gin, g);
- bug_on(g_gin != g_check, "modular and old PRS GCD disagree: " <<
+ cbug_on(g_gin != g_check, "modular and old PRS GCD disagree: " <<
"a = \"" << a << "\", b = \"" << b << "\", " <<
"old sr_gcd = \"" << g_gin << "\", " <<
"mod_gcd = \"" << g_check << "\"");