Prettified source code.

[ginac.git] / ginac / polynomial / pgcd.cpp

diff --git a/ginac/polynomial/pgcd.cpp b/ginac/polynomial/pgcd.cpp
index ddc3b8cb109ef7154cbf36f0202d5663954abb34..6e5e6b2ebc4bbaadc6adc1bcc20401f672d5af9d 100644 (file)
--- a/ginac/polynomial/pgcd.cpp
+++ b/ginac/polynomial/pgcd.cpp
@@ -1,3 +1,25 @@
+/** @file pgcd.cpp
+ *
+ *  GCD for polynomials in prime field. */
+
+/*
+ *  GiNaC Copyright (C) 1999-2009 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 "pgcd.h"
 #include "collect_vargs.h"
 #include "smod_helpers.h"
@@ -6,8 +28,7 @@
 #include "newton_interpolate.h"
 #include "divide_in_z_p.h"
 
-namespace GiNaC
-{
+namespace GiNaC {
 
 extern void
 primpart_content(ex& pp, ex& c, ex e, const exvector& vars, const long p);
@@ -133,4 +154,3 @@ ex pgcd(const ex& A, const ex& B, const exvector& vars, const long p)
 }
 
 } // namespace GiNaC
-