/* nag_blast_dtr_copy (f16qec) Example Program.
 *
 * Copyright 2022 Numerical Algorithms Group.
 *
 * Mark 28.6, 2022.
 */

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

int main(void) {

  /* Scalars */
  Integer exit_status, i, j, n, pda, pdb;

  /* Arrays */
  double *a = 0, *b = 0;
  char nag_enum_arg[40];

  /* Nag Types */
  NagError fail;
  Nag_DiagType diag;
  Nag_MatrixType matrix;
  Nag_OrderType order;
  Nag_TransType trans;
  Nag_UploType uplo;

#ifdef NAG_COLUMN_MAJOR
#define A(I, J) a[(J - 1) * pda + I - 1]
  order = Nag_ColMajor;
#else
#define A(I, J) a[(I - 1) * pda + J - 1]
  order = Nag_RowMajor;
#endif

  exit_status = 0;
  INIT_FAIL(fail);

  printf("nag_blast_dtr_copy (f16qec) Example Program Results\n\n");

  /* Skip heading in data file */
  scanf("%*[^\n] ");
  /* Read the problem dimension */
  scanf("%" NAG_IFMT "%*[^\n] ", &n);
  /* Read uplo */
  scanf("%39s%*[^\n] ", nag_enum_arg);
  /* nag_enum_name_to_value (x04nac).
   * Converts NAG enum member name to value
   */
  uplo = (Nag_UploType)nag_enum_name_to_value(nag_enum_arg);
  /* Read trans */
  scanf("%39s%*[^\n] ", nag_enum_arg);
  /* nag_enum_name_to_value (x04nac).
   * Converts NAG enum member name to value
   */
  trans = (Nag_TransType)nag_enum_name_to_value(nag_enum_arg);
  /* Read diag */
  scanf("%39s%*[^\n] ", nag_enum_arg);
  /* nag_enum_name_to_value (x04nac).
   * Converts NAG enum member name to value
   */
  diag = (Nag_DiagType)nag_enum_name_to_value(nag_enum_arg);

  pda = n;
  pdb = n;

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

  /* Read A from data file */
  if (uplo == Nag_Upper) {
    for (i = 1; i <= n; ++i) {
      for (j = i; j <= n; ++j)
        scanf("%lf", &A(i, j));
    }
    scanf("%*[^\n] ");
  } else {
    for (i = 1; i <= n; ++i) {
      for (j = 1; j <= i; ++j)
        scanf("%lf", &A(i, j));
    }
    scanf("%*[^\n] ");
  }

  /* nag_blast_dtr_copy (f16qec).
   * Triangular matrix copy.
   *
   */
  nag_blast_dtr_copy(order, uplo, trans, diag, n, a, pda, b, pdb, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_blast_dtr_copy (f16qec).\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)
   */
  if (uplo == Nag_Upper)
    matrix = Nag_UpperMatrix;
  else
    matrix = Nag_LowerMatrix;

  fflush(stdout);
  nag_file_print_matrix_real_gen(order, matrix, Nag_NonUnitDiag, n, n, b, pdb,
                                 "Copy of Input Matrix", 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);
  NAG_FREE(b);

  return exit_status;
}