1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
/** @file exam_archive.cpp
*
* Here we test GiNaC's archiving system. */
/*
* GiNaC Copyright (C) 1999-2026 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, see <https://www.gnu.org/licenses/>.
*/
#include "ginac.h"
using namespace GiNaC;
#include <fstream>
#include <iostream>
using namespace std;
#include <cln/cln.h>
unsigned exam_archive()
{
unsigned result = 0;
symbol x("x"), y("y"), mu("mu"), dim("dim", "\\Delta");
ex e, f;
// This expression is complete nonsense but it contains every type of
// GiNaC object
e = -42 * x * pow(y, sin(y*Catalan)) * dirac_ONE()
* epsilon_tensor(idx(fail(), 3), idx(0, 3), idx(y/2, 3))
+ lorentz_g(
varidx(lst{x, -11*y, acos(2*x).series(x==3-5*I, 3)} * color_ONE()
* metric_tensor(varidx(log(cos(128.0/(x*y))), 5), varidx(2, 5)), zeta(3)),
varidx(diag_matrix({-1, Euler, atan(x/y==-15*I/17)})
* delta_tensor(idx(x, 2), idx(wild(7), 3)), zeta(3), true),
true
)
+ dirac_gamma(varidx(mu, dim)) * dirac_gamma(varidx(mu, 4-dim, true))
* color_T(idx(x, 8), 1) * color_h(idx(x, 8), idx(y, 8), idx(2, 8))
* indexed(x, sy_anti(), idx(2*y+1, x), varidx(-mu, 5))
- 2.4275 * spinor_metric(spinidx(0, 2, false, true), spinidx(y))
+ abs(x).series(x == y, 4);
archive ar;
ar.archive_ex(e, "expr 1");
{
std::ofstream fout("exam.gar", std::ios_base::binary);
fout << ar;
}
ar.clear();
{
std::ifstream fin("exam.gar", std::ios_base::binary);
fin >> ar;
}
f = ar.unarchive_ex(lst{x, y, mu, dim}, "expr 1");
ex difference = (f - e).expand();
if (!difference.is_zero()) {
clog << "archiving/unarchiving " << e << endl
<< "erroneously returned " << f << endl;
++result;
}
return result;
}
/** numeric::archive used to fail if the real part of a complex number
* is a rational number and the imaginary part is a floating point one. */
unsigned numeric_complex_bug()
{
using namespace cln;
struct archive_unarchive_check
{
unsigned operator()(const cl_N& n) const
{
ex e = numeric(n);
archive ar;
ar.archive_ex(e, "test");
ex check = ar.unarchive_ex(lst{}, "test");
if (!check.is_equal(e)) {
clog << __FILE__ << ':' << __LINE__ << ": expected: " << e << ", got " << check << endl;
return 1;
}
return 0;
}
} checker;
unsigned result = 0;
const cl_I one(1);
const cl_R three_fp = cl_float(3.0);
std::vector<cl_N> numbers = {
cln::complex(one, one),
cln::complex(one, three_fp),
cln::complex(three_fp, one),
cln::complex(three_fp, three_fp)
};
for (auto & n : numbers) {
result += checker(n);
}
return result;
}
int main(int argc, char** argv)
{
unsigned result = 0;
cout << "examining archiving system" << flush;
result += exam_archive(); cout << '.' << flush;
result += numeric_complex_bug(); cout << '.' << flush;
return result;
}
|
