17 September 2021 11:54:17.807 PM TEST_PARTIAL_DIGEST_TEST: FORTRAN90 version. 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 45 2 37 3 24 4 46 5 65 6 104 7 86 8 178 9 75 10 -57 11 -29 12 133 13 91 14 -25 15 -69 16 72 17 15 18 -80 19 -41 20 129 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 4 3 5 4 4 5 2 6 6 7 4 8 9 9 10 10 4 Descending heap form: 1 10 2 9 3 6 4 9 5 4 6 5 7 4 8 4 9 4 10 2 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 18 2 47 3 34 4 53 5 51 6 16 7 56 8 50 9 7 10 18 11 1 12 50 13 55 14 1 15 4 16 23 17 36 18 54 19 47 20 35 Ascending sorted: 1 1 2 1 3 4 4 7 5 16 6 18 7 18 8 23 9 34 10 35 11 36 12 47 13 47 14 50 15 50 16 51 17 53 18 54 19 55 20 56 KSUB_RANDOM_TEST KSUB_RANDOM generates a random K subset of an N set. Set size is N = 5 Subset size is K = 3 5 3 4 4 1 5 2 4 1 1 4 2 2 1 5 3 2 1 2 4 1 5 1 4 2 1 5 2 3 5 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 2 3 12 4 17 5 18 6 20 Distances: 1 1 2 2 3 2 4 3 5 5 6 6 7 8 8 10 9 12 10 15 11 16 12 17 13 18 14 18 15 20 TEST_PARTIAL_DIGEST_TEST: Normal end of execution. 17 September 2021 11:54:17.807 PM