{"bugs":[{"bugid":944036,"firstseen":"2024-11-19T20:52:26.702956","severity":"normal","status":"CONFIRMED","summary":"sci-mathematics\/gap-4.13.1-r1 - [ncurses-6.5] [meson] [libtool] [gcc-15] src\/bool.c: error: passing argument 1 of InitHandlerFunc from incompatible pointer type [-Wincomp"}],"categories":[{"categoryid":1560,"name":"dev-debug"},{"categoryid":1562,"name":"dev-gap","summary":"The dev-gap category contains packages for the GAP computer algebra system, available at https:\/\/www.gap-system.org\/packages\/."},{"categoryid":393,"name":"dev-libs","summary":"The dev-libs category contains various miscellaneous programming libraries."},{"categoryid":317,"name":"sci-mathematics","summary":"The sci-mathematics category contains mathematical software."},{"categoryid":381,"name":"sys-libs","summary":"The sys-libs category contains various system-level libraries."}],"changelog":[{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"353d3dad87f6bd7deeee47a2e8ff40532973ead7","committime":"2024-11-24T14:48:11","packageid":77034,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"In particular, this fixes bug 944744, a test failure with the new\ndev-gap\/grape.\n\nCloses: https:\/\/bugs.gentoo.org\/944744\nSigned-off-by: Michael Orlitzky ","commitid":"aa676b404b96cc55e5596728261f37794591dc72","committime":"2024-11-24T14:23:12","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: backport another upstream patch"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"fde5db99f97b0021af03d25b81469a0eac04b762","committime":"2024-11-23T14:24:35","packageid":77034,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Signed-off-by: Michael Orlitzky ","commitid":"f8f09cb5f6adaa0e7ca7f539d2ce4e59ea7e8063","committime":"2024-11-21T00:07:42","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: add 4.14.0_beta1"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"60afcf70cbb2d34565ceed125516f88b368ed024","committime":"2024-10-09T13:48:17","packageid":77034,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Backport https:\/\/github.com\/gap-system\/gap\/pull\/5796 because it's\ncausing failures in the SageMath test suite when dev-gap\/grape also\nhappens to be installed.\n\nThanks to Dima Pasechnik for the pointer.\n\nSigned-off-by: Michael Orlitzky ","commitid":"69eb7e19b70a4eedbbc6699b8cd5045a49e0e244","committime":"2024-10-09T13:34:00","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: revbump with an upstream patch"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"df1ad0eb43d167ec17ad510d0c0da6d1f97e0e92","committime":"2024-08-29T14:18:46","packageid":77034,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"(And rearrange some variables to appease pkgcheck.)\n\nSigned-off-by: Michael Orlitzky ","commitid":"48c64c09523127fdf44095413e11ed5bd2e288fe","committime":"2024-08-28T13:20:20","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap,dev-gap\/*: add ~riscv keywords"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"a0c64c2687b1d2bfc1e42085999a420a07fdaeef","committime":"2024-07-14T23:03:56","packageid":77034,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Signed-off-by: Michael Orlitzky ","commitid":"8182d6c863ab09949b876a2fe50cc957df6fa2d5","committime":"2024-07-14T22:47:46","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: drop 4.13.0"},{"authoremail":"sam@gentoo.org","authorname":"Sam James","body":"Signed-off-by: Sam James ","commitid":"dfd388d146765f35c8c316067faa06a404c57756","committime":"2024-07-14T22:44:27","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: Stabilize 4.13.1 amd64, #936054"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"41b6e5a4e31f48bab10e2a27ff818202596c7f6a","committime":"2024-06-14T01:48:55","packageid":77034,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Signed-off-by: Michael Orlitzky ","commitid":"2b486e60b88aa44369e2d696ba705afaed84a57e","committime":"2024-06-13T23:42:03","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: add 4.13.1"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"df93d8996bee9324178fbcae241716fd3b905b21","committime":"2024-05-08T07:48:56","packageid":77034,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"juippis@gentoo.org","authorname":"Joonas Niilola","body":"Signed-off-by: Joonas Niilola ","commitid":"76b3c10daf41fb62123f2c192516a9102641f283","committime":"2024-05-08T07:32:37","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: Stabilize 4.13.0 amd64, #931511"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"ae3ef41d23a3038b85be95798f13c0ad133b77bb","committime":"2024-03-19T21:04:05","packageid":77034,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Signed-off-by: Michael Orlitzky ","commitid":"7defea81a0e791ecb81999292862fb204f081b73","committime":"2024-03-18T14:54:48","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: drop 4.12.2-r4"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Signed-off-by: Michael Orlitzky ","commitid":"1d5a649cfb4443b2ae96b516f722f28b13e98755","committime":"2024-03-18T14:54:20","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: add 4.13.0, drop 4.13.0_alpha2"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"110b436d28928620548a57aaa2b93d89e5121b59","committime":"2024-02-20T23:48:58","packageid":77034,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Signed-off-by: Michael Orlitzky ","commitid":"dca27bfcce1a3d987f3b3d6fd7ffa489305d5454","committime":"2024-02-20T15:31:46","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: add 4.13.0_alpha2, drop 4.13.0_alpha1"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"67ef6840be95d45e0f5cd965741f7194d90a818f","committime":"2024-02-07T21:33:23","packageid":77034,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Signed-off-by: Michael Orlitzky ","commitid":"9a97b3a4c75084e81cb96286afe7825650cb141c","committime":"2024-02-07T21:17:20","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: add 4.13.0_alpha1 masked for testing"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"c8b0ac9524b3e52753b246c0309d4e3cb1d89962","committime":"2024-02-05T15:18:23","packageid":77034,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Closes: https:\/\/bugs.gentoo.org\/922835\nSigned-off-by: Michael Orlitzky ","commitid":"0b6fa23e6ed561e1248bf2928202ba5966944388","committime":"2024-02-05T15:00:39","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: respect CC and CXX in the \"gac\" compiler"},{"authoremail":"repomirrorci@gentoo.org","authorname":"Repository mirror & CI","commitid":"ef7e430d211f596ad971e729444e8a50fe17a0d1","committime":"2024-01-22T11:35:12","packageid":77034,"repoid":1,"summary":"Merge updates from master"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Suggested-by: Michael Mair-Keimberger \nSigned-off-by: Michael Orlitzky ","commitid":"0f2e12f7aa02ef63b84cfc748d851a9044e55b76","committime":"2024-01-17T00:39:28","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: use a bash array for econf args"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Without AC_CONFIG_MACRO_DIRS in configure.ac, running eautoconf clobbers\nthe important m4_include directives in aclocal.m4, leading to libtool\nversion errors in the build. A quick \"sed\" does the trick.\n\nSigned-off-by: Michael Orlitzky ","commitid":"5419a91b0e134275bfdcb321f2eaec35480a94f0","committime":"2024-01-14T14:35:18","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: fix regeneration of aclocal.m4"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Some day, this might pull in app-emacs\/gap-mode, which does not yet\nexist. I tried to package it but it throws several warnings in the\nlatest version of emacs:\n\n https:\/\/gitlab.com\/gvol\/gap-mode\/-\/issues\/13\n\nFor now let's drop the flag since it doesn't do anything.\n\nSigned-off-by: Michael Orlitzky ","commitid":"498ad57b5231fd0ff2e55aab14254c6ecbaab9fd","committime":"2024-01-14T12:54:35","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: drop USE=emacs (a no-op)"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Signed-off-by: Michael Orlitzky ","commitid":"7fb1aee89d3004cb4c12c0d3ebfbcacd2c5b2006","committime":"2024-01-14T00:57:36","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: update dev-util\/valgrind -> dev-debug\/valgrind"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"This completes the rest of the dependency circle for GAP and the\npackages that it sort-of depends on.\n\nSigned-off-by: Michael Orlitzky ","commitid":"6beb198dc65f95ccc86bbb32bf906eb6dfddecfb","committime":"2023-12-21T15:39:21","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: PDEPEND on autoloaded packages without USE=minimal"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"Now that the four \"required\" GAP packages are in the tree, GAP itself\nshould depend upon them. Afterwards, its test suite is usable (modulo\ncircular dependency issues).\n\nSigned-off-by: Michael Orlitzky ","commitid":"c42748c637c1cb605188f3584cce2aef06276ec3","committime":"2023-12-21T14:51:24","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: depend on required packages, enable tests"},{"authoremail":"mjo@gentoo.org","authorname":"Michael Orlitzky","body":"This is not really functional for the moment, because GAP has several\nrequired packages that cannot be added until GAP itself is in the tree\ndue to circular dependencies.\n\nSigned-off-by: Michael Orlitzky ","commitid":"61447179735f6dc2be6f7da74307eaccd01c96c8","committime":"2023-12-21T14:28:57","packageid":77034,"repoid":1,"summary":"sci-mathematics\/gap: new package, add 4.12.2"}],"dependencies":[{"block":false,"categoryid":381,"description":"Another cute console display library","ebuildids":[829856,845621,845714],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"base-system@gentoo.org","maintainername":"Gentoo Base System","name":"readline","packageid":53265},{"block":false,"categoryid":381,"description":"Standard (de)compression library","ebuildids":[829856,845621,845714],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"base-system@gentoo.org","maintainername":"Gentoo Base System","name":"zlib","packageid":55408},{"block":false,"categoryid":393,"description":"Library for arbitrary-precision arithmetic on different type of numbers","ebuildids":[829856,845621,845714],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"toolchain@gentoo.org","maintainername":"Gentoo Toolchain Project","name":"gmp","packageid":55512},{"block":false,"categoryid":1560,"description":"An open-source memory debugger for GNU\/Linux","ebuildids":[829856,845621,845714],"firstseen":"2024-01-13T18:09:53.829789","name":"valgrind","packageid":76909,"summary":"Valgrind is a GPL'd tool to help you find memory-management problems in your programs. When a program is run under Valgrind's supervision, all reads and writes of memory are checked, and calls to malloc\/new\/free\/delete are intercepted. As a result, Valgrind can detect problems such as - Use of uninitialised memory - Reading\/writing memory after it has been free'd - Reading\/writing off the end of malloc'd blocks - Reading\/writing inappropriate areas on the stack - Memory leaks -- where pointers to malloc'd blocks are lost forever - Passing of uninitialised and\/or unaddressible memory to system calls - Mismatched use of malloc\/new\/new [] vs free\/delete\/delete [] - Some abuses of the POSIX Pthreads API"}],"depending":[{"block":false,"categoryid":1562,"description":"Almost-crystallographic group library and algorithms for GAP","ebuildids":[812640],"firstseen":"2024-01-22T11:43:13.819329","name":"aclib","packageid":76973,"summary":"The AClib package contains a library of almost crystallographic groups and a some algorithms to compute with these groups. A group is called almost crystallographic if it is finitely generated nilpotent-by-finite and has no non-trivial finite normal subgroups."},{"block":false,"categoryid":1562,"description":"Algebraic number theory and an interface to PARI\/GP","ebuildids":[812641],"firstseen":"2024-01-22T11:43:13.819329","name":"alnuth","packageid":76974,"summary":"The Alnuth package provides various methods to compute with number fields which are given by a defining polynomial or by generators. Some of the methods provided in this package are written in GAP code. The other part of the methods is imported from the computer algebra system PARI\/GP."},{"block":false,"categoryid":1562,"description":"GAP Interface to the Atlas of Group Representations","ebuildids":[814261],"firstseen":"2024-01-22T11:43:13.819329","name":"atlasrep","packageid":76975,"summary":"AtlasRep provides an interface between GAP and databases such as the Atlas of Group Representations, which comprises representations of many almost simple groups and information about their maximal subgroups, and is included in the GAP package."},{"block":false,"categoryid":1562,"description":"Generate documentation from GAP source code","ebuildids":[812643],"firstseen":"2024-01-22T11:43:13.819329","name":"autodoc","packageid":76976,"summary":"AutoDoc is a package for the GAP computer algebra system. It is meant to simplify the creation of reference manuals for GAP packages. It makes it possible to create documentation from source code comments, without writing XML files. It is not a substitute for GAPDoc, but rather builds on GAPDoc, by generating XML input for the latter. As such, you can combine an existing GAPDoc manual with AutoDoc."},{"block":false,"categoryid":1562,"description":"Computing the Automorphism Group of a p-Group","ebuildids":[812644],"firstseen":"2024-01-22T11:43:13.819329","name":"autpgrp","packageid":76977,"summary":"The AutPGrp package introduces a new function to compute the automorphism group of a finite p-group. The underlying algorithm is a refinement of the methods described in O'Brien (1995). In particular, this implementation is more efficient in both time and space requirements and hence has a wider range of applications than the ANUPQ method. It also usually out-performs all but the method designed for finite abelian groups."},{"block":false,"categoryid":1562,"description":"GAP ncurses interface for browsing two-dimensional data","ebuildids":[815570,815570,815570],"firstseen":"2024-01-22T11:43:13.819329","name":"browse","packageid":76978,"summary":"The Browse package provides three levels of functionality: 1 A GAP interface to the C-library ncurses. 2 A generic function for interactive browsing through two-dimensional arrays of data. 3 Several applications of the first two, e.g., a method for browsing character tables, browsing through the content of some data collections, or some games."},{"block":false,"categoryid":1562,"description":"Cohomology groups of finite groups on finite modules","ebuildids":[812646,812646],"firstseen":"2024-01-22T11:43:13.819329","name":"cohomolo","packageid":76979,"summary":"The cohomolo package is a GAP interface to some C programs for computing Schur multipliers and covering groups of finite groups and first and second cohomology groups of finite groups acting on finite modules."},{"block":false,"categoryid":1562,"description":"Congruence subgroups of SL(2,ZZ) for GAP","ebuildids":[845596],"firstseen":"2024-01-22T11:43:13.819329","name":"congruence","packageid":76980,"summary":"The GAP package Congruence provides functions to construct several types of canonical congruence subgroups in SL_2(Z), and also intersections of a finite number of such subgroups. Furthermore, it implements the algorithm for generating Farey symbols for congruence subgroups and using them to produce a system of independent generators for these subgroups."},{"block":false,"categoryid":1562,"description":"GAP package to compute with real semisimple Lie algebras","ebuildids":[845597],"firstseen":"2024-01-22T11:43:13.819329","name":"corelg","packageid":76981},{"block":false,"categoryid":1562,"description":"GAP Package to calculate group cohomology and Massey products","ebuildids":[812649],"firstseen":"2024-01-22T11:43:13.819329","name":"crime","packageid":76982,"summary":"This CRIME package computes cohomology rings for finite p-groups using Jon Carlson's method, both as GAP objects, and also in terms of generators and relators. It also computes induced homomorphisms on cohomology and Massey products in the cohomology ring."},{"block":false,"categoryid":1562,"description":"GAP algorithms for subgroups of finite soluble groups","ebuildids":[812650],"firstseen":"2024-01-22T11:43:13.819329","name":"crisp","packageid":76983,"summary":"CRISP provides algorithms for computing subgroups of finite soluble groups related to a group class C. In particular, it allows to compute C-radicals and C-injectors for Fitting classes (and Fitting sets) C, C-residuals for formations C, and C-projectors for Schunck classes C. In order to carry out these computations, the group class C must be represented by an algorithm which can decide membership in the group class. Moreover, CRISP contains algorithms for the computation of normal subgroups invariant under a prescribed set of automorphisms and belonging to a given group class. This includes an improved method to compute the set of all normal subgroups of a finite soluble group, its characteristic subgroups, minimal normal subgroups and the socle and p-socles for given primes p."},{"block":false,"categoryid":1562,"description":"GAP implementation of SHA256 and HMAC for the Jupyter kernel","ebuildids":[845598,845598,845598],"firstseen":"2024-01-22T11:43:13.819329","name":"crypting","packageid":76984},{"block":false,"categoryid":1562,"description":"GAP package for computing with crystallographic groups","ebuildids":[814262],"firstseen":"2024-01-22T11:43:13.819329","name":"cryst","packageid":76985,"summary":"This package, previously known as CrystGAP, provides a rich set of methods for the computation with affine crystallographic groups, in particular space groups. Affine crystallographic groups are fully supported both in representations acting from the right or from the left, the latter one being preferred by crystallographers. Functions to determine representatives of all space group types of a given dimension are also provided."},{"block":false,"categoryid":1562,"description":"The crystallographic groups catalog","ebuildids":[812653],"firstseen":"2024-01-22T11:43:13.819329","name":"crystcat","packageid":76986,"summary":"This package provides a catalog of crystallographic groups of dimensions 2, 3, and 4 which covers most of the data contained in the book Crystallographic groups of four-dimensional space by H. Brown, R. Bülow, J. Neubüser, H. Wondratschek, and H. Zassenhaus (John Wiley, New York, 1978)."},{"block":false,"categoryid":1562,"description":"The GAP Character Table Library","ebuildids":[819835],"firstseen":"2024-01-22T11:43:13.819329","name":"ctbllib","packageid":76987},{"block":false,"categoryid":1562,"description":"Compact vectors over finite fields in GAP","ebuildids":[845599,845599,845599],"firstseen":"2024-01-22T11:43:13.819329","name":"cvec","packageid":76988,"summary":"This package provides an implementation of compact vectors over finite fields. Contrary to earlier implementations no table lookups are used but only word-based processor arithmetic. This allows for bigger finite fields and higher speed."},{"block":false,"categoryid":1562,"description":"Collection of standard data structures for GAP","ebuildids":[845600,845600,845600],"firstseen":"2024-01-22T11:43:13.819329","name":"datastructures","packageid":76989,"summary":"The datastructures package aims at providing standard datastructures, consolidating existing code and improving on it, in particular in view of HPC-GAP. The datastructures package consists of two parts: interface declarations and implementations. The goal of interface declarations is to define standard interfaces for datastructures and decouple them from the implementations. This enables easy exchangability of implementations, for example for more efficient implementations, or implementations more suited for parallelisation or sequential use. The datastructures package declares interfaces for the following datastructures: * queues * doubly linked lists * heaps * priority queues * hash tables * dictionaries"},{"block":false,"categoryid":1562,"description":"The Design Package for GAP","ebuildids":[845601],"firstseen":"2024-01-22T11:43:13.819329","name":"design","packageid":76990},{"block":false,"categoryid":1562,"description":"Graphs, digraphs, and multidigraphs in GAP","ebuildids":[845602,845602,845602],"firstseen":"2024-01-22T11:43:13.819329","name":"digraphs","packageid":76991},{"block":false,"categoryid":1562,"description":"Elementary Divisors of Integer Matrices (EDIM) for GAP","ebuildids":[815575,815575,815575],"firstseen":"2024-01-22T11:43:13.819329","name":"edim","packageid":76992,"summary":"This package provides a collection of functions for computing the Smith normal form of integer matrices and some related utilities."},{"block":false,"categoryid":1562,"description":"Advanced Methods for Factoring Integers","ebuildids":[812660],"firstseen":"2024-01-22T11:43:13.819329","name":"factint","packageid":76993,"summary":"This package provides routines for factoring integers, in particular: * Pollard's p-1 * Williams' p+1 * Elliptic Curves Method (ECM) * Continued Fraction Algorithm (CFRAC) * Multiple Polynomial Quadratic Sieve (MPQS) It also provides access to Richard P. Brent's tables of factors of integers of the form b^k +\/- 1."},{"block":false,"categoryid":1562,"description":"Free Group Algorithms (FGA) for GAP","ebuildids":[819836],"firstseen":"2024-01-22T11:43:13.819329","name":"fga","packageid":76994,"summary":"The FGA package installs methods for computations with finitely generated subgroups of free groups and provides a presentation for their automorphism groups."},{"block":false,"categoryid":1562,"description":"GAP documentation structure and tooling","ebuildids":[819837],"firstseen":"2024-01-22T11:43:13.819329","name":"gapdoc","packageid":76995,"summary":"This package contains a definition of a structure for GAP (package) documentation, based on XML. It also contains conversion programs for producing text-, PDF- or HTML-versions of such documents, with hyperlinks if possible."},{"block":false,"categoryid":1562,"description":"Compute Gröbner bases of noncommutative polynomials","ebuildids":[845603],"firstseen":"2024-01-22T11:43:13.819329","name":"gbnp","packageid":76996,"summary":"The GBNP package provides algorithms for computing Grobner bases of noncommutative polynomials with coefficients from a field implemented in GAP and with respect to the \"total degree first then lexicographical\" ordering. Further provided are some variations, such as a weighted and truncated version and a tracing facility. The word \"algorithm\" is to be interpreted loosely here: in general one cannot expect such an algorithm to terminate, as it would imply solvability of the word problem for finitely presented (semi)groups."},{"block":false,"categoryid":1562,"description":"GAP implementation of the randomized Schreier-Sims algorithm","ebuildids":[845604],"firstseen":"2024-01-22T11:43:13.819329","name":"genss","packageid":76997,"summary":"The genss package implements the randomised Schreier-Sims algorithm to compute a stabiliser chain and a base and strong generating set for arbitrary finite groups."},{"block":false,"categoryid":1562,"description":"GRaph Algorithms using PErmutation groups","ebuildids":[845605],"firstseen":"2024-01-22T11:43:13.819329","name":"grape","packageid":76998,"summary":"GRAPE is a package for computing with graphs and groups, and is primarily designed for constructing and analysing graphs related to groups, finite geometries, and designs."},{"block":false,"categoryid":1562,"description":"GAP package for computing with error-correcting codes","ebuildids":[845606,845606],"firstseen":"2024-01-22T11:43:13.819329","name":"guava","packageid":76999},{"block":false,"categoryid":1562,"description":"Homological Algebra Programming (HAP) in GAP","ebuildids":[845607],"firstseen":"2024-01-22T11:43:13.819329","name":"hap","packageid":77000,"summary":"HAP is a package for some calculations in elementary algebraic topology and the cohomology of groups. The initial focus of the library was on computations related to the cohomology of finite and infinite groups, with particular emphasis on integral coefficients. The focus has since broadened to include Steenrod algebras of finite groups, Bredon homology, cohomology of simplicial groups, and general computations in algebraic topology relating to finite CW-complexes, covering spaces, knots, knotted surfaces, and topics such as persitent homology arising in topological data analysis."},{"block":false,"categoryid":1562,"description":"A HAP extension for crytallographic groups","ebuildids":[812668],"firstseen":"2024-01-22T11:43:13.819329","name":"hapcryst","packageid":77001,"summary":"This is an extension to the HAP package by Graham Ellis. It implements geometric methods for the calculation of resolutions of Bieberbach groups."},{"block":false,"categoryid":1562,"description":"Calculate decomposition matrices of Hecke algebras in GAP","ebuildids":[845608],"firstseen":"2024-01-22T11:43:13.819329","name":"hecke","packageid":77002,"summary":"The Hecke package provides functions for calculating decomposition matrices of Hecke algebras of the symmetric groups and q-Schur algebras."},{"block":false,"categoryid":1562,"description":"Find minimal and canonical images in permutation groups","ebuildids":[845609],"firstseen":"2024-01-22T11:43:13.819329","name":"images","packageid":77003},{"block":false,"categoryid":1562,"description":"Bindings for low level C library I\/O routines","ebuildids":[813505,813505,813505,845610,845610,845610],"firstseen":"2024-01-22T11:43:13.819329","name":"io","packageid":77004,"summary":"The IO package, as its name suggests, provides bindings for GAP to the lower levels of Input\/Output functionality in the C library."},{"block":false,"categoryid":1562,"description":"Irreducible soluble linear groups over finite fields and more","ebuildids":[812672],"firstseen":"2024-01-22T11:43:13.819329","name":"irredsol","packageid":77005,"summary":"The GAP package IRREDSOL provides a library of all irreducible soluble subgroups of GL(n,q), up to conjugacy, for q^n up to 2^24-1, and a library of the primitive soluble groups of degree up to 2^24-1."},{"block":false,"categoryid":1562,"description":"Lie AlGebras and UNits of group Algebras","ebuildids":[812673,845611],"firstseen":"2024-01-22T11:43:13.819329","name":"laguna","packageid":77006,"summary":"The LAGUNA package replaces the LAG package and provides functionality for calculation of the normalized unit group of the modular group algebra of the finite p-group and for investigation of Lie algebra associated with group algebras and other associative algebras."},{"block":false,"categoryid":1562,"description":"A database of Lie algebras","ebuildids":[812674],"firstseen":"2024-01-22T11:43:13.819329","name":"liealgdb","packageid":77007,"summary":"LieAlgDB provides access to several classifications of Lie algebras. In the mathematics literature many classifications of Lie algebras of various types have been published. This package aims at making a few classifications of small dimensional Lie algebras that have appeared in recent years more accessible. For each classification that is contained in the package, functions are provided that construct Lie algebras from that classification inside GAP. This allows the user to obtain easy access to the often rather complicated data contained in a classification, and to directly interface the Lie algebras to the functionality for Lie algebras which is already contained in GAP."},{"block":false,"categoryid":1562,"description":"Database and algorithms for Lie p-rings","ebuildids":[829850],"firstseen":"2024-01-22T11:43:13.819329","name":"liepring","packageid":77008},{"block":false,"categoryid":1562,"description":"Finitely presented Lie rings in GAP","ebuildids":[812676],"firstseen":"2024-01-22T11:43:13.819329","name":"liering","packageid":77009,"summary":"The package LieRing contains functionality for working with finitely presented Lie rings and the Lazard correspondence."},{"block":false,"categoryid":1562,"description":"Computing with quasigroups and loops in GAP","ebuildids":[845612],"firstseen":"2024-01-22T11:43:13.819329","name":"loops","packageid":77010,"summary":"The LOOPS package provides researchers in nonassociative algebra with a computational tool that integrates standard notions of loop theory with libraries of loops and group-theoretical algorithms of GAP. The package also expands GAP toward nonassociative structures."},{"block":false,"categoryid":1562,"description":"A GAP package to compute mapping-class group orbits","ebuildids":[812678],"firstseen":"2024-01-22T11:43:13.819329","name":"mapclass","packageid":77011},{"block":false,"categoryid":1562,"description":"Nilpotent Quotients of finitely-presented groups","ebuildids":[845613,845613,845613],"firstseen":"2024-01-22T11:43:13.819329","name":"nq","packageid":77012,"summary":"This package provides access to the ANU nilpotent quotient program for computing nilpotent factor groups of finitely presented groups."},{"block":false,"categoryid":1562,"description":"GAP methods to enumerate orbits","ebuildids":[845614,845614,845614],"firstseen":"2024-01-22T11:43:13.819329","name":"orb","packageid":77013},{"block":false,"categoryid":1562,"description":"Polycyclic presentations for matrix groups","ebuildids":[812681],"firstseen":"2024-01-22T11:43:13.819329","name":"polenta","packageid":77014,"summary":"The Polenta package provides methods to compute polycyclic presentations of matrix groups (finite or infinite). As a by-product, this package gives some functionality to compute certain module series for modules of solvable groups. For example, if G is a rational polycyclic matrix group, then we can compute the radical series of the natural Q[G]-module Q^d."},{"block":false,"categoryid":1562,"description":"Computation with polycyclic groups","ebuildids":[812682],"firstseen":"2024-01-22T11:43:13.819329","name":"polycyclic","packageid":77015,"summary":"This package provides various algorithms for computations with polycyclic groups defined by polycyclic presentations. The features of this package include, * creating a polycyclic group from a polycyclic presentation arithmetic in a polycyclic group * computation with subgroups and factor groups of a polycyclic group * computation of standard subgroup series such as the derived series, the lower central series * computation of the first and second cohomology * computation of group extensions * computation of normalizers and centralizers * solutions to the conjugacy problems for elements and subgroups * computation of torsion and various finite subgroups * computation of various subgroups of finite index * computation of the Schur multiplicator, the non-abelian exterior square and the non-abelian tenor square"},{"block":false,"categoryid":1562,"description":"GAP interface to sci-mathematics\/polymake","ebuildids":[812683],"firstseen":"2024-01-22T11:43:13.819329","name":"polymaking","packageid":77016,"summary":"This package provides a very basic interface to the polymake program by Ewgenij Gawrilow, Michael Joswig et al."},{"block":false,"categoryid":1562,"description":"GAP Primitive Permutation Groups Library","ebuildids":[812684],"firstseen":"2024-01-22T11:43:13.819329","name":"primgrp","packageid":77017,"summary":"The PrimGrp package provides the library of primitive permutation groups which includes, up to permutation isomorphism (i.e., up to conjugacy in the corresponding symmetric group), all primitive permutation groups of degree less than 4096."},{"block":false,"categoryid":1562,"description":"Quivers and Path Algebras in GAP","ebuildids":[819839],"firstseen":"2024-01-22T11:43:13.819329","name":"qpa","packageid":77018,"summary":"The QPA package provides data structures and algorithms for doing computations with finite dimensional quotients of path algebras, and finitely generated modules over such algebras. The current version of the QPA package has data structures for quivers, quotients of path algebras, and modules, homomorphisms and complexes of modules over quotients of path algebras."},{"block":false,"categoryid":1562,"description":"GAP package for quantum group computations","ebuildids":[845615],"firstseen":"2024-01-22T11:43:13.819329","name":"quagroup","packageid":77019,"summary":"The package QuaGroup contains functionality for working with quantized enveloping algebras of finite-dimensional semisimple Lie algebras."},{"block":false,"categoryid":1562,"description":"Roots of a polynomial as radicals in GAP","ebuildids":[812687],"firstseen":"2024-01-22T11:43:13.819329","name":"radiroot","packageid":77020,"summary":"The package can compute and display an expression by radicals for the roots of a solvable, rational polynomial. Related to this, it is possible to create the Galois group and the splitting field of a rational polynomial."},{"block":false,"categoryid":1562,"description":"Set-theoretic computations with residue classes in GAP","ebuildids":[812688],"firstseen":"2024-01-22T11:43:13.819329","name":"resclasses","packageid":77021,"summary":"This package permits to compute with set-theoretic unions of residue classes of Z and a few other rings. In particular it provides methods for computing unions, intersections and differences of these sets."},{"block":false,"categoryid":1562,"description":"GAP package for semigroups and monoids","ebuildids":[845616,845616,845616],"firstseen":"2024-01-22T11:43:13.819329","name":"semigroups","packageid":77022,"summary":"The Semigroups package is a GAP package for semigroups, and monoids. There are particularly efficient methods for finitely presented semigroups and monoids, and for semigroups and monoids consisting of transformations, partial permutations, bipartitions, partitioned binary relations, subsemigroups of regular Rees 0-matrix semigroups, and matrices of various semirings including boolean matrices, matrices over finite fields, and certain tropical matrices. Semigroups contains efficient methods for creating semigroups, monoids, and inverse semigroups and monoids, calculating their Green's structure, ideals, size, elements, group of units, small generating sets, testing membership, finding the inverses of a regular element, factorizing elements over the generators, and so on. It is possible to test if a semigroup satisfies a particular property, such as if it is regular, simple, inverse, completely regular, and a large number of further properties. There are methods for finding presentations for a semigroup, the congruences of a semigroup, the maximal subsemigroups of a finite semigroup, smaller degree partial permutation representations, and the character tables of inverse semigroups. There are functions for producing pictures of the Green's structure of a semigroup, and for drawing graphical representations of certain types of elements."},{"block":false,"categoryid":1562,"description":"GAP interface to sci-mathematics\/singular","ebuildids":[829851],"firstseen":"2024-01-22T11:43:13.819329","name":"singular","packageid":77023},{"block":false,"categoryid":1562,"description":"GAP package for simple Lie algebra computations","ebuildids":[845617],"firstseen":"2024-01-22T11:43:13.819329","name":"sla","packageid":77024},{"block":false,"categoryid":1562,"description":"The GAP Small Groups Library","ebuildids":[812692,845618],"firstseen":"2024-01-22T11:43:13.819329","name":"smallgrp","packageid":77025,"summary":"The SmallGrp package provides the library of groups of certain \"small\" orders. The groups are sorted by their orders and they are listed up to isomorphism; that is, for each of the available orders a complete and irredundant list of isomorphism type representatives of groups is given."},{"block":false,"categoryid":1562,"description":"System of finite nearrings and their applications","ebuildids":[812693],"firstseen":"2024-01-22T11:43:13.819329","name":"sonata","packageid":77026,"summary":"SONATA stands for \"systems of nearrings and their applications.\" It provides methods for the construction and the analysis of finite nearrings: * Methods for constructing all endomorphisms and all fixed-point-free automorphisms of a given group. * Methods for constructing the following nearrings of functions on a group G: the nearring of polynomial functions of G (in the sense of Lausch-Nöbauer); the nearring of compatible functions of G; distributively generated nearrings such as I(G), A(G), E(G); centralizer nearrings. * A library of all small nearrings (up to order 15) and all small nearrings with identity (up to order 31). * Functions to obtain solvable fixed-point-free automorphism groups on abelian groups, nearfields, planar nearrings, as well as designs from those. * Various functions to study the structure (size, ideals, N-groups, ...) of nearrings, to determine properties of nearring elements, and to decide whether two nearrings are isomorphic. * If the package XGAP is installed, the lattices of one- and two-sided ideals of a nearring can be studied interactively using a graphical representation"},{"block":false,"categoryid":1562,"description":"Computing in nilpotent Lie algebras","ebuildids":[812694],"firstseen":"2024-01-22T11:43:13.819329","name":"sophus","packageid":77027,"summary":"The Sophus package is written to compute with nilpotent Lie algebras over finite prime fields. Using this package, you can compute the cover, the list of immediate descendants, and the automorphism group of such Lie algebras. You can also test if two such Lie algebras are isomorphic. The immediate descendant function of the package can be used to classify small-dimensional nilpotent Lie algebras over a given field. For instance, the package author obtained a classification of nilpotent Lie algebras with dimension at most 9 over F_2."},{"block":false,"categoryid":1562,"description":"Brauer tables of spin-symmetric groups","ebuildids":[812695],"firstseen":"2024-01-22T11:43:13.819329","name":"spinsym","packageid":77028,"summary":"This package contains Brauer tables of Schur covers of symmetric and alternating groups, and provides some related functionalities."},{"block":false,"categoryid":1562,"description":"The GAP library of Tables of Marks","ebuildids":[819841],"firstseen":"2024-01-22T11:43:13.819329","name":"tomlib","packageid":77029,"summary":"The concept of a table of marks was introduced by W. Burnside in his 1955 book Theory of Groups of Finite Order. Therefore a table of marks is sometimes called a Burnside matrix. The table of marks of a finite group G is a matrix whose rows and columns are labelled by the conjugacy classes of subgroups of G and where for two subgroups H and K the (H, K)-entry is the number of fixed points of K in the transitive action of G on the cosets of H in G. So the table of marks characterizes the set of all permutation representations of G. Moreover, the table of marks gives a compact description of the subgroup lattice of G, since from the numbers of fixed points the numbers of conjugates of a subgroup K contained in a subgroup H can be derived. For small groups the table of marks of G can be constructed directly in GAP by first computing the entire subgroup lattice of G. However, for larger groups this method is unfeasible. The GAP Table of Marks library provides access to several hundred tables of marks and their maximal subgroups."},{"block":false,"categoryid":1562,"description":"GAP package for computing with toric varieties","ebuildids":[845619],"firstseen":"2024-01-22T11:43:13.819329","name":"toric","packageid":77030},{"block":false,"categoryid":1562,"description":"GAP transitive groups library","ebuildids":[814263],"firstseen":"2024-01-22T11:43:13.819329","name":"transgrp","packageid":77031,"summary":"A library of transitive groups. Groups of degree 15-30 are due to Alexander Hulpke Degree 32 is due to John Cannon and Derek Holt Degree 34-48 is due to Derek Holt and Gordon Royle. Groups of degree 32 (~30MB) and 48 (~30GB) need to be downloaded separately."},{"block":false,"categoryid":1562,"description":"Utility functions in GAP","ebuildids":[812699,845620],"firstseen":"2024-01-22T11:43:13.819329","name":"utils","packageid":77032,"summary":"This package collects together utility functions from a selection of GAP packages in order to make them more widely visible to other package authors. Other generally useful functions, which are not deemed suitable for the main library, and also welcome. For example, recent additions are functions to convert certain types of group to Magma format."}],"ebuilds":[{"archs":[],"ebuildid":845621,"firstseen":"2024-11-23T14:44:47.658275","license":"GPL-2+","moddate":"2024-11-23T14:44:47","packageid":77034,"repoid":1,"slot":"0\/9","uses":["cpu_flags_x86_popcnt","debug","memcheck","minimal","readline","test","valgrind"],"version":"4.14.0_beta1"},{"archs":["~amd64","~riscv"],"ebuildid":845714,"firstseen":"2024-11-24T14:58:27.316882","license":"GPL-2+","moddate":"2024-11-24T14:58:27","packageid":77034,"repoid":1,"slot":"0\/9","uses":["cpu_flags_x86_popcnt","debug","memcheck","minimal","readline","test","valgrind"],"version":"4.13.1-r2"},{"archs":["amd64","~riscv"],"ebuildid":829856,"firstseen":"2024-06-14T03:07:41.206079","license":"GPL-2+","moddate":"2024-08-29T14:37:14","packageid":77034,"repoid":1,"slot":"0\/9","uses":["cpu_flags_x86_popcnt","debug","memcheck","minimal","readline","test","valgrind"],"version":"4.13.1"}],"masks":[],"package":{"categoryid":317,"description":"System for computational discrete algebra. Core functionality.","firstseen":"2024-01-22T11:43:13.819329","name":"gap","packageid":77034,"summary":"Groups, Algorithms, Programming is a system for computational discrete algebra, with particular emphasis on Computational Group Theory. GAP provides a programming language, a library of thousands of functions implementing algebraic algorithms written in the GAP language as well as large data libraries of algebraic objects. GAP is used in research and teaching for studying groups and their representations, rings, vector spaces, algebras, combinatorial structures, and more."},"rdependencies":[{"block":false,"categoryid":381,"description":"Another cute console display library","ebuildids":[829856,845621,845714],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"base-system@gentoo.org","maintainername":"Gentoo Base System","name":"readline","packageid":53265},{"block":false,"categoryid":381,"description":"Standard (de)compression library","ebuildids":[829856,845621,845714],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"base-system@gentoo.org","maintainername":"Gentoo Base System","name":"zlib","packageid":55408},{"block":false,"categoryid":393,"description":"Library for arbitrary-precision arithmetic on different type of numbers","ebuildids":[829856,845621,845714],"firstseen":"2010-05-04T00:54:45.661860","maintainer":"toolchain@gentoo.org","maintainername":"Gentoo Toolchain Project","name":"gmp","packageid":55512},{"block":false,"categoryid":1560,"description":"An open-source memory debugger for GNU\/Linux","ebuildids":[829856,845621,845714],"firstseen":"2024-01-13T18:09:53.829789","name":"valgrind","packageid":76909,"summary":"Valgrind is a GPL'd tool to help you find memory-management problems in your programs. When a program is run under Valgrind's supervision, all reads and writes of memory are checked, and calls to malloc\/new\/free\/delete are intercepted. As a result, Valgrind can detect problems such as - Use of uninitialised memory - Reading\/writing memory after it has been free'd - Reading\/writing off the end of malloc'd blocks - Reading\/writing inappropriate areas on the stack - Memory leaks -- where pointers to malloc'd blocks are lost forever - Passing of uninitialised and\/or unaddressible memory to system calls - Mismatched use of malloc\/new\/new [] vs free\/delete\/delete [] - Some abuses of the POSIX Pthreads API"}],"repos":[{"branch":"master","lastcommit":"450460fefe0916c237e2fd93afd039afae67bafe","name":"gentoo","path":"\/usr\/portage","repoid":1,"upstream":"origin"}],"tracked":false,"urls":["https:\/\/www.gap-system.org\/"],"uses":[{"description":"Enable extra debug codepaths, like asserts and extra output. If you want to get meaningful backtraces see https:\/\/wiki.gentoo.org\/wiki\/Project:Quality_Assurance\/Backtraces","isdefault":false,"use":"debug"},{"description":"Enable memory checking","isdefault":false,"packageid":77034,"use":"memcheck"},{"description":"Install only the GAP packages that are strictly required for GAP to run. GAP will complain about the others unless you either start it with the \"-A\" flag or set \"AutoloadPackages\" in your gap.ini.","isdefault":false,"packageid":77034,"use":"minimal"},{"description":"Enable support for libreadline, a GNU line-editing library that almost everyone wants","isdefault":false,"use":"readline"},{"description":"Enable dependencies and\/or preparations necessary to run tests (usually controlled by FEATURES=test but can be toggled independently)","isdefault":false,"use":"test"},{"description":"Enable annotations for accuracy. May slow down runtime slightly. Safe to use even if not currently using dev-debug\/valgrind","isdefault":false,"use":"valgrind"},{"description":"Enable popcnt instruction support ([abm] or [popcnt] in cpuinfo)","group":"cpu_flags_x86","isdefault":false,"use":"popcnt"}]}