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

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

  /* NAG structures */
  NagError fail;

  /* Set the distribution parameters */
  Integer m = 5;
  double lambda[] = { 0.5e0, 5.0e0, 10.0e0, 500.0e0, 1000.0e0 };

  /* Set the sample size */
  Integer n = 10;

  /* 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_compd_poisson (g05tkc) 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;
  }

  /* Allocate arrays */
  if (!(state = NAG_ALLOC(lstate, Integer)) || !(x = NAG_ALLOC(m, 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 and display n sets of the m variates */
  for (i = 0; i < n; i++) {
    /* Generate the variates */
    nag_rand_compd_poisson(m, lambda, state, x, &fail);
    if (fail.code != NE_NOERROR) {
      printf("Error from nag_rand_compd_poisson (g05tkc).\n%s\n",
             fail.message);
      exit_status = 1;
      goto END;
    }

    /* Display the variates */
    printf("%12" NAG_IFMT "", i + 1);
    for (j = 0; j < m; j++)
      printf("%12" NAG_IFMT "", x[j]);
    printf("\n");
  }

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

  return exit_status;
}