X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=check%2Fexam_cra.cpp;h=94a5b69d596939fe753bd462ce2cc8faae3dae5b;hp=6e247704fac4e9a82ed6d9e2716771e8c0de63dd;hb=f9afb6aca6a971650dff63b11ca8c2ef18506690;hpb=d625a28c3def007a9d2d5108141a6f6a4889bf9d

diff --git a/check/exam_cra.cpp b/check/exam_cra.cpp
index 6e247704..94a5b69d 100644
--- a/check/exam_cra.cpp
+++ b/check/exam_cra.cpp
@@ -1,14 +1,37 @@
-#include <iostream>
+/** @file exam_cra.cpp
+ *
+ *  Test of Chinese remainder algorithm. */
+
+/*
+ *  GiNaC Copyright (C) 1999-2011 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 "polynomial/cra_garner.h"
+
 #include <cln/integer.h>
 #include <cln/integer_io.h>
 #include <cln/random.h>
 #include <cln/numtheory.h>
-#include "polynomial/cra_garner.hpp"
+using namespace cln;
+#include <iostream>
+#include <limits>
 #include <map>
-#include <vector>
 #include <stdexcept>
-#include <limits>
-using namespace cln;
+#include <vector>
 using namespace std;
 
 /// Generate a sequences of primes p_i such that \prod_i p_i < limit
@@ -120,4 +143,3 @@ static void dump(const std::vector<cln::cl_I>& v)
 		std::cerr << v[i] << " ";
 	std::cerr << "]";
 }
-