{"bugs":[{"bugid":721930,"firstseen":"2020-05-09T18:56:55.830338","severity":"normal","status":"CONFIRMED","summary":"sci-libs\/coinor-clp-1.17.6 : ClpFactorization.cpp: error: double CoinFactorization::ftranCountInput_ is protected within this cont"},{"bugid":836102,"firstseen":"2022-03-26T04:01:13.448062","severity":"normal","status":"CONFIRMED","summary":"sci-libs\/coinor-clp: uses variables banned in scope (VariableScope)"},{"bugid":900565,"firstseen":"2023-03-09T14:53:32.711508","severity":"normal","status":"CONFIRMED","summary":"sci-libs\/coinor-clp-1.17.6-r1 has implicit function declarations in configure logs (GCC-13-SYSTEM)"}],"categories":[{"categoryid":318,"name":"sci-libs","summary":"The sci-libs category contains various science-related libraries."},{"categoryid":317,"name":"sci-mathematics","summary":"The sci-mathematics category contains mathematical software."}],"changelog":[{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"3548511996bfd3574f9e3a3a433fb9e7526f3f58","committime":"2024-01-12T15:05:10","packageid":61817,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mgorny@gentoo.org","authorname":"Michał Górny","body":"Per the category metadata, app-doc\/ is reserved for documentation\n*files* and not software. Move it to app-text\/ where it seems a better\nfit.\n\nSigned-off-by: Michał Górny ","commitid":"f7fdfdaeec3764929686064a6054c38a6b2d7788","committime":"2024-01-11T16:04:37","packageid":61817,"repoid":1,"summary":"Move {app-doc → app-text}\/doxygen"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"a411a5fcb5ac457c77383d64fb74647f9e4bc225","committime":"2023-03-07T00:31:56","packageid":61817,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"dlan@gentoo.org","authorname":"Yixun Lan","body":"Signed-off-by: Yixun Lan ","commitid":"6eff601b81ec3030341069e2e42b69f463eac6bf","committime":"2023-03-06T11:38:21","packageid":61817,"repoid":1,"summary":"sci-libs\/coinor-clp: Keyword 1.17.6-r1 riscv, #881389"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"ad1e72b8e24e184cebb642747af2c79721ee51ee","committime":"2022-11-19T05:01:48","packageid":61817,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"xen0n@gentoo.org","authorname":"WANG Xuerui","body":"Signed-off-by: WANG Xuerui ","commitid":"9f10beb1a090def77d49326f647360941849e9c7","committime":"2022-11-19T02:42:11","packageid":61817,"repoid":1,"summary":"sci-libs\/coinor-clp: keyword 1.17.6-r1 for ~loong"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"d5eed8d231844996541b00f161d5b259b75e6b1a","committime":"2022-03-26T11:04:28","packageid":61817,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"andrewammerlaan@gentoo.org","authorname":"Andrew Ammerlaan","body":"- mpi does nothing if mumps is disabled\n- rewrite doc building\n- add missing || die\n\nSigned-off-by: Andrew Ammerlaan ","commitid":"2544bae364261bd686f8933e6ebcbc54d17bee02","committime":"2022-03-26T10:54:15","packageid":61817,"repoid":1,"summary":"sci-libs\/coinor-clp: add REQUIRED_USE"},{"authoremail":"lssndrbarbieri@gmail.com","authorname":"Alessandro Barbieri","body":"Signed-off-by: Alessandro Barbieri \nCloses: https:\/\/github.com\/gentoo\/gentoo\/pull\/21968\nSigned-off-by: Andrew Ammerlaan ","commitid":"e6f9cf418dcfcc3252887b5dddbb06dcbb941d3c","committime":"2021-08-12T23:37:34","packageid":61817,"repoid":1,"summary":"sci-libs\/coinor-clp: EAPI 8, restore old mpi behaviour"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"eb9e08ccc7f6deb96c2d45ce7655407039ca9c16","committime":"2021-07-16T11:51:36","packageid":61817,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"marecki@gentoo.org","authorname":"Marek Szuba","body":"ParMETIS on the one hand no longer installs bundled METIS and on the\nother unconditionally depends on MPI. Therefore, only keep it in ebuilds\nwhich use MPI themselves and depend on METIS directly otherwise.\n\nNote that some of the alleged sci-libs\/parmetis revdeps might in fact\nnot use even when they use MPI, as none of these revdeps have actually\nexplicitly requested sci-libs\/parmetis[mpi].\n\nSigned-off-by: Marek Szuba ","commitid":"ea68b9915231ddf7ac3b09f8032e5cfe99961bdd","committime":"2021-07-16T10:36:31","packageid":61817,"repoid":1,"summary":"*\/*: update sci-libs\/{,par}metis revdeps"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"ea82d90ce08538c35007eb2c5ea9fd1b18561488","committime":"2020-05-08T12:35:02","packageid":61817,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Another \"standard\" version bump that is getting less standard. I've\nadded the usual coinor-* hacks and comments explaining them, but this\npackage is worse than some of the others. The mumps and libscotch\ndependencies are being neglected in Gentoo, so a lot of that stuff is\nbroken. To work around it, we now require sci-libs\/mumps (and\ntherefore sci-libs\/scotch) to be built without USE=mpi.\n\nI don't feel great about this ebuild, but it's a necessary step towards\na modern set of coinor-* packages that we can begin fixing in earnest.\n\nPackage-Manager: Portage-2.3.89, Repoman-2.3.20\nSigned-off-by: Michael Orlitzky ","commitid":"43f4976dbc20cb4c18668db393c05c71a66d9544","committime":"2020-05-07T13:43:52","packageid":61817,"repoid":1,"summary":"sci-libs\/coinor-clp: new EAPI=7 version 1.17.6."},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"fef742528aacdd4ffa4e59ea0354106ca161650e","committime":"2019-12-10T23:48:11","packageid":61817,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mgorny@gentoo.org","authorname":"Michał Górny","body":"The result was achieved via the following pipeline:\n\n pkgcheck scan -c RestrictTestCheck -R FormatReporter \\\n --format '{category}\/{package}\/{package}-{version}.ebuild' |\n xargs -n32 grep -L RESTRICT |\n xargs -n32 sed -i -e '\/^IUSE=.*test\/aRESTRICT=\"!test? ( test )\"'\n\nThe resulting metadata was compared before and after the change.\nFew Go ebuilds had to be fixed manually due to implicit RESTRICT=strip\nadded by the eclass. Two ebuilds have to be fixed because of multiline\nIUSE.\n\nSuggested-by: Robin H. Johnson \nCloses: https:\/\/github.com\/gentoo\/gentoo\/pull\/13942\nSigned-off-by: Michał Górny ","commitid":"064af661d0c9a31cecdf348632bc5603333a9149","committime":"2019-12-10T22:02:54","packageid":61817,"repoid":1,"summary":"*\/*: [QA] Fix trivial cases of MissingTestRestrict"},{"authoremail":"repo-qa-checks@gentoo.org","authorname":"Repository QA checks","commitid":"25093d6359f778b8d1052f66ba9e26fc29ded21a","committime":"2017-02-28T20:35:29","packageid":61817,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"robbat2@gentoo.org","authorname":"Robin H. Johnson","body":"Signed-off-by: Robin H. Johnson ","commitid":"61b861acd7b49083dab687e133f30f3331cb7480","committime":"2017-02-28T19:47:27","packageid":61817,"repoid":1,"summary":"Drop $Id$ per council decision in bug #611234."},{"authoremail":"repo-qa-checks@gentoo.org","authorname":"Repository QA checks","commitid":"945f0d2a26da4f944fd06ad6a874f69d37ce1e06","committime":"2015-08-09T09:26:46","packageid":61817,"repoid":1,"summary":"2015-08-09 09:26:21 UTC"},{"authoremail":"robbat2@gentoo.org","authorname":"Robin H. Johnson","body":"This commit represents a new era for Gentoo:\nStoring the gentoo-x86 tree in Git, as converted from CVS.\n\nThis commit is the start of the NEW history.\nAny historical data is intended to be grafted onto this point.\n\nCreation process:\n1. Take final CVS checkout snapshot\n2. Remove ALL ChangeLog* files\n3. Transform all Manifests to thin\n4. Remove empty Manifests\n5. Convert all stale $Header$\/$Id$ CVS keywords to non-expanded Git $Id$\n5.1. Do not touch files with -kb\/-ko keyword flags.\n\nSigned-off-by: Robin H. Johnson \nX-Thanks: Alec Warner - did the GSoC 2006 migration tests\nX-Thanks: Robin H. Johnson - infra guy, herding this project\nX-Thanks: Nguyen Thai Ngoc Duy - Former Gentoo developer, wrote Git features for the migration\nX-Thanks: Brian Harring - wrote much python to improve cvs2svn\nX-Thanks: Rich Freeman - validation scripts\nX-Thanks: Patrick Lauer - Gentoo dev, running new 2014 work in migration\nX-Thanks: Michał Górny - scripts, QA, nagging\nX-Thanks: All of other Gentoo developers - many ideas and lots of paint on the bikeshed","commitid":"56bd759df1d0c750a065b8c845e93d5dfa6b549d","committime":"2015-08-08T20:49:04","packageid":61817,"repoid":1,"summary":"proj\/gentoo: Initial commit"},{"authoremail":"repo-qa-checks@gentoo.org","authorname":"Repository QA checks","commitid":"a637bd65b7fef8e2be4e7fc6e9097479372e0e2e","committime":"2015-06-19T16:38:33","packageid":61817,"repoid":1,"summary":"2015-06-19 16:35:30 UTC"}],"dependencies":[{"block":false,"categoryid":318,"description":"Library to order a sparse matrix prior to Cholesky factorization","ebuildids":[674462,744441],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"amd","packageid":42168,"summary":"AMD is a set of routines for ordering a sparse matrix prior to Cholesky factorization (or for LU factorization with diagonal pivoting). There are versions in both C and Fortran."},{"block":false,"categoryid":318,"description":"A package for unstructured serial graph partitioning","ebuildids":[674462,744441],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"metis","packageid":43712,"summary":"METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes."},{"block":false,"categoryid":317,"description":"GNU Linear Programming Kit","ebuildids":[674462,744441],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"robbat2@gentoo.org","maintainername":"Gentoo Mathematics Project","name":"glpk","packageid":44310,"summary":"The GNU Linear Programming Kit package is intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. It is a set of routines written in ANSI C and organized in the form of a callable library."},{"block":false,"categoryid":318,"description":"Sparse Cholesky factorization and update\/downdate library","ebuildids":[674462,744441],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"cholmod","packageid":47950},{"block":false,"categoryid":318,"description":"COIN-OR Open Solver Interface","ebuildids":[674462,744441],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-osi","packageid":61824,"summary":"The COIN-OR Open Solver Interface is a uniform API for interacting with callable solver libraries. It supports linear programming solvers as well as the ability to \"finish off\" a mixed-integer problem calling the solver library's MIP solver."},{"block":false,"categoryid":318,"description":"COIN-OR Matrix, Vector and other utility classes","ebuildids":[674462,744441],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-utils","packageid":61828,"summary":"CoinUtils (Coin-or Utilities) is a collection of classes that are generally useful to COmputational INfrastructure for Operations Research (COIN-OR) projects. These include vector, matrix, mps file reading classes."},{"block":false,"categoryid":318,"description":"MUltifrontal Massively Parallel sparse direct matrix Solver","ebuildids":[674462,744441],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"mumps","packageid":61830,"summary":"MUltifrontal Massively Parallel sparse direct Solver implements a direct solver for large sparse linear systems, with a particular focus on symmetric positive definite matrices. It can operate on distributed matrices e.g. over a cluster. It has Fortran and C interfaces, and can interface with ordering tools such as Scotch or Metis."}],"depending":[{"block":false,"categoryid":318,"description":"C++ template static library of common data structures and algorithms","ebuildids":[796594,796594],"firstseen":"2014-01-14T14:46:49.842361","maintainer":"mmokrejs@gmail.com","maintainername":"Martin Mokrejs","name":"lemon","packageid":61807,"summary":"LEMON stands for Library for Efficient Modeling and Optimization in Networks. It is a C++ template library providing efficient implementations of common data structures and algorithms with focus on combinatorial optimization tasks connected mainly with graphs and networks."},{"block":false,"categoryid":318,"description":"COIN-OR Branch-Cut-Price Framework","ebuildids":[704527,704527],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-bcp","packageid":61812,"summary":"BCP is a parallel framework for implementing branch, cut, and price algorithms for solving mixed integer programs (MIPs). BCP provides the user with an object-oriented framework that can be used to develop an efficient problem class specific MIP solver without all the implementational effort. involved with implementing a branch and bound framework from scratch."},{"block":false,"categoryid":318,"description":"COIN-OR BiCePS Linear Integer Solver","ebuildids":[704529,704529],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-blis","packageid":61814,"summary":"CHiPPS is the COIN-OR High-Performance Parallel Search Framework, a framework for implementing parallel algorithms based on tree search. The current CHiPPS architecture consists of three layers. The BiCePS Linear Integer Solver (BLIS) is a concretization of the BiCePS layer for solving mixed-integer linear programs."},{"block":false,"categoryid":318,"description":"COIN-OR branch-and-cut mixed integer program solver","ebuildids":[674460,674460],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-cbc","packageid":61815,"summary":"COIN-OR Branch-and-Cut is a Mixed integer linear programming solver. It uses many of the COIN-OR components and is designed to be used with COIN-OR CLP or COIN-OR Dylp. It is available as a library and as a standalone solver."},{"block":false,"categoryid":318,"description":"COIN-OR cut-generation library","ebuildids":[674461,674461],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-cgl","packageid":61816,"summary":"The COIN-OR Cut Generation Library (Cgl) is an open collection of cutting plane implementations (\"cut generators\") for use in teaching, research, and applications. Cgl can be used with other COIN-OR packages that make use of cuts, such as the mixed-integer linear programming."},{"block":false,"categoryid":318,"description":"COIN-OR Decomposition in Integer Programming library","ebuildids":[713406,713406],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-dip","packageid":61819,"summary":"DIP (Decomposition for Integer Programming) is an open-source extensible software framework for implementing decomposition-based bounding algorithms for use in solving large-scale discrete optimization problems. The framework provides a simple API for experimenting with various decomposition-based algorithms, such as Dantzig-Wolfe decomposition, Lagrangian relaxation, and various cutting plane methods."},{"block":false,"categoryid":318,"description":"COIN-OR lightweight API for COIN-OR libraries CLP, CBC, and CGL","ebuildids":[704535,704535],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-mp","packageid":61822,"summary":"The COmputational INfrastructure for Operations Research (COIN-OR) MP is a C-API interface library that supports most of the functionality of the CLP (Coin LP), CBC (Coin Branch-and-Cut), and CGL (Cut Generation Library) projects."},{"block":false,"categoryid":318,"description":"COIN-OR Stochastic modelling interface","ebuildids":[704537,704537],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-smi","packageid":61826,"summary":"The COIN-OR Stochastic Modeling Interface (SMI) is an interface for problems in which uncertainty and optimization appear together. There are many modeling and algorithmic approaches that could belong here, like: recourse programming, chance constrained programming, stochastic control and dynamic programming, robust optimization, etc, etc. SMI is intended to be like OSI in the sense that an SmiXX object is an implementation derived from a base class that takes care of a number of commonly encountered programming issues, like handling probability distributions, managing problem generation, interacting with solvers to obtain solution information, etc."},{"block":false,"categoryid":318,"description":"COIN-OR solver for mixed-integer linear programs","ebuildids":[704538,704538],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-symphony","packageid":61827,"summary":"SYMPHONY is a generic mixed-integer linear programs (MILP) solver, callable library, and extensible framework for implementing customized solvers. SYMPHONY has a number of advanced capabilities, including the ability to solve multi-objective MILPs, the ability to warm start its solution procedure. SYMPHONY is part of the larger COIN-OR initiative (Computational Infrastructurefor Operations Research)."},{"block":false,"categoryid":318,"description":"COIN-OR Basic Open-source Nonlinear Mixed INteger programming","ebuildids":[704530,704530],"firstseen":"2014-01-16T14:35:40.742019","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-bonmin","packageid":61833,"summary":"BONMIN (Basic Open-source Nonlinear Mixed INteger programming) is an open-source code for solving general MINLP (Mixed Integer NonLinear Programming) problems."},{"block":false,"categoryid":318,"description":"COIN-OR Convex Over and Under ENvelopes for Nonlinear Estimation","ebuildids":[704882,704882],"firstseen":"2014-01-16T14:35:40.742019","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-couenne","packageid":61834,"summary":"Couenne (Convex Over and Under ENvelopes for Nonlinear Estimation) is a spatial branch and bound algorithm that implements linearization, bound reduction, and branching techniques for Mixed-integer, Nonlinear Programming (MINLP) problems. The purpose of Couenne is to find global optima of nonconvex MINLPs."},{"block":false,"categoryid":318,"description":"Scientific library collection for large scale problems","ebuildids":[796529,796529,808080,808080,829204,829204,833645,833645],"firstseen":"2019-08-05T07:39:31.134254","name":"trilinos","packageid":70043,"summary":"The Trilinos Project is an effort to develop algorithms and enabling technologies within an object-oriented software framework for the solution of large-scale, complex multi-physics engineering and scientific problems."}],"ebuilds":[{"archs":["~amd64","~amd64-linux","~loong","~riscv","~x86","~x86-linux"],"ebuildid":744441,"firstseen":"2022-03-26T11:22:52.495826","license":"EPL-1.0","moddate":"2024-12-17T22:35:47","packageid":61817,"repoid":1,"slot":"0\/1","uses":["doc","examples","glpk","metis","mpi","mumps","sparse","static-libs","test"],"version":"1.17.6-r1"},{"archs":["~amd64","~amd64-linux","~x86","~x86-linux"],"ebuildid":674462,"firstseen":"2020-05-08T13:41:20.890780","license":"EPL-1.0","moddate":"2024-12-17T22:35:47","packageid":61817,"repoid":1,"slot":"0\/1","uses":["doc","examples","glpk","metis","mumps","sparse","static-libs","test"],"version":"1.17.6"}],"masks":[],"package":{"categoryid":318,"description":"COIN-OR linear programming solver","firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-clp","packageid":61817,"summary":"Clp (Coin-OR linear programming) is an open-source linear programming solver written in C++. It is primarily meant to be used as a callable library, but a basic, stand-alone executable version is also available. It is designed to find solutions of constrained linear mathematical optimization problems."},"rdependencies":[{"block":false,"categoryid":318,"description":"Library to order a sparse matrix prior to Cholesky factorization","ebuildids":[674462,744441],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"amd","packageid":42168,"summary":"AMD is a set of routines for ordering a sparse matrix prior to Cholesky factorization (or for LU factorization with diagonal pivoting). There are versions in both C and Fortran."},{"block":false,"categoryid":318,"description":"A package for unstructured serial graph partitioning","ebuildids":[674462,744441],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"metis","packageid":43712,"summary":"METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes."},{"block":false,"categoryid":317,"description":"GNU Linear Programming Kit","ebuildids":[674462,744441],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"robbat2@gentoo.org","maintainername":"Gentoo Mathematics Project","name":"glpk","packageid":44310,"summary":"The GNU Linear Programming Kit package is intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. It is a set of routines written in ANSI C and organized in the form of a callable library."},{"block":false,"categoryid":318,"description":"Sparse Cholesky factorization and update\/downdate library","ebuildids":[674462,744441],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"cholmod","packageid":47950},{"block":false,"categoryid":318,"description":"COIN-OR Open Solver Interface","ebuildids":[674462,744441],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-osi","packageid":61824,"summary":"The COIN-OR Open Solver Interface is a uniform API for interacting with callable solver libraries. It supports linear programming solvers as well as the ability to \"finish off\" a mixed-integer problem calling the solver library's MIP solver."},{"block":false,"categoryid":318,"description":"COIN-OR Matrix, Vector and other utility classes","ebuildids":[674462,744441],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-utils","packageid":61828,"summary":"CoinUtils (Coin-or Utilities) is a collection of classes that are generally useful to COmputational INfrastructure for Operations Research (COIN-OR) projects. These include vector, matrix, mps file reading classes."},{"block":false,"categoryid":318,"description":"MUltifrontal Massively Parallel sparse direct matrix Solver","ebuildids":[674462,744441],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"mumps","packageid":61830,"summary":"MUltifrontal Massively Parallel sparse direct Solver implements a direct solver for large sparse linear systems, with a particular focus on symmetric positive definite matrices. It can operate on distributed matrices e.g. over a cluster. It has Fortran and C interfaces, and can interface with ordering tools such as Scotch or Metis."}],"repos":[{"branch":"master","lastcommit":"76f1e3c8ccd64113c3f681214c0c9e26102d9899","name":"gentoo","path":"\/usr\/portage","repoid":1,"upstream":"origin"}],"tracked":false,"urls":["https:\/\/github.com\/coin-or\/Clp"],"uses":[{"description":"Add extra documentation (API, Javadoc, etc). It is recommended to enable per package instead of globally","isdefault":false,"use":"doc"},{"description":"Install examples, usually source code","isdefault":false,"use":"examples"},{"description":"Enable GNU Linear Programming Kit sci-mathematics\/glpk support","isdefault":false,"packageid":61817,"use":"glpk"},{"description":"Enable partitioning with sci-libs\/metis","isdefault":false,"packageid":61817,"use":"metis"},{"description":"Add MPI (Message Passing Interface) layer to the apps that support it","isdefault":false,"use":"mpi"},{"description":"Enable sci-libs\/mumps support","isdefault":false,"packageid":61817,"use":"mumps"},{"description":"Enable support for sparse matrix with sci-libs\/cholmod","isdefault":false,"packageid":61817,"use":"sparse"},{"description":"Build static versions of dynamic libraries as well","isdefault":false,"use":"static-libs"},{"description":"Enable dependencies and\/or preparations necessary to run tests (usually controlled by FEATURES=test but can be toggled independently)","isdefault":false,"use":"test"}]}