Added legacy tests for zeta and multiple polylog.

[ginac.git] / check / exam_inifcns_nstdsums.cpp

diff --git a/check/exam_inifcns_nstdsums.cpp b/check/exam_inifcns_nstdsums.cpp
index 8434fd1e699d28cd3cd1d69506f03b037bd5ddca..ec843da3ab5544ea8b9eda8c0f4c3a8a19d0a541 100644 (file)
--- a/check/exam_inifcns_nstdsums.cpp
+++ b/check/exam_inifcns_nstdsums.cpp
@@ -4,7 +4,7 @@
  *  functions. */
 
 /*
- *  GiNaC Copyright (C) 1999-2004 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2008 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
@@ -18,12 +18,15 @@
  *
  *  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., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
-#include "exams.h"
-
+#include <iostream>
 #include <fstream>
+#include "ginac.h"
+using namespace std;
+using namespace GiNaC;
+
 
 
 ////////////////////////////////////////////////////////////////////////////////
@@ -287,24 +290,97 @@ static unsigned inifcns_test_LiG()
 }
 
 
+////////////////////////////////////////////////////////////////////////////////
+////////////////////////////////////////////////////////////////////////////////
+//  legacy exam - checking for historical bugs
+////////////////////////////////////////////////////////////////////////////////
+////////////////////////////////////////////////////////////////////////////////
+
+
+static unsigned inifcns_test_legacy()
+{
+       Digits = 17;
+       ex prec = 5 * pow(10, -(int)Digits);
+
+       unsigned result = 0;
+
+       ex r1 = zeta(lst(1,1,1,1,1,1),lst(-1,-1,-1,1,1,1));
+       if ((r1.evalf() - numeric("-0.0012588769028204890704")) > prec) {
+               clog << "zeta({1,1,1,1,1,1},{-1,-1,-1,1,1,1}) seems to be wrong." << endl;
+               result++;
+       }
+
+       ex x1 = exp(2*Pi*I/13).evalf();
+       ex x2 = exp(24*Pi*I/13).evalf();
+       ex r2 = Li(lst(2),lst(x1)).hold().evalf();
+       ex r3 = Li(lst(2),lst(x2)).hold().evalf();
+       if ( abs(r2-conjugate(r3)) > prec ) {
+               clog << "Legacy test 2 seems to be wrong." << endl;
+               result++;
+       }
+
+       ex x3 = exp(5*Pi*I/3).evalf();
+       ex r4 = Li(lst(3),lst(x3)).hold().evalf();
+       if ( abs(r4 - numeric("0.40068563438653142847-0.95698384815740185713*I")) > prec ) {
+               clog << "Legacy test 3 seems to be wrong." << endl;
+               result++;
+       }
+
+       Digits = 100;
+       prec = 5 * pow(10, -(int)Digits);
+       ex x0 = 1.;
+          x1 = exp(Pi*I/3).evalf();
+          x2 = exp(2*Pi*I/3).evalf();
+          x3 = -1.;
+       ex x4 = exp(4*Pi*I/3).evalf();
+       ex x5 = exp(5*Pi*I/3).evalf();
+
+       ex r5 = Li(lst(1,1,1,1),lst(x2,x4,x3,x0)).hold().evalf();
+       ex r6 = Li(lst(1,1,1,1),lst(x4,x2,x3,x0)).hold().evalf();
+       if ( abs(r5-conjugate(r6)) > prec ) {
+               clog << "Legacy test 4 seems to be wrong." << endl;
+               result++;
+       }
+
+       ex r7 = Li(lst(1,2,1),lst(x3,x2,x4)).hold().evalf()
+               +Li(lst(1,1,2),lst(x3,x2,x4)).hold().evalf()
+               +Li(lst(1,1,1,1),lst(x3,x0,x2,x4)).hold().evalf()
+               +Li(lst(1,1,1,1),lst(x3,x2,x0,x4)).hold().evalf()
+               +Li(lst(1,1,1,1),lst(x3,x2,x4,x0)).hold().evalf()
+               +Li(lst(1,2,1),lst(x2,x1,x0)).hold().evalf()
+               +Li(lst(1,1,2),lst(x2,x3,x4)).hold().evalf()
+               +Li(lst(1,1,1,1),lst(x2,x4,x3,x0)).hold().evalf()
+               +Li(lst(1,1,1,1),lst(x2,x3,x4,x0)).hold().evalf()
+               +Li(lst(1,1,1,1),lst(x2,x3,x0,x4)).hold().evalf()
+               +Li(lst(2,2),lst(x5,x4)).hold().evalf()
+               +Li(lst(2,1,1),lst(x5,x0,x4)).hold().evalf()
+               +Li(lst(2,1,1),lst(x5,x4,x0)).hold().evalf()
+               -Li(lst(1,1),lst(x3,x0)).hold().evalf()*Li(lst(1,1),lst(x2,x4)).hold().evalf();
+       if ( abs(r7) > prec ) {
+               clog << "Legacy test 5 seems to be wrong." << endl;
+               result++;
+       }
+
+       return result;
+}
+
+
 unsigned exam_inifcns_nstdsums(void)
 {
        unsigned result = 0;
        
        cout << "examining consistency of nestedsums functions" << flush;
-       clog << "----------consistency of nestedsums functions:" << endl;
        
        result += inifcns_test_zeta();
        result += inifcns_test_S();
        result += inifcns_test_HLi();
        result += inifcns_test_LiG();
-       
-       if (!result) {
-               cout << " passed " << endl;
-               clog << "(no output)" << endl;
-       } else {
-               cout << " failed " << endl;
-       }
+       result += inifcns_test_legacy();
        
        return result;
 }
+
+int main(int argc, char** argv)
+{
+       return exam_inifcns_nstdsums();
+}