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
125
126
127
128
129
130
131
132
|
/* Test file for mpfr_const_euler.
Copyright 2001-2025 Free Software Foundation, Inc.
Contributed by the Pascaline and Caramba projects, INRIA.
This file is part of the GNU MPFR Library.
The GNU MPFR Library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 3 of the License, or (at your
option) any later version.
The GNU MPFR Library 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 Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the GNU MPFR Library; see the file COPYING.LESSER.
If not, see <https://www.gnu.org/licenses/>. */
#include "mpfr-test.h"
/* Wrapper for tgeneric */
static int
my_const_euler (mpfr_ptr x, mpfr_srcptr y, mpfr_rnd_t r)
{
return mpfr_const_euler (x, r);
}
#define RAND_FUNCTION(x) mpfr_set_ui ((x), 0, MPFR_RNDN)
#define TEST_FUNCTION my_const_euler
#include "tgeneric.c"
static void
exercise_Ziv (void)
{
mpfr_t x, y;
int inex;
mpfr_init2 (x, 177);
mpfr_init2 (y, 177);
inex = mpfr_const_euler (x, MPFR_RNDN);
mpfr_set_str_binary (y, "0.10010011110001000110011111100011011111011011000011000111101001001101000110111110001111111000000100000001010100101100101101010110101000011100111011001100001110101111011001011101");
MPFR_ASSERTN(mpfr_equal_p (x, y));
MPFR_ASSERTN(inex > 0);
mpfr_clear (x);
mpfr_clear (y);
}
int
main (int argc, char *argv[])
{
mpfr_t gamma, y, z, t;
unsigned int err, prec, yprec, p0 = 2, p1 = 200;
int rnd;
tests_start_mpfr ();
prec = (argc < 2) ? 53 : atoi(argv[1]);
if (argc > 1)
{
mpfr_init2 (gamma, prec);
mpfr_const_euler (gamma, MPFR_RNDN);
printf("gamma="); mpfr_out_str (stdout, 10, 0, gamma, MPFR_RNDD);
puts ("");
mpfr_clear (gamma);
return 0;
}
exercise_Ziv ();
mpfr_init (y);
mpfr_init (z);
mpfr_init (t);
mpfr_set_prec (y, 32);
mpfr_set_prec (z, 32);
(mpfr_const_euler) (y, MPFR_RNDN);
mpfr_set_str_binary (z, "0.10010011110001000110011111100011");
if (mpfr_cmp (y, z))
{
printf ("Error for prec=32\n");
exit (1);
}
for (prec = p0; prec <= p1; prec++)
{
mpfr_set_prec (z, prec);
mpfr_set_prec (t, prec);
yprec = prec + 10;
RND_LOOP_NO_RNDF (rnd)
{
mpfr_set_prec (y, yprec);
mpfr_const_euler (y, (mpfr_rnd_t) rnd);
err = (rnd == MPFR_RNDN) ? yprec + 1 : yprec;
/* Note: for rnd = RNDF, rnd1 = RNDF is equivalent to rnd1 = RNDN
in mpfr_can_round, thus rnd2 = RNDF reduces to rnd2 = RNDN in that
case, we are duplicating the test for rnd = RNDN. */
if (mpfr_can_round (y, err, (mpfr_rnd_t) rnd, (mpfr_rnd_t) rnd, prec))
{
mpfr_set (t, y, (mpfr_rnd_t) rnd);
mpfr_const_euler (z, (mpfr_rnd_t) rnd);
if (mpfr_cmp (t, z))
{
printf ("results differ for prec=%u rnd_mode=%s\n", prec,
mpfr_print_rnd_mode ((mpfr_rnd_t) rnd));
printf (" got ");
mpfr_out_str (stdout, 2, prec, z, MPFR_RNDN);
puts ("");
printf (" expected ");
mpfr_out_str (stdout, 2, prec, t, MPFR_RNDN);
puts ("");
printf (" approximation was ");
mpfr_dump (y);
exit (1);
}
}
}
}
mpfr_clear (y);
mpfr_clear (z);
mpfr_clear (t);
test_generic (MPFR_PREC_MIN, 200, 1);
tests_end_mpfr ();
return 0;
}
|
