Hash :
5b92dd0a
Author :
Date :
2024-01-01T10:31:48
maint: run 'make update-copyright'
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
/* Test a totalorder-like function.
Copyright 2023-2024 Free Software Foundation, Inc.
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 3 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 <stdio.h>
#include "infinity.h"
#include "macros.h"
#include "minus-zero.h"
#include "signed-nan.h"
#include "signed-snan.h"
int
main ()
{
TOTALORDER_TYPE x[] =
{
{ TOTALORDER_NEGATIVE_NAN () },
#if TOTALORDER_HAVE_SNAN
TOTALORDER_NEGATIVE_SNAN (),
#endif
{ -TOTALORDER_INF () },
{ -1e37 },
{ -1 },
{ -1e-5 },
{ TOTALORDER_MINUS_ZERO },
{ 0 },
{ 1e-5 },
{ 1 },
{ 1e37 },
{ TOTALORDER_INF () },
#if TOTALORDER_HAVE_SNAN
TOTALORDER_POSITIVE_SNAN (),
#endif
{ TOTALORDER_POSITIVE_NAN () }
};
int n = SIZEOF (x);
int result = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (!(!!TOTALORDER (&x[i].value, &x[j].value) == (i <= j)))
{
fprintf (stderr, "Failed: i=%d j=%d\n", i, j);
result = 1;
}
return result;
}