| Version | EAPI | Keywords | Slot |
|---|---|---|---|
| 3.0.3 | 8 | ~alpha ~amd64 ~arm ~arm64 ~hppa ~loong ~mips ~ppc ~ppc64 ~riscv ~s390 ~sparc ~x86 | 0/3 |
| 2.4.6-r1 | 7 | ~alpha amd64 arm arm64 ~hppa ~loong ~mips ~ppc ppc64 ~riscv ~s390 ~sparc ~x86 ~arm64-macos ~x64-macos | 0 |
<pkgmetadata> <maintainer type="project"> <email>sci@gentoo.org</email> <name>Gentoo Science Project</name> </maintainer> <longdescription lang="en"> Constrained Approximate Minimum Degree ordering is a set of routines for ordering a sparse matrix prior to Cholesky factorization (or for LU factorization with diagonal pivoting). </longdescription> <upstream> <remote-id type="github">DrTimothyAldenDavis/SuiteSparse</remote-id> </upstream> </pkgmetadata>
| Flag | Description | 3.0.3 | 2.4.6-r1 |
|---|---|---|---|
| doc | Add extra documentation (API, Javadoc, etc). It is recommended to enable per package instead of globally | ✓ | ✓ |
| test | Enable dependencies and/or preparations necessary to run tests (usually controlled by FEATURES=test but can be toggled independently) | ✓ | ✗ |
| Type | File | Size | Versions |
|---|---|---|---|
| DIST | SuiteSparse-7.0.0.gh.tar.gz | 64884962 bytes | 3.0.3 |
| Type | File | Size |
|---|---|---|
| DIST | camd-2.4.6.tar.bz2 | 317071 bytes |