[superlu] 01/01: Add spacing to package descriptions.

[Drew Parsons]

This is an automated email from the git hooks/post-receive script.

dparsons pushed a commit to branch master
in repository superlu.

commit 3bcad5c8385b6fafe65acad6f36c58855d253e43
Author: Drew Parsons <dparsons at debian.org>
Date:   Sat Oct 21 22:24:08 2017 +0800

    Add spacing to package descriptions.
    
    Closes: #266560.
    
    Also, libsuperlu-doc Recommends: libsuperlu-dev
---
 debian/changelog |  7 +++++++
 debian/control   | 60 ++++++++++++++++++++++++++++++++------------------------
 2 files changed, 41 insertions(+), 26 deletions(-)

diff --git a/debian/changelog b/debian/changelog
index dd557e9..f85e147 100644
--- a/debian/changelog
+++ b/debian/changelog
@@ -1,3 +1,10 @@
+superlu (5.2.1+dfsg1-3) UNRELEASED; urgency=medium
+
+  * Team upload.
+  * Add spacing to package descriptions. Closes: #266560.
+
+ -- Drew Parsons <dparsons at debian.org>  Sat, 21 Oct 2017 22:21:38 +0800
+
 superlu (5.2.1+dfsg1-2) unstable; urgency=medium
 
   * Thanks Christophe Prud'homme for your contributions to the earlier
diff --git a/debian/control b/debian/control
index 779f7a1..de02682 100644
--- a/debian/control
+++ b/debian/control
@@ -22,19 +22,22 @@ Depends: ${shlibs:Depends}, ${misc:Depends}
 Description: Direct solution of large, sparse systems of linear equations
  SuperLU is a general purpose library for the direct solution of
  large, sparse, nonsymmetric systems of linear equations on high
- performance machines. The library is written in C and is callable from
- either C or Fortran. The library routines will perform an LU
- decomposition with partial pivoting and triangular system solves
- through forward and back substitution. The LU factorization routines
- can handle non-square matrices but the triangular solves are performed
- only for square matrices. The matrix columns may be preordered (before
- factorization) either through library or user supplied routines. This
- preordering for sparsity is completely separate from the
- factorization. Working precision iterative refinement subroutines are
- provided for improved backward stability. Routines are also provided
- to equilibrate the system, estimate the condition number, calculate
- the relative backward error, and estimate error bounds for the refined
- solutions.
+ performance machines.
+ .
+ The library is written in C and is callable from either C or Fortran.
+ The library routines will perform an LU decomposition with partial
+ pivoting and triangular system solves through forward and back
+ substitution. The LU factorization routines can handle non-square
+ matrices but the triangular solves are performed only for square
+ matrices. The matrix columns may be preordered (before factorization)
+ either through library or user supplied routines. This preordering
+ for sparsity is completely separate from the factorization. Working
+ precision iterative refinement subroutines are provided for improved
+ backward stability. Routines are also provided to equilibrate the
+ system, estimate the condition number, calculate the relative
+ backward error, and estimate error bounds for the refined solutions.
+ .
+ This package contains the SuperLU shared library.
 
 Package: libsuperlu-dev
 Section: libdevel
@@ -48,24 +51,29 @@ Description: Direct solution of large, sparse systems of linear equations
  .
  SuperLU is a general purpose library for the direct solution of
  large, sparse, nonsymmetric systems of linear equations on high
- performance machines. The library is written in C and is callable from
- either C or Fortran. The library routines will perform an LU
- decomposition with partial pivoting and triangular system solves
- through forward and back substitution. The LU factorization routines
- can handle non-square matrices but the triangular solves are performed
- only for square matrices. The matrix columns may be preordered (before
- factorization) either through library or user supplied routines. This
- preordering for sparsity is completely separate from the
- factorization. Working precision iterative refinement subroutines are
- provided for improved backward stability. Routines are also provided
- to equilibrate the system, estimate the condition number, calculate
- the relative backward error, and estimate error bounds for the refined
- solutions.
+ performance machines.
+ .
+ The library is written in C and is callable from either C or Fortran.
+ The library routines will perform an LU decomposition with partial
+ pivoting and triangular system solves through forward and back
+ substitution. The LU factorization routines can handle non-square
+ matrices but the triangular solves are performed only for square
+ matrices. The matrix columns may be preordered (before factorization)
+ either through library or user supplied routines. This preordering
+ for sparsity is completely separate from the factorization. Working
+ precision iterative refinement subroutines are provided for improved
+ backward stability. Routines are also provided to equilibrate the
+ system, estimate the condition number, calculate the relative
+ backward error, and estimate error bounds for the refined solutions.
+ .
+ This package contains the header and development files to build
+ against SuperLU.
 
 Package: libsuperlu-doc
 Section: doc
 Architecture: all
 Depends: ${misc:Depends}
+Recommends: libsuperlu-dev
 Description: Documentation for SuperLU
  This package contains the user guide and the reference manual of SuperLU.
  It also includes some example programs.

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-science/packages/superlu.git