09 May 2025 9:46:53.345 PM test_partial_digest_test(): Fortran90 version. Test test_partial_digest(). I4_UNIFORM_AB_TEST I4_UNIFORM_AB computes pseudorandom values in an interval [A,B]. The lower endpoint A = -100 The upper endpoint B = 200 1 -72 2 -11 3 117 4 177 5 30 6 56 7 69 8 168 9 -48 10 79 11 8 12 65 13 -88 14 79 15 4 16 165 17 -72 18 -11 19 37 20 -4 I4VEC_DISTANCES_TEST I4VEC_DISTANCES computes the pairwise distances between elements of an I4VEC. Locations: 1 0 2 3 3 10 4 20 5 100 Distances: 1 3 2 10 3 20 4 100 5 7 6 17 7 97 8 10 9 90 10 80 I4VEC_HEAP_D_TEST For an I4VEC, I4VEC_HEAP_D puts into descending heap form. Unsorted array: 1 9 2 5 3 3 4 6 5 7 6 10 7 10 8 7 9 1 10 1 Descending heap form: 1 10 2 7 3 10 4 6 5 7 6 3 7 9 8 5 9 1 10 1 I4VEC_PRINT_TEST I4VEC_PRINT prints an I4VEC The I4VEC: 1 91 2 92 3 93 4 94 I4VEC_SORT_HEAP_A_TEST I4VEC_SORT_HEAP_A ascending sorts an I4VEC, Unsorted: 1 46 2 57 3 16 4 34 5 52 6 47 7 19 8 44 9 42 10 3 11 21 12 48 13 28 14 15 15 18 16 53 17 30 18 50 19 40 20 46 Ascending sorted: 1 3 2 15 3 16 4 18 5 19 6 21 7 28 8 30 9 34 10 40 11 42 12 44 13 46 14 46 15 47 16 48 17 50 18 52 19 53 20 57 KSUB_RANDOM_TEST KSUB_RANDOM generates a random K subset of an N set. Set size is N = 5 Subset size is K = 3 2 1 5 5 2 4 5 4 1 2 5 4 4 1 5 2 4 5 3 5 4 1 4 2 2 4 1 5 1 2 example_partial_digest_test: TEST_PARTIAL_DIGEST creates test problems for the partial digest problem. Number of nodes = 6 Maximum distance = 20 Locations: 1 0 2 5 3 8 4 13 5 15 6 20 Distances: 1 2 2 3 3 5 4 5 5 5 6 7 7 7 8 8 9 8 10 10 11 12 12 13 13 15 14 15 15 20 TEST_PARTIAL_DIGEST_TEST: Normal end of execution. 09 May 2025 9:46:53.345 PM