academic/colamd: Renamed and moved from libraries.

Signed-off-by: Robby Workman <rworkman@slackbuilds.org>
This commit is contained in:
Kyle Guinn 2014-01-24 20:35:26 -06:00 committed by Robby Workman
parent ffffac9b04
commit 928fce8faa
5 changed files with 18 additions and 17 deletions

View File

@ -22,7 +22,8 @@
# OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
# ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
PRGNAM=COLAMD
PRGNAM=colamd
SRCNAM=COLAMD
VERSION=${VERSION:-2.8.0}
BUILD=${BUILD:-1}
TAG=${TAG:-_SBo}
@ -64,9 +65,9 @@ set -e
rm -rf $PKG
mkdir -p $TMP $PKG $OUTPUT
cd $TMP
rm -rf $PRGNAM
tar xvf $CWD/$PRGNAM-$VERSION.tar.gz
cd $PRGNAM
rm -rf $SRCNAM
tar xvf $CWD/$SRCNAM-$VERSION.tar.gz
cd $SRCNAM
chown -R root:root .
find -L . \
\( -perm 777 -o -perm 775 -o -perm 750 -o -perm 711 -o -perm 555 \

View File

@ -1,10 +1,10 @@
PRGNAM="COLAMD"
PRGNAM="colamd"
VERSION="2.8.0"
HOMEPAGE="https://www.cise.ufl.edu/research/sparse/colamd/"
DOWNLOAD="https://www.cise.ufl.edu/research/sparse/colamd/COLAMD-2.8.0.tar.gz"
MD5SUM="482dc4f958c2dafdd430d4c3148d15c5"
DOWNLOAD_x86_64=""
MD5SUM_x86_64=""
REQUIRES="SuiteSparse_config"
REQUIRES="suitesparseconfig"
MAINTAINER="Kyle Guinn"
EMAIL="elyk03@gmail.com"

View File

@ -6,14 +6,14 @@
# customary to leave one space after the ':' except on otherwise blank lines.
|-----handy-ruler------------------------------------------------------|
COLAMD: COLAMD (sparse matrix ordering routines)
COLAMD:
COLAMD: The COLAMD column approximate minimum degree ordering algorithm
COLAMD: computes a permutation vector P such that the LU factorization of
COLAMD: A (:,P) tends to be sparser than that of A. The Cholesky
COLAMD: factorization of (A (:,P))'*(A (:,P)) will also tend to be sparser
COLAMD: than that of A'*A.
COLAMD:
COLAMD:
COLAMD:
COLAMD:
colamd: COLAMD (sparse matrix ordering routines)
colamd:
colamd: The COLAMD column approximate minimum degree ordering algorithm
colamd: computes a permutation vector P such that the LU factorization of
colamd: A (:,P) tends to be sparser than that of A. The Cholesky
colamd: factorization of (A (:,P))'*(A (:,P)) will also tend to be sparser
colamd: than that of A'*A.
colamd:
colamd:
colamd:
colamd: