Skip to content

Commit 9ae647a

Browse files
author
Leo
committed
Merge branch 'master' of https://github.com/gap-packages/modisom
2 parents 6099a15 + eea1239 commit 9ae647a

File tree

7 files changed

+56
-35
lines changed

7 files changed

+56
-35
lines changed

.github/workflows/CI.yml

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -33,17 +33,17 @@ jobs:
3333
- stable-4.9
3434

3535
steps:
36-
- uses: actions/checkout@v4
36+
- uses: actions/checkout@v5
3737
- uses: gap-actions/setup-gap@v2
3838
with:
3939
GAPBRANCH: ${{ matrix.gap-branch }}
4040
- uses: gap-actions/build-pkg@v1
41-
- uses: gap-actions/run-pkg-tests@v2
42-
- uses: gap-actions/run-pkg-tests@v2
41+
- uses: gap-actions/run-pkg-tests@v3
42+
- uses: gap-actions/run-pkg-tests@v3
4343
with:
4444
only-needed: true
4545
- uses: gap-actions/process-coverage@v2
46-
- uses: codecov/codecov-action@v4
46+
- uses: codecov/codecov-action@v5
4747
with:
4848
token: ${{ secrets.CODECOV_TOKEN }}
4949

@@ -53,7 +53,7 @@ jobs:
5353
runs-on: ubuntu-latest
5454

5555
steps:
56-
- uses: actions/checkout@v4
56+
- uses: actions/checkout@v5
5757
- uses: gap-actions/setup-gap@v2
5858
- uses: gap-actions/build-pkg-docs@v1
5959
with:

.github/workflows/release.yml

Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
name: Release
2+
3+
on:
4+
workflow_dispatch:
5+
inputs:
6+
dry-run:
7+
description: "Only create an archive containing the release instead of publishing it on GitHub"
8+
type: boolean
9+
required: false
10+
default: false
11+
force:
12+
description: "Allow overwriting an existing release, or making a release with an incorrect date"
13+
type: boolean
14+
required: false
15+
default: false
16+
17+
permissions: write-all
18+
19+
jobs:
20+
release:
21+
name: "Release the GAP package"
22+
runs-on: ubuntu-latest
23+
24+
steps:
25+
- uses: actions/checkout@v5
26+
- uses: gap-actions/setup-gap@v3
27+
- uses: gap-actions/build-pkg-docs@v2
28+
with:
29+
use-latex: true
30+
- uses: gap-actions/release-pkg@v1
31+
with:
32+
dry-run: ${{ inputs.dry-run }}
33+
force: ${{ inputs.force }}
34+
- uses: gap-actions/update-gh-pages@v1
35+
if: ${{ !inputs.dry-run }}

PackageInfo.g

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@ SetPackageInfo( rec(
66
PackageName := "ModIsom",
77
Subtitle := "Computing automorphisms and checking isomorphisms for modular group algebras of finite p-groups",
88
Version := "3.0.2",
9-
Date := "28/12/2024", # dd/mm/yyyy format
9+
Date := "13/09/2025", # dd/mm/yyyy format
1010
License := "GPL-2.0-or-later",
1111

1212
Persons := [
@@ -118,7 +118,6 @@ PackageDoc := rec(
118118
PDFFile := "doc/manual.pdf",
119119
SixFile := "doc/manual.six",
120120
LongTitle := "Computing with nilpotent associative algebras",
121-
Autoload := true
122121
),
123122

124123

@@ -131,7 +130,6 @@ Dependencies := rec(
131130

132131
BannerString := Concatenation( "Loading ModIsom ", ~.Version, "... \n"),
133132
AvailabilityTest := ReturnTrue,
134-
Autoload := false,
135133
TestFile := "tst/testall.g",
136134
Keywords := ["modular isomorphism problem",
137135
"automorphism group",

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
[![Build Status](https://github.com/gap-packages/modisom/workflows/CI/badge.svg?branch=master)](https://github.com/gap-packages/modisom/actions?query=workflow%3ACI+branch%3Amaster)
1+
[![CI](https://github.com/gap-packages/modisom/actions/workflows/CI.yml/badge.svg)](https://github.com/gap-packages/modisom/actions/workflows/CI.yml)
22
[![Code Coverage](https://codecov.io/github/gap-packages/modisom/coverage.svg?branch=master&token=)](https://codecov.io/gh/gap-packages/modisom)
33

44

doc/make_doc

Lines changed: 9 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -2,25 +2,20 @@
22
set -e
33

44
echo "TeXing documentation"
5+
# delete old stuff to avoid spurious or "hidden errors" caused by their presence
6+
rm -f manual.aux manual.pdf manual.idx manual.ilg manual.ind manual.lab manual.log manual.six manual.toc
57
# TeX the manual
6-
tex manual
7-
# ... and build its bibliography (uncomment if there is a `manual.bib')
8+
pdftex manual
9+
# ... and build its bibliography
810
bibtex manual
9-
# TeX the manual again to incorporate the ToC ... and build the index
10-
tex manual
11-
tex manual
11+
# TeX the manual again to incorporate the ToC
12+
pdftex manual
13+
# ... and build the index
1214
../../../doc/manualindex manual
1315
# Finally TeX the manual again to get cross-references right
14-
tex manual
15-
# Create PDF version
16-
pdftex manual; pdftex manual
16+
pdftex manual
1717

1818
# The HTML version of the manual
19-
rm -rf ../htm
20-
mkdir ../htm
19+
mkdir -p ../htm
2120
echo "Creating HTML documentation"
2221
../../../etc/convert.pl -i -u -c -n ModIsom . ../htm
23-
24-
#############################################################################
25-
##
26-
#E

gap/grpalg/collect.gi

Lines changed: 4 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -5,13 +5,6 @@
55
##
66
## functions to work with tables (in the sense of ModIsom) which correspond to quotients of the augmentation ideal I of a group algebra of a finite p-group over a field of characteristic p modulo a power of I. In particular, to generate the table for this quotient
77

8-
# Input: A list
9-
# Output: The nonzero positions of the list
10-
BindGlobal("PosNonzero", function(list)
11-
return PositionsProperty(list, x -> not IsZero(x));
12-
end);
13-
14-
158
# Input: Linear combination of words. A word is a list of pairs of natural numbers. We think e.g. g1^2*g3 = [[1,2],[3,1]]
169
# Output: Same linear combination (in the math sense) where each word
1710
# appears at most once
@@ -198,7 +191,7 @@ local w, sw, pos, p;
198191

199192
sw := 0;
200193
w := [ ];
201-
pos := PosNonzero(exp);
194+
pos := PositionNonZero(exp);
202195

203196
for p in pos do
204197
sw := sw + 1;
@@ -443,7 +436,7 @@ local F, p, exp, pos1, i, j, pows, pos, combs, v, c, w, s, m, tup, coefprod, exp
443436
# Check if weight of p-th power exceeds level
444437
if p*T.pre.weights[i] <= lvl then
445438
pows := StructuralCopy(T.pre.jen.pows[pos1]);
446-
pos := PosNonzero(pows);
439+
pos := PositionNonZero(pows);
447440
pows := pows{pos};
448441
combs := Combinations([1..Length(pos)]);
449442
Remove(combs, 1);
@@ -523,7 +516,7 @@ local F, p, exp, pos1, i, j, pows, pos, combs, v, c, w, s, m, tup, coefprod, exp
523516
pows := StructuralCopy(T.pre.jen.coms[poscom][2]);
524517
pows[pos1] := 1;
525518
pows[pos2] := 1;
526-
pos := PosNonzero(pows);
519+
pos := PositionNonZero(pows);
527520
pows := pows{pos};
528521
combs := Combinations([1..Length(pos)]);
529522
v := [ ];
@@ -591,7 +584,7 @@ end);
591584
# Input: Table and maximal weight we want. Typically output from PreSet
592585
# Output: None. T.powwords, T.commwords, T.dim, T.wgs are set
593586
BindGlobal("WordFillTable", function(T, lvl)
594-
local F, p, s1, l, i, pos1, expw1, w1, sortweights1, sortexpw1, f1, posf1, s2, post2, expw2, w2, sortweights2, sortexpw2, f2, posf2, dep, mm, vec, posvec, fac1, posnonzero, v;
587+
local F, p, s1, l, i, pos1, expw1, w1, sortweights1, sortexpw1, f1, posf1, s2, post2, expw2, w2, sortweights2, sortexpw2, f2, posf2, dep, mm, vec, posvec, fac1, v;
595588

596589
F := T.fld;
597590
p := Characteristic(F);

gap/grpalg/tabletoalgebraandback.gi

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -24,7 +24,7 @@ local k, maxweight, i, lim, sup, coeffs, v0, res, exps, nonzeroexps, sum, S, ini
2424
## for each element g1^e1...gm^em we convert g1^e1...gm^em to an expression in the Jennings basis using the formulas known for this
2525
for i in [1..Size(sup)] do
2626
exps := ExponentsOfPcElement(T.pre.jen.pcgs, sup[i]){[1..lim]};
27-
nonzeroexps := PosNonzero(exps);
27+
nonzeroexps := PositionNonZero(exps);
2828
sum := ShallowCopy(v0);
2929
# run over all supsets of non-zero exponents. Each gives a summand
3030
for S in Combinations( nonzeroexps ) do

0 commit comments

Comments
 (0)