3 * Several GCD algorithms. */
6 * GiNaC Copyright (C) 1999-2022 Johannes Gutenberg University Mainz, Germany
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
24 #include "sr_gcd_uvar.h"
25 #include "heur_gcd_uvar.h"
31 upoly sr_gcd(const upoly& a, const upoly& b)
34 bool found = sr_gcd_priv(g, a, b);
38 throw std::runtime_error("failed to compute gcd");
41 bool heur_gcd_z(upoly& g, const upoly& a, const upoly& b)
43 return heur_gcd_z_priv(g, a, b);
46 upoly pseudoremainder(const upoly& a, const upoly& b)
49 pseudoremainder(r, a, b);