%% TEST02 calls CC_GRIDS_MINMAX to collect all points on 2D grids for Q = 3 to 5.
%
%  Modified:
%
%    10 October 2006
%
%  Author:
%
%    John Burkardt
%
  clear

  dim_num = 2;

  q_max = 5;
  q_min = 3;

  fprintf ( 1, '\n' );
  fprintf ( 1, 'TEST02:\n' );
  fprintf ( 1, '  CC_GRIDS_MINMAX returns all Clenshaw Curtis grids\n' );
  fprintf ( 1, '  whose Q value satisfies Q_MIN <= Q <= Q_MAX.\n' );
  fprintf ( 1, '  Here, Q is the sum of the orders of the 1D rules, and\n' );
  fprintf ( 1, '  Q_MIN = %d\n', q_min );
  fprintf ( 1, '  Q_MAX = %d\n', q_max );
  fprintf ( 1, '\n' );
  fprintf ( 1, '  Spatial dimension of grids = %d\n', dim_num );

  [ grid_num, point_num ] = cc_grids_minmax_size ( dim_num, q_min, q_max );

  fprintf ( 1, '\n' );
  fprintf ( 1, '  Number of grids = %d\n', grid_num );
  fprintf ( 1, '  Number of points in the grids = %d\n', point_num );
%
%  Compute the orders and points.
%
  [ grid_order, grid_point ] = cc_grids_minmax ( dim_num, q_min, q_max, ...
    grid_num, point_num );
%
%  Now we're done.  Print the merged grid data.
%
  fprintf ( 1, '\n' );
  fprintf ( 1, '         I         Q          Grid orders:\n' );
  fprintf ( 1, '\n' );
  for j = 1 : grid_num
    q = sum ( grid_order(1:dim_num,j) );
    fprintf ( 1, '  %8d  %8d', j, q );
    for dim = 1 : dim_num
      fprintf ( 1, '  %8d', grid_order(dim,j) );
    end
    fprintf ( 1, '\n' );
  end

  fprintf ( 1, '\n' );
  fprintf ( 1, '  Grid points:\n' );
  fprintf ( 1, '\n' );
  for j = 1 : point_num
    fprintf ( 1, '  %8d', j );
    for dim = 1 : dim_num
      fprintf ( 1, '  %12f', grid_point(dim,j) );
    end
    fprintf ( 1, '\n' );
  end