/* nag_rand_2_way_table (g05pzc) Example Program.
 *
 * Copyright 2017 Numerical Algorithms Group.
 *
 * Mark 26.2, 2017.
 */
/* Pre-processor includes */
#include <stdio.h>
#include <math.h>
#include <nag.h>
#include <nag_stdlib.h>
#include <nagg05.h>

#define X(I, J) x[I*pdx + J]

int main(void)
{
  /* Integer scalar and array declarations */
  Integer exit_status = 0;
  Integer lr, i, j, lstate, rctot, x_size;
  Integer *state = 0, *x = 0;
  Integer pdx;

  /* NAG structures */
  NagError fail;
  Nag_ModeRNG mode;

  /* Double scalar and array declarations */
  double *r = 0;

  /* Set the size of the table and the row and column totals */
  Integer nrow = 3;
  Integer ncol = 4;
  Integer totr[] = { 16, 17, 17 };
  Integer totc[] = { 9, 11, 7, 23 };

  /* Choose the base generator */
  Nag_BaseRNG genid = Nag_Basic;
  Integer subid = 0;

  /* Set the seed */
  Integer seed[] = { 1762543 };
  Integer lseed = 1;

  /* Initialize the error structure */
  INIT_FAIL(fail);

  printf("nag_rand_2_way_table (g05pzc) Example Program Results\n\n");

  /* Get the length of the state array */
  lstate = -1;
  nag_rand_init_repeatable(genid, subid, seed, lseed, state, &lstate, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_rand_init_repeatable (g05kfc).\n%s\n",
           fail.message);
    exit_status = 1;
    goto END;
  }

  /* Calculate the grand total */
  for (i = 0, rctot = 0; i < nrow; i++)
    rctot += totr[i];

  /* Calculate the size of the reference vector */
  lr = 5 + rctot;

  pdx = ncol;
  x_size = pdx * nrow;

  /* Allocate arrays */
  if (!(r = NAG_ALLOC(lr, double)) ||
      !(state = NAG_ALLOC(lstate, Integer)) ||
      !(x = NAG_ALLOC(x_size, Integer)))
  {
    printf("Allocation failure\n");
    exit_status = -1;
    goto END;
  }

  /* Initialize the generator to a repeatable sequence */
  nag_rand_init_repeatable(genid, subid, seed, lseed, state, &lstate, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_rand_init_repeatable (g05kfc).\n%s\n",
           fail.message);
    exit_status = 1;
    goto END;
  }

  /* Generate the random table */
  mode = Nag_InitializeAndGenerate;
  nag_rand_2_way_table(mode, nrow, ncol, totr, totc, r, lr, state, x, pdx,
                       &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_rand_2_way_table (g05pzc).\n%s\n", fail.message);
    exit_status = 1;
    goto END;
  }

  /* Display the results */
  for (i = 0; i < nrow; i++) {
    printf(" ");
    for (j = 0; j < ncol; j++)
      printf("%4" NAG_IFMT "%s", X(i, j), (j + 1) % ncol ? " " : " | ");
    printf("%5" NAG_IFMT "", totr[i]);
    printf("\n");
  }
  printf("  -------------------+-------\n ");
  for (j = 0; j < ncol; j++)
    printf("%4" NAG_IFMT "%s", totc[j], (j + 1) % ncol ? " " : " | ");
  printf("%5" NAG_IFMT "", rctot);
  printf("\n");

END:
  NAG_FREE(r);
  NAG_FREE(state);
  NAG_FREE(x);

  return exit_status;
}