From b17d8291b10e2af92d29c150fc2c286a73a7749b Mon Sep 17 00:00:00 2001 From: bangerth Date: Wed, 25 Oct 2006 00:13:36 +0000 Subject: [PATCH] Fix a couple of issues. git-svn-id: https://svn.dealii.org/trunk@14076 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/lac/source/sparse_direct.cc | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/deal.II/lac/source/sparse_direct.cc b/deal.II/lac/source/sparse_direct.cc index 8c7a2c7bcf..da5c303053 100644 --- a/deal.II/lac/source/sparse_direct.cc +++ b/deal.II/lac/source/sparse_direct.cc @@ -1685,7 +1685,7 @@ SparseDirectUMFPACK::clear () template void SparseDirectUMFPACK:: -sort_arrays (const SparseMatrix &) +sort_arrays (const SparseMatrix &matrix) { // do the copying around of entries // so that the diagonal entry is in the @@ -1698,7 +1698,7 @@ sort_arrays (const SparseMatrix &) // second entry in a row // // ignore rows with only one or no entry - for (unsigned int row=0; row &matrix) // columns. we can do the same // thing as above, but we have to // do it multiple times - for (unsigned int row=0; row &matrix) // otherwise swap this entry // with successive ones as // long as necessary - unsigned int element = cursor; + int element = cursor; while ((element < Ap[row+1]-1) && (Ai[element] > Ai[element+1])) { @@ -1871,7 +1871,7 @@ factorize (const Matrix &matrix) // be more careful for block sparse // matrices, so ship this task out // to a different function - sort_array (); + sort_arrays (matrix); int status; status = umfpack_di_symbolic (N, N, -- 2.39.5