/* nag_blast_dge_load (f16qhc) Example Program.
 *
 * Copyright 2023 Numerical Algorithms Group.
 *
 * Mark 29.2, 2023.
 */

#include <nag.h>
#include <stdio.h>

int main(void) {
  /* Scalars */
  double alpha, diag;
  Integer exit_status, m, n, pda;
  /* Arrays */
  double *a = 0;
  /* Nag Types */
  Nag_OrderType order;
  NagError fail;

#ifdef NAG_COLUMN_MAJOR
  order = Nag_ColMajor;
#else
  order = Nag_RowMajor;
#endif

  exit_status = 0;
  INIT_FAIL(fail);

  printf("nag_blast_dge_load (f16qhc) Example Program Results\n\n");

  /* Skip heading in data file */
  scanf("%*[^\n] ");
  /* Read the problem dimensions */
  scanf("%" NAG_IFMT "%" NAG_IFMT "%*[^\n] ", &m, &n);
  /* Read scalar parameters */
  scanf("%lf%lf%*[^\n] ", &alpha, &diag);

  if (order == Nag_ColMajor)
    pda = m;
  else
    pda = n;

  if (m > 0 && n > 0) {
    /* Allocate memory */
    if (!(a = NAG_ALLOC(m * n, double))) {
      printf("Allocation failure\n");
      exit_status = -1;
      goto END;
    }
  } else {
    printf("Invalid m or n\n");
    exit_status = 1;
    return exit_status;
  }

  /* nag_blast_dge_load (f16qhc).
   * General matrix initialization.
   *
   */
  nag_blast_dge_load(order, m, n, alpha, diag, a, pda, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_blast_dge_load (f16qhc).\n%s\n", fail.message);
    exit_status = 1;
    goto END;
  }

  /* Print output */
  /* nag_file_print_matrix_real_gen (x04cac).
   * Print real general matrix (easy-to-use)
   */
  fflush(stdout);
  nag_file_print_matrix_real_gen(order, Nag_GeneralMatrix, Nag_NonUnitDiag, m,
                                 n, a, pda, "Matrix A", 0, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_file_print_matrix_real_gen (x04cac).\n%s\n",
           fail.message);
    exit_status = 1;
    goto END;
  }

END:
  NAG_FREE(a);

  return exit_status;
}