proj/gentoo: Initial commit

This commit represents a new era for Gentoo:
Storing the gentoo-x86 tree in Git, as converted from CVS.

This commit is the start of the NEW history.
Any historical data is intended to be grafted onto this point.

Creation process:
1. Take final CVS checkout snapshot
2. Remove ALL ChangeLog* files
3. Transform all Manifests to thin
4. Remove empty Manifests
5. Convert all stale $Header$/$Id$ CVS keywords to non-expanded Git $Id$
5.1. Do not touch files with -kb/-ko keyword flags.

Signed-off-by: Robin H. Johnson <robbat2@gentoo.org>
X-Thanks: Alec Warner <antarus@gentoo.org> - did the GSoC 2006 migration tests
X-Thanks: Robin H. Johnson <robbat2@gentoo.org> - infra guy, herding this project
X-Thanks: Nguyen Thai Ngoc Duy <pclouds@gentoo.org> - Former Gentoo developer, wrote Git features for the migration
X-Thanks: Brian Harring <ferringb@gentoo.org> - wrote much python to improve cvs2svn
X-Thanks: Rich Freeman <rich0@gentoo.org> - validation scripts
X-Thanks: Patrick Lauer <patrick@gentoo.org> - Gentoo dev, running new 2014 work in migration
X-Thanks: Michał Górny <mgorny@gentoo.org> - scripts, QA, nagging
X-Thanks: All of other Gentoo developers - many ideas and lots of paint on the bikeshed

1 files changed, 21 insertions, 0 deletions

diff --git a/sci-libs/superlu/metadata.xml b/sci-libs/superlu/metadata.xml
new file mode 100644
index 000000000000..e43161f47979
--- /dev/null
+++ b/sci-libs/superlu/metadata.xml
@@ -0,0 +1,21 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd">
+<pkgmetadata>
+  <herd>sci</herd>
+  <longdescription lang="en">
+  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.
+</longdescription>
+</pkgmetadata>