Happy New Year!

[ginac.git] / ginac / polynomial / upoly.h

diff --git a/ginac/polynomial/upoly.h b/ginac/polynomial/upoly.h
index bbbb91a7ccb2854e7bed71137c03628ab359ecae..2c59a0038db5b1d2aa4d5c613effe604945e05a9 100644 (file)
--- a/ginac/polynomial/upoly.h
+++ b/ginac/polynomial/upoly.h
@@ -1,19 +1,42 @@
-#ifndef GINAC_NEW_UPOLY_HPP
-#define GINAC_NEW_UPOLY_HPP
-#include <vector>
-#include <cstddef>
+/** @file upoly.h
+ *
+ *  Interface to polynomials with integer and modular coefficients. */
+
+/*
+ *  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
+ */
+
+#ifndef GINAC_UPOLY_H
+#define GINAC_UPOLY_H
+
+#include "ring_traits.h"
+#include "debug.h"
+#include "compiler.h"
+
 #include <cln/integer.h>
-#include <cln/modinteger.h>
 #include <cln/integer_io.h>
-#include <stdexcept>
+#include <cln/modinteger.h>
+#include <cstddef>
 #include <iterator>
 #include <limits>
-#include "ring_traits.h"
-#include "debug.h"
-#include "compiler.h"
+#include <stdexcept>
+#include <vector>
 
-namespace GiNaC
-{
+namespace GiNaC {
 
 typedef std::vector<cln::cl_I> upoly;
 typedef std::vector<cln::cl_MI> umodpoly;
@@ -146,7 +169,7 @@ template<typename T> bool divide(T& p, const typename T::value_type& c)
 
 // Convert Z[x] -> Z/p[x]
 
-static void
+static inline void
 make_umodpoly(umodpoly& up, const upoly& p, const cln::cl_modint_ring& R)
 {
        for (std::size_t i = p.size(); i-- != 0; )
@@ -156,5 +179,4 @@ make_umodpoly(umodpoly& up, const upoly& p, const cln::cl_modint_ring& R)
 
 } // namespace GiNaC
 
-#endif // GINAC_NEW_UPOLY_HPP
-
+#endif // GINAC_UPOLY_H