{"bugs":[{"bugid":836101,"firstseen":"2022-03-26T04:01:13.448062","severity":"normal","status":"CONFIRMED","summary":"sci-libs\/coinor-cgl: uses variables banned in scope (VariableScope)"},{"bugid":849707,"firstseen":"2022-06-04T22:04:57.122232","severity":"normal","status":"CONFIRMED","summary":"sci-libs\/coinor-cgl-0.60.3 installs libtool files (.la) without corresponding static libraries"},{"bugid":865921,"firstseen":"2022-08-21T12:56:19.520214","severity":"normal","status":"CONFIRMED","summary":"sci-libs\/coinor-cgl-0.60.3 - CglLandPUtils.hpp: error: invalid cast from type std::nullptr_t to type OsiRowCut"},{"bugid":900563,"firstseen":"2023-03-09T14:53:32.711508","severity":"normal","status":"CONFIRMED","summary":"sci-libs\/coinor-cgl-0.60.3 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."}],"changelog":[{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"3548511996bfd3574f9e3a3a433fb9e7526f3f58","committime":"2024-01-12T15:05:10","packageid":61816,"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":61816,"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":61816,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"dlan@gentoo.org","authorname":"Yixun Lan","body":"Signed-off-by: Yixun Lan ","commitid":"9b87a859ac9f8851ca8cf62c3c1352ac9f4b2cb9","committime":"2023-03-06T11:38:31","packageid":61816,"repoid":1,"summary":"sci-libs\/coinor-cgl: Keyword 0.60.3 riscv, #881389"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"ad1e72b8e24e184cebb642747af2c79721ee51ee","committime":"2022-11-19T05:01:48","packageid":61816,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"xen0n@gentoo.org","authorname":"WANG Xuerui","body":"Signed-off-by: WANG Xuerui ","commitid":"02c466b5962f774a18c8e1746be54fa92a4642e2","committime":"2022-11-19T02:42:19","packageid":61816,"repoid":1,"summary":"sci-libs\/coinor-cgl: keyword 0.60.3 for ~loong"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"ea82d90ce08538c35007eb2c5ea9fd1b18561488","committime":"2020-05-08T12:35:02","packageid":61816,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Standardish EAPI\/version bump, documenting all of the coinor-*\nweirdness that I'm now familiar with. I added a subslot 0\/1\ncorresponding to the major soname component in, for example,\nlibCgl.so.1.10.3.\n\nPackage-Manager: Portage-2.3.89, Repoman-2.3.20\nSigned-off-by: Michael Orlitzky ","commitid":"8a5725be549e222fa1ebf14b9e0624a6ddf87b30","committime":"2020-05-07T17:13:39","packageid":61816,"repoid":1,"summary":"sci-libs\/coinor-cgl: new EAPI=7 version 0.60.3."},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"fef742528aacdd4ffa4e59ea0354106ca161650e","committime":"2019-12-10T23:48:11","packageid":61816,"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":61816,"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":61816,"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":61816,"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":61816,"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":61816,"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":61816,"repoid":1,"summary":"2015-06-19 16:35:30 UTC"}],"dependencies":[{"block":false,"categoryid":318,"description":"COIN-OR linear programming solver","ebuildids":[674461],"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."},{"block":false,"categoryid":318,"description":"COIN-OR dynamic simplex linear program solver","ebuildids":[674461],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-dylp","packageid":61820,"summary":"DyLP is designed to find solutions of constrained linear mathematical optimization problems. To this end, it is using a full implementation of the so called dynamic simplex algorithm for linear programming. DyLP is part of the larger COIN-OR initiative (Computational Infrastructure for Operations Research)."},{"block":false,"categoryid":318,"description":"COIN-OR Open Solver Interface","ebuildids":[674461],"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":[674461],"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":"COIN-OR volume algorithm linear program solver","ebuildids":[674461],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-vol","packageid":61829,"summary":"Volume Algorithm is part of COIN-OR (COmputational INfrastructure for Operations Research) project. Vol is an implementation of a subgradient method that produces primal as well as dual solutions."}],"depending":[{"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 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 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."}],"ebuilds":[{"archs":["~amd64","~amd64-linux","~loong","~riscv","~x86","~x86-linux"],"ebuildid":674461,"firstseen":"2020-05-08T13:41:20.890780","license":"EPL-1.0","moddate":"2024-01-12T15:22:47","packageid":61816,"repoid":1,"slot":"0\/1","uses":["doc","examples","static-libs","test"],"version":"0.60.3"}],"masks":[],"package":{"categoryid":318,"description":"COIN-OR cut-generation library","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."},"rdependencies":[{"block":false,"categoryid":318,"description":"COIN-OR linear programming solver","ebuildids":[674461],"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."},{"block":false,"categoryid":318,"description":"COIN-OR dynamic simplex linear program solver","ebuildids":[674461],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-dylp","packageid":61820,"summary":"DyLP is designed to find solutions of constrained linear mathematical optimization problems. To this end, it is using a full implementation of the so called dynamic simplex algorithm for linear programming. DyLP is part of the larger COIN-OR initiative (Computational Infrastructure for Operations Research)."},{"block":false,"categoryid":318,"description":"COIN-OR Open Solver Interface","ebuildids":[674461],"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":[674461],"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":"COIN-OR volume algorithm linear program solver","ebuildids":[674461],"firstseen":"2014-01-15T14:46:35.049138","maintainer":"sci@gentoo.org","maintainername":"Gentoo Science Project","name":"coinor-vol","packageid":61829,"summary":"Volume Algorithm is part of COIN-OR (COmputational INfrastructure for Operations Research) project. Vol is an implementation of a subgradient method that produces primal as well as dual solutions."}],"repos":[{"branch":"master","lastcommit":"fca511c77eccdbd1fc733bf9fc52a6fcd83f1434","name":"gentoo","path":"\/usr\/portage","repoid":1,"upstream":"origin"}],"tracked":false,"urls":["https:\/\/projects.coin-or.org\/Cgl\/"],"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":"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"}]}