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 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051
|
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright by The HDF Group. *
* Copyright by the Board of Trustees of the University of Illinois. *
* All rights reserved. *
* *
* This file is part of HDF5. The full HDF5 copyright notice, including *
* terms governing use, modification, and redistribution, is contained in *
* the files COPYING and Copyright.html. COPYING can be found at the root *
* of the source code distribution tree; Copyright.html can be found at the *
* root level of an installed copy of the electronic HDF5 document set and *
* is linked from the top-level documents page. It can also be found at *
* http://hdfgroup.org/HDF5/doc/Copyright.html. If you do not have *
* access to either file, you may request a copy from help@hdfgroup.org. *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/*
Test HDF Heap routines.
REMARKS
DESIGN
BUGS/LIMITATIONS
EXPORTED ROUTINES
AUTHOR
Quincey Koziol
MODIFICATION HISTORY
2/18/03 - Started coding
*/
#include <time.h>
#include <stdlib.h>
#include "testhdf5.h"
#include "H5HPprivate.h"
/* The number of elements in testing arrays */
#define NUM_ELEMS 1000
/* Objects for testing in heaps */
typedef struct test_obj {
H5HP_info_t heap_info; /* Information required for heap. _MUST_ be first */
int val; /* Actual information for object */
} test_obj;
/* Array of random element values */
static test_obj rand_num[NUM_ELEMS];
/* Array of random elements values, sorted in increasing order */
static test_obj inc_sort_num[NUM_ELEMS];
/* Array of random elements values, sorted in decreasing order */
static test_obj dec_sort_num[NUM_ELEMS];
static int tst_dec_sort(const void *_i1, const void *_i2)
{
const test_obj *i1=(const test_obj *)_i1;
const test_obj *i2=(const test_obj *)_i2;
if(i1->val<i2->val)
return(1);
else if(i1->val>i2->val)
return(-1);
return(0);
}
static int tst_inc_sort(const void *_i1, const void *_i2)
{
const test_obj *i1=(const test_obj *)_i1;
const test_obj *i2=(const test_obj *)_i2;
if(i1->val<i2->val)
return(-1);
else if(i1->val>i2->val)
return(1);
return(0);
}
/****************************************************************
**
** test_heap_init(): Test H5HP (heap) code.
** Initialize data for Heap testing
**
****************************************************************/
static void
test_heap_init(void)
{
time_t curr_time; /* Current time, for seeding random number generator */
size_t u; /* Local index variables */
/* Create randomized set of numbers */
curr_time=time(NULL);
HDsrandom((unsigned)curr_time);
for(u=0; u<NUM_ELEMS; u++)
/* Generate random numbers from -1000 to 1000 */
rand_num[u].val=(int)(HDrandom()%2001)-1001;
/* Sort random numbers into increasing order */
HDmemcpy(inc_sort_num,rand_num,sizeof(test_obj)*NUM_ELEMS);
HDqsort(inc_sort_num, (size_t)NUM_ELEMS, sizeof(test_obj), tst_inc_sort);
/* Sort random numbers into decreasing order */
HDmemcpy(dec_sort_num,rand_num,sizeof(test_obj)*NUM_ELEMS);
HDqsort(dec_sort_num, (size_t)NUM_ELEMS, sizeof(test_obj), tst_dec_sort);
} /* end test_tst_init() */
/****************************************************************
**
** test_heap_create(): Test basic H5HP (heap) code.
** Tests creating and closing heaps.
**
****************************************************************/
static void
test_heap_create(void)
{
H5HP_t *heap; /* Heap created */
herr_t ret; /* Generic return value */
/* Output message about test being performed */
MESSAGE(6, ("Testing Creating & Closing Heaps\n"));
/* Try creating a maximum Heap */
heap=H5HP_create(H5HP_MAX_HEAP);
CHECK(heap, NULL, "H5HP_create");
/* Try closing the heap */
ret=H5HP_close(heap);
CHECK(ret, FAIL, "H5HP_close");
/* Try creating a minimum Heap */
heap=H5HP_create(H5HP_MIN_HEAP);
CHECK(heap, NULL, "H5HP_create");
/* Try closing the heap */
ret=H5HP_close(heap);
CHECK(ret, FAIL, "H5HP_close");
} /* end test_heap_create() */
/****************************************************************
**
** test_heap_insert_min(): Test H5HP (heap) code.
** Tests basic inserting objects into minimum heaps.
**
****************************************************************/
static void
test_heap_insert_min(void)
{
H5HP_t *heap; /* Heap created */
ssize_t num; /* Number of elements in heap */
int val; /* Value of object on heap */
test_obj obj1, obj2, obj3; /* Test objects to insert */
herr_t ret; /* Generic return value */
/* Output message about test being performed */
MESSAGE(7, ("Testing Inserting Into Minimum Heaps\n"));
/* Create a Heap */
heap=H5HP_create(H5HP_MIN_HEAP);
CHECK(heap, NULL, "H5HP_create");
/* Check that the heap has no elements */
num=H5HP_count(heap);
VERIFY(num, 0, "H5HP_count");
/* Insert an object into the heap */
obj1.val=100;
ret=H5HP_insert(heap,10,&obj1);
CHECK(ret, FAIL, "H5HP_insert");
/* Check that the heap has one element */
num=H5HP_count(heap);
VERIFY(num, 1, "H5HP_count");
/* Check the minimum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 10, "H5HP_top");
/* Insert another object into the heap, with value less than top element */
obj2.val=50;
ret=H5HP_insert(heap,5,&obj2);
CHECK(ret, FAIL, "H5HP_insert");
/* Check that the heap has two elements */
num=H5HP_count(heap);
VERIFY(num, 2, "H5HP_count");
/* Check the minimum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 5, "H5HP_top");
/* Insert third object into the heap, with value greater than top element */
obj3.val=200;
ret=H5HP_insert(heap,20,&obj3);
CHECK(ret, FAIL, "H5HP_insert");
/* Check that the heap has three elements */
num=H5HP_count(heap);
VERIFY(num, 3, "H5HP_count");
/* Check the minimum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 5, "H5HP_top");
/* Close the heap */
ret=H5HP_close(heap);
CHECK(ret, FAIL, "H5HP_close");
} /* end test_heap_insert_min() */
/****************************************************************
**
** test_heap_insert(): Test H5HP (heap) code.
** Tests basic inserting objects into maximum heaps.
**
****************************************************************/
static void
test_heap_insert_max(void)
{
H5HP_t *heap; /* Heap created */
ssize_t num; /* Number of elements in heap */
int val; /* Value of object on heap */
test_obj obj1, obj2, obj3; /* Test objects to insert */
herr_t ret; /* Generic return value */
/* Output message about test being performed */
MESSAGE(7, ("Testing Inserting Into Maximum Heaps\n"));
/* Create a Heap */
heap=H5HP_create(H5HP_MAX_HEAP);
CHECK(heap, NULL, "H5HP_create");
/* Check that the heap has no elements */
num=H5HP_count(heap);
VERIFY(num, 0, "H5HP_count");
/* Insert an object into the heap */
obj1.val=100;
ret=H5HP_insert(heap,10,&obj1);
CHECK(ret, FAIL, "H5HP_insert");
/* Check that the heap has one element */
num=H5HP_count(heap);
VERIFY(num, 1, "H5HP_count");
/* Check the maximum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 10, "H5HP_top");
/* Insert another object into the heap, with value less than top element */
obj2.val=50;
ret=H5HP_insert(heap,5,&obj2);
CHECK(ret, FAIL, "H5HP_insert");
/* Check that the heap has two elements */
num=H5HP_count(heap);
VERIFY(num, 2, "H5HP_count");
/* Check the maximum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 10, "H5HP_top");
/* Insert third object into the heap, with value greater than top element */
obj3.val=200;
ret=H5HP_insert(heap,20,&obj3);
CHECK(ret, FAIL, "H5HP_insert");
/* Check that the heap has three elements */
num=H5HP_count(heap);
VERIFY(num, 3, "H5HP_count");
/* Check the maximum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 20, "H5HP_top");
/* Close the heap */
ret=H5HP_close(heap);
CHECK(ret, FAIL, "H5HP_close");
} /* end test_heap_insert_max() */
/****************************************************************
**
** test_heap_insert(): Test H5HP (heap) code.
** Tests basic inserting objects into heaps.
**
****************************************************************/
static void
test_heap_insert(void)
{
/* Output message about test being performed */
MESSAGE(6, ("Testing Inserting Into Heaps\n"));
/* Test insertions into minimum & maximum heaps */
test_heap_insert_max();
test_heap_insert_min();
} /* end test_heap_insert() */
/****************************************************************
**
** test_heap_insert_many_core (): Tests H5HP (heap) code.
** "Core" routine called by test_heap_insert_many() routine.
**
****************************************************************/
static void
test_heap_insert_many_core(H5HP_type_t heap_type, test_obj *arr, size_t nelem, int top_val)
{
H5HP_t *heap; /* Heap created */
ssize_t num; /* Number of elements in heap */
int val; /* Value of object on heap */
size_t u; /* Local index variable */
herr_t ret; /* Generic return value */
/* Create a Heap */
heap=H5HP_create(heap_type);
CHECK(heap, NULL, "H5HP_create");
/* Check that the heap has no elements */
num=H5HP_count(heap);
VERIFY(num, 0, "H5HP_count");
/* Insert the array elements into the heap */
for(u=0; u<nelem; u++) {
ret=H5HP_insert(heap,arr[u].val,&arr[u]);
CHECK(ret, FAIL, "H5HP_insert");
} /* end for */
/* Check that the heap has correct number of elements */
num=H5HP_count(heap);
CHECK(num, FAIL, "H5HP_count");
VERIFY((size_t)num, nelem, "H5HP_count");
/* Check the maximum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, top_val, "H5HP_top");
/* Close the heap */
ret=H5HP_close(heap);
CHECK(ret, FAIL, "H5HP_close");
} /* end test_heap_insert_many_core() */
/****************************************************************
**
** test_heap_insert_many (): Test H5HP (heap) code.
** Tests inserting many objects into heaps.
**
****************************************************************/
static void
test_heap_insert_many(void)
{
/* Output message about test being performed */
MESSAGE(6, ("Testing Inserting Many Objects Into Heaps\n"));
/* Test creating a heap from random elements */
test_heap_insert_many_core(H5HP_MAX_HEAP, rand_num, (size_t)NUM_ELEMS, dec_sort_num[0].val);
/* Test creating a heap from elements in increasing order */
test_heap_insert_many_core(H5HP_MAX_HEAP, inc_sort_num, (size_t)NUM_ELEMS, dec_sort_num[0].val);
/* Test creating a heap from elements in decreasing order */
test_heap_insert_many_core(H5HP_MAX_HEAP, dec_sort_num, (size_t)NUM_ELEMS, dec_sort_num[0].val);
/* Test creating a heap from random elements */
test_heap_insert_many_core(H5HP_MIN_HEAP, rand_num, (size_t)NUM_ELEMS, inc_sort_num[0].val);
/* Test creating a heap from elements in increasing order */
test_heap_insert_many_core(H5HP_MIN_HEAP, inc_sort_num, (size_t)NUM_ELEMS, inc_sort_num[0].val);
/* Test creating a heap from elements in decreasing order */
test_heap_insert_many_core(H5HP_MIN_HEAP, dec_sort_num, (size_t)NUM_ELEMS, inc_sort_num[0].val);
} /* end test_heap_insert_many() */
/****************************************************************
**
** test_heap_remove_min(): Test H5HP (heap) code.
** Tests basic removal of objects from minimum heaps.
**
****************************************************************/
static void
test_heap_remove_min(void)
{
H5HP_t *heap; /* Heap created */
ssize_t num; /* Number of elements in heap */
int val; /* Value of object on heap */
void *ptr; /* Pointer for object on heap */
test_obj obj1, obj2, obj3; /* Test objects to insert */
herr_t ret; /* Generic return value */
/* Output message about test being performed */
MESSAGE(7, ("Testing Removing From Minimum Heaps\n"));
/* Create a Heap */
heap=H5HP_create(H5HP_MIN_HEAP);
CHECK(heap, NULL, "H5HP_create");
/* Check that the heap has no elements */
num=H5HP_count(heap);
VERIFY(num, 0, "H5HP_count");
/* Try removing an object from an empty heap */
ret=H5HP_remove(heap,&val,&ptr);
VERIFY(ret, FAIL, "H5HP_remove");
/* Insert an object into the heap */
obj1.val=100;
ret=H5HP_insert(heap,10,&obj1);
CHECK(ret, FAIL, "H5HP_insert");
/* Insert another object into the heap, with value less than top element */
obj2.val=50;
ret=H5HP_insert(heap,5,&obj2);
CHECK(ret, FAIL, "H5HP_insert");
/* Insert third object into the heap, with value greater than top element */
obj3.val=200;
ret=H5HP_insert(heap,20,&obj3);
CHECK(ret, FAIL, "H5HP_insert");
/* Remove first maximum value from heap */
ret=H5HP_remove(heap,&val,&ptr);
CHECK(ret, FAIL, "H5HP_remove");
VERIFY(val, 5, "H5HP_remove");
VERIFY(ptr, &obj2, "H5HP_remove");
/* Remove second maximum value from heap */
ret=H5HP_remove(heap,&val,&ptr);
CHECK(ret, FAIL, "H5HP_remove");
VERIFY(val, 10, "H5HP_remove");
VERIFY(ptr, &obj1, "H5HP_remove");
/* Remove third maximum value from heap */
ret=H5HP_remove(heap,&val,&ptr);
CHECK(ret, FAIL, "H5HP_remove");
VERIFY(val, 20, "H5HP_remove");
VERIFY(ptr, &obj3, "H5HP_remove");
/* Try removing an object from an empty heap */
ret=H5HP_remove(heap,&val,&ptr);
VERIFY(ret, FAIL, "H5HP_remove");
/* Close the heap */
ret=H5HP_close(heap);
CHECK(ret, FAIL, "H5HP_close");
} /* end test_heap_remove_min() */
/****************************************************************
**
** test_heap_remove_max(): Test H5HP (heap) code.
** Tests basic removal of objects from maximum heaps.
**
****************************************************************/
static void
test_heap_remove_max(void)
{
H5HP_t *heap; /* Heap created */
ssize_t num; /* Number of elements in heap */
int val; /* Value of object on heap */
void *ptr; /* Pointer for object on heap */
test_obj obj1, obj2, obj3; /* Test objects to insert */
herr_t ret; /* Generic return value */
/* Output message about test being performed */
MESSAGE(7, ("Testing Removing From Maximum Heaps\n"));
/* Create a Heap */
heap=H5HP_create(H5HP_MAX_HEAP);
CHECK(heap, NULL, "H5HP_create");
/* Check that the heap has no elements */
num=H5HP_count(heap);
VERIFY(num, 0, "H5HP_count");
/* Try removing an object from an empty heap */
ret=H5HP_remove(heap,&val,&ptr);
VERIFY(ret, FAIL, "H5HP_remove");
/* Insert an object into the heap */
obj1.val=100;
ret=H5HP_insert(heap,10,&obj1);
CHECK(ret, FAIL, "H5HP_insert");
/* Insert another object into the heap, with value less than top element */
obj2.val=50;
ret=H5HP_insert(heap,5,&obj2);
CHECK(ret, FAIL, "H5HP_insert");
/* Insert third object into the heap, with value greater than top element */
obj3.val=200;
ret=H5HP_insert(heap,20,&obj3);
CHECK(ret, FAIL, "H5HP_insert");
/* Remove first maximum value from heap */
ret=H5HP_remove(heap,&val,&ptr);
CHECK(ret, FAIL, "H5HP_remove");
VERIFY(val, 20, "H5HP_remove");
VERIFY(ptr, &obj3, "H5HP_remove");
/* Remove second maximum value from heap */
ret=H5HP_remove(heap,&val,&ptr);
CHECK(ret, FAIL, "H5HP_remove");
VERIFY(val, 10, "H5HP_remove");
VERIFY(ptr, &obj1, "H5HP_remove");
/* Remove third maximum value from heap */
ret=H5HP_remove(heap,&val,&ptr);
CHECK(ret, FAIL, "H5HP_remove");
VERIFY(val, 5, "H5HP_remove");
VERIFY(ptr, &obj2, "H5HP_remove");
/* Try removing an object from an empty heap */
ret=H5HP_remove(heap,&val,&ptr);
VERIFY(ret, FAIL, "H5HP_remove");
/* Close the heap */
ret=H5HP_close(heap);
CHECK(ret, FAIL, "H5HP_close");
} /* end test_heap_remove_max() */
/****************************************************************
**
** test_heap_remove(): Test H5HP (heap) code.
** Tests basic removal of objects from minimum & maximum heaps.
**
****************************************************************/
static void
test_heap_remove(void)
{
/* Output message about test being performed */
MESSAGE(6, ("Testing Removing From Heaps\n"));
/* Test removals from minimum & maximum heaps */
test_heap_remove_max();
test_heap_remove_min();
} /* end test_heap_remove() */
/****************************************************************
**
** test_heap_remove_many_core (): Tests H5HP (heap) code.
** "Core" routine called by test_heap_remove_many() routine.
**
****************************************************************/
static void test_heap_remove_many_core(H5HP_type_t heap_type, test_obj *arr, size_t nelem)
{
H5HP_t *heap; /* Heap created */
ssize_t num; /* Number of elements in heap */
int last_val; /* Last value from the heap */
int val; /* Value of object on heap */
test_obj *ptr; /* Pointer for object on heap */
size_t u; /* Local index variable */
herr_t ret; /* Generic return value */
/* Create a Heap */
heap=H5HP_create(heap_type);
CHECK(heap, NULL, "H5HP_create");
/* Check that the heap has no elements */
num=H5HP_count(heap);
VERIFY(num, 0, "H5HP_count");
/* Insert the array elements into the heap */
for(u=0; u<nelem; u++) {
ret=H5HP_insert(heap,arr[u].val,&arr[u]);
CHECK(ret, FAIL, "H5HP_insert");
} /* end for */
/* Check that the heap has correct number of elements */
num=H5HP_count(heap);
CHECK(num, FAIL, "H5HP_count");
VERIFY((size_t)num, nelem, "H5HP_count");
/* Set an appropriate starting value for the "last" value from heap */
if(heap_type==H5HP_MAX_HEAP)
last_val=INT_MAX;
else
last_val=INT_MIN;
/* Remove the objects from the heap */
for(u=0; u<nelem; u++) {
ret=H5HP_remove(heap,&val,(void **)&ptr);
CHECK(ret, FAIL, "H5HP_remove");
VERIFY(val, ptr->val, "H5HP_remove");
/* Check that the value is correct, based on the heap type */
if(heap_type==H5HP_MAX_HEAP) {
if(val>last_val)
TestErrPrintf("Error on line %d: incorrect value from heap=%d, last_val=%d\n",__LINE__,val,last_val);
} /* end if */
else {
if(val<last_val)
TestErrPrintf("Error on line %d: incorrect value from heap=%d, last_val=%d\n",__LINE__,val,last_val);
} /* end else */
/* Update last value */
last_val=val;
} /* end for */
/* Check that the heap has no elements */
num=H5HP_count(heap);
VERIFY(num, 0, "H5HP_count");
/* Insert & remove again, to check that completely empty heaps can be added again */
/* Set an appropriate starting value for the "last" value from heap */
if(heap_type==H5HP_MAX_HEAP)
last_val=INT_MAX;
else
last_val=INT_MIN;
/* Insert the array elements into the heap */
for(u=0; u<nelem; u++) {
ret=H5HP_insert(heap,arr[u].val,&arr[u]);
CHECK(ret, FAIL, "H5HP_insert");
} /* end for */
/* Check that the heap has correct number of elements */
num=H5HP_count(heap);
CHECK(num, FAIL, "H5HP_count");
VERIFY((size_t)num, nelem, "H5HP_count");
/* Remove the objects from the heap */
for(u=0; u<nelem; u++) {
ret=H5HP_remove(heap,&val,(void **)&ptr);
CHECK(ret, FAIL, "H5HP_remove");
VERIFY(val, ptr->val, "H5HP_remove");
/* Check that the value is correct, based on the heap type */
if(heap_type==H5HP_MAX_HEAP) {
if(val>last_val)
TestErrPrintf("Error on line %d: incorrect value from heap=%d, last_val=%d\n",__LINE__,val,last_val);
} /* end if */
else {
if(val<last_val)
TestErrPrintf("Error on line %d: incorrect value from heap=%d, last_val=%d\n",__LINE__,val,last_val);
} /* end else */
/* Update last value */
last_val=val;
} /* end for */
/* Check that the heap has no elements */
num=H5HP_count(heap);
VERIFY(num, 0, "H5HP_count");
/* Close the heap */
ret=H5HP_close(heap);
CHECK(ret, FAIL, "H5HP_close");
} /* end test_heap_remove_many_core() */
/****************************************************************
**
** test_heap_remove_many (): Test H5HP (heap) code.
** Tests removing many objects into heaps.
**
****************************************************************/
static void
test_heap_remove_many(void)
{
/* Output message about test being performed */
MESSAGE(6, ("Testing Removing Many Objects From Heaps\n"));
/* Test removing objects from maximum heap with random elements */
test_heap_remove_many_core(H5HP_MAX_HEAP, rand_num, (size_t)NUM_ELEMS);
/* Test removing objects from maximum heap with elements already sorted in increasing order */
test_heap_remove_many_core(H5HP_MAX_HEAP, inc_sort_num, (size_t)NUM_ELEMS);
/* Test removing objects from maximum heap with elements already sorted in decreasing order */
test_heap_remove_many_core(H5HP_MAX_HEAP, dec_sort_num, (size_t)NUM_ELEMS);
/* Test removing objects from minimum heap with random elements */
test_heap_remove_many_core(H5HP_MIN_HEAP, rand_num, (size_t)NUM_ELEMS);
/* Test removing objects from minimum heap with elements already sorted in increasing order */
test_heap_remove_many_core(H5HP_MIN_HEAP, inc_sort_num, (size_t)NUM_ELEMS);
/* Test removing objects from minimum heap with elements already sorted in decreasing order */
test_heap_remove_many_core(H5HP_MIN_HEAP, dec_sort_num, (size_t)NUM_ELEMS);
} /* end test_heap_remove_many() */
/****************************************************************
**
** test_heap_change_min (): Test H5HP (heap) code.
** Tests changing the priority of an object in a minimum heap
**
****************************************************************/
static void
test_heap_change_min(void)
{
H5HP_t *heap; /* Heap created */
ssize_t num; /* Number of elements in heap */
int val; /* Value of object on heap */
test_obj obj1, obj2, obj3; /* Test objects to insert */
herr_t ret; /* Generic return value */
/* Output message about test being performed */
MESSAGE(7, ("Testing Changing Priority of Objects in Minimum Heaps\n"));
/* Create a Heap */
heap=H5HP_create(H5HP_MIN_HEAP);
CHECK(heap, NULL, "H5HP_create");
/* Check that the heap has no elements */
num=H5HP_count(heap);
VERIFY(num, 0, "H5HP_count");
/* Insert an object into the heap */
obj1.val=100;
ret=H5HP_insert(heap,10,&obj1);
CHECK(ret, FAIL, "H5HP_insert");
/* Insert another object into the heap, with value less than top element */
obj2.val=50;
ret=H5HP_insert(heap,5,&obj2);
CHECK(ret, FAIL, "H5HP_insert");
/* Insert third object into the heap, with value greater than top element */
obj3.val=200;
ret=H5HP_insert(heap,20,&obj3);
CHECK(ret, FAIL, "H5HP_insert");
/* Change priority of first object on heap in way which shouldn't affect heap order */
ret=H5HP_change(heap,11,&obj1);
CHECK(ret, FAIL, "H5HP_change");
/* Check the minimum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 5, "H5HP_top");
/* Change priority of first object on heap to be the top object on the heap */
ret=H5HP_change(heap,3,&obj1);
CHECK(ret, FAIL, "H5HP_change");
/* Check the maximum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 3, "H5HP_top");
/* Change priority of first object on heap to not be the top object on the heap */
ret=H5HP_change(heap,10,&obj1);
CHECK(ret, FAIL, "H5HP_change");
/* Check the maximum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 5, "H5HP_top");
/* Close the heap */
ret=H5HP_close(heap);
CHECK(ret, FAIL, "H5HP_close");
} /* end test_heap_change_min() */
/****************************************************************
**
** test_heap_change_max (): Test H5HP (heap) code.
** Tests changing the priority of an object in a maximumheap
**
****************************************************************/
static void
test_heap_change_max(void)
{
H5HP_t *heap; /* Heap created */
ssize_t num; /* Number of elements in heap */
int val; /* Value of object on heap */
test_obj obj1, obj2, obj3; /* Test objects to insert */
herr_t ret; /* Generic return value */
/* Output message about test being performed */
MESSAGE(7, ("Testing Changing Priority of Objects in Maximum Heaps\n"));
/* Create a Heap */
heap=H5HP_create(H5HP_MAX_HEAP);
CHECK(heap, NULL, "H5HP_create");
/* Check that the heap has no elements */
num=H5HP_count(heap);
VERIFY(num, 0, "H5HP_count");
/* Insert an object into the heap */
obj1.val=100;
ret=H5HP_insert(heap,10,&obj1);
CHECK(ret, FAIL, "H5HP_insert");
/* Insert another object into the heap, with value less than top element */
obj2.val=50;
ret=H5HP_insert(heap,5,&obj2);
CHECK(ret, FAIL, "H5HP_insert");
/* Insert third object into the heap, with value greater than top element */
obj3.val=200;
ret=H5HP_insert(heap,20,&obj3);
CHECK(ret, FAIL, "H5HP_insert");
/* Change priority of first object on heap in way which shouldn't affect heap order */
ret=H5HP_change(heap,11,&obj1);
CHECK(ret, FAIL, "H5HP_change");
/* Check the maximum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 20, "H5HP_top");
/* Change priority of first object on heap to be the top object on the heap */
ret=H5HP_change(heap,21,&obj1);
CHECK(ret, FAIL, "H5HP_change");
/* Check the maximum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 21, "H5HP_top");
/* Change priority of first object on heap to not be the top object on the heap */
ret=H5HP_change(heap,10,&obj1);
CHECK(ret, FAIL, "H5HP_change");
/* Check the maximum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 20, "H5HP_top");
/* Close the heap */
ret=H5HP_close(heap);
CHECK(ret, FAIL, "H5HP_close");
} /* end test_heap_change() */
/****************************************************************
**
** test_heap_change (): Test H5HP (heap) code.
** Tests changing the priority of an object in maximum & minimum heaps
**
****************************************************************/
static void
test_heap_change(void)
{
/* Output message about test being performed */
MESSAGE(6, ("Testing Changing Priority of Objects in Heaps\n"));
/* Test removals from minimum & maximum heaps */
test_heap_change_max();
test_heap_change_min();
} /* end test_heap_change() */
/****************************************************************
**
** test_heap_incdec_min (): Test H5HP (heap) code.
** Tests incrementing & decrementing priority of objects on
** a minimum heap.
**
****************************************************************/
static void
test_heap_incdec_min(void)
{
H5HP_t *heap; /* Heap created */
ssize_t num; /* Number of elements in heap */
int val; /* Value of object on heap */
test_obj obj1, obj2, obj3; /* Test objects to insert */
herr_t ret; /* Generic return value */
/* Output message about test being performed */
MESSAGE(7, ("Testing Incrementing & Decrementing Priority of Objects in Minimum Heaps\n"));
/* Create a Heap */
heap=H5HP_create(H5HP_MIN_HEAP);
CHECK(heap, NULL, "H5HP_create");
/* Check that the heap has no elements */
num=H5HP_count(heap);
VERIFY(num, 0, "H5HP_count");
/* Insert an object into the heap */
obj1.val=100;
ret=H5HP_insert(heap,6,&obj1);
CHECK(ret, FAIL, "H5HP_insert");
/* Insert another object into the heap, with value less than top element */
obj2.val=50;
ret=H5HP_insert(heap,5,&obj2);
CHECK(ret, FAIL, "H5HP_insert");
/* Insert third object into the heap, with value greater than top element */
obj3.val=200;
ret=H5HP_insert(heap,20,&obj3);
CHECK(ret, FAIL, "H5HP_insert");
/* Decrement object one's priority by two to put it on top of the heap */
ret=H5HP_decr(heap, 2, &obj1);
CHECK(ret, FAIL, "H5HP_change");
/* Check the minimum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 4, "H5HP_top");
/* Decrement object two's priority by two to put it back on top of the heap */
ret=H5HP_decr(heap, 2, &obj2);
CHECK(ret, FAIL, "H5HP_change");
/* Check the minimum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 3, "H5HP_top");
/* Increment object two's priority by two to return object one to the top */
ret=H5HP_incr(heap,2,&obj2);
CHECK(ret, FAIL, "H5HP_change");
/* Check the minimum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 4, "H5HP_top");
/* Close the heap */
ret=H5HP_close(heap);
CHECK(ret, FAIL, "H5HP_close");
} /* end test_heap_incdec_min() */
/****************************************************************
**
** test_heap_incdec_max (): Test H5HP (heap) code.
** Tests incrementing & decrementing priority of objects on
** a maximum heap.
**
****************************************************************/
static void
test_heap_incdec_max(void)
{
H5HP_t *heap; /* Heap created */
ssize_t num; /* Number of elements in heap */
int val; /* Value of object on heap */
test_obj obj1, obj2, obj3; /* Test objects to insert */
herr_t ret; /* Generic return value */
/* Output message about test being performed */
MESSAGE(7, ("Testing Incrementing & Decrementing Priority of Objects in Maximum Heaps\n"));
/* Create a Heap */
heap=H5HP_create(H5HP_MAX_HEAP);
CHECK(heap, NULL, "H5HP_create");
/* Check that the heap has no elements */
num=H5HP_count(heap);
VERIFY(num, 0, "H5HP_count");
/* Insert an object into the heap */
obj1.val=100;
ret=H5HP_insert(heap,19,&obj1);
CHECK(ret, FAIL, "H5HP_insert");
/* Insert another object into the heap, with value less than top element */
obj2.val=50;
ret=H5HP_insert(heap,5,&obj2);
CHECK(ret, FAIL, "H5HP_insert");
/* Insert third object into the heap, with value greater than top element */
obj3.val=200;
ret=H5HP_insert(heap,20,&obj3);
CHECK(ret, FAIL, "H5HP_insert");
/* Increment object one's priority by two to put it on top of the heap */
ret=H5HP_incr(heap, 2, &obj1);
CHECK(ret, FAIL, "H5HP_change");
/* Check the maximum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 21, "H5HP_top");
/* Increment object three's priority by two to put it back on top of the heap */
ret=H5HP_incr(heap, 2, &obj3);
CHECK(ret, FAIL, "H5HP_change");
/* Check the maximum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 22, "H5HP_top");
/* Decrement object three's priority by two to return object one to the top */
ret=H5HP_decr(heap,2,&obj3);
CHECK(ret, FAIL, "H5HP_change");
/* Check the maximum value on the heap */
ret=H5HP_top(heap, &val);
CHECK(ret, FAIL, "H5HP_top");
VERIFY(val, 21, "H5HP_top");
/* Close the heap */
ret=H5HP_close(heap);
CHECK(ret, FAIL, "H5HP_close");
} /* end test_heap_incdec_max() */
/****************************************************************
**
** test_heap_incdec (): Test H5HP (heap) code.
** Tests incrementing & decrementing priority of objects on
** maximum & minimum heaps.
**
****************************************************************/
static void
test_heap_incdec(void)
{
/* Output message about test being performed */
MESSAGE(6, ("Testing Incrementing & Decrementing Priority of Objects in Heaps\n"));
/* Test increments & decrements in minimum & maximum heaps */
test_heap_incdec_max();
test_heap_incdec_min();
} /* end test_heap_incdec() */
/****************************************************************
**
** test_heap(): Main H5HP testing routine.
**
****************************************************************/
void
test_heap(void)
{
/* Output message about test being performed */
MESSAGE(5, ("Testing Heaps\n"));
/* Initialize Heap testing data */
test_heap_init();
/* Actual Heap tests */
test_heap_create(); /* Test Heap creation */
test_heap_insert(); /* Test basic Heap insertion */
test_heap_insert_many(); /* Test Heap insertion of many items */
test_heap_remove(); /* Test basic Heap removal */
test_heap_remove_many(); /* Test Heap removal of many items */
test_heap_change(); /* Test changing priority of objects on Heap */
test_heap_incdec(); /* Test incrementing & decrementing priority of objects on Heap */
} /* end test_heap() */
|