21 January 2020 11:07:17 AM

TEST_PARTIAL_DIGEST_TESTS:

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
  The initial seed is 123456789

         1  -35
         2  187
         3  149
         4  69
         5  25
         6  -81
         7  -23
         8  -67
         9  -87
        10  90
        11  -82
        12  35
        13  20
        14  127
        15  139
        16  -100
        17  170
        18  5
        19  -72
        20  -96

I4VEC_DISTANCES_TEST
  I4VEC_DISTANCES computes the pairwise distances between elements
  of an I4VEC.

  Locations:

       0:        0
       1:        3
       2:       10
       3:       20
       4:      100

  Distances:

       0:        3
       1:       10
       2:       20
       3:      100
       4:        7
       5:       17
       6:       97
       7:       10
       8:       90
       9:       80

I4VEC_HEAP_D_TEST
  I4VEC_HEAP_D turns an integer array into an descending heap;

  Using random seed 123456789

  Unheaped array:

       0:        6
       1:       29
       2:       25
       3:       17
       4:       12
       5:        2
       6:        7
       7:        3
       8:        1
       9:       19
      10:        1
      11:       13
      12:       12
      13:       23
      14:       24
      15:        0
      16:       27
      17:       10
      18:        2
      19:        0
      20:       26
      21:       26
      22:        3
      23:        0
      24:        8
      25:       28
      26:        3
      27:       10
      28:       25
      29:        8

  Descending heaped array:

       0:       29
       1:       27
       2:       28
       3:       17
       4:       26
       5:       25
       6:       25
       7:        6
       8:       10
       9:       19
      10:       26
      11:       13
      12:       12
      13:       23
      14:       24
      15:        0
      16:        3
      17:        1
      18:        2
      19:        0
      20:       12
      21:        1
      22:        3
      23:        0
      24:        8
      25:        2
      26:        3
      27:       10
      28:        7
      29:        8

I4VEC_PRINT_TEST
  I4VEC_PRINT prints an I4VEC

  Here is the I4VEC:

       0:       91
       1:       92
       2:       93
       3:       94

I4VEC_SORT_HEAP_A_TEST
  I4VEC_SORT_HEAP_A sorts an I4VEC;

  Unsorted array:

       0:        2
       1:       10
       2:        9
       3:        6
       4:        4
       5:        0
       6:        2
       7:        1
       8:        0
       9:        6

  Sorted array:

       0:        0
       1:        0
       2:        1
       3:        2
       4:        2
       5:        4
       6:        6
       7:        6
       8:        9
       9:       10

KSUB_RANDOM_TEST
  KSUB_RANDOM generates a random K subset of an N set.
  Set size is N =    52
  Subset size is K = 5

   12   50   44   31   24
    4   15    8    6   35
    4   24   23   40   43
    1   47   20    8    5
   45   44    9    4   17

TEST_PARTIAL_DIGEST_TEST:
  TEST_PARTIAL_DIGEST creates test problems for the
  partial digest problem.

  Number of nodes = 6
  Maximum distance = 20

  Locations:

       0:        0
       1:        5
       2:       12
       3:       17
       4:       19
       5:       20

  Distances:

       0:        1
       1:        2
       2:        3
       3:        5
       4:        5
       5:        7
       6:        7
       7:        8
       8:       12
       9:       12
      10:       14
      11:       15
      12:       17
      13:       19
      14:       20

TEST_PARTIAL_DIGEST_TESTS:
  Normal end of execution.
21 January 2020 11:07:17 AM