Write TPR body as opaque XDR data in big-endian format
[gromacs.git] / src / gromacs / utility / compare.cpp
blob7a32bf107b9c067ba7d99b8d4d4200c8b8fc8a61
1 /*
2 * This file is part of the GROMACS molecular simulation package.
4 * Copyright (c) 1991-2000, University of Groningen, The Netherlands.
5 * Copyright (c) 2001-2004, The GROMACS development team.
6 * Copyright (c) 2013,2014,2015,2016,2017,2018,2019, by the GROMACS development team, led by
7 * Mark Abraham, David van der Spoel, Berk Hess, and Erik Lindahl,
8 * and including many others, as listed in the AUTHORS file in the
9 * top-level source directory and at http://www.gromacs.org.
11 * GROMACS is free software; you can redistribute it and/or
12 * modify it under the terms of the GNU Lesser General Public License
13 * as published by the Free Software Foundation; either version 2.1
14 * of the License, or (at your option) any later version.
16 * GROMACS is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19 * Lesser General Public License for more details.
21 * You should have received a copy of the GNU Lesser General Public
22 * License along with GROMACS; if not, see
23 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
24 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
26 * If you want to redistribute modifications to GROMACS, please
27 * consider that scientific software is very special. Version
28 * control is crucial - bugs must be traceable. We will be happy to
29 * consider code for inclusion in the official distribution, but
30 * derived work must not be called official GROMACS. Details are found
31 * in the README & COPYING files - if they are missing, get the
32 * official version at http://www.gromacs.org.
34 * To help us fund GROMACS development, we humbly ask that you cite
35 * the research papers on the package. Check out http://www.gromacs.org.
37 /* This file is completely threadsafe - keep it that way! */
39 #include "gmxpre.h"
41 #include "compare.h"
43 #include <cmath>
44 #include <cstdio>
45 #include <cstring>
47 #include "gromacs/utility/strconvert.h"
49 void cmp_int(FILE* fp, const char* s, int index, int i1, int i2)
51 if (i1 != i2)
53 if (index != -1)
55 fprintf(fp, "%s[%d] (%d - %d)\n", s, index, i1, i2);
57 else
59 fprintf(fp, "%s (%d - %d)\n", s, i1, i2);
64 void cmp_int64(FILE* fp, const char* s, int64_t i1, int64_t i2)
66 if (i1 != i2)
68 fprintf(fp, "%s (", s);
69 fprintf(fp, "%" PRId64, i1);
70 fprintf(fp, " - ");
71 fprintf(fp, "%" PRId64, i2);
72 fprintf(fp, ")\n");
76 void cmp_us(FILE* fp, const char* s, int index, unsigned short i1, unsigned short i2)
78 if (i1 != i2)
80 if (index != -1)
82 fprintf(fp, "%s[%d] (%hu - %hu)\n", s, index, i1, i2);
84 else
86 fprintf(fp, "%s (%hu - %hu)\n", s, i1, i2);
91 void cmp_uc(FILE* fp, const char* s, int index, unsigned char i1, unsigned char i2)
93 if (i1 != i2)
95 if (index != -1)
97 fprintf(fp, "%s[%d] (%d - %d)\n", s, index, int{ i1 }, int{ i2 });
99 else
101 fprintf(fp, "%s (%d - %d)\n", s, int{ i1 }, int{ i2 });
106 gmx_bool cmp_bool(FILE* fp, const char* s, int index, gmx_bool b1, gmx_bool b2)
108 if (b1 != b2)
110 if (index != -1)
112 fprintf(fp, "%s[%d] (%s - %s)\n", s, index, gmx::boolToString(b1), gmx::boolToString(b2));
114 else
116 fprintf(fp, "%s (%s - %s)\n", s, gmx::boolToString(b1), gmx::boolToString(b2));
119 return b1 && b2;
122 void cmp_str(FILE* fp, const char* s, int index, const char* s1, const char* s2)
124 if (std::strcmp(s1, s2) != 0)
126 if (index != -1)
128 fprintf(fp, "%s[%d] (%s - %s)\n", s, index, s1, s2);
130 else
132 fprintf(fp, "%s (%s - %s)\n", s, s1, s2);
137 gmx_bool equal_real(real i1, real i2, real ftol, real abstol)
139 return ((2 * std::fabs(i1 - i2) <= (fabs(i1) + fabs(i2)) * ftol) || std::fabs(i1 - i2) <= abstol);
142 gmx_bool equal_float(float i1, float i2, float ftol, float abstol)
144 return ((2 * std::fabs(i1 - i2) <= (std::fabs(i1) + std::fabs(i2)) * ftol)
145 || std::fabs(i1 - i2) <= abstol);
148 gmx_bool equal_double(double i1, double i2, real ftol, real abstol)
150 return ((2 * fabs(i1 - i2) <= (fabs(i1) + fabs(i2)) * ftol) || fabs(i1 - i2) <= abstol);
153 void cmp_real(FILE* fp, const char* s, int index, real i1, real i2, real ftol, real abstol)
155 if (!equal_real(i1, i2, ftol, abstol))
157 if (index != -1)
159 fprintf(fp, "%s[%2d] (%e - %e)\n", s, index, i1, i2);
161 else
163 fprintf(fp, "%s (%e - %e)\n", s, i1, i2);
168 void cmp_float(FILE* fp, const char* s, int index, float i1, float i2, float ftol, float abstol)
170 if (!equal_float(i1, i2, ftol, abstol))
172 if (index != -1)
174 fprintf(fp, "%s[%2d] (%e - %e)\n", s, index, i1, i2);
176 else
178 fprintf(fp, "%s (%e - %e)\n", s, i1, i2);
183 void cmp_double(FILE* fp, const char* s, int index, double i1, double i2, double ftol, double abstol)
185 if (!equal_double(i1, i2, ftol, abstol))
187 if (index != -1)
189 fprintf(fp, "%s[%2d] (%16.9e - %16.9e)\n", s, index, i1, i2);
191 else
193 fprintf(fp, "%s (%16.9e - %16.9e)\n", s, i1, i2);