X-Git-Url: https://ginac.de/ginac.git//ginac.git?a=blobdiff_plain;f=ginac%2Fpolynomial%2Fprimes_factory.h;h=3227ecddb829d57668e7a52b42516d681ab60dc8;hb=63f3e977f92d51ea173382a9b7c4c3b18bda7b8e;hp=093c973759c6673208fac601a0bc26cd89a2488e;hpb=45b1e47372090352ac5af655b32473df2abab23b;p=ginac.git

diff --git a/ginac/polynomial/primes_factory.h b/ginac/polynomial/primes_factory.h
index 093c9737..3227ecdd 100644
--- a/ginac/polynomial/primes_factory.h
+++ b/ginac/polynomial/primes_factory.h
@@ -1,13 +1,36 @@
+/** @file primes_factory.h
+ *
+ *  Factory for prime numbers. */
+
+/*
+ *  GiNaC Copyright (C) 1999-2018 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
+ */
+
 #ifndef GINAC_CHINREM_GCD_PRIMES_FACTORY_H
 #define GINAC_CHINREM_GCD_PRIMES_FACTORY_H
+
+#include "smod_helpers.h"
+#include "debug.h"
+
 #include <cln/integer.h>
 #include <cln/numtheory.h>
 #include <limits>
-#include "smod_helpers.h"
-#include "debug.hpp"
 
-namespace GiNaC
-{
+namespace GiNaC {
 
 /**
  * Find a `big' prime p such that lc mod p != 0. Helper class used by modular
@@ -56,5 +79,4 @@ public:
 
 } // namespace GiNaC
 
-#endif /* GINAC_CHINREM_GCD_PRIMES_FACTORY_H */
-
+#endif // ndef GINAC_CHINREM_GCD_PRIMES_FACTORY_H