X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=ginac%2Fpolynomial%2Fmod_gcd.cpp;h=8084bb993af6e6870f94296b9964472ca1512b06;hp=82d5f427f397abd6b8e6cce68ac84eb6c03a72e5;hb=8cffcdf13d817a47f217f1a1043317d95969e070;hpb=55fcb39a1209898ec43694f7e25ffb4572b0c4d1

diff --git a/ginac/polynomial/mod_gcd.cpp b/ginac/polynomial/mod_gcd.cpp
index 82d5f427..8084bb99 100644
--- a/ginac/polynomial/mod_gcd.cpp
+++ b/ginac/polynomial/mod_gcd.cpp
@@ -1,13 +1,37 @@
-#include "upoly.hpp"
-#include "gcd_euclid.tcc"
-#include "cra_garner.hpp"
-#include <cln/random.h>
+/** @file mod_gcd.cpp
+ *
+ *  Implementation of modular GCD. */
+
+/*
+ *  GiNaC Copyright (C) 1999-2019 Johannes Gutenberg University Mainz, Germany
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+ */
+
+#include "upoly.h"
+#include "gcd_euclid.h"
+#include "cra_garner.h"
+#include "debug.h"
+
 #include <cln/numtheory.h>
+#include <cln/random.h>
 #include <stdexcept>
-#include "debug.hpp"
+#include <algorithm>
+
+namespace GiNaC {
 
-namespace GiNaC
-{
 /**
  * @brief Remove the integer content from univariate polynomials A and B.
  *
@@ -172,4 +196,3 @@ void mod_gcd(upoly& result, upoly A, upoly B)
 }
 
 } // namespace GiNaC
-