Commit 43c22e5d1e04272b194673362ac1872ab59cd2a9
2022-05-10T22:07:28
Test: Refactor math suite duplicate code. Many tests were using the same underlying routine, as such three helper functions were added: - A wrapper to test double -> double functions. - A wrapper to test (double, double) -> double functions, - A wrapper for range tests on double -> double functions.
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 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640
diff --git a/test/testautomation_math.c b/test/testautomation_math.c
index 9e3c713..e6ec303 100644
--- a/test/testautomation_math.c
+++ b/test/testautomation_math.c
@@ -27,6 +27,103 @@ typedef struct
double expected;
} dd_to_d;
+/*
+ NB: You cannot create an array of these structures containing INFINITY or NAN.
+ On platforms such as OS/2, they are defined as 'extern const double' making them
+ not compile-time constant.
+*/
+
+/* ================= Test Helpers ================== */
+
+/**
+ * \brief Runs all the cases on a given function with a signature double -> double
+ *
+ * \param func_name, the name of the tested function.
+ * \param func, the function to call.
+ * \param cases, an array of all the cases.
+ * \param cases_size, the size of the cases array.
+ */
+static int
+helper_dtod(const char *func_name, double (*func)(double),
+ const d_to_d *cases, const size_t cases_size)
+{
+ Uint32 i;
+ for (i = 0; i < cases_size; i++) {
+ const double result = func(cases[i].input);
+ SDLTest_AssertCheck(result == cases[i].expected,
+ "%s(%f), expected %f, got %f",
+ func_name,
+ cases[i].input,
+ cases[i].expected, result);
+ }
+
+ return TEST_COMPLETED;
+}
+
+/**
+ * \brief Runs all the cases on a given function with a signature (double, double) -> double
+ *
+ * \param func_name, the name of the tested function.
+ * \param func, the function to call.
+ * \param cases, an array of all the cases.
+ * \param cases_size, the size of the cases array.
+ */
+static int
+helper_ddtod(const char *func_name, double (*func)(double, double),
+ const dd_to_d *cases, const size_t cases_size)
+{
+ Uint32 i;
+ for (i = 0; i < cases_size; i++) {
+ const double result = func(cases[i].x_input, cases[i].y_input);
+ SDLTest_AssertCheck(result == cases[i].expected,
+ "%s(%f,%f), expected %f, got %f",
+ func_name,
+ cases[i].x_input, cases[i].y_input,
+ cases[i].expected, result);
+ }
+
+ return TEST_COMPLETED;
+}
+
+/**
+ * \brief Runs a range of values on a given function with a signature double -> double
+ *
+ * This function is only meant to test functions that returns the input value if it is
+ * integral: f(x) -> x for x in N.
+ *
+ * \param func_name, the name of the tested function.
+ * \param func, the function to call.
+ */
+static int
+helper_range(const char *func_name, double (*func)(double))
+{
+ const Uint32 ITERATIONS = 10000000;
+ const Uint32 STEP = SDL_MAX_UINT32 / ITERATIONS;
+ Uint32 i;
+ double test_value = 0.0;
+
+ SDLTest_AssertPass("%s: Testing a range of %u values with %u steps",
+ func_name, ITERATIONS, STEP);
+
+ for (i = 0; i < ITERATIONS; i++, test_value += STEP) {
+ double result;
+ /* These are tested elsewhere */
+ if (isnan(test_value) || isinf(test_value)) {
+ continue;
+ }
+
+ result = func(test_value);
+ if (result != test_value) { /* Only log failures to save performances */
+ SDLTest_AssertPass("%s(%.1f), expected %.1f, got %.1f",
+ func_name, test_value,
+ test_value, result);
+ return TEST_ABORTED;
+ }
+ }
+
+ return TEST_COMPLETED;
+}
+
/* ================= Test Case Implementation ================== */
/* SDL_floor tests functions */
@@ -58,17 +155,8 @@ floor_infCases(void *args)
static int
floor_zeroCases(void *args)
{
- Uint32 i;
- const double zero_cases[] = { 0.0, -0.0 };
-
- for (i = 0; i < SDL_arraysize(zero_cases); i++) {
- const double result = SDL_floor(zero_cases[i]);
- SDLTest_AssertCheck(result == zero_cases[i],
- "Floor(%.1f), expected %.1f, got %.1f",
- zero_cases[i], zero_cases[i], result);
- }
-
- return TEST_COMPLETED;
+ const d_to_d zero_cases[] = { { 0.0, 0.0 }, { -0.0, -0.0 } };
+ return helper_dtod("Floor", SDL_floor, zero_cases, SDL_arraysize(zero_cases));
}
/**
@@ -90,24 +178,17 @@ floor_nanCase(void *args)
static int
floor_roundNumbersCases(void *args)
{
- Uint32 i;
- const double round_cases[] = {
- 1.0,
- -1.0,
- 15.0,
- -15.0,
- 125.0,
- -125.0,
- 1024.0,
- -1024.0
+ const d_to_d round_cases[] = {
+ { 1.0, 1.0 },
+ { -1.0, -1.0 },
+ { 15.0, 15.0 },
+ { -15.0, -15.0 },
+ { 125.0, 125.0 },
+ { -125.0, -125.0 },
+ { 1024.0, 1024.0 },
+ { -1024.0, -1024.0 }
};
- for (i = 0; i < SDL_arraysize(round_cases); i++) {
- const double result = SDL_floor(round_cases[i]);
- SDLTest_AssertCheck(result == round_cases[i],
- "Floor(%.1f), expected %.1f, got %.1f", round_cases[i],
- round_cases[i], result);
- }
- return TEST_COMPLETED;
+ return helper_dtod("Floor", SDL_floor, round_cases, SDL_arraysize(round_cases));
}
/**
@@ -116,7 +197,6 @@ floor_roundNumbersCases(void *args)
static int
floor_fractionCases(void *args)
{
- Uint32 i;
const d_to_d frac_cases[] = {
{ 1.0 / 2.0, 0.0 },
{ -1.0 / 2.0, -1.0 },
@@ -129,13 +209,7 @@ floor_fractionCases(void *args)
{ 19357.0 / 53.0, 365.0 },
{ -19357.0 / 53.0, -366.0 }
};
- for (i = 0; i < SDL_arraysize(frac_cases); i++) {
- const double result = SDL_floor(frac_cases[i].input);
- SDLTest_AssertCheck(result == frac_cases[i].expected,
- "Floor(%f), expected %.1f, got %f", frac_cases[i].input,
- frac_cases[i].expected, result);
- }
- return TEST_COMPLETED;
+ return helper_dtod("Floor", SDL_floor, frac_cases, SDL_arraysize(frac_cases));
}
/**
@@ -144,29 +218,7 @@ floor_fractionCases(void *args)
static int
floor_rangeTest(void *args)
{
- const Uint32 ITERATIONS = 10000000;
- const Uint32 STEP = SDL_MAX_UINT32 / ITERATIONS;
- Uint32 i;
- double test_value = 0.0;
-
- SDLTest_AssertPass("Floor: Testing a range of %u values with %u steps",
- ITERATIONS, STEP);
-
- for (i = 0; i < ITERATIONS; i++, test_value += STEP) {
- double result;
- /* These are tested elsewhere */
- if (isnan(test_value) || isinf(test_value)) {
- continue;
- }
-
- result = SDL_floor(test_value);
- if (result != test_value) { /* Only log failures to save performances */
- SDLTest_AssertPass("Floor(%.1f), expected %.1f, got %.1f", test_value,
- test_value, result);
- return TEST_ABORTED;
- }
- }
- return TEST_COMPLETED;
+ return helper_range("Floor", SDL_floor);
}
/* SDL_ceil tests functions */
@@ -198,19 +250,8 @@ ceil_infCases(void *args)
static int
ceil_zeroCases(void *args)
{
- double result;
-
- result = SDL_ceil(0.0);
- SDLTest_AssertCheck(0.0 == result,
- "Ceil(%.1f), expected %.1f, got %.1f",
- 0.0, 0.0, result);
-
- result = SDL_ceil(-0.0);
- SDLTest_AssertCheck(-0.0 == result,
- "Ceil(%.1f), expected %.1f, got %.1f",
- -0.0, -0.0, result);
-
- return TEST_COMPLETED;
+ const d_to_d zero_cases[] = { { 0.0, 0.0 }, { -0.0, -0.0 } };
+ return helper_dtod("Ceil", SDL_ceil, zero_cases, SDL_arraysize(zero_cases));
}
/**
@@ -232,24 +273,17 @@ ceil_nanCase(void *args)
static int
ceil_roundNumbersCases(void *args)
{
- Uint32 i;
- const double round_cases[] = {
- 1.0,
- -1.0,
- 15.0,
- -15.0,
- 125.0,
- -125.0,
- 1024.0,
- -1024.0
+ const d_to_d round_cases[] = {
+ { 1.0, 1.0 },
+ { -1.0, -1.0 },
+ { 15.0, 15.0 },
+ { -15.0, -15.0 },
+ { 125.0, 125.0 },
+ { -125.0, -125.0 },
+ { 1024.0, 1024.0 },
+ { -1024.0, -1024.0 }
};
- for (i = 0; i < SDL_arraysize(round_cases); i++) {
- const double result = SDL_ceil(round_cases[i]);
- SDLTest_AssertCheck(result == round_cases[i],
- "Ceil(%.1f), expected %.1f, got %.1f", round_cases[i],
- round_cases[i], result);
- }
- return TEST_COMPLETED;
+ return helper_dtod("Ceil", SDL_ceil, round_cases, SDL_arraysize(round_cases));
}
/**
@@ -258,7 +292,6 @@ ceil_roundNumbersCases(void *args)
static int
ceil_fractionCases(void *args)
{
- Uint32 i;
const d_to_d frac_cases[] = {
{ 1.0 / 2.0, 1.0 },
{ -1.0 / 2.0, -0.0 },
@@ -271,13 +304,7 @@ ceil_fractionCases(void *args)
{ 19357.0 / 53.0, 366.0 },
{ -19357.0 / 53.0, -365.0 }
};
- for (i = 0; i < SDL_arraysize(frac_cases); i++) {
- const double result = SDL_ceil(frac_cases[i].input);
- SDLTest_AssertCheck(result == frac_cases[i].expected,
- "Ceil(%f), expected %.1f, got %f", frac_cases[i].input,
- frac_cases[i].expected, result);
- }
- return TEST_COMPLETED;
+ return helper_dtod("Ceil", SDL_ceil, frac_cases, SDL_arraysize(frac_cases));
}
/**
@@ -286,29 +313,7 @@ ceil_fractionCases(void *args)
static int
ceil_rangeTest(void *args)
{
- const Uint32 ITERATIONS = 10000000;
- const Uint32 STEP = SDL_MAX_UINT32 / ITERATIONS;
- Uint32 i;
- double test_value = 0.0;
-
- SDLTest_AssertPass("Ceil: Testing a range of %u values with %u steps",
- ITERATIONS, STEP);
-
- for (i = 0; i < ITERATIONS; i++, test_value += STEP) {
- double result;
- /* These are tested elsewhere */
- if (isnan(test_value) || isinf(test_value)) {
- continue;
- }
-
- result = SDL_ceil(test_value);
- if (result != test_value) { /* Only log failures to save performances */
- SDLTest_AssertPass("Ceil(%.1f), expected %.1f, got %.1f", test_value,
- test_value, result);
- return TEST_ABORTED;
- }
- }
- return TEST_COMPLETED;
+ return helper_range("Ceil", SDL_ceil);
}
/* SDL_trunc tests functions */
@@ -340,19 +345,8 @@ trunc_infCases(void *args)
static int
trunc_zeroCases(void *args)
{
- double result;
-
- result = SDL_trunc(0.0);
- SDLTest_AssertCheck(0.0 == result,
- "Trunc(%.1f), expected %.1f, got %.1f",
- 0.0, 0.0, result);
-
- result = SDL_trunc(-0.0);
- SDLTest_AssertCheck(-0.0 == result,
- "Trunc(%.1f), expected %.1f, got %.1f",
- -0.0, -0.0, result);
-
- return TEST_COMPLETED;
+ const d_to_d zero_cases[] = { { 0.0, 0.0 }, { -0.0, -0.0 } };
+ return helper_dtod("Trunc", SDL_trunc, zero_cases, SDL_arraysize(zero_cases));
}
/**
@@ -374,24 +368,17 @@ trunc_nanCase(void *args)
static int
trunc_roundNumbersCases(void *args)
{
- Uint32 i;
- const double round_cases[] = {
- 1.0,
- -1.0,
- 15.0,
- -15.0,
- 125.0,
- -125.0,
- 1024.0,
- -1024.0
+ const d_to_d round_cases[] = {
+ { 1.0, 1.0 },
+ { -1.0, -1.0 },
+ { 15.0, 15.0 },
+ { -15.0, -15.0 },
+ { 125.0, 125.0 },
+ { -125.0, -125.0 },
+ { 1024.0, 1024.0 },
+ { -1024.0, -1024.0 }
};
- for (i = 0; i < SDL_arraysize(round_cases); i++) {
- const double result = SDL_trunc(round_cases[i]);
- SDLTest_AssertCheck(result == round_cases[i],
- "Trunc(%.1f), expected %.1f, got %.1f", round_cases[i],
- round_cases[i], result);
- }
- return TEST_COMPLETED;
+ return helper_dtod("Trunc", SDL_trunc, round_cases, SDL_arraysize(round_cases));
}
/**
@@ -400,7 +387,6 @@ trunc_roundNumbersCases(void *args)
static int
trunc_fractionCases(void *args)
{
- Uint32 i;
const d_to_d frac_cases[] = {
{ 1.0 / 2.0, 0.0 },
{ -1.0 / 2.0, -0.0 },
@@ -413,13 +399,7 @@ trunc_fractionCases(void *args)
{ 19357.0 / 53.0, 365.0 },
{ -19357.0 / 53.0, -365.0 }
};
- for (i = 0; i < SDL_arraysize(frac_cases); i++) {
- const double result = SDL_trunc(frac_cases[i].input);
- SDLTest_AssertCheck(result == frac_cases[i].expected,
- "Trunc(%f), expected %.1f, got %f", frac_cases[i].input,
- frac_cases[i].expected, result);
- }
- return TEST_COMPLETED;
+ return helper_dtod("Trunc", SDL_trunc, frac_cases, SDL_arraysize(frac_cases));
}
/**
@@ -428,29 +408,7 @@ trunc_fractionCases(void *args)
static int
trunc_rangeTest(void *args)
{
- const Uint32 ITERATIONS = 10000000;
- const Uint32 STEP = SDL_MAX_UINT32 / ITERATIONS;
- Uint32 i;
- double test_value = 0.0;
-
- SDLTest_AssertPass("Trunc: Testing a range of %u values with %u steps",
- ITERATIONS, STEP);
-
- for (i = 0; i < ITERATIONS; i++, test_value += STEP) {
- double result;
- /* These are tested elsewhere */
- if (isnan(test_value) || isinf(test_value)) {
- continue;
- }
-
- result = SDL_trunc(test_value);
- if (result != test_value) { /* Only log failures to save performances */
- SDLTest_AssertPass("Trunc(%.1f), expected %.1f, got %.1f", test_value,
- test_value, result);
- return TEST_ABORTED;
- }
- }
- return TEST_COMPLETED;
+ return helper_range("Trunc", SDL_trunc);
}
/* SDL_round tests functions */
@@ -482,19 +440,8 @@ round_infCases(void *args)
static int
round_zeroCases(void *args)
{
- double result;
-
- result = SDL_round(0.0);
- SDLTest_AssertCheck(0.0 == result,
- "Round(%.1f), expected %.1f, got %.1f",
- 0.0, 0.0, result);
-
- result = SDL_round(-0.0);
- SDLTest_AssertCheck(-0.0 == result,
- "Round(%.1f), expected %.1f, got %.1f",
- -0.0, -0.0, result);
-
- return TEST_COMPLETED;
+ const d_to_d zero_cases[] = { { 0.0, 0.0 }, { -0.0, -0.0 } };
+ return helper_dtod("Round", SDL_round, zero_cases, SDL_arraysize(zero_cases));
}
/**
@@ -516,24 +463,17 @@ round_nanCase(void *args)
static int
round_roundNumbersCases(void *args)
{
- Uint32 i;
- const double round_cases[] = {
- 1.0,
- -1.0,
- 15.0,
- -15.0,
- 125.0,
- -125.0,
- 1024.0,
- -1024.0
+ const d_to_d round_cases[] = {
+ { 1.0, 1.0 },
+ { -1.0, -1.0 },
+ { 15.0, 15.0 },
+ { -15.0, -15.0 },
+ { 125.0, 125.0 },
+ { -125.0, -125.0 },
+ { 1024.0, 1024.0 },
+ { -1024.0, -1024.0 }
};
- for (i = 0; i < SDL_arraysize(round_cases); i++) {
- const double result = SDL_round(round_cases[i]);
- SDLTest_AssertCheck(result == round_cases[i],
- "Round(%.1f), expected %.1f, got %.1f", round_cases[i],
- round_cases[i], result);
- }
- return TEST_COMPLETED;
+ return helper_dtod("Round", SDL_round, round_cases, SDL_arraysize(round_cases));
}
/**
@@ -542,7 +482,6 @@ round_roundNumbersCases(void *args)
static int
round_fractionCases(void *args)
{
- Uint32 i;
const d_to_d frac_cases[] = {
{ 1.0 / 2.0, 1.0 },
{ -1.0 / 2.0, -1.0 },
@@ -555,13 +494,7 @@ round_fractionCases(void *args)
{ 19357.0 / 53.0, 365.0 },
{ -19357.0 / 53.0, -365.0 }
};
- for (i = 0; i < SDL_arraysize(frac_cases); i++) {
- const double result = SDL_round(frac_cases[i].input);
- SDLTest_AssertCheck(result == frac_cases[i].expected,
- "Round(%f), expected %.1f, got %f", frac_cases[i].input,
- frac_cases[i].expected, result);
- }
- return TEST_COMPLETED;
+ return helper_dtod("Round", SDL_round, frac_cases, SDL_arraysize(frac_cases));
}
/**
@@ -570,29 +503,7 @@ round_fractionCases(void *args)
static int
round_rangeTest(void *args)
{
- const Uint32 ITERATIONS = 10000000;
- const Uint32 STEP = SDL_MAX_UINT32 / ITERATIONS;
- Uint32 i;
- double test_value = 0.0;
-
- SDLTest_AssertPass("Round: Testing a range of %u values with %u steps",
- ITERATIONS, STEP);
-
- for (i = 0; i < ITERATIONS; i++, test_value += STEP) {
- double result;
- /* These are tested elsewhere */
- if (isnan(test_value) || isinf(test_value)) {
- continue;
- }
-
- result = SDL_round(test_value);
- if (result != test_value) { /* Only log failures to save performances */
- SDLTest_AssertPass("Round(%.1f), expected %.1f, got %.1f", test_value,
- test_value, result);
- return TEST_ABORTED;
- }
- }
- return TEST_COMPLETED;
+ return helper_range("Round", SDL_round);
}
/* SDL_fabs tests functions */
@@ -624,19 +535,8 @@ fabs_infCases(void *args)
static int
fabs_zeroCases(void *args)
{
- double result;
-
- result = SDL_fabs(0.0);
- SDLTest_AssertCheck(0.0 == result,
- "Fabs(%.1f), expected %.1f, got %.1f",
- 0.0, 0.0, result);
-
- result = SDL_fabs(-0.0);
- SDLTest_AssertCheck(0.0 == result,
- "Fabs(%.1f), expected %.1f, got %.1f",
- -0.0, 0.0, result);
-
- return TEST_COMPLETED;
+ const d_to_d zero_cases[] = { { 0.0, 0.0 }, { -0.0, 0.0 } };
+ return helper_dtod("Fabs", SDL_fabs, zero_cases, SDL_arraysize(zero_cases));
}
/**
@@ -658,29 +558,7 @@ fabs_nanCase(void *args)
static int
fabs_rangeTest(void *args)
{
- const Uint32 ITERATIONS = 10000000;
- const Uint32 STEP = SDL_MAX_UINT32 / ITERATIONS;
- Uint32 i;
- double test_value = 0.0;
-
- SDLTest_AssertPass("Fabs: Testing a range of %u values with %u steps",
- ITERATIONS, STEP);
-
- for (i = 0; i < ITERATIONS; i++, test_value += STEP) {
- double result;
- /* These are tested elsewhere */
- if (isnan(test_value) || isinf(test_value)) {
- continue;
- }
-
- result = SDL_fabs(test_value);
- if (result != test_value) { /* Only log failures to save performances */
- SDLTest_AssertPass("Fabs(%.1f), expected %.1f, got %.1f", test_value,
- test_value, result);
- return TEST_ABORTED;
- }
- }
- return TEST_COMPLETED;
+ return helper_range("Fabs", SDL_fabs);
}
/* SDL_copysign tests functions */
@@ -722,29 +600,13 @@ copysign_infCases(void *args)
static int
copysign_zeroCases(void *args)
{
- double result;
-
- result = SDL_copysign(0.0, -1.0);
- SDLTest_AssertCheck(-0.0 == result,
- "Copysign(%f,%.1f), expected %f, got %f",
- 0.0, -1.0, -0.0, result);
-
- result = SDL_copysign(0.0, 1.0);
- SDLTest_AssertCheck(0.0 == result,
- "Copysign(%f,%.1f), expected %f, got %f",
- 0.0, 1.0, 0.0, result);
-
- result = SDL_copysign(-0.0, -1.0);
- SDLTest_AssertCheck(-0.0 == result,
- "Copysign(%f,%.1f), expected %f, got %f",
- -0.0, -1.0, -0.0, result);
-
- result = SDL_copysign(-0.0, 1.0);
- SDLTest_AssertCheck(0.0 == result,
- "Copysign(%f,%.1f), expected %f, got %f",
- -0.0, 1.0, 0.0, result);
-
- return TEST_COMPLETED;
+ const dd_to_d zero_cases[] = {
+ { 0.0, 1.0, 0.0 },
+ { 0.0, -1.0, -0.0 },
+ { -0.0, 1.0, 0.0 },
+ { -0.0, -1.0, -0.0 }
+ };
+ return helper_ddtod("Copysign", SDL_copysign, zero_cases, SDL_arraysize(zero_cases));
}
/**