Update reference to Robert C. Martin's "Acyclic Visitor" paper.

[ginac.git] / check / exam_cra.cpp

diff --git a/check/exam_cra.cpp b/check/exam_cra.cpp
index f224926d5c5953630e032bc3fa8b167b1644b9aa..76511eee59521a805af9c60a4194e71f609b7faf 100644 (file)
--- a/check/exam_cra.cpp
+++ b/check/exam_cra.cpp
@@ -3,7 +3,7 @@
  *  Test of Chinese remainder algorithm. */
 
 /*
- *  GiNaC Copyright (C) 1999-2009 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2016 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
@@ -32,6 +32,7 @@ using namespace cln;
 #include <map>
 #include <stdexcept>
 #include <vector>
+#include <algorithm>
 using namespace std;
 
 /// Generate a sequences of primes p_i such that \prod_i p_i < limit