# include <cstdlib>
# include <cmath>
# include <ctime>
# include <iostream>
# include <fstream>
# include <iomanip>
# include <cstring>

using namespace std;

int main ( );
char ch_cap ( char c );
bool ch_eqi ( char c1, char c2 );
int ch_to_digit ( char c );
double cvt_energy ( int ndim, int n, int batch, int sample, bool initialize,
  int sample_num, int *seed, double r[] );
void cvt_sample ( int ndim, int n, int n_now, int sample, bool initialize,
  int *seed, double r[] );
void cvt_write ( int ndim, int n, int batch, int seed_init, int seed,
  char *init_string, int it_max, int it_fixed, int it_num,
  double it_diff, double energy, char *sample_string, int sample_num, double r[],
  string file_out_name );
void data_read ( char *file_in_name, int ndim, int n, double r[] );
char digit_to_ch ( int i );
void find_closest ( int ndim, int n, int sample_num, double s[], double r[],
  int nearest[] );
int get_seed ( );
bool halham_leap_check ( int ndim, int leap[] );
bool halham_n_check ( int n );
bool halham_ndim_check ( int ndim );
bool halham_seed_check ( int ndim, int seed[] );
bool halham_step_check ( int step );
bool halton_base_check ( int ndim, int base[] );
int i4_log_10 ( int i );
int i4_max ( int i1, int i2 );
int i4_min ( int i1, int i2 );
void i4_to_halton_sequence ( int ndim, int n, int step, int seed[], int leap[],
  int base[], double r[] );
char *i4_to_s ( int i );
void mpb ( int ndim, int n, double generator[], int npp );
void points_eps ( string file_name, int ndim, int node_num, double node_xy[],
  string title );
int prime ( int n );
double r8_epsilon ( );
double r8_huge ( );
double r8_max ( double x, double y );
double r8_min ( double x, double y );
void r8mat_uniform_01 ( int m, int n, int *seed, double r[] );
unsigned long random_initialize ( unsigned long seed );
bool s_eqi ( char *s1, char *s2 );
int s_len_trim ( char* s );
double s_to_r8 ( char *s, int *lchar, bool *error );
bool s_to_r8vec ( char *s, int n, double rvec[] );
void timestamp ( );
char *timestring ( );
void tuple_next_fast ( int m, int n, int rank, int x[] );

//****************************************************************************80

int main ( )

//****************************************************************************80
//
//  Purpose:
//
//    MAIN is the main program for CCVT_BOX.
//
//  Discussion:
//
//    CCVT_BOX does a CVT calculation with points forced to the boundary.
//
//    This code essentially carries out a standard CVT iteration, but
//    at the end of every iteration, the CVT generators are modified
//    by replacing points that are near the boundary by their projections
//    on the boundary.  The goal is to get a set of points with the
//    good distribution properties of a CVT, but which also "mesh" the
//    boundary.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    03 December 2004
//
//  Author:
//
//    Lili Ju
//
//  Local parameters:
//
//    Local, double AV_POINTS(2,N), used to store the running
//    total and then average of the sample points closest to each
//    generator.
//
//    Local, double BETA(2), coefficients that determine the
//    form of the CVT update method.
//
//    Local, int COUNT(2,N), counts the number of sample points that
//    were nearest to each generator.
//
//    Local, double GENERATOR(2,N), the coordinates of the
//    CVT generators.
//
//    Local, int IT_MAX, the number of CVT iterations to carry out.
//    (the user specifies this.)
//
//    Local, int N, the number of generators (the user specifies this).
//
//    Local, int NPP, the number of subintervals into which the
//    perimeter of the box is to be divided, as part of the projection
//    scheme that sends some interior points to the boundary.
//
//    Local, int SAMPLE_NUM, the total number of sampling points to generate
//    on one CVT iteration.  (The user specifies this.)
//
//    Local, int SEED, a seed for the random number generator.
//
{
# define NDIM 2

  double *av_points;
  int batch;
  int *count;
  bool DEBUG = true;
  double energy;
  double energy2;
  double *generator;
  int i;
  int init;
  char init_string[80];
  bool initialize;
  double it_diff;
  int it_fixed;
  int it_max;
  int it_num;
  int j;
  int n;
  int nearest[1];
  int npp;
  double s[NDIM];
  int sample;
  int sample_num;
  char sample_string[80];
  int seed;
  int seed_init = 123456789;
  int seed_iter;

  timestamp ( );
  cout << "\n";
  cout << "CCVT_BOX:\n";
  cout << "\n";
  cout << "  Compiled on " << __DATE__ << " at " << __TIME__ << ".\n";
  cout << "\n";
  cout << "  Generate a constrained CVT dataset.\n";
//
//  Get some input from the user.
//
  cout << "\n";
  cout << "  Default NDIM = " << NDIM << "\n";

  cout << "\n";
  cout << "  N is the number of points to generate.\n";
  cout << "  (Try '100' if you have no preference.)\n";
  cout << "  (Any value less than 1 terminates execution.)\n";

  cin >> n;
  cout << "  User input N = " << n << "\n";

  if ( n < 1 )
  {
    cout << "\n";
    cout << "CCVT_BOX\n";
    cout << "  The input value of N = " << n << "\n";
    cout << "  is interpreted as a request for termination.\n";
    cout << "  Normal end of execution.\n";
    exit ( 1 );
  }

  cout << "\n";
  cout << "  NPP is the number of sample points used to\n";
  cout << "  check the boundary.\n";
  cout << "  (Try '1000' if you have no preference.)\n";
  cout << "  (Any value less than 1 terminates execution.)\n";

  cin >> npp;
  cout << "  User input NPP = " << npp << "\n";

  if ( n < 1 )
  {
    cout << "\n";
    cout << "CCVT_BOX\n";
    cout << "  The input value of N = " << n << "\n";
    cout << "  is interpreted as a request for termination.\n";
    cout << "  Normal end of execution.\n";
    exit ( 1 );
  }

  cout << "  Default SEED = " << seed_init << "\n";

  strcpy ( init_string, "RAND" );
  init = -1;

  cout << "  Default INIT = \"" << init_string << "\".\n";

  cout << "\n";
  cout << "  IT_MAX is the maximum number of iterations.\n";
  cout << "\n";
  cout << "  An iteration carries out the following steps:\n";
  cout << "  * the Voronoi region associated with each\n";
  cout << "    generator is estimated by sampling;\n";
  cout << "  * the centroid of each Voronoi region is estimated.\n";
  cout << "  * the generator is replaced by the centroid.\n";
  cout << "\n";
  cout << "  If ""enough"" sampling points are used,\n";
  cout << "  and ""enough"" iterations are taken, this process\n";
  cout << "  will converge.\n";
  cout << "\n";
  cout << "  (Try '50' if you have no preference.)\n";
  cout << "  (A negative value terminates execution).\n";
  cout << "\n";
  cout << "  Enter IT_MAX:\n";

  cin >> it_max;
  cout << "  User input IT_MAX = " << it_max << "\n";

  if ( it_max < 0 )
  {
    cout << "\n";
    cout << "CCVT_BOX\n";
    cout << "  The input value of IT_MAX = " << it_max << "\n";
    cout << "  is interpreted as a request for termination.\n";
    cout << "  Normal end of execution.\n";
    exit ( 1 );
  }

  it_fixed = 1;
  cout << "  Default IT_FIXED = " << it_fixed << "\n";

  strcpy ( sample_string, "RAND" );
  sample = -1;

  cout << "  Default SAMPLE = \"" << sample_string << "\".\n";

  cout << "\n";
  cout << "  SAMPLE_NUM is the number of sample points.\n";
  cout << "\n";
  cout << "  The Voronoi regions will be explored by generating\n";
  cout << "  SAMPLE_NUM points.  For each sample point, the\n";
  cout << "  nearest generator is found.  Using more points\n";
  cout << "  gives a better estimate of these regions.\n";
  cout << "\n";
  cout << "  SAMPLE_NUM should be much larger than N, the\n";
  cout << "  number of generators.\n";
  cout << "\n";
  cout << "  (Try '10000' if you have no preference.)\n";
  cout << "  (A zero or negative value terminates execution.)\n";
  cout << "\n";

  cin >> sample_num;
  cout << "  User input SAMPLE_NUM = " << sample_num << "\n";

  if ( sample_num <= 0 )
  {
    cout << "\n";
    cout << "CCVT_BOX\n";
    cout << "  The input value of SAMPLE_NUM = " << sample_num << "\n";
    cout << "  is interpreted as a request for termination.\n";
    cout << "  Normal end of execution.\n";
    exit ( 1 );
  }

  batch = 1000;
  cout << "  Default BATCH = " << batch << "\n";
//
//  Allocate space.
//
  av_points = new double[2*n];
  count = new int[n];
  generator = new double[NDIM*n];

  if ( DEBUG )
  {
    cout << "\n";
    cout << "                            Energy         Energy after\n";
    cout << "  Iteration     Seed        of CVT         projection\n";
    cout << "\n";
  }
//
//  Initialize the generators by randomly sampling the region.
//
  seed_iter = seed_init;

  seed = seed_iter;

  initialize = true;
  cvt_sample ( NDIM, n, n, init, initialize, &seed, generator );

  if ( sample == init )
  {
    initialize = false;
  }
  else
  {
    initialize = true;
  }

  seed = seed_iter;

  energy = cvt_energy ( NDIM, n, batch, sample, initialize, sample_num, &seed,
    generator );

  mpb ( NDIM, n, generator, npp );

  seed = seed_iter;
  it_num = 0;
  it_diff = 0.0;

  energy2 = cvt_energy ( NDIM, n, batch, sample, initialize, sample_num, &seed,
    generator );

  cout << "  "
       << setw(6)  << it_num    << "  "
       << setw(12) << seed_iter << "  "
       << setw(14) << energy    << "  "
       << setw(14) << energy2   << "\n";

  cvt_write ( NDIM, n, batch, seed_init, seed, init_string, it_max,
    it_fixed, it_num, it_diff, energy2, sample_string, sample_num, generator,
    "initial.txt" );

  points_eps ( "initial.eps", NDIM, n, generator, "Initial generators" );
//
//   Start the iteration.
//
  for ( it_num = 1; it_num <= it_max; it_num++ )
  {
//
//  Sample the region.
//
    seed_iter = seed;
    for ( j = 0; j < n; j++ )
    {
      for ( i = 0; i < NDIM; i++ )
      {
        av_points[i+j*NDIM] = 0.0;
      }
    }
    for ( j = 0; j < n; j++ )
    {
      count[j] = 0;
    }

    for ( j = 0; j < sample_num; j++ )
    {
      cvt_sample ( NDIM, sample_num, 1, sample, initialize, &seed, s );

      find_closest ( NDIM, n, 1, s, generator, nearest );

      for ( i = 0; i < NDIM; i++ )
      {
        av_points[i+nearest[0]*NDIM] = av_points[i+nearest[0]*NDIM] + s[i];
      }

      count[nearest[0]] = count[nearest[0]] + 1;
    }
//
//  Replace the generators by the average of the sample points.
//
    for ( j = 0; j < n; j++ )
    {
      if ( count[j] != 0 )
      {
        for ( i = 0; i < NDIM; i++ )
        {
          generator[i+j*NDIM] = av_points[i+j*NDIM] / ( double ) ( count[j] );
        }
      }
    }

    seed = seed_iter;

    energy = cvt_energy ( NDIM, n, batch, sample, initialize, sample_num,
      &seed, generator );
//
//  Apply Lili's projection method.
//  In this case, the energy is changed, so it must be recalculated.
//
    mpb ( NDIM, n, generator, npp );

    seed = seed_iter;

    energy2 = cvt_energy ( NDIM, n, batch, sample, initialize, sample_num,
      &seed, generator );

    cout << "  "
         << setw(6)  << it_num    << "  "
         << setw(12) << seed_iter << "  "
         << setw(14) << energy    << "  "
         << setw(14) << energy2   << "\n";
  }
//
//  Write out the final points.
//
  cvt_write ( NDIM, n, batch, seed_init, seed, init_string, it_max,
    it_fixed, it_num, it_diff, energy2, sample_string, sample_num, generator,
    "final.txt" );

  points_eps ( "final.eps", NDIM, n, generator, "Final generators" );
//
//  Deallocate memory.
//
  delete [] av_points;
  delete [] count;
  delete [] generator;
//
//  Terminate.
//
  cout << "\n";
  cout << "CCVT_BOX:\n";
  cout << "  Normal end of execution.\n";
  cout << "\n";
  timestamp ( );

  return ( 0 );
# undef NDIM
}
//****************************************************************************80*

char ch_cap ( char c )

//****************************************************************************80*
//
//  Purpose:
//
//    CH_CAP capitalizes a single character.
//
//  Discussion:
//
//    This routine should be equivalent to the library "toupper" function.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    19 July 1998
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, char C, the character to capitalize.
//
//    Output, char CH_CAP, the capitalized character.
//
{
  if ( 97 <= c && c <= 122 )
  {
    c = c - 32;
  }

  return c;
}
//****************************************************************************80*

bool ch_eqi ( char c1, char c2 )

//****************************************************************************80*
//
//  Purpose:
//
//    CH_EQI is true if two characters are equal, disregarding case.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    13 June 2003
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, char C1, char C2, the characters to compare.
//
//    Output, bool CH_EQI, is true if the two characters are equal,
//    disregarding case.
//
{
  if ( 97 <= c1 && c1 <= 122 )
  {
    c1 = c1 - 32;
  }
  if ( 97 <= c2 && c2 <= 122 )
  {
    c2 = c2 - 32;
  }

  return ( c1 == c2 );
}
//****************************************************************************80

int ch_to_digit ( char c )

//****************************************************************************80
//
//  Purpose:
//
//    CH_TO_DIGIT returns the integer value of a base 10 digit.
//
//  Example:
//
//     C   DIGIT
//    ---  -----
//    '0'    0
//    '1'    1
//    ...  ...
//    '9'    9
//    ' '    0
//    'X'   -1
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    13 June 2003
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, char C, the decimal digit, '0' through '9' or blank are legal.
//
//    Output, int CH_TO_DIGIT, the corresponding integer value.  If C was
//    'illegal', then DIGIT is -1.
//
{
  int digit;
//
  if ( '0' <= c && c <= '9' )
  {
    digit = c - '0';
  }
  else if ( c == ' ' )
  {
    digit = 0;
  }
  else
  {
    digit = -1;
  }

  return digit;
}
//****************************************************************************80

double cvt_energy ( int ndim, int n, int batch, int sample, bool initialize,
  int sample_num, int *seed, double r[] )

//****************************************************************************80
//
//  Purpose:
//
//    CVT_ENERGY computes the CVT energy of a dataset.
//
//  Discussion:
//
//    For a given number of generators, a CVT is a minimizer (or at least
//    a local minimizer) of the CVT energy.  During a CVT iteration,
//    it should generally be the case that the CVT energy decreases from
//    step to step, and that perturbations or adjustments of an
//    approximate CVT will almost always have higher CVT energy.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    03 December 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int NDIM, the spatial dimension.
//
//    Input, int N, the number of generators.
//
//    Input, int BATCH, the maximum number of sample points to generate
//    at one time.
//
//    Input, int SAMPLE, specifies how the sampling is done.
//    -1, 'RANDOM', using FORTRAN RANDOM function;
//     0, 'UNIFORM', using a simple uniform RNG;
//     1, 'HALTON', from a Halton sequence;
//     2, 'GRID', points from a grid;
//
//    Input, bool INITIALIZE, is TRUE if the pseudorandom process
//    should be reinitialized.
//
//    Input, int SAMPLE_NUM, the number of sample points to use.
//
//    Input/output, int *SEED, a seed for the random number generator.
//
//    Input, double R[NDIM*N], the coordinates of the points.
//
//    Output, double CVT_ENERGY, the estimated CVT energy.
//
{
  double energy;
  int get;
  int have;
  int i;
  int j;
  int *nearest;
  double *s;

  nearest = new int[batch];
  s = new double [ndim*batch];

  have = 0;
  energy = 0.0;

  while ( have < sample_num )
  {
    get = i4_min ( sample_num - have, batch );

    cvt_sample ( ndim, sample_num, get, sample, initialize, seed, s );

    have = have + get;

    find_closest ( ndim, n, get, s, r, nearest );

    for ( j = 0; j < get; j++ )
    {
      for ( i = 0; i < ndim; i++ )
      {
        energy = energy + ( s[i+j*ndim] - r[i+nearest[j]*ndim] )
                        * ( s[i+j*ndim] - r[i+nearest[j]*ndim] );
      }
    }

  }

  energy = energy / ( double ) ( sample_num );

  delete [] nearest;
  delete [] s;

  return energy;
}
//****************************************************************************80

void cvt_sample ( int ndim, int n, int n_now, int sample, bool initialize,
  int *seed, double r[] )

//****************************************************************************80
//
//  Purpose:
//
//    CVT_SAMPLE returns sample points.
//
//  Discussion:
//
//    N sample points are to be taken from the unit box of dimension NDIM.
//
//    These sample points are usually created by a pseudorandom process
//    for which the points are essentially indexed by a quantity called
//    SEED.  To get N sample points, we generate values with indices
//    SEED through SEED+N-1.
//
//    It may not be practical to generate all the sample points in a
//    single call.  For that reason, the routine allows the user to
//    request a total of N points, but to require that only N_NOW be
//    generated now (on this call).
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    23 August 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int NDIM, the spatial dimension.
//
//    Input, int N, the number of Voronoi cells.
//
//    Input, int N_NOW, the number of sample points to be generated
//    on this call.  N_NOW must be at least 1.
//
//    Input, int SAMPLE, specifies how the sampling is done.
//    -1, 'RANDOM', using C++ RANDOM function;
//     0, 'UNIFORM', using a simple uniform RNG;
//     1, 'HALTON', from a Halton sequence;
//     2, 'GRID', points from a grid;
//
//    Input, bool INITIALIZE, is TRUE if the pseudorandom process should be
//    reinitialized.
//
//    Input/output, int *SEED, the random number seed.
//
//    Output, double R[NDIM*N_NOW], the sample points.
//
{
  double exponent;
  static int *halton_base = NULL;
  static int *halton_leap = NULL;
  static int *halton_seed = NULL;
  int halton_step;
  int i;
  int j;
  static int ngrid;
  static int rank;
  int rank_max;
  static int *tuple = NULL;

  if ( n_now < 1 )
  {
    cout << "\n";
    cout << "CVT_SAMPLE - Fatal error!\n";
    cout << "  N_NOW < 1.\n";
    exit ( 1 );
  }

  if ( sample == -1 )
  {
    if ( initialize )
    {
      random_initialize ( ( unsigned long ) seed );
    }

    for ( j = 0; j < n_now; j++ )
    {
      for ( i = 0; i < ndim; i++ )
      {
        r[i+j*ndim] = ( double ) random ( ) / ( double ) RAND_MAX;
      }
    }
    *seed = *seed + n_now * ndim;
  }
  else if ( sample == 0 )
  {
    r8mat_uniform_01 ( ndim, n_now, seed, r );
  }
  else if ( sample == 1 )
  {
    halton_seed = new int[ndim];
    halton_leap = new int[ndim];
    halton_base = new int[ndim];

    halton_step = *seed;

    for ( i = 0; i < ndim; i++ )
    {
      halton_seed[i] = 0;
    }

    for ( i = 0; i < ndim; i++ )
    {
      halton_leap[i] = 1;
    }

    for ( i = 0; i < ndim; i++ )
    {
      halton_base[i] = prime ( i + 1 );
    }

    i4_to_halton_sequence ( ndim, n_now, halton_step, halton_seed, halton_leap,
      halton_base, r );

    delete [] halton_seed;
    delete [] halton_leap;
    delete [] halton_base;

    *seed = *seed + n_now;
  }
  else if ( sample == 2 )
  {
    exponent = 1.0 / ( double ) ( ndim );
    ngrid = ( int ) pow ( ( double ) n, exponent );
    rank_max = ( int ) pow ( ( double ) ngrid, ( double ) ndim );
    tuple = new int[ndim];

    if ( rank_max < n )
    {
      ngrid = ngrid + 1;
      rank_max = ( int ) pow ( ( double ) ngrid, ( double ) ndim );
    }

    if ( initialize )
    {
      rank = -1;
      tuple_next_fast ( ngrid, ndim, rank, tuple );
    }

    rank = ( *seed ) % rank_max;

    for ( j = 0; j < n_now; j++ )
    {
      tuple_next_fast ( ngrid, ndim, rank, tuple );
      rank = rank + 1;
      rank = rank % rank_max;
      for ( i = 0; i < ndim; i++ )
      {
        r[i+j*ndim] = double ( 2 * tuple[i] - 1 ) / double ( 2 * ngrid );
      }
    }
    delete [] tuple;
    *seed = *seed + n_now;
  }
  else
  {
    cout << "\n";
    cout << "CVT_SAMPLE - Fatal error!\n";
    cout << "  The value of SAMPLE = " << sample << " is illegal.\n";
    exit ( 1 );
  }

  return;
}
//****************************************************************************80

void cvt_write ( int ndim, int n, int batch, int seed_init, int seed,
  char *init_string, int it_max, int it_fixed, int it_num,
  double it_diff, double energy, char *sample_string, int sample_num, double r[],
  string file_out_name )

//****************************************************************************80
//
//  Purpose:
//
//    CVT_WRITE writes a CVT dataset to a file.
//
//  Discussion:
//
//    The initial lines of the file are comments, which begin with a
//    "#" character.
//
//    Thereafter, each line of the file contains the M-dimensional
//    components of the next entry of the dataset.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    17 November 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int NDIM, the spatial dimension.
//
//    Input, int N, the number of points.
//
//    Input, int BATCH, sets the maximum number of sample points
//    generated at one time.  It is inefficient to generate the sample
//    points 1 at a time, but memory intensive to generate them all
//    at once.  You might set BATCH to min ( SAMPLE_NUM, 10000 ), for instance.
//
//    Input, int SEED_INIT, the initial random number seed.
//
//    Input, int SEED, the current random number seed.
//
//    Input, char *INIT_STRING, specifies how the initial
//    generators are chosen:
//    filename, by reading data from a file;
//    'GRID', picking points from a grid;
//    'HALTON', from a Halton sequence;
//    'RANDOM', using the C++ RANDOM function;
//    'UNIFORM', using a simple uniform RNG;
//
//    Input, int IT_MAX, the maximum number of iterations allowed.
//
//    Input, int IT_FIXED, the number of iterations to take with a
//    fixed set of sample points.
//
//    Input, int IT_NUM, the actual number of iterations taken.
//
//    Input, double IT_DIFF, the L2 norm of the change
//    in the CVT coordinates on the last iteration.
//
//    Input, double *ENERGY,  the discrete "energy", divided
//    by the number of sample points.
//
//    Input, char *SAMPLE_STRING, specifies how the region is sampled:
//    'GRID', picking points from a grid;
//    'HALTON', from a Halton sequence;
//    'RANDOM', using the C++ RANDOM function;
//    'UNIFORM', using a simple uniform RNG;
//
//    Input, int SAMPLE_NUM, the number of sampling points used on
//    each iteration.
//
//    Input, double R(NDIM,N), the points.
//
//    Input, string FILE_OUT_NAME, the name of the output file.
//
{
  ofstream file_out;
  int i;
  int j;
  char *s;

  file_out.open ( file_out_name.c_str ( ) );

  if ( !file_out )
  {
    cout << "\n";
    cout << "CVT_WRITE - Fatal error!\n";
    cout << "  Could not open the output file.\n";
    exit ( 1 );
  }

  s = timestring ( );

  file_out << "#  " << file_out_name << "\n";
  file_out << "#  created by routine CVT_WRITE.CPP" << "\n";
  file_out << "#  at " << s << "\n";
  file_out << "#\n";

  file_out << "#  Spatial dimension NDIM =   "  << ndim          << "\n";
  file_out << "#  Number of points N =       "  << n             << "\n";
  file_out << "#  Initial SEED_INIT =        "  << seed_init     << "\n";
  file_out << "#  Current SEED =             "  << seed          << "\n";
  file_out << "#  INIT =                    \"" << init_string   << "\".\n";
  file_out << "#  Max iterations IT_MAX =    "  << it_max        << "\n";
  file_out << "#  IT_FIXED (fixed samples) = "  << it_fixed      << "\n";
  file_out << "#  Iterations IT_NUM =        "  << it_num        << "\n";
  file_out << "#  Difference IT_DIFF =       "  << it_diff       << "\n";
  file_out << "#  CVT ENERGY =               "  << energy        << "\n";
  file_out << "#  SAMPLE =                  \"" << sample_string << "\".\n";
  file_out << "#  Samples SAMPLE_NUM =       "  << sample_num    << "\n";
  file_out << "#  Sampling BATCH size =      "  << batch         << "\n";
  file_out << "#  EPSILON (unit roundoff) =  "  << r8_epsilon ( ) << "\n";

  file_out << "#\n";

  for ( j = 0; j < n; j++ )
  {
    for ( i = 0; i < ndim; i++ )
    {
      file_out << setw(10) << r[i+j*ndim] << "  ";
    }
    file_out << "\n";
  }

  file_out.close ( );

  return;
}
//****************************************************************************80

void data_read ( char *file_in_name, int ndim, int n, double r[] )

//****************************************************************************80
//
//  Purpose:
//
//    DATA_READ reads generator coordinate data from a file.
//
//  Discussion:
//
//    The file is assumed to contain one record per line.
//
//    Records beginning with the '#' character are comments, and are ignored.
//    Blank lines are also ignored.
//
//    Each line that is not ignored is assumed to contain exactly (or at least)
//    M real numbers, representing the coordinates of a point.
//
//    There are assumed to be exactly (or at least) N such records.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    03 August 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, char *FILE_IN_NAME, the name of the input file.
//
//    Input, int NDIM, the number of spatial dimensions.
//
//    Input, int N, the number of points.  The program
//    will stop reading data once N values have been read.
//
//    Output, double R[NDIM*N], the point coordinates.
//
{
  bool error;
  ifstream file_in;
  int i;
  int j;
  char line[255];
  double *x;

  file_in.open ( file_in_name );

  if ( !file_in )
  {
    cout << "\n";
    cout << "DATA_READ - Fatal error!\n";
    cout << "  Could not open the input file: \"" << file_in_name << "\"\n";
    exit ( 1 );
  }

  x = new double[ndim];

  j = 0;

  while ( j < n )
  {
    file_in.getline ( line, sizeof ( line ) );

    if ( file_in.eof ( ) )
    {
      break;
    }

    if ( line[0] == '#' || s_len_trim ( line ) == 0 )
    {
      continue;
    }

    error = s_to_r8vec ( line, ndim, x );

    if ( error )
    {
      continue;
    }

    for ( i = 0; i < ndim; i++ )
    {
      r[i+j*ndim] = x[i];
    }
    j = j + 1;

  }

  file_in.close ( );

  delete [] x;

  cout << "\n";
  cout << "DATA_READ:\n";
  cout << "  Read coordinate data from file.\n";

  return;
}
//****************************************************************************80

char digit_to_ch ( int i )

//****************************************************************************80
//
//  Purpose:
//
//    DIGIT_TO_CH returns the base 10 digit character corresponding to a digit.
//
//  Example:
//
//     I     C
//   -----  ---
//     0    '0'
//     1    '1'
//   ...    ...
//     9    '9'
//    10    '*'
//   -83    '*'
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    16 June 2003
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int I, the digit, which should be between 0 and 9.
//
//    Output, char DIGIT_TO_CH, the appropriate character '0' through '9' or '*'.
//
{
  char c;

  if ( 0 <= i && i <= 9 )
  {
    c = '0' + i;
  }
  else
  {
    c = '*';
  }

  return c;
}
//****************************************************************************80

void find_closest ( int ndim, int n, int sample_num, double s[], double r[],
  int nearest[] )

//****************************************************************************80
//
//  Purpose:
//
//    FIND_CLOSEST finds the nearest R point to each S point.
//
//  Discussion:
//
//    This routine finds the closest Voronoi cell generator by checking every
//    one.  For problems with many cells, this process can take the bulk
//    of the CPU time.  Other approaches, which group the cell generators into
//    bins, can run faster by a large factor.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    21 October 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int NDIM, the spatial dimension.
//
//    Input, int N, the number of cell generators.
//
//    Input, int SAMPLE_NUM, the number of sample points.
//
//    Input, double S[NDIM*SAMPLE_NUM], the points to be checked.
//
//    Input, double R[NDIM*N], the cell generators.
//
//    Output, int NEAREST[SAMPLE_NUM], the (0-based) index of the nearest
//    cell generator.
//
{
  double dist_sq_min;
  double dist_sq;
  int i;
  int jr;
  int js;
//
  for ( js = 0; js < sample_num; js++ )
  {
    dist_sq_min = r8_huge ( );
    nearest[js] = -1;

    for ( jr = 0; jr < n; jr++ )
    {
      dist_sq = 0.0;
      for ( i = 0; i < ndim; i++ )
      {
        dist_sq = dist_sq + ( s[i+js*ndim] - r[i+jr*ndim] )
                          * ( s[i+js*ndim] - r[i+jr*ndim] );
      }

      if ( jr == 0 || dist_sq < dist_sq_min )
      {
        dist_sq_min = dist_sq;
        nearest[js] = jr;
      }
    }
  }

  return;
}
//****************************************************************************80

int get_seed ( )

//****************************************************************************80
//
//  Purpose:
//
//    GET_SEED returns a random seed for the random number generator.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    15 September 2003
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Output, int GET_SEED, a random seed value.
//
{
# define I_MAX 2147483647

  time_t clock;
  int ihour;
  int imin;
  int isec;
  int seed;
  struct tm *lt;
  time_t tloc;
//
//  If the internal seed is 0, generate a value based on the time.
//
  clock = time ( &tloc );
  lt = localtime ( &clock );
//
//  Hours is 1, 2, ..., 12.
//
  ihour = lt->tm_hour;

  if ( 12 < ihour )
  {
    ihour = ihour - 12;
  }
//
//  Move Hours to 0, 1, ..., 11
//
  ihour = ihour - 1;

  imin = lt->tm_min;

  isec = lt->tm_sec;

  seed = isec + 60 * ( imin + 60 * ihour );
//
//  We want values in [1,43200], not [0,43199].
//
  seed = seed + 1;
//
//  Remap ISEED from [1,43200] to [1,IMAX].
//
  seed = ( int )
    ( ( ( double ) seed )
    * ( ( double ) I_MAX ) / ( 60.0E+00 * 60.0E+00 * 12.0E+00 ) );
//
//  Never use a seed of 0.
//
  if ( seed == 0 )
  {
    seed = 1;
  }

  return seed;
#undef I_MAX
}
//**********************************************************************

bool halham_leap_check ( int ndim, int leap[] )

//**********************************************************************
//
//  Purpose:
//
//    HALHAM_LEAP_CHECK checks LEAP for a Halton or Hammersley sequence.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    16 September 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int NDIM, the spatial dimension.
//
//    Input, int LEAP[NDIM], the successive jumps in the sequence.
//    Each entry must be greater than 0.
//
//    Output, bool HALHAM_LEAP_CHECK, is true if LEAP is legal.
//
{
  int i;
  bool value;

  value = true;

  for ( i = 0; i < ndim; i++ )
  {
    if ( leap[i] < 1 )
    {
      cout << "\n";
      cout << "HALHAM_LEAP_CHECK - Fatal error!\n";
      cout << "  Leap entries must be greater than 0.\n";
      cout << "  leap[" << i << "] = " << leap[i] << "\n";
      value = false;
      break;
    }
  }

  return value;
}
//**********************************************************************

bool halham_n_check ( int n )

//**********************************************************************
//
//  Purpose:
//
//    HALHAM_N_CHECK checks N for a Halton or Hammersley sequence.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    16 September 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int N, the number of elements of the subsequence.
//    N must be positive.
//
//    Output, bool HALHAM_N_CHECK, is true if N is legal.
//
{
  bool value;

  if ( n < 1 )
  {
    cout << "\n";
    cout << "HALHAM_N_CHECK - Fatal error!\n";
    cout << "  N < 0.";
    cout << "  N = " << n << "\n";
    value = false;
  }
  else
  {
    value = true;
  }

  return value;
}
//**********************************************************************

bool halham_ndim_check ( int ndim )

//**********************************************************************
//
//  Purpose:
//
//    HALHAM_NDIM_CHECK checks NDIM for a Halton or Hammersley sequence.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    16 September 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int NDIM, the spatial dimension.
//    NDIM must be positive.
//
//    Output, bool HALHAM_NDIM_CHECK, is true if NDIM is legal.
//
{
  bool value;

  if ( ndim < 1 )
  {
    cout << "\n";
    cout << "HALHAM_NDIM_CHECK - Fatal error!\n";
    cout << "  NDIM < 0.";
    cout << "  NDIM = " << ndim << "\n";
    value = false;
  }
  else
  {
    value = true;
  }

  return value;
}
//**********************************************************************

bool halham_seed_check ( int ndim, int seed[] )

//**********************************************************************
//
//  Purpose:
//
//    HALHAM_SEED_CHECK checks SEED for a Halton or Hammersley sequence.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    16 September 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int NDIM, the spatial dimension.
//
//    Input, int SEED[NDIM], the sequence index
//    corresponding to STEP = 0.  Each entry must be 0 or greater.
//
//    Output, bool HALHAM_SEED_CHECK, is true if SEED is legal.
//
{
  int i;
  bool value;

  value = true;

  for ( i = 0; i < ndim; i++ )
  {
    if ( seed[i] < 0 )
    {
      cout << "\n";
      cout << "HALHAM_SEED_CHECK - Fatal error!\n";
      cout << "  SEED entries must be nonnegative.\n";
      cout << "  seed[" << i << "] = " << seed[i] << "\n";
      value = false;
      break;
    }
  }

  return value;
}
//**********************************************************************

bool halham_step_check ( int step )

//**********************************************************************
//
//  Purpose:
//
//    HALHAM_STEP_CHECK checks STEP for a Halton or Hammersley sequence.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    16 September 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int STEP, the index of the subsequence element.
//    STEP must be 1 or greater.
//
//    Output, bool HALHAM_STEP_CHECK, is true if STEP is legal.
//
{
  bool value;

  if ( step < 0 )
  {
    cout << "\n";
    cout << "HALHAM_STEP_CHECK - Fatal error!\n";
    cout << "  STEP < 0.";
    cout << "  STEP = " << step << "\n";
    value = false;
  }
  else
  {
    value = true;
  }

  return value;
}
//**********************************************************************

bool halton_base_check ( int ndim, int base[] )

//**********************************************************************
//
//  Purpose:
//
//    HALTON_BASE_CHECK checks BASE for a Halton sequence.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    21 September 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int NDIM, the spatial dimension.
//
//    Input, int BASE[NDIM], the bases.
//
//    Output, bool HALTON_BASE_CHECK, is true if BASE is legal.
//
{
  int i;
  bool value;

  value = true;

  for ( i = 0; i < ndim; i++ )
  {
    if ( base[i] <= 1 )
    {
      cout << "\n";
      cout << "HALTON_BASE_CHECK - Fatal error!\n";
      cout << "  Bases must be greater than 1.\n";
      cout << "  base[" << i << "] = " << base[i] << "\n";
      value = false;
      break;
    }
  }

  return value;
}
//****************************************************************************80

int i4_log_10 ( int i )

//****************************************************************************80
//
//  Purpose:
//
//    I4_LOG_10 returns the whole part of the logarithm base 10 of an integer.
//
//  Discussion:
//
//    It should be the case that 10^I4_LOG_10(I) <= |I| < 10^(I4_LOG_10(I)+1).
//    (except for I = 0).
//
//    The number of decimal digits in I is I4_LOG_10(I) + 1.
//
//  Example:
//
//        I    I4_LOG_10(I)
//
//        0     0
//        1     0
//        2     0
//
//        9     0
//       10     1
//       11     1
//
//       99     1
//      100     2
//      101     2
//
//      999     2
//     1000     3
//     1001     3
//
//     9999     3
//    10000     4
//    10001     4
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    17 June 2003
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int I, the integer.
//
//    Output, int I4_LOG_10, the whole part of the logarithm of abs ( I ).
//
{
  int ten_pow;
  int value;

  i = abs ( i );

  ten_pow = 10;
  value = 0;

  while ( ten_pow <= i )
  {
    ten_pow = ten_pow * 10;
    value = value + 1;
  }

  return value;
}
//****************************************************************************

int i4_max ( int i1, int i2 )

//****************************************************************************
//
//  Purpose:
//
//    I4_MAX returns the maximum of two integers.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    13 October 1998
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int I1, I2, are two integers to be compared.
//
//    Output, int I4_MAX, the larger of I1 and I2.
//
//
{
  if ( i2 < i1 )
  {
    return i1;
  }
  else
  {
    return i2;
  }

}
//****************************************************************************80

int i4_min ( int i1, int i2 )

//****************************************************************************80
//
//  Purpose:
//
//    I4_MIN returns the smaller of two integers.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    11 September 1998
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int I1 and I2, two integers to be compared.
//
//    Output, int I4_MIN, the smaller of i1 and i2.
//
{
  if ( i1 < i2 )
  {
    return i1;
  }
  else
  {
    return i2;
  }

}
//****************************************************************************80

void i4_to_halton_sequence ( int ndim, int n, int step, int seed[], int leap[],
  int base[], double r[] )

//****************************************************************************80
//
//  Purpose:
//
//    I4_TO_HALTON_SEQUENCE computes N elements of a leaped Halton subsequence.
//
//  Discussion:
//
//    The NDIM-dimensional Halton sequence is really NDIM separate
//    sequences, each generated by a particular base.
//
//    This routine selects elements of a "leaped" subsequence of the
//    Halton sequence.  The subsequence elements are indexed by a
//    quantity called STEP, which starts at 0.  The STEP-th subsequence
//    element is simply element
//
//      SEED(1:NDIM) + STEP * LEAP(1:NDIM)
//
//    of the original Halton sequence.
//
//
//    The data to be computed has two dimensions.
//
//    The number of data items is NDIM * N, where NDIM is the spatial dimension
//    of each element of the sequence, and N is the number of elements of the sequence.
//
//    The data is stored in a one dimensional array R.  The first element of the
//    sequence is stored in the first NDIM entries of R, followed by the NDIM entries
//    of the second element, and so on.
//
//    In particular, the J-th element of the sequence is stored in entries
//    0+(J-1)*NDIM through (NDIM-1) + (J-1)*NDIM.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    16 July 2004
//
//  Author:
//
//    John Burkardt
//
//  Reference:
//
//    J H Halton,
//    On the efficiency of certain quasi-random sequences of points
//    in evaluating multi-dimensional integrals,
//    Numerische Mathematik,
//    Volume 2, 1960, pages 84-90.
//
//    J H Halton and G B Smith,
//    Algorithm 247: Radical-Inverse Quasi-Random Point Sequence,
//    Communications of the ACM,
//    Volume 7, 1964, pages 701-702.
//
//    Ladislav Kocis and William Whiten,
//    Computational Investigations of Low-Discrepancy Sequences,
//    ACM Transactions on Mathematical Software,
//    Volume 23, Number 2, 1997, pages 266-294.
//
//  Parameters:
//
//    Input, int NDIM, the spatial dimension.
//
//    Input, int N, the number of elements of the sequence.
//
//    Input, int STEP, the index of the subsequence element.
//    0 <= STEP is required
//
//    Input, int SEED[NDIM], the Halton sequence index corresponding
//    to STEP = 0.
//
//    Input, int LEAP[NDIM], the succesive jumps in the Halton sequence.
//
//    Input, int BASE[NDIM], the Halton bases.
//
//    Output, double R[NDIM*N], the next N elements of the
//    leaped Halton subsequence, beginning with element STEP.
//
{
  double base_inv;
  int digit;
  int i;
  int j;
  int *seed2;
//
//  Check the input.
//
  if ( !halham_ndim_check ( ndim ) )
  {
    exit ( 1 );
  }

  if ( !halham_n_check ( n ) )
  {
    exit ( 1 );
  }

  if ( !halham_step_check ( step ) )
  {
    exit ( 1 );
  }

  if ( !halham_seed_check ( ndim, seed ) )
  {
    exit ( 1 );
  }

  if ( !halham_leap_check ( ndim, leap ) )
  {
    exit ( 1 );
  }

  if ( !halton_base_check ( ndim, base ) )
  {
    exit ( 1 );
  }
//
//  Calculate the data.
//
  seed2 = new int[n];

  for ( i = 0; i < ndim; i++ )
  {
    for ( j = 0; j < n; j++ )
    {
      seed2[j] = seed[i] + ( step + j ) * leap[i];
    }

    for ( j = 0; j < n; j++ )
    {
      r[i+j*ndim] = 0.0E+00;
    }

    for ( j = 0; j < n; j++ )
    {
      base_inv = 1.0E+00 / ( ( double ) base[i] );

      while ( seed2[j] != 0 )
      {
        digit = seed2[j] % base[i];
        r[i+j*ndim] = r[i+j*ndim] + ( ( double ) digit ) * base_inv;
        base_inv = base_inv / ( ( double ) base[i] );
        seed2[j] = seed2[j] / base[i];
      }
    }
  }

  delete [] seed2;

  return;
}
//****************************************************************************80

char *i4_to_s ( int i )

//****************************************************************************80
//
//  Purpose:
//
//    I4_TO_S converts an integer to a string.
//
//  Example:
//
//    INTVAL  S
//
//         1  1
//        -1  -1
//         0  0
//      1952  1952
//    123456  123456
//   1234567  1234567
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    13 March 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int I, an integer to be converted.
//
//    Output, char *I4_TO_S, the representation of the integer.
//
{
  int digit;
  int j;
  int length;
  int ten_power;
  char *s;

  length = i4_log_10 ( i );

  ten_power = ( int ) pow ( ( double ) 10, ( double ) length );

  if ( i < 0 )
  {
    length = length + 1;
  }
//
//  Add one position for the trailing null.
//
  length = length + 1;

  s = new char[length];

  if ( i == 0 )
  {
    s[0] = '0';
    s[1] = '\0';
    return s;
  }
//
//  Now take care of the sign.
//
  j = 0;
  if ( i < 0 )
  {
    s[j] = '-';
    j = j + 1;
    i = abs ( i );
  }
//
//  Find the leading digit of I, strip it off, and stick it into the string.
//
  while ( 0 < ten_power )
  {
    digit = i / ten_power;
    s[j] = digit_to_ch ( digit );
    j = j + 1;
    i = i - digit * ten_power;
    ten_power = ten_power / 10;
  }
//
//  Tack on the trailing NULL.
//
  s[j] = '\0';
  j = j + 1;

  return s;
}
//****************************************************************************80

void mpb ( int ndim, int n, double generator[], int npp )

//****************************************************************************80
//
//  Purpose:
//
//    MPB projects generators onto the boundary of the region.
//
//  Discussion:
//
//    The number NPP sets the number of subintervals into which we subdivide
//    the boundary.  It does NOT specify how many points will be pulled onto
//    the boundary.  The reason for this is that, after the first boundary
//    subinterval has had a generator pulled into it, on every subsequent
//    subinterval the nearest generator is likely to be the one in the
//    previous subinterval!  Unless an interior generator is closer than
//    some small distance, this process will simply drag some unfortunate
//    generator onto the boundary, and then around from interval to interval
//    for a considerable time.
//
//    The algorithm could be changed, if desired, so that points snapped
//    to the boundary are guaranteed not to move, at least not twice in
//    one application of this routine!
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    03 December 2004
//
//  Author:
//
//    Lili Ju
//
//  Parameters:
//
//    Input, int NDIM, the spatial dimension.
//
//    Input, int N, the number of generators.
//
//    Input/output, double GENERATOR[NDIM*N], the coordinates of
//    the generators.  On output, some generators will have been moved.
//
//    Input, int NPP, the number of subintervals into which the
//    perimeter is divided.
//
{
  double dx;
  double dy;
  double hh;
  int i;
  int nearest[1];
  double u;
  double *sample;

  sample = new double[ndim];

  dx = 1.0;
  dy = 1.0;
//
//  HH is the length of an individual segment of the perimeter of the region.
//
//  U is set in such a way that on step I, it measures the distance from
//  the lower left corner of the box to the midpoint of the I-th subinterval
//  on the perimeter of the box.
//
  hh = 2.0 * ( dx + dy ) / ( double ) ( npp );

  u = -0.5 * hh;

  for ( i = 1; i <= npp; i++ )
  {
    u = u + hh;
//
//  The portion of the bottom perimeter from (0,0) to (1,0).
//
    if ( u < dx )
    {
      sample[0] = u;
      sample[1] = 0.0;
      find_closest ( ndim, n, 1, sample, generator, nearest );
      generator[1+nearest[0]*2] = 0.0;
    }
//
//  The portion of the right perimeter from (1,0) to (1,1).
//
    else if ( dx < u && u < dx + dy )
    {
      sample[0] = 1.0;
      sample[1] = u - dx;
      find_closest ( ndim, n, 1, sample, generator, nearest );
      generator[0+nearest[0]*2] = 1.0;
    }
//
//  The portion of the top perimeter from (1,1) to (0,1).
//
    else if ( dx + dy < u && u < dx + dy + dx )
    {
      sample[0] = 1.0 - ( u - dx - dy );
      sample[1] = 1.0;
      find_closest ( ndim, n, 1, sample, generator, nearest );
      generator[1+nearest[0]*2] = 1.0;
    }
//
//  The portion of the left perimeter from (0,1) to (0,0).
//
    else if ( dx + dy + dx < u )
    {
      sample[0] = 0.0;
      sample[1] = 1.0 - ( u - dx - dy - dx );
      find_closest ( ndim, n, 1, sample, generator, nearest );
      generator[0+nearest[0]*2] = 0.0;
    }

  }

  delete [] sample;

  return;
}
//****************************************************************************80

void points_eps ( string file_name, int ndim, int node_num, double node_xy[],
  string title )

//****************************************************************************80
//
//  Purpose:
//
//    POINTS_EPS creates an EPS file image of a set of points.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    09 June 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, string FILE_NAME, the name of the file to create.
//
//    Input, int NDIM, the spatial dimension.
//
//    Input, int NODE_NUM, the number of nodes.
//
//    Input, double NODE_XY[2*NODE_NUM], the coordinates
//    of the nodes.
//
//    Input, string TITLE, a title for the plot.
//
{
  int circle_size = 3;
  bool debug = false;
  double dif;
  int eps_x;
  int eps_y;
  ofstream file;
  int node;
  double node_x_max;
  double node_x_min;
  double node_y_max;
  double node_y_min;
  double scale;
  char *string;
//
//  Determine the range of the points.
//
  node_x_min =  r8_huge ( );
  node_x_max = -r8_huge ( );
  node_y_min =  r8_huge ( );
  node_y_max = -r8_huge ( );

  for ( node = 0; node < node_num; node++ )
  {
    node_x_min = r8_min ( node_x_min, node_xy[0+node*2] );
    node_x_max = r8_max ( node_x_max, node_xy[0+node*2] );
    node_y_min = r8_min ( node_y_min, node_xy[1+node*2] );
    node_y_max = r8_max ( node_y_max, node_xy[1+node*2] );
  }

  if ( node_y_max - node_y_min < node_x_max - node_x_min )
  {
    scale = node_x_max - node_x_min;
    dif = ( node_x_max - node_x_min ) - ( node_y_max - node_y_min );
    node_y_max = node_y_max + 0.5 * dif;
    node_y_min = node_y_min - 0.5 * dif;
  }
  else
  {
    scale = node_y_max - node_y_min;
    dif = ( node_y_max - node_y_min ) - ( node_x_max - node_x_min );
    node_x_max = node_x_max + 0.5 * dif;
    node_x_min = node_x_min - 0.5 * dif;
  }
//
//  Open the output file.
//
  file.open ( file_name.c_str ( ) );

  if ( ! file )
  {
    cout << "\n";
    cout << "POINTS_EPS - Fatal error!\n";
    cout << "  Cannot open the output file \"" << file_name << "\".\n";
    return;
  }

  string = timestring ( );

  file << "%!PS-Adobe-3.0 EPSF-3.0\n";
  file << "%%Creator: points_eps(ccvt_box.cpp)\n";
  file << "%%Title: " << file_name << "\n";
  file << "%%CreationDate: " << string << "\n";
  file << "%%Pages: 1\n";
  file << "%%BoundingBox:    36    36   576   756\n";
  file << "%%Document-Fonts: Times-Roman\n";
  file << "%%LanguageLevel: 1\n";
  file << "%%EndComments\n";
  file << "%%BeginProlog\n";
  file << "/inch {72 mul} def\n";
  file << "%%EndProlog\n";
  file << "%%Page:      1     1\n";
  file << "save\n";
  file << "%\n";
  file << "% Set RGB line color.\n";
  file << "%\n";
  file << " 0.9000 0.9000 0.9000 setrgbcolor\n";
  file << "%\n";
  file << "% Draw a gray border around the page.\n";
  file << "%\n";
  file << "newpath\n";
  file << "    36   126 moveto\n";
  file << "   576   126 lineto\n";
  file << "   576   666 lineto\n";
  file << "    36   666 lineto\n";
  file << "    36   126 lineto\n";
  file << "stroke\n";
  file << "%\n";
  file << "% Set RGB line color.\n";
  file << "%\n";
  file << " 0.0000 0.0000 0.0000 setrgbcolor\n";

  file << "%\n";
  file << "%  Label the plot:\n";
  file << "%\n";
  file << " 0.0000 0.0000 0.0000 setrgbcolor\n";
  file << "/Times-Roman findfont 0.50 inch scalefont setfont\n";
  file << "    36   666 moveto\n";
  file << "( " << title << ") show\n";

  file << "%\n";
  file << "% Define a clipping polygon\n";
  file << "%\n";
  file << "    36   126 moveto\n";
  file << "   576   126 lineto\n";
  file << "   576   666 lineto\n";
  file << "    36   666 lineto\n";
  file << "    36   126 lineto\n";
  file << "clip newpath\n";

  file << "%\n";
  file << "%  Draw the boundary in red:\n";
  file << "%\n";
  file << " 0.9000 0.0000 0.0000 setrgbcolor\n";
  file << "newpath\n";
  file << "    61   151 moveto\n";
  file << "   551   151 lineto\n";
  file << "   551   641 lineto\n";
  file << "    61   641 lineto\n";
  file << "    61   151 lineto\n";
  file << "stroke\n";
  file << "%\n";
  file << "%  Draw filled dots at each node:\n";
  file << "%\n";
  file << " 0.0000 0.0000 0.9000 setrgbcolor\n";

  for ( node = 0; node < node_num; node++ )
  {
    eps_x = ( int ) (
      ( ( node_x_max - node_xy[0+node*2]              ) *  61.0
      + (            + node_xy[0+node*2] - node_x_min ) * 551.0 )
      / scale );

    eps_y = ( int ) (
      ( ( node_y_max - node_xy[1+node*2]              ) * 151.0
      + (              node_xy[1+node*2] - node_y_min ) * 641.0 )
      / scale );

    file << "newpath  "
         << eps_x << "  "
         << eps_y << "  "
         << circle_size << "  0 360 arc closepath fill\n";

  }

  file << "%\n";
  file << "restore showpage\n";
  file << "%\n";
  file << "% End of page\n";
  file << "%\n";
  file << "%%Trailer\n";
  file << "%%EOF\n";

  file.close ( );

  if ( debug )
  {
    cout << "\n";
    cout << "POINTS_EPS:\n";
    cout << "  An encapsulated PostScript file was created\n";
    cout << "  containing an image of the points.\n";
    cout << "  The file is named \"" << file_name << "\".\n";
  }

  delete [] string;

  return;
}
//****************************************************************************80

int prime ( int n )

//****************************************************************************80
//
//  Purpose:
//
//    PRIME returns any of the first PRIME_MAX prime numbers.
//
//  Discussion:
//
//    PRIME_MAX is 1600, and the largest prime stored is 13499.
//
//    Thanks to Bart Vandewoestyne for pointing out a typo, 18 February 2005.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    18 February 2005
//
//  Author:
//
//    John Burkardt
//
//  Reference:
//
//    Milton Abramowitz and Irene Stegun,
//    Handbook of Mathematical Functions,
//    US Department of Commerce, 1964, pages 870-873.
//
//    Daniel Zwillinger,
//    CRC Standard Mathematical Tables and Formulae,
//    30th Edition,
//    CRC Press, 1996, pages 95-98.
//
//  Parameters:
//
//    Input, int N, the index of the desired prime number.
//    In general, is should be true that 0 <= N <= PRIME_MAX.
//    N = -1 returns PRIME_MAX, the index of the largest prime available.
//    N = 0 is legal, returning PRIME = 1.
//
//    Output, int PRIME, the N-th prime.  If N is out of range, PRIME
//    is returned as -1.
//
{
# define PRIME_MAX 1600

  int npvec[PRIME_MAX] = {
        2,    3,    5,    7,   11,   13,   17,   19,   23,   29,
       31,   37,   41,   43,   47,   53,   59,   61,   67,   71,
       73,   79,   83,   89,   97,  101,  103,  107,  109,  113,
      127,  131,  137,  139,  149,  151,  157,  163,  167,  173,
      179,  181,  191,  193,  197,  199,  211,  223,  227,  229,
      233,  239,  241,  251,  257,  263,  269,  271,  277,  281,
      283,  293,  307,  311,  313,  317,  331,  337,  347,  349,
      353,  359,  367,  373,  379,  383,  389,  397,  401,  409,
      419,  421,  431,  433,  439,  443,  449,  457,  461,  463,
      467,  479,  487,  491,  499,  503,  509,  521,  523,  541,
      547,  557,  563,  569,  571,  577,  587,  593,  599,  601,
      607,  613,  617,  619,  631,  641,  643,  647,  653,  659,
      661,  673,  677,  683,  691,  701,  709,  719,  727,  733,
      739,  743,  751,  757,  761,  769,  773,  787,  797,  809,
      811,  821,  823,  827,  829,  839,  853,  857,  859,  863,
      877,  881,  883,  887,  907,  911,  919,  929,  937,  941,
      947,  953,  967,  971,  977,  983,  991,  997, 1009, 1013,
     1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069,
     1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151,
     1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223,
     1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291,
     1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373,
     1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451,
     1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511,
     1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583,
     1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657,
     1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733,
     1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811,
     1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889,
     1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987,
     1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053,
     2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129,
     2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213,
     2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287,
     2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357,
     2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423,
     2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531,
     2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617,
     2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687,
     2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741,
     2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819,
     2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903,
     2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999,
     3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079,
     3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181,
     3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257,
     3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331,
     3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413,
     3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511,
     3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571,
     3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643,
     3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727,
     3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821,
     3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907,
     3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989,
     4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057,
     4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139,
     4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231,
     4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297,
     4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409,
     4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493,
     4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583,
     4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657,
     4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751,
     4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831,
     4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937,
     4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003,
     5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087,
     5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179,
     5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279,
     5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387,
     5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443,
     5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521,
     5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639,
     5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693,
     5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791,
     5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857,
     5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939,
     5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053,
     6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133,
     6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221,
     6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301,
     6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367,
     6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473,
     6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571,
     6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673,
     6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761,
     6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833,
     6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917,
     6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997,
     7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103,
     7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207,
     7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297,
     7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411,
     7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499,
     7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561,
     7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643,
     7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723,
     7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829,
     7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919,
     7927, 7933, 7937, 7949, 7951, 7963, 7993, 8009, 8011, 8017,
     8039, 8053, 8059, 8069, 8081, 8087, 8089, 8093, 8101, 8111,
     8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219,
     8221, 8231, 8233, 8237, 8243, 8263, 8269, 8273, 8287, 8291,
     8293, 8297, 8311, 8317, 8329, 8353, 8363, 8369, 8377, 8387,
     8389, 8419, 8423, 8429, 8431, 8443, 8447, 8461, 8467, 8501,
     8513, 8521, 8527, 8537, 8539, 8543, 8563, 8573, 8581, 8597,
     8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677,
     8681, 8689, 8693, 8699, 8707, 8713, 8719, 8731, 8737, 8741,
     8747, 8753, 8761, 8779, 8783, 8803, 8807, 8819, 8821, 8831,
     8837, 8839, 8849, 8861, 8863, 8867, 8887, 8893, 8923, 8929,
     8933, 8941, 8951, 8963, 8969, 8971, 8999, 9001, 9007, 9011,
     9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109,
     9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199,
     9203, 9209, 9221, 9227, 9239, 9241, 9257, 9277, 9281, 9283,
     9293, 9311, 9319, 9323, 9337, 9341, 9343, 9349, 9371, 9377,
     9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437, 9439,
     9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533,
     9539, 9547, 9551, 9587, 9601, 9613, 9619, 9623, 9629, 9631,
     9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733,
     9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811,
     9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887,
     9901, 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973,10007,
    10009,10037,10039,10061,10067,10069,10079,10091,10093,10099,
    10103,10111,10133,10139,10141,10151,10159,10163,10169,10177,
    10181,10193,10211,10223,10243,10247,10253,10259,10267,10271,
    10273,10289,10301,10303,10313,10321,10331,10333,10337,10343,
    10357,10369,10391,10399,10427,10429,10433,10453,10457,10459,
    10463,10477,10487,10499,10501,10513,10529,10531,10559,10567,
    10589,10597,10601,10607,10613,10627,10631,10639,10651,10657,
    10663,10667,10687,10691,10709,10711,10723,10729,10733,10739,
    10753,10771,10781,10789,10799,10831,10837,10847,10853,10859,
    10861,10867,10883,10889,10891,10903,10909,10937,10939,10949,
    10957,10973,10979,10987,10993,11003,11027,11047,11057,11059,
    11069,11071,11083,11087,11093,11113,11117,11119,11131,11149,
    11159,11161,11171,11173,11177,11197,11213,11239,11243,11251,
    11257,11261,11273,11279,11287,11299,11311,11317,11321,11329,
    11351,11353,11369,11383,11393,11399,11411,11423,11437,11443,
    11447,11467,11471,11483,11489,11491,11497,11503,11519,11527,
    11549,11551,11579,11587,11593,11597,11617,11621,11633,11657,
    11677,11681,11689,11699,11701,11717,11719,11731,11743,11777,
    11779,11783,11789,11801,11807,11813,11821,11827,11831,11833,
    11839,11863,11867,11887,11897,11903,11909,11923,11927,11933,
    11939,11941,11953,11959,11969,11971,11981,11987,12007,12011,
    12037,12041,12043,12049,12071,12073,12097,12101,12107,12109,
    12113,12119,12143,12149,12157,12161,12163,12197,12203,12211,
    12227,12239,12241,12251,12253,12263,12269,12277,12281,12289,
    12301,12323,12329,12343,12347,12373,12377,12379,12391,12401,
    12409,12413,12421,12433,12437,12451,12457,12473,12479,12487,
    12491,12497,12503,12511,12517,12527,12539,12541,12547,12553,
    12569,12577,12583,12589,12601,12611,12613,12619,12637,12641,
    12647,12653,12659,12671,12689,12697,12703,12713,12721,12739,
    12743,12757,12763,12781,12791,12799,12809,12821,12823,12829,
    12841,12853,12889,12893,12899,12907,12911,12917,12919,12923,
    12941,12953,12959,12967,12973,12979,12983,13001,13003,13007,
    13009,13033,13037,13043,13049,13063,13093,13099,13103,13109,
    13121,13127,13147,13151,13159,13163,13171,13177,13183,13187,
    13217,13219,13229,13241,13249,13259,13267,13291,13297,13309,
    13313,13327,13331,13337,13339,13367,13381,13397,13399,13411,
    13417,13421,13441,13451,13457,13463,13469,13477,13487,13499 };

  if ( n == -1 )
  {
    return PRIME_MAX;
  }
  else if ( n == 0 )
  {
    return 1;
  }
  else if ( n <= PRIME_MAX )
  {
    return npvec[n-1];
  }
  else
  {
    cout << "\n";
    cout << "PRIME - Fatal error!\n";
    cout << "  Unexpected input value of n = " << n << "\n";
    exit ( 1 );
  }

  return 0;
# undef PRIME_MAX
}
//****************************************************************************80

double r8_epsilon ( )

//****************************************************************************80
//
//  Purpose:
//
//    R8_EPSILON returns the R8 roundoff unit.
//
//  Discussion:
//
//    The roundoff unit is a number R which is a power of 2 with the
//    property that, to the precision of the computer's arithmetic,
//      1 < 1 + R
//    but
//      1 = ( 1 + R / 2 )
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    01 September 2012
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Output, double R8_EPSILON, the R8 round-off unit.
//
{
  const double value = 2.220446049250313E-016;

  return value;
}
//****************************************************************************80

double r8_huge ( )

//****************************************************************************80
//
//  Purpose:
//
//    R8_HUGE returns a "huge" real value, usually the largest legal real.
//
//  Discussion:
//
//    HUGE_VAL is the largest representable legal real number, and is usually
//    defined in math.h, or sometimes in stdlib.h.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    08 May 2003
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Output, double R8_HUGE, a "huge" real value.
//
{
  return HUGE_VAL;
}
//****************************************************************************80

double r8_max ( double x, double y )

//****************************************************************************80
//
//  Purpose:
//
//    R8_MAX returns the maximum of two double precision values.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    18 August 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, double X, Y, the quantities to compare.
//
//    Output, double R8_MAX, the maximum of X and Y.
//
{
  if ( y < x )
  {
    return x;
  }
  else
  {
    return y;
  }
}
//****************************************************************************80

double r8_min ( double x, double y )

//****************************************************************************80
//
//  Purpose:
//
//    R8_MIN returns the minimum of two double precision values.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    31 August 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, double X, Y, the quantities to compare.
//
//    Output, double R8_MIN, the minimum of X and Y.
//
{
  if ( y < x )
  {
    return y;
  }
  else
  {
    return x;
  }
}
//****************************************************************************80

void r8mat_uniform_01 ( int m, int n, int *seed, double r[] )

//****************************************************************************80
//
//  Purpose:
//
//    R8MAT_UNIFORM_01 fills a double precision array with pseudorandom values.
//
//  Discussion:
//
//    This routine implements the recursion
//
//      seed = 16807 * seed mod ( 2^31 - 1 )
//      unif = seed / ( 2^31 - 1 )
//
//    The integer arithmetic never requires more than 32 bits,
//    including a sign bit.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    11 August 2004
//
//  Author:
//
//    John Burkardt
//
//  Reference:
//
//    Paul Bratley, Bennett Fox, L E Schrage,
//    A Guide to Simulation,
//    Springer Verlag, pages 201-202, 1983.
//
//    Bennett Fox,
//    Algorithm 647:
//    Implementation and Relative Efficiency of Quasirandom
//    Sequence Generators,
//    ACM Transactions on Mathematical Software,
//    Volume 12, Number 4, pages 362-376, 1986.
//
//  Parameters:
//
//    Input, int M, N, the number of rows and columns.
//
//    Input/output, int *SEED, the "seed" value.  On output, SEED has
//    been updated.
//
//    Output, double R8MAT_UNIFORM_01[M*N], a matrix of pseudorandom values.
//
{
  int i;
  int j;
  int k;

  for ( j = 0; j < n; j++ )
  {
    for ( i = 0; i < m; i++ )
    {
      k = *seed / 127773;

      *seed = 16807 * ( *seed - k * 127773 ) - k * 2836;

      if ( *seed < 0 )
      {
        *seed = *seed + 2147483647;
      }

      r[i+j*m] = ( double ) ( *seed ) * 4.656612875E-10;
    }
  }

  return;
}
//****************************************************************************80

unsigned long random_initialize ( unsigned long seed )

//****************************************************************************80
//
//  Purpose:
//
//    RANDOM_INITIALIZE initializes the RANDOM random number generator.
//
//  Discussion:
//
//    If you don't initialize RANDOM, the random number generator,
//    it will behave as though it were seeded with value 1.
//    This routine will either take a user-specified seed, or
//    (if the user passes a 0) make up a "random" one.  In either
//    case, the seed is passed to SRAND (the appropriate routine
//    to call when setting the seed for RANDOM).  The seed is also
//    returned to the user as the value of the function.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    11 August 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, unsigned long SEED, is either 0, which means that the user
//    wants this routine to come up with a seed, or nonzero, in which
//    case the user has supplied the seed.
//
//    Output, unsigned long RANDOM_INITIALIZE, is the value of the seed
//    passed to SRAND, which is either the user's input value, or if
//    that was zero, the value selected by this routine.
//
{
# define DEBUG 0

  if ( seed != 0 )
  {
    if ( DEBUG )
    {
      cout << "\n";
      cout << "RANDOM_INITIALIZE\n";
      cout << "  Initialize RANDOM with user SEED = " << seed << "\n";
    }
  }
  else
  {
    seed = get_seed ( );
    if ( DEBUG )
    {
      cout << "\n";
      cout << "RANDOM_INITIALIZE\n";
      cout << "  Initialize RAND with arbitrary SEED = " << seed << "\n";
    }
  }
//
//  Now set the seed.
//
  srand ( seed );

  return seed;
# undef DEBUG
}
//****************************************************************************80

bool s_eqi ( char *s1, char *s2 )

//****************************************************************************80
//
//  Purpose:
//
//    S_EQI reports whether two strings are equal, ignoring case.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    05 May 2003
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, char *S1, char *S2, pointers to two strings.
//
//    Output, bool S_EQI, is true if the strings are equal.
//
{
  int i;
  int nchar;
  int nchar1;
  int nchar2;

  nchar1 = strlen ( s1 );
  nchar2 = strlen ( s2 );
  nchar = i4_min ( nchar1, nchar2 );

//
//  The strings are not equal if they differ over their common length.
//
  for ( i = 0; i < nchar; i++ )
  {

    if ( ch_cap ( s1[i] ) != ch_cap ( s2[i] ) )
    {
      return false;
    }
  }
//
//  The strings are not equal if the longer one includes nonblanks
//  in the tail.
//
  if ( nchar < nchar1 )
  {
    for ( i = nchar; i < nchar1; i++ )
    {
      if ( s1[i] != ' ' )
      {
        return false;
      }
    }
  }
  else if ( nchar < nchar2 )
  {
    for ( i = nchar; i < nchar2; i++ )
    {
      if ( s2[i] != ' ' )
      {
        return false;
      }
    }
  }

  return true;

}
//****************************************************************************80

int s_len_trim ( char* s )

//****************************************************************************80
//
//  Purpose:
//
//    S_LEN_TRIM returns the length of a string to the last nonblank.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    26 April 2003
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, char *S, a pointer to a string.
//
//    Output, int S_LEN_TRIM, the length of the string to the last nonblank.
//    If S_LEN_TRIM is 0, then the string is entirely blank.
//
{
  int n;
  char* t;

  n = strlen ( s );
  t = s + strlen ( s ) - 1;

  while ( 0 < n )
  {
    if ( *t != ' ' )
    {
      return n;
    }
    t--;
    n--;
  }

  return n;
}
//****************************************************************************80

double s_to_r8 ( char *s, int *lchar, bool *error )

//****************************************************************************80
//
//  Purpose:
//
//    S_TO_R8 reads an R8 from a string.
//
//  Discussion:
//
//    This routine will read as many characters as possible until it reaches
//    the end of the string, or encounters a character which cannot be
//    part of the real number.
//
//    Legal input is:
//
//       1 blanks,
//       2 '+' or '-' sign,
//       2.5 spaces
//       3 integer part,
//       4 decimal point,
//       5 fraction part,
//       6 'E' or 'e' or 'D' or 'd', exponent marker,
//       7 exponent sign,
//       8 exponent integer part,
//       9 exponent decimal point,
//      10 exponent fraction part,
//      11 blanks,
//      12 final comma or semicolon.
//
//    with most quantities optional.
//
//  Example:
//
//    S                 R
//
//    '1'               1.0
//    '     1   '       1.0
//    '1A'              1.0
//    '12,34,56'        12.0
//    '  34 7'          34.0
//    '-1E2ABCD'        -100.0
//    '-1X2ABCD'        -1.0
//    ' 2E-1'           0.2
//    '23.45'           23.45
//    '-4.2E+2'         -420.0
//    '17d2'            1700.0
//    '-14e-2'         -0.14
//    'e2'              100.0
//    '-12.73e-9.23'   -12.73 * 10.0**(-9.23)
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    07 August 2003
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, char *S, the string containing the
//    data to be read.  Reading will begin at position 1 and
//    terminate at the end of the string, or when no more
//    characters can be read to form a legal real.  Blanks,
//    commas, or other nonnumeric data will, in particular,
//    cause the conversion to halt.
//
//    Output, int *LCHAR, the number of characters read from
//    the string to form the number, including any terminating
//    characters such as a trailing comma or blanks.
//
//    Output, bool *ERROR, is true if an error occurred.
//
//    Output, double S_TO_R8, the real value that was read from the string.
//
{
  char c;
  int ihave;
  int isgn;
  int iterm;
  int jbot;
  int jsgn;
  int jtop;
  int nchar;
  int ndig;
  double r;
  double rbot;
  double rexp;
  double rtop;
  char TAB = 9;

  nchar = s_len_trim ( s );
  *error = false;
  r = 0.0E+00;
  *lchar = -1;
  isgn = 1;
  rtop = 0.0E+00;
  rbot = 1.0E+00;
  jsgn = 1;
  jtop = 0;
  jbot = 1;
  ihave = 1;
  iterm = 0;

  for ( ; ; )
  {
    c = s[*lchar+1];
    *lchar = *lchar + 1;
//
//  Blank or TAB character.
//
    if ( c == ' ' || c == TAB )
    {
      if ( ihave == 2 )
      {
      }
      else if ( ihave == 6 || ihave == 7 )
      {
        iterm = 1;
      }
      else if ( 1 < ihave )
      {
        ihave = 11;
      }
    }
//
//  Comma.
//
    else if ( c == ',' || c == ';' )
    {
      if ( ihave != 1 )
      {
        iterm = 1;
        ihave = 12;
        *lchar = *lchar + 1;
      }
    }
//
//  Minus sign.
//
    else if ( c == '-' )
    {
      if ( ihave == 1 )
      {
        ihave = 2;
        isgn = -1;
      }
      else if ( ihave == 6 )
      {
        ihave = 7;
        jsgn = -1;
      }
      else
      {
        iterm = 1;
      }
    }
//
//  Plus sign.
//
    else if ( c == '+' )
    {
      if ( ihave == 1 )
      {
        ihave = 2;
      }
      else if ( ihave == 6 )
      {
        ihave = 7;
      }
      else
      {
        iterm = 1;
      }
    }
//
//  Decimal point.
//
    else if ( c == '.' )
    {
      if ( ihave < 4 )
      {
        ihave = 4;
      }
      else if ( 6 <= ihave && ihave <= 8 )
      {
        ihave = 9;
      }
      else
      {
        iterm = 1;
      }
    }
//
//  Exponent marker.
//
    else if ( ch_eqi ( c, 'E' ) || ch_eqi ( c, 'D' ) )
    {
      if ( ihave < 6 )
      {
        ihave = 6;
      }
      else
      {
        iterm = 1;
      }
    }
//
//  Digit.
//
    else if ( ihave < 11 && '0' <= c && c <= '9' )
    {
      if ( ihave <= 2 )
      {
        ihave = 3;
      }
      else if ( ihave == 4 )
      {
        ihave = 5;
      }
      else if ( ihave == 6 || ihave == 7 )
      {
        ihave = 8;
      }
      else if ( ihave == 9 )
      {
        ihave = 10;
      }

      ndig = ch_to_digit ( c );

      if ( ihave == 3 )
      {
        rtop = 10.0E+00 * rtop + ( double ) ndig;
      }
      else if ( ihave == 5 )
      {
        rtop = 10.0E+00 * rtop + ( double ) ndig;
        rbot = 10.0E+00 * rbot;
      }
      else if ( ihave == 8 )
      {
        jtop = 10 * jtop + ndig;
      }
      else if ( ihave == 10 )
      {
        jtop = 10 * jtop + ndig;
        jbot = 10 * jbot;
      }

    }
//
//  Anything else is regarded as a terminator.
//
    else
    {
      iterm = 1;
    }
//
//  If we haven't seen a terminator, and we haven't examined the
//  entire string, go get the next character.
//
    if ( iterm == 1 || nchar <= *lchar + 1 )
    {
      break;
    }

  }
//
//  If we haven't seen a terminator, and we have examined the
//  entire string, then we're done, and LCHAR is equal to NCHAR.
//
  if ( iterm != 1 && (*lchar) + 1 == nchar )
  {
    *lchar = nchar;
  }
//
//  Number seems to have terminated.  Have we got a legal number?
//  Not if we terminated in states 1, 2, 6 or 7!
//
  if ( ihave == 1 || ihave == 2 || ihave == 6 || ihave == 7 )
  {
    *error = true;
    return r;
  }
//
//  Number seems OK.  Form it.
//
  if ( jtop == 0 )
  {
    rexp = 1.0E+00;
  }
  else
  {
    if ( jbot == 1 )
    {
      rexp = pow ( 10.0E+00, jsgn * jtop );
    }
    else
    {
      rexp = jsgn * jtop;
      rexp = rexp / jbot;
      rexp = pow ( 10.0E+00, rexp );
    }

  }

  r = isgn * rexp * rtop / rbot;

  return r;
}
//****************************************************************************80

bool s_to_r8vec ( char *s, int n, double rvec[] )

//****************************************************************************80
//
//  Purpose:
//
//    S_TO_R8VEC reads an R8VEC from a string.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    19 February 2001
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, char *S, the string to be read.
//
//    Input, int N, the number of values expected.
//
//    Output, double RVEC[N], the values read from the string.
//
//    Output, bool S_TO_R8VEC, is true if an error occurred.
//
{
  bool error;
  int i;
  int lchar;

  for ( i = 0; i < n; i++ )
  {
    rvec[i] = s_to_r8 ( s, &lchar, &error );

    if ( error )
    {
      return error;
    }

    s = s + lchar;

  }

  return error;
}
//****************************************************************************80

void timestamp ( )

//****************************************************************************80
//
//  Purpose:
//
//    TIMESTAMP prints the current YMDHMS date as a time stamp.
//
//  Example:
//
//    May 31 2001 09:45:54 AM
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    02 October 2003
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    None
//
{
# define TIME_SIZE 40

  static char time_buffer[TIME_SIZE];
  const struct tm *tm;
  time_t now;

  now = time ( NULL );
  tm = localtime ( &now );

  strftime ( time_buffer, TIME_SIZE, "%d %B %Y %I:%M:%S %p", tm );

  cout << time_buffer << "\n";

  return;
# undef TIME_SIZE
}
//****************************************************************************80

char *timestring ( )

//****************************************************************************80
//
//  Purpose:
//
//    TIMESTRING returns the current YMDHMS date as a string.
//
//  Example:
//
//    May 31 2001 09:45:54 AM
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    13 June 2003
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Output, char *TIMESTRING, a string containing the current YMDHMS date.
//
{
# define TIME_SIZE 40

  const struct tm *tm;
  time_t now;
  char *s;

  now = time ( NULL );
  tm = localtime ( &now );

  s = new char[TIME_SIZE];

  strftime ( s, TIME_SIZE, "%d %B %Y %I:%M:%S %p", tm );

  return s;
# undef TIME_SIZE
}
//****************************************************************************80

void tuple_next_fast ( int m, int n, int rank, int x[] )

//****************************************************************************80
//
//  Purpose:
//
//    TUPLE_NEXT_FAST computes the next element of a tuple space, "fast".
//
//  Discussion:
//
//    The elements are N vectors.  Each entry is constrained to lie
//    between 1 and M.  The elements are produced one at a time.
//    The first element is
//      (1,1,...,1)
//    and the last element is
//      (M,M,...,M)
//    Intermediate elements are produced in lexicographic order.
//
//  Example:
//
//    N = 2,
//    M = 3
//
//    INPUT        OUTPUT
//    -------      -------
//    Rank          X
//    ----          ----
//   -1            -1 -1
//
//    0             1  1
//    1             1  2
//    2             1  3
//    3             2  1
//    4             2  2
//    5             2  3
//    6             3  1
//    7             3  2
//    8             3  3
//    9             1  1
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    11 August 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int M, the maximum entry in each component.
//    M must be greater than 0.
//
//    Input, int N, the number of components.
//    N must be greater than 0.
//
//    Input, integer RANK, indicates the rank of the tuples.
//    Typically, 0 <= RANK < N**M; values larger than this are legal
//    and meaningful, and are equivalent to the corresponding value
//    MOD N**M.  If RANK < 0, this indicates that this is the first
//    call for the given values of (M,N).  Initialization is done,
//    and X is set to a dummy value.
//
//    Output, int X[N], the next tuple, or a dummy value if initialization
//    is being done.
//
{
  static int *base = NULL;
  int i;
//
  if ( rank < 0 )
  {
    if ( m <= 0 )
    {
      cout << "\n";
      cout << "TUPLE_NEXT_FAST - Fatal error!\n";
      cout << "  The value M <= 0 is not legal.\n";
      cout << "  M = " << m << "\n";
      exit ( 1 );
    }
    if ( n <= 0 )
    {
      cout << "\n";
      cout << "TUPLE_NEXT_FAST - Fatal error!\n";
      cout << "  The value N <= 0 is not legal.\n";
      cout << "  N = " << n << "\n";
      exit ( 1 );
    }

    if ( base )
    {
      delete [] base;
    }
    base = new int[n];

    base[n-1] = 1;
    for ( i = n-2; 0 <= i; i-- )
    {
      base[i] = base[i+1] * m;
    }
    for ( i = 0; i < n; i++ )
    {
      x[i] = -1;
    }
  }
  else
  {
    for ( i = 0; i < n; i++ )
    {
      x[i] = ( ( rank / base[i] ) % m ) + 1;
    }
  }
  return;
}