Script 'mail_helper' called by obssrc Hello community, here is the log from the commit of package gap-matgrp for openSUSE:Factory checked in at 2025-10-12 22:23:40 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/gap-matgrp (Old) and /work/SRC/openSUSE:Factory/.gap-matgrp.new.18484 (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "gap-matgrp" Sun Oct 12 22:23:40 2025 rev:3 rq:1310771 version:0.72 Changes: -------- --- /work/SRC/openSUSE:Factory/gap-matgrp/gap-matgrp.changes 2025-01-01 23:07:29.679441991 +0100 +++ /work/SRC/openSUSE:Factory/.gap-matgrp.new.18484/gap-matgrp.changes 2025-10-12 22:28:46.080786186 +0200 @@ -1,0 +2,6 @@ +Sat Oct 11 18:42:40 UTC 2025 - Jan Engelhardt <[email protected]> + +- Update to release 0.72 + * No changelog was provided + +------------------------------------------------------------------- Old: ---- matgrp0.71.tar.gz New: ---- matgrp0.72.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ gap-matgrp.spec ++++++ --- /var/tmp/diff_new_pack.QzzDfo/_old 2025-10-12 22:28:46.624808964 +0200 +++ /var/tmp/diff_new_pack.QzzDfo/_new 2025-10-12 22:28:46.624808964 +0200 @@ -1,7 +1,7 @@ # # spec file for package gap-matgrp # -# Copyright (c) 2022 SUSE LLC +# Copyright (c) 2025 SUSE LLC and contributors # # All modifications and additions to the file contributed by third parties # remain the property of their copyright owners, unless otherwise agreed @@ -17,7 +17,7 @@ Name: gap-matgrp -Version: 0.71 +Version: 0.72 Release: 0 Summary: GAP: Matric group interface routines License: GPL-2.0-only OR GPL-3.0-only ++++++ _scmsync.obsinfo ++++++ --- /var/tmp/diff_new_pack.QzzDfo/_old 2025-10-12 22:28:46.664810639 +0200 +++ /var/tmp/diff_new_pack.QzzDfo/_new 2025-10-12 22:28:46.668810807 +0200 @@ -1,5 +1,5 @@ -mtime: 1735590629 -commit: f4808b2869cc05983465a6ffb9e24ccfda1703dc3b27c120a09529c0ceffd17e +mtime: 1760208177 +commit: 8aac78481b0c0e38327528451d78e45f0e55d2a322a3640136ca5f25ec673a0e url: https://src.opensuse.org/jengelh/gap-matgrp revision: master ++++++ build.specials.obscpio ++++++ ++++++ build.specials.obscpio ++++++ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/.gitignore new/.gitignore --- old/.gitignore 1970-01-01 01:00:00.000000000 +0100 +++ new/.gitignore 2025-10-11 20:43:03.000000000 +0200 @@ -0,0 +1 @@ +.osc ++++++ matgrp0.71.tar.gz -> matgrp0.72.tar.gz ++++++ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/matgrp/PackageInfo.g new/matgrp/PackageInfo.g --- old/matgrp/PackageInfo.g 2024-11-01 20:35:43.000000000 +0100 +++ new/matgrp/PackageInfo.g 2025-08-25 21:22:42.000000000 +0200 @@ -8,12 +8,12 @@ ## See '?Extending: Version Numbers' in GAP help for an explanation ## of valid version numbers. -Version := "0.71", +Version := "0.72", License := "GPL-2.0 OR GPL-3.0", # SPDX ID, see https://spdx.org ## Release date of the current version in dd/mm/yyyy format. -Date := "01/11/2024", +Date := "25/08/2025", ## URL of the archive(s) of the current package release, but *without* ## the format extension(s), like '.zoo', which are given next. diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/matgrp/lib/recograt.gi new/matgrp/lib/recograt.gi --- old/matgrp/lib/recograt.gi 2024-11-01 20:35:04.000000000 +0100 +++ new/matgrp/lib/recograt.gi 2025-08-25 19:56:07.000000000 +0200 @@ -103,10 +103,10 @@ nb:=SiftedVector(submodule,nb); if fcand.ops[k]=OnLines then fct:=MakeSubmoduleColineAction(submodule); - Add(FUNCSPACEHASH,[fct,submodule]); + Add(FUNCSPACEHASH,[fct,submodule]); else fct:=MakeSubmoduleCosetAction(submodule); - Add(FUNCSPACEHASH,[fct,submodule]); + Add(FUNCSPACEHASH,[fct,submodule]); fi; Add(cand.points,nb); Add(cand.ops,fct); @@ -127,7 +127,7 @@ BasisVectors(fct[2])*bas{sel}))); Add(cand.points,fcand.points[k]*bas{sel}); fct:=MakeSubmoduleCosetAction(submodule); - Add(FUNCSPACEHASH,[fct,submodule]); + Add(FUNCSPACEHASH,[fct,submodule]); Add(cand.ops,fct); Info(InfoFFMat,2,"ACTPOP"); elif fcand.ops[k]=OnSubspacesByCanonicalBasis then @@ -195,7 +195,7 @@ if ValueOption("Subrecurse")<>false then while j<=Length(dims) and Length(cand.points)<=5 do # don't bother is the space is too small - if (j=Length(dims) and lastdim>0) or + if (j=Length(dims) and lastdim>0) or (j<Length(dims) and Size(F)^(dims[j+1]-lastdim)>limit) then sel:=[lastdim+1..dims[j]]; if trysel(false,true) then @@ -209,7 +209,7 @@ od; fi; - if lastdim=0 and ValueOption("Facrecurse")<>false then + if lastdim=0 and ValueOption("Facrecurse")<>false then # all but last submodule was trivial -- step down on factors j:=Length(dims)-1; @@ -260,7 +260,7 @@ TryNextMethod(); end; -InstallMethod(FindBasePointCandidates, +InstallMethod(FindBasePointCandidates, "for reducible matrix group over a FF, use submodules and quotients", [ IsGroup and IsMatrixGroup and IsFinite, IsRecord, IsInt, IsObject ], 21, MSSFBPC); @@ -452,7 +452,7 @@ sel:=[]; u:=TrivialSubgroup(Image(nicehom)); for i in [1..Length(NiceGens(r))] do - ngi:=ImagesRepresentative(nicehom,NiceGens(r)[i]); + ngi:=ImagesRepresentative(nicehom,NiceGens(r)[i]); if not ngi in u then u:=ClosureGroup(u,ngi); Add(sel,i); @@ -500,7 +500,7 @@ sz:=[]; permap:=[]; allgens:=NiceGens(recog); - + extranum:=Length(allgens)+1; treerecurse(recog,[]); @@ -554,10 +554,10 @@ CSIDepthElm:=function(csi,x) local i; i:=1; - while i<=csi.n and + while i<=csi.n and (not IsBound(csi.leafs[i]) or # early skipped multiple solvable factor ( - (IsBool(csi.leafs[i]) or not (IsBound(csi.leafs[i]!.projective) and csi.leafs[i]!.projective) + (IsBool(csi.leafs[i]) or not (IsBound(csi.leafs[i]!.projective) and csi.leafs[i]!.projective) or csi.leafs[i]!.projective=false) and Order(CSIImageHomNr(csi,i,x))=1) or @@ -588,7 +588,7 @@ local i,ximg; i:=1; while i<=csi.n do - if not IsBound(csi.leafs[i]) or + if not IsBound(csi.leafs[i]) or ((IsBool(csi.leafs[i]) or not (IsBound(csi.leafs[i]!.projective) and csi.leafs[i]!.projective) or csi.leafs[i]!.projective=false) and Order(CSIImageHomNr(csi,i,x))=1) then @@ -698,7 +698,7 @@ else isom:=IdentityMapping(gp); # first one -- iso is trivial fi; - + #find out what the previous factors do on it for j in Filtered([1..i-1],x->IsBound(csi.minranges[x])) do Info(InfoFFMat,2,"Try ",i," mapped by ",j); @@ -767,7 +767,7 @@ diso:=IdentityMapping(dgp); else # isomorphism to canonical form - diso:=InverseGeneralMapping(isoms[d]); + diso:=InverseGeneralMapping(isoms[d]); fi; genimgs[kn][i]:=List(genims,x->ImagesRepresentative(diso,x)); @@ -889,7 +889,7 @@ # does any of the elements actually do something -- if so, what? -# if true or ForAny(c,x->IsBound(doesaut[x]) +# if true or ForAny(c,x->IsBound(doesaut[x]) # and ForAny(pools[i],y->y in doesaut[x])) then Info(InfoFFMat,2,c," acts ",pools[i],j); for kn in c do @@ -935,7 +935,7 @@ Add(wrs,w); a:=List([1..m],x->PerfectResiduum(Image(Embedding(w,x)))); b:=TrivialSubgroup(w); - for l in a do + for l in a do b:=ClosureGroup(b,l); od; SetDirectFactorsFittingFreeSocle(w,a); @@ -1388,7 +1388,7 @@ fi; fi; until IsClosed(S!.orb); - Info(InfoGenSS, 2, "Layer ", layer, ": Orbit length is ", Length(S!.orb)); + Info(InfoGenSS, 2, "Layer ", layer, ": Orbit length is ", Length(S!.orb)); if layer > 1 then parentS!.stab := S; # such that from now on random element @@ -1440,7 +1440,7 @@ S!.stab := MATGRP_StabilizerChainInner(stabgens,false, layer+1,cand,opt,S); fi; - if IsString(S!.stab) then return S!.stab; fi; + if IsString(S!.stab) then return S!.stab; fi; if opt.ImmediateVerificationElements > 0 then Info(InfoGenSS,2,"Doing immediate verification in layer ", S!.layer," (",opt.ImmediateVerificationElements, @@ -1478,7 +1478,7 @@ return false; fi; #SS := StabilizerChain(Group(el),S!.opt); - SS:=StabilizerChain(Group(el),rec(Cand:=rec(ops:=[op],points:=[pt]),Reduced:=false,StrictlyUseCandidates:=true)); + SS:=StabilizerChain(Group(el),rec(Cand:=rec(ops:=[op],points:=[pt]),Reduced:=false,StrictlyUseCandidates:=true)); if IsString(SS) then return SS; fi; for n in NamesOfComponents(SS) do @@ -1527,7 +1527,7 @@ newstrongnr := Length(SS!.stronggens)+1; # r.rem will end up there ! SS!.stab := MATGRP_StabilizerChainInner([r.rem],false, SS!.layer+1,rec(points:=[pt],ops:=[op]), SS!.opt, SS ); - if IsString(SS!.stab) then return SS!.stab; fi; + if IsString(SS!.stab) then return SS!.stab; fi; SS := SS!.stab; fi; # Now we have added a new generator (or a new layer) at layer SS, @@ -1608,7 +1608,7 @@ if IsBound(arg[3]) then sz:=arg[3]; #SetSize(a,sz); - else + else sz:=fail; fi; SetIsSolvableGroup(a,true); @@ -1696,7 +1696,7 @@ MATGRP_AddGeneratorToStabilizerChain(S,g,goodbase.points[pbp],goodbase.ops[pbp]); - while Size(S)=oldsz do + while Size(S)=oldsz do Error("orderr BUG !!!\n"); MATGRP_AddGeneratorToStabilizerChain(S,g); od; @@ -1779,7 +1779,7 @@ oldsz:=Size(S); while not a do c:=c+1; - if c>bound then + if c>bound then # not solvable Error("not solvable"); fi; @@ -1856,13 +1856,13 @@ S:=StabilizerChain(Group(x),rec(Base:=CBase,Reduced:=false,StrictlyUseCandidates:=true, OrbitsWithLog := false,RandomStabGens:=1,Size:=Order(x))); - # Remove those ~!@#$ extra generators (powers of x) that are added + # Remove those ~!@#$ extra generators (powers of x) that are added # to make the tree shallower, but cause problems here. strongs:=[x]; a:=S; - while a<>false do + while a<>false do a!.stronggens:=ShallowCopy(strongs); a!.layergens:=[1]; if Length(a!.orb!.gens)>0 then @@ -1886,7 +1886,7 @@ #CHAINTEST(S,"F2"); strongs:=[]; - + fi; if Size(S)=oldsz then Error("no change!");fi; @@ -1894,7 +1894,7 @@ Add(pcgs,x); a:=Set(Filtered(StrongGenerators(S),x->not x in strongs)); a:=Difference(a,List([0..Order(x)],y->x^y)); - if Length(a)>0 then + if Length(a)>0 then # redo Info(InfoFFMat,1,"nanu-redo"); #Error("nanu"); @@ -1906,7 +1906,7 @@ Append(stronglevs,ListWithIdenticalEntries(1,n+1-xp)); - #if n+1-xp in depths then + #if n+1-xp in depths then # Add(stabs,StructuralCopy(S)); #fi; xp:=xp+1; @@ -2001,7 +2001,7 @@ #TODO: Use chain for decomposition -- at the moment it uses subgroups a:=pcgs; pcgs:=PcgsByPcSequenceCons(IsPcgsDefaultRep, - IsPcgsMatGroupByStabChainRep and IsPcgs and IsPrimeOrdersPcgs, + IsPcgsMatGroupByStabChainRep and IsPcgs and IsPrimeOrdersPcgs, FamilyObj(gens[1]),pcgs,[]); pcgs!.stabilizerChain:=S; #pcgs!.stabs:=Reversed(stabs); @@ -2177,7 +2177,7 @@ fi; # stop when we've set the lowest layer or if the remainder is the identity - until layer=laynums[Length(laynums)] or delta=fail; + until layer=laynums[Length(laynums)] or delta=fail; # do we only want some? if laynums=pcgs!.laynums then @@ -2269,7 +2269,7 @@ csi:=GetInformationFromRecog(r); G!.storedrecog:=csi; factorhom:=FindAct(csi); - + #TODO: Better kernel gens by random selection sz:=Size(G)/Size(Image(factorhom)); @@ -2334,7 +2334,7 @@ Print("PcgsDegrees ",Maximum(List( BasePointsActionsOrbitLengthsStabilizerChain(f.pcgs!.stabilizerChain), x->x[3])),"\n"); - + end; # work over residue class rings @@ -2547,7 +2547,7 @@ if not IsZero(e) then if bot and IsBound(bas[i]) and Length(bas[i])=layerlimit then # Bottom layer is full, nothing else needed to do - a:=fail; + a:=fail; elif IsBound(bas[i]) and Length(bas[i])>0 then s:=SolutionMat(bas[i],e); if s=fail then @@ -2730,7 +2730,7 @@ od; pcgs:=PcgsByPcSequenceCons(IsPcgsDefaultRep, - IsPcgsResidueMatGroupRep and IsPcgs and IsPrimeOrdersPcgs, + IsPcgsResidueMatGroupRep and IsPcgs and IsPrimeOrdersPcgs, FamilyObj(One(g)),pcgs,[]); # decomposition info for pcgs @@ -2848,8 +2848,9 @@ # temporary -- missing in library InstallMethod(MaximalSubgroupClassReps,"TF method",true, - [IsGroup and IsFinite and - HasFittingFreeLiftSetup],OVERRIDENICE,DoMaxesTF); + [IsGroup and IsFinite and HasFittingFreeLiftSetup], + {} -> RankFilter( IsHandledByNiceMonomorphism ), +DoMaxesTF); TFSubgroupMembership:=function(g,u,elm) local ffu,ff,x; @@ -2871,7 +2872,7 @@ # careful -- this implicitly assumes we always stay in the parent InstallMethod(\in,"ff subgroup",IsElmsColls, [IsMultiplicativeElementWithInverse,IsGroup and IsMatrixGroup], - OVERRIDENICE, + {} -> RankFilter( IsHandledByNiceMonomorphism ), function(elm,u) if not HasParentAttr(u) or not HasFittingFreeLiftSetup(ParentAttr(u)) then TryNextMethod();
