Script 'mail_helper' called by obssrc
Hello community,
here is the log from the commit of package gap-repndecomp for openSUSE:Factory
checked in at 2024-03-25 21:09:38
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Comparing /work/SRC/openSUSE:Factory/gap-repndecomp (Old)
and /work/SRC/openSUSE:Factory/.gap-repndecomp.new.1905 (New)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "gap-repndecomp"
Mon Mar 25 21:09:38 2024 rev:2 rq:1161019 version:1.3.0
Changes:
--------
--- /work/SRC/openSUSE:Factory/gap-repndecomp/gap-repndecomp.changes
2023-12-28 23:00:39.108662749 +0100
+++ /work/SRC/openSUSE:Factory/.gap-repndecomp.new.1905/gap-repndecomp.changes
2024-03-25 21:15:29.749259731 +0100
@@ -1,0 +2,6 @@
+Sat Mar 23 22:02:59 UTC 2024 - Jan Engelhardt <jeng...@inai.de>
+
+- Update to release 1.3.0
+ * Do not pass extra arguments to ``DeclareGlobalFunction``
+
+-------------------------------------------------------------------
Old:
----
RepnDecomp-1.2.1.tar.gz
New:
----
RepnDecomp-1.3.0.tar.gz
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Other differences:
------------------
++++++ gap-repndecomp.spec ++++++
--- /var/tmp/diff_new_pack.GEkC5Z/_old 2024-03-25 21:15:30.369282496 +0100
+++ /var/tmp/diff_new_pack.GEkC5Z/_new 2024-03-25 21:15:30.373282643 +0100
@@ -1,7 +1,7 @@
#
# spec file for package gap-repndecomp
#
-# Copyright (c) 2023 SUSE LLC
+# Copyright (c) 2024 SUSE LLC
#
# 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-repndecomp
-Version: 1.2.1
+Version: 1.3.0
Release: 0
Summary: GAP: Decomposition of finite groups reprensentations into
irreducibles
License: GPL-3.0-only
++++++ RepnDecomp-1.2.1.tar.gz -> RepnDecomp-1.3.0.tar.gz ++++++
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/PackageInfo.g
new/RepnDecomp-1.3.0/PackageInfo.g
--- old/RepnDecomp-1.2.1/PackageInfo.g 2022-03-03 00:51:26.000000000 +0100
+++ new/RepnDecomp-1.3.0/PackageInfo.g 2023-01-03 02:15:20.000000000 +0100
@@ -10,8 +10,8 @@
PackageName := "RepnDecomp",
Subtitle := "Decompose representations of finite groups into irreducibles",
-Version := "1.2.1",
-Date := "02/03/2022", # dd/mm/yyyy format
+Version := "1.3.0",
+Date := "02/01/2023", # dd/mm/yyyy format
License := "GPL-3.0",
Persons := [
@@ -65,7 +65,7 @@
PackageDoc := rec(
BookName := "RepnDecomp",
ArchiveURLSubset := ["doc"],
- HTMLStart := "doc/chap0.html",
+ HTMLStart := "doc/chap0_mj.html",
PDFFile := "doc/manual.pdf",
SixFile := "doc/manual.six",
LongTitle := "Decompose representations of finite groups into irreducibles",
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/RepnDecomp.toc
new/RepnDecomp-1.3.0/doc/RepnDecomp.toc
--- old/RepnDecomp-1.2.1/doc/RepnDecomp.toc 2022-03-03 00:51:44.000000000
+0100
+++ new/RepnDecomp-1.3.0/doc/RepnDecomp.toc 1970-01-01 01:00:00.000000000
+0100
@@ -1,59 +0,0 @@
-\contentsline {chapter}{\numberline {1}\textcolor {Chapter
}{Introduction}}{3}{chapter.1}%
-\contentsline {section}{\numberline {1.1}\textcolor {Chapter }{Getting started
with RepnDecomp}}{3}{section.1.1}%
-\contentsline {subsection}{\numberline {1.1.1}\textcolor {Chapter
}{Installation}}{3}{subsection.1.1.1}%
-\contentsline {subsection}{\numberline {1.1.2}\textcolor {Chapter }{Note on
what is meant by a representation}}{3}{subsection.1.1.2}%
-\contentsline {subsection}{\numberline {1.1.3}\textcolor {Chapter }{API
Overview}}{3}{subsection.1.1.3}%
-\contentsline {chapter}{\numberline {2}\textcolor {Chapter }{Isomorphisms
between representations}}{5}{chapter.2}%
-\contentsline {section}{\numberline {2.1}\textcolor {Chapter }{Finding
explicit isomorphisms}}{5}{section.2.1}%
-\contentsline {subsection}{\numberline {2.1.1}\textcolor {Chapter
}{LinearRepresentationIsomorphism}}{5}{subsection.2.1.1}%
-\contentsline {subsection}{\numberline {2.1.2}\textcolor {Chapter
}{LinearRepresentationIsomorphismSlow}}{6}{subsection.2.1.2}%
-\contentsline {section}{\numberline {2.2}\textcolor {Chapter }{Testing
isomorphisms}}{6}{section.2.2}%
-\contentsline {subsection}{\numberline {2.2.1}\textcolor {Chapter
}{AreRepsIsomorphic}}{6}{subsection.2.2.1}%
-\contentsline {subsection}{\numberline {2.2.2}\textcolor {Chapter
}{IsLinearRepresentationIsomorphism}}{7}{subsection.2.2.2}%
-\contentsline {chapter}{\numberline {3}\textcolor {Chapter }{Algorithms for
unitary representations}}{8}{chapter.3}%
-\contentsline {section}{\numberline {3.1}\textcolor {Chapter }{Unitarising
representations}}{8}{section.3.1}%
-\contentsline {subsection}{\numberline {3.1.1}\textcolor {Chapter
}{UnitaryRepresentation}}{8}{subsection.3.1.1}%
-\contentsline {subsection}{\numberline {3.1.2}\textcolor {Chapter
}{IsUnitaryRepresentation}}{9}{subsection.3.1.2}%
-\contentsline {subsection}{\numberline {3.1.3}\textcolor {Chapter
}{LDLDecomposition}}{9}{subsection.3.1.3}%
-\contentsline {section}{\numberline {3.2}\textcolor {Chapter }{Decomposing
unitary representations}}{9}{section.3.2}%
-\contentsline {subsection}{\numberline {3.2.1}\textcolor {Chapter
}{IrreducibleDecompositionDixon}}{9}{subsection.3.2.1}%
-\contentsline {chapter}{\numberline {4}\textcolor {Chapter }{Miscellaneous
useful functions}}{10}{chapter.4}%
-\contentsline {section}{\numberline {4.1}\textcolor {Chapter }{Predicates for
representations}}{10}{section.4.1}%
-\contentsline {subsection}{\numberline {4.1.1}\textcolor {Chapter
}{IsFiniteGroupLinearRepresentation (for
IsGroupHomomorphism)}}{10}{subsection.4.1.1}%
-\contentsline {subsection}{\numberline {4.1.2}\textcolor {Chapter
}{IsFiniteGroupPermutationRepresentation (for
IsGroupHomomorphism)}}{10}{subsection.4.1.2}%
-\contentsline {section}{\numberline {4.2}\textcolor {Chapter }{Efficient
summing over groups}}{10}{section.4.2}%
-\contentsline {subsection}{\numberline {4.2.1}\textcolor {Chapter
}{GroupSumBSGS}}{10}{subsection.4.2.1}%
-\contentsline {section}{\numberline {4.3}\textcolor {Chapter }{Space-efficient
representation of tensors of matrices}}{11}{section.4.3}%
-\contentsline {subsection}{\numberline {4.3.1}\textcolor {Chapter
}{IsTensorProductOfMatricesObj (for
IsMultiplicativeElementWithInverse)}}{11}{subsection.4.3.1}%
-\contentsline {subsection}{\numberline {4.3.2}\textcolor {Chapter
}{IsTensorProductPairRep (for IsPositionalObjectRep)}}{11}{subsection.4.3.2}%
-\contentsline {subsection}{\numberline {4.3.3}\textcolor {Chapter
}{IsTensorProductKroneckerRep (for
IsPositionalObjectRep)}}{11}{subsection.4.3.3}%
-\contentsline {subsection}{\numberline {4.3.4}\textcolor {Chapter
}{TensorProductOfMatrices}}{11}{subsection.4.3.4}%
-\contentsline {subsection}{\numberline {4.3.5}\textcolor {Chapter
}{CharacterOfTensorProductOfRepresentations}}{11}{subsection.4.3.5}%
-\contentsline {section}{\numberline {4.4}\textcolor {Chapter }{Matrices and
homomorphisms}}{11}{section.4.4}%
-\contentsline {subsection}{\numberline {4.4.1}\textcolor {Chapter
}{ComposeHomFunction}}{11}{subsection.4.4.1}%
-\contentsline {section}{\numberline {4.5}\textcolor {Chapter }{Representation
theoretic functions}}{12}{section.4.5}%
-\contentsline {subsection}{\numberline {4.5.1}\textcolor {Chapter
}{TensorProductRepLists}}{12}{subsection.4.5.1}%
-\contentsline {subsection}{\numberline {4.5.2}\textcolor {Chapter
}{DirectSumOfRepresentations}}{12}{subsection.4.5.2}%
-\contentsline {subsection}{\numberline {4.5.3}\textcolor {Chapter
}{DegreeOfRepresentation}}{12}{subsection.4.5.3}%
-\contentsline {subsection}{\numberline {4.5.4}\textcolor {Chapter
}{PermToLinearRep}}{12}{subsection.4.5.4}%
-\contentsline {subsection}{\numberline {4.5.5}\textcolor {Chapter
}{IsOrthonormalSet}}{12}{subsection.4.5.5}%
-\contentsline {chapter}{\numberline {5}\textcolor {Chapter }{Computing
decompositions of representations}}{13}{chapter.5}%
-\contentsline {section}{\numberline {5.1}\textcolor {Chapter }{Block
diagonalizing}}{13}{section.5.1}%
-\contentsline {subsection}{\numberline {5.1.1}\textcolor {Chapter
}{BlockDiagonalBasisOfRepresentation}}{13}{subsection.5.1.1}%
-\contentsline {subsection}{\numberline {5.1.2}\textcolor {Chapter
}{BlockDiagonalRepresentation}}{13}{subsection.5.1.2}%
-\contentsline {section}{\numberline {5.2}\textcolor {Chapter }{Algorithms due
to the authors}}{13}{section.5.2}%
-\contentsline {subsection}{\numberline {5.2.1}\textcolor {Chapter
}{REPN{\textunderscore }ComputeUsingMyMethod (for
IsGroupHomomorphism)}}{13}{subsection.5.2.1}%
-\contentsline {subsection}{\numberline {5.2.2}\textcolor {Chapter
}{REPN{\textunderscore }ComputeUsingMyMethodCanonical (for
IsGroupHomomorphism)}}{14}{subsection.5.2.2}%
-\contentsline {section}{\numberline {5.3}\textcolor {Chapter }{Algorithms due
to Serre}}{15}{section.5.3}%
-\contentsline {subsection}{\numberline {5.3.1}\textcolor {Chapter
}{CanonicalDecomposition}}{15}{subsection.5.3.1}%
-\contentsline {subsection}{\numberline {5.3.2}\textcolor {Chapter
}{IrreducibleDecomposition}}{15}{subsection.5.3.2}%
-\contentsline {subsection}{\numberline {5.3.3}\textcolor {Chapter
}{IrreducibleDecompositionCollected}}{16}{subsection.5.3.3}%
-\contentsline {subsection}{\numberline {5.3.4}\textcolor {Chapter
}{REPN{\textunderscore }ComputeUsingSerre (for
IsGroupHomomorphism)}}{16}{subsection.5.3.4}%
-\contentsline {chapter}{\numberline {6}\textcolor {Chapter }{Centralizer
(commutant) rings}}{18}{chapter.6}%
-\contentsline {section}{\numberline {6.1}\textcolor {Chapter }{Finding a basis
for the centralizer}}{18}{section.6.1}%
-\contentsline {subsection}{\numberline {6.1.1}\textcolor {Chapter
}{CentralizerBlocksOfRepresentation}}{18}{subsection.6.1.1}%
-\contentsline {subsection}{\numberline {6.1.2}\textcolor {Chapter
}{CentralizerOfRepresentation}}{18}{subsection.6.1.2}%
-\contentsline {section}{\numberline {6.2}\textcolor {Chapter }{Using the
centralizer for computations}}{19}{section.6.2}%
-\contentsline {subsection}{\numberline {6.2.1}\textcolor {Chapter
}{ClassSumCentralizer}}{19}{subsection.6.2.1}%
-\contentsline {subsection}{\numberline {6.2.2}\textcolor {Chapter
}{ClassSumCentralizerNC}}{19}{subsection.6.2.2}%
-\contentsline {chapter}{Index}{20}{section*.2}%
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/RepnDecomp.xml
new/RepnDecomp-1.3.0/doc/RepnDecomp.xml
--- old/RepnDecomp-1.2.1/doc/RepnDecomp.xml 2022-03-03 00:51:43.000000000
+0100
+++ new/RepnDecomp-1.3.0/doc/RepnDecomp.xml 2023-01-03 03:06:35.000000000
+0100
@@ -3,8 +3,7 @@
<!-- This is an automatically generated file. -->
<!DOCTYPE Book SYSTEM "gapdoc.dtd"
[
-<!ENTITY see '<Alt Only="LaTeX">$\to$</Alt><Alt Not="LaTeX">--></Alt>'>
-<!ENTITY RepnDecomp '<Package>RepnDecomp</Package>'>
+ [<#Include SYSTEM "_entities.xml">
]
>
<Book Name="RepnDecomp">
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore'
old/RepnDecomp-1.2.1/doc/_Chapter_Miscellaneous_useful_functions.xml
new/RepnDecomp-1.3.0/doc/_Chapter_Miscellaneous_useful_functions.xml
--- old/RepnDecomp-1.2.1/doc/_Chapter_Miscellaneous_useful_functions.xml
2022-03-03 00:51:43.000000000 +0100
+++ new/RepnDecomp-1.3.0/doc/_Chapter_Miscellaneous_useful_functions.xml
2023-01-03 03:06:35.000000000 +0100
@@ -82,7 +82,7 @@
structure.
<ManSection>
<Filt Arg="arg" Name="IsTensorProductOfMatricesObj" Label="for
IsMultiplicativeElementWithInverse"/>
- <Returns><C>true</C> or <C>false</C>
+ <Returns><K>true</K> or <K>false</K>
</Returns>
<Description>
<P/>
@@ -94,7 +94,7 @@
tensor product <Math>A_1 \otimes A_2</Math>.
<ManSection>
<Filt Arg="arg" Name="IsTensorProductPairRep" Label="for
IsPositionalObjectRep"/>
- <Returns><C>true</C> or <C>false</C>
+ <Returns><K>true</K> or <K>false</K>
</Returns>
<Description>
<P/>
@@ -106,7 +106,7 @@
is very space inefficient and supposed to be used as a last resort.
<ManSection>
<Filt Arg="arg" Name="IsTensorProductKroneckerRep" Label="for
IsPositionalObjectRep"/>
- <Returns><C>true</C> or <C>false</C>
+ <Returns><K>true</K> or <K>false</K>
</Returns>
<Description>
<P/>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/_entities.xml
new/RepnDecomp-1.3.0/doc/_entities.xml
--- old/RepnDecomp-1.2.1/doc/_entities.xml 1970-01-01 01:00:00.000000000
+0100
+++ new/RepnDecomp-1.3.0/doc/_entities.xml 2023-01-03 03:06:35.000000000
+0100
@@ -0,0 +1 @@
+<!ENTITY RepnDecomp '<Package>RepnDecomp</Package>'>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/chap0.html
new/RepnDecomp-1.3.0/doc/chap0.html
--- old/RepnDecomp-1.2.1/doc/chap0.html 2022-03-03 00:51:44.000000000 +0100
+++ new/RepnDecomp-1.3.0/doc/chap0.html 2023-01-03 03:06:37.000000000 +0100
@@ -29,10 +29,10 @@
<h2>Decompose representations of finite groups into irreducibles</h2>
<p>
- 1.2.1</p>
+ 1.3.0</p>
<p>
- 2 March 2022
+ 2 January 2023
</p>
</div>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/chap0.txt
new/RepnDecomp-1.3.0/doc/chap0.txt
--- old/RepnDecomp-1.2.1/doc/chap0.txt 2022-03-03 00:51:43.000000000 +0100
+++ new/RepnDecomp-1.3.0/doc/chap0.txt 2023-01-03 03:06:35.000000000 +0100
@@ -6,10 +6,10 @@
[1X Decompose representations of finite groups into irreducibles
[101X
- 1.2.1
+ 1.3.0
- 2 March 2022
+ 2 January 2023
Kaashif Hymabaccus
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/chap0_mj.html
new/RepnDecomp-1.3.0/doc/chap0_mj.html
--- old/RepnDecomp-1.2.1/doc/chap0_mj.html 2022-03-03 00:51:44.000000000
+0100
+++ new/RepnDecomp-1.3.0/doc/chap0_mj.html 2023-01-03 03:06:37.000000000
+0100
@@ -32,10 +32,10 @@
<h2>Decompose representations of finite groups into irreducibles</h2>
<p>
- 1.2.1</p>
+ 1.3.0</p>
<p>
- 2 March 2022
+ 2 January 2023
</p>
</div>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/chap4.html
new/RepnDecomp-1.3.0/doc/chap4.html
--- old/RepnDecomp-1.2.1/doc/chap4.html 2022-03-03 00:51:44.000000000 +0100
+++ new/RepnDecomp-1.3.0/doc/chap4.html 2023-01-03 03:06:37.000000000 +0100
@@ -114,7 +114,7 @@
<h5>4.3-1 IsTensorProductOfMatricesObj</h5>
<div class="func"><table class="func" width="100%"><tr><td
class="tdleft"><code class="func">‣ IsTensorProductOfMatricesObj</code>(
<var class="Arg">arg</var> )</td><td
class="tdright">( filter )</td></tr></table></div>
-<p>Returns: <code class="code">true</code> or <code
class="code">false</code></p>
+<p>Returns: <code class="keyw">true</code> or <code
class="keyw">false</code></p>
<p>Position <span class="Math">i</span> in this representation stores the
matrix <span class="Math">A_i</span> in the tensor product <span
class="Math">A_1 \otimes A_2</span>.</p>
@@ -123,7 +123,7 @@
<h5>4.3-2 IsTensorProductPairRep</h5>
<div class="func"><table class="func" width="100%"><tr><td
class="tdleft"><code class="func">‣ IsTensorProductPairRep</code>( <var
class="Arg">arg</var> )</td><td
class="tdright">( filter )</td></tr></table></div>
-<p>Returns: <code class="code">true</code> or <code
class="code">false</code></p>
+<p>Returns: <code class="keyw">true</code> or <code
class="keyw">false</code></p>
<p>Position 1 stores the full Kronecker product of the matrices, this is very
space inefficient and supposed to be used as a last resort.</p>
@@ -132,7 +132,7 @@
<h5>4.3-3 IsTensorProductKroneckerRep</h5>
<div class="func"><table class="func" width="100%"><tr><td
class="tdleft"><code class="func">‣ IsTensorProductKroneckerRep</code>(
<var class="Arg">arg</var> )</td><td
class="tdright">( filter )</td></tr></table></div>
-<p>Returns: <code class="code">true</code> or <code
class="code">false</code></p>
+<p>Returns: <code class="keyw">true</code> or <code
class="keyw">false</code></p>
<p>More convenient constructor for a tensor product (automatically handles
family)</p>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/chap4.txt
new/RepnDecomp-1.3.0/doc/chap4.txt
--- old/RepnDecomp-1.2.1/doc/chap4.txt 2022-03-03 00:51:43.000000000 +0100
+++ new/RepnDecomp-1.3.0/doc/chap4.txt 2023-01-03 03:06:35.000000000 +0100
@@ -70,7 +70,7 @@
[1X4.3-1 IsTensorProductOfMatricesObj[101X
[33X[1;0Y[29X[2XIsTensorProductOfMatricesObj[102X( [3Xarg[103X )
[32X filter[133X
- [6XReturns:[106X [33X[0;10Y[10Xtrue[110X or [10Xfalse[110X[133X
+ [6XReturns:[106X [33X[0;10Y[9Xtrue[109X or [9Xfalse[109X[133X
[33X[0;0YPosition [23Xi[123X in this representation stores the
matrix [23XA_i[123X in the tensor
product [23XA_1 \otimes A_2[123X.[133X
@@ -78,7 +78,7 @@
[1X4.3-2 IsTensorProductPairRep[101X
[33X[1;0Y[29X[2XIsTensorProductPairRep[102X( [3Xarg[103X ) [32X
filter[133X
- [6XReturns:[106X [33X[0;10Y[10Xtrue[110X or [10Xfalse[110X[133X
+ [6XReturns:[106X [33X[0;10Y[9Xtrue[109X or [9Xfalse[109X[133X
[33X[0;0YPosition 1 stores the full Kronecker product of the matrices,
this is very
space inefficient and supposed to be used as a last resort.[133X
@@ -86,7 +86,7 @@
[1X4.3-3 IsTensorProductKroneckerRep[101X
[33X[1;0Y[29X[2XIsTensorProductKroneckerRep[102X( [3Xarg[103X ) [32X
filter[133X
- [6XReturns:[106X [33X[0;10Y[10Xtrue[110X or [10Xfalse[110X[133X
+ [6XReturns:[106X [33X[0;10Y[9Xtrue[109X or [9Xfalse[109X[133X
[33X[0;0YMore convenient constructor for a tensor product
(automatically handles
family)[133X
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/chap4_mj.html
new/RepnDecomp-1.3.0/doc/chap4_mj.html
--- old/RepnDecomp-1.2.1/doc/chap4_mj.html 2022-03-03 00:51:44.000000000
+0100
+++ new/RepnDecomp-1.3.0/doc/chap4_mj.html 2023-01-03 03:06:37.000000000
+0100
@@ -117,7 +117,7 @@
<h5>4.3-1 IsTensorProductOfMatricesObj</h5>
<div class="func"><table class="func" width="100%"><tr><td
class="tdleft"><code class="func">‣ IsTensorProductOfMatricesObj</code>(
<var class="Arg">arg</var> )</td><td
class="tdright">( filter )</td></tr></table></div>
-<p>Returns: <code class="code">true</code> or <code
class="code">false</code></p>
+<p>Returns: <code class="keyw">true</code> or <code
class="keyw">false</code></p>
<p>Position <span class="SimpleMath">\(i\)</span> in this representation
stores the matrix <span class="SimpleMath">\(A_i\)</span> in the tensor product
<span class="SimpleMath">\(A_1 \otimes A_2\)</span>.</p>
@@ -126,7 +126,7 @@
<h5>4.3-2 IsTensorProductPairRep</h5>
<div class="func"><table class="func" width="100%"><tr><td
class="tdleft"><code class="func">‣ IsTensorProductPairRep</code>( <var
class="Arg">arg</var> )</td><td
class="tdright">( filter )</td></tr></table></div>
-<p>Returns: <code class="code">true</code> or <code
class="code">false</code></p>
+<p>Returns: <code class="keyw">true</code> or <code
class="keyw">false</code></p>
<p>Position 1 stores the full Kronecker product of the matrices, this is very
space inefficient and supposed to be used as a last resort.</p>
@@ -135,7 +135,7 @@
<h5>4.3-3 IsTensorProductKroneckerRep</h5>
<div class="func"><table class="func" width="100%"><tr><td
class="tdleft"><code class="func">‣ IsTensorProductKroneckerRep</code>(
<var class="Arg">arg</var> )</td><td
class="tdright">( filter )</td></tr></table></div>
-<p>Returns: <code class="code">true</code> or <code
class="code">false</code></p>
+<p>Returns: <code class="keyw">true</code> or <code
class="keyw">false</code></p>
<p>More convenient constructor for a tensor product (automatically handles
family)</p>
Binary files old/RepnDecomp-1.2.1/doc/manual.pdf and
new/RepnDecomp-1.3.0/doc/manual.pdf differ
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/doc/title.xml
new/RepnDecomp-1.3.0/doc/title.xml
--- old/RepnDecomp-1.2.1/doc/title.xml 2022-03-03 00:51:43.000000000 +0100
+++ new/RepnDecomp-1.3.0/doc/title.xml 2023-01-03 03:06:35.000000000 +0100
@@ -9,7 +9,7 @@
Decompose representations of finite groups into irreducibles
</Subtitle>
<Version>
- 1.2.1
+ 1.3.0
</Version>
<Author>
Kaashif Hymabaccus<Alt Only="LaTeX"><Br/></Alt>
@@ -18,6 +18,6 @@
</Author>
<Date>
- 2 March 2022
+ 2 January 2023
</Date>
</TitlePage>
\ No newline at end of file
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/lib/block_diagonalize.gd
new/RepnDecomp-1.3.0/lib/block_diagonalize.gd
--- old/RepnDecomp-1.2.1/lib/block_diagonalize.gd 2022-03-03
00:51:26.000000000 +0100
+++ new/RepnDecomp-1.3.0/lib/block_diagonalize.gd 2023-01-03
02:15:20.000000000 +0100
@@ -15,7 +15,7 @@
#! with dimension $d_i$ and multiplicity $m_i$. The basis returned by
#! this operation gives each $\rho(g)$ as a block diagonal matrix
#! which has $m_i$ blocks of size $d_i \times d_i$ for each $i$.
-DeclareGlobalFunction( "BlockDiagonalBasisOfRepresentation",
IsGroupHomomorphism );
+DeclareGlobalFunction( "BlockDiagonalBasisOfRepresentation" );
#! @Arguments rho
@@ -26,6 +26,6 @@
#! Attr="BlockDiagonalBasisOfRepresentation" /> to calculate the basis
#! change matrix and applies it to put $\rho$ into the block
#! diagonalised form.
-DeclareGlobalFunction( "BlockDiagonalRepresentation", IsGroupHomomorphism );
+DeclareGlobalFunction( "BlockDiagonalRepresentation" );
DeclareGlobalFunction( "BasisChangeMatrixSimilar" );
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/makedoc.sh
new/RepnDecomp-1.3.0/makedoc.sh
--- old/RepnDecomp-1.2.1/makedoc.sh 2022-03-03 00:51:26.000000000 +0100
+++ new/RepnDecomp-1.3.0/makedoc.sh 1970-01-01 01:00:00.000000000 +0100
@@ -1,38 +0,0 @@
-#!/usr/bin/env bash
-#
-# Copyright (C) 2017-2019 Max Horn
-# Copyright (C) 2017-2019 The GAP Team
-#
-# This code is free software; you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation; either version 2 of the License, or
-# (at your option) any later version.
-#
-# SPDX-License-Identifier: GPL-2.0-or-later
-#
-set -ex
-
-GAPROOT=${GAPROOT-$HOME/gap}
-
-# set up a custom GAP root containing only this package, so that
-# we can force GAP to load the correct version of this package
-# (we already did that in build_pkg.sh, but we do it again here,
-# to allow the occasional instance where a package wants to also
-# run the tests of others packages, by invoking this script multiple
-# times in different directories)
-mkdir -p gaproot/pkg/
-ln -f -s $PWD gaproot/pkg/
-
-# start GAP with custom GAP root, to ensure correct package version is loaded
-GAP="$GAPROOT/bin/gap.sh -l $PWD/gaproot; --quitonbreak"
-
-# Unless explicitly turned off by setting the NO_COVERAGE environment variable,
-# we collect coverage data
-if [[ -z $NO_COVERAGE ]]; then
- mkdir -p ${COVDIR-coverage}
- GAP="$GAP --cover ${COVDIR-coverage}/$(mktemp XXXXXX).coverage"
-fi
-
-# TODO: honor TestFile from PackageInfo record, but make sure that it
-# is for the package in the current directory
-$GAP -q < makedoc.g
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/tst/repndecomp01.tst
new/RepnDecomp-1.3.0/tst/repndecomp01.tst
--- old/RepnDecomp-1.2.1/tst/repndecomp01.tst 2022-03-03 00:51:44.000000000
+0100
+++ new/RepnDecomp-1.3.0/tst/repndecomp01.tst 2023-01-03 03:06:37.000000000
+0100
@@ -8,7 +8,7 @@
# taken. Note that the XML file in turn may have been generated by AutoDoc
# from some other input.
#
-gap> START_TEST( "repndecomp01.tst");
+gap> START_TEST("repndecomp01.tst");
# doc/_Chapter_Introduction.xml:43-52
gap> G := SymmetricGroup(3);
@@ -21,4 +21,4 @@
[ [ 0, 1, 0 ], [ 1, 0, 0 ], [ 0, 0, 1 ] ] ]
#
-gap> STOP_TEST("repndecomp01.tst", 1 );
+gap> STOP_TEST("repndecomp01.tst", 1);
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/tst/repndecomp02.tst
new/RepnDecomp-1.3.0/tst/repndecomp02.tst
--- old/RepnDecomp-1.2.1/tst/repndecomp02.tst 2022-03-03 00:51:44.000000000
+0100
+++ new/RepnDecomp-1.3.0/tst/repndecomp02.tst 2023-01-03 03:06:37.000000000
+0100
@@ -8,7 +8,7 @@
# taken. Note that the XML file in turn may have been generated by AutoDoc
# from some other input.
#
-gap> START_TEST( "repndecomp02.tst");
+gap> START_TEST("repndecomp02.tst");
# /doc/_Chunks.xml:66-93
gap> G := SymmetricGroup(4);;
@@ -65,4 +65,4 @@
false
#
-gap> STOP_TEST("repndecomp02.tst", 1 );
+gap> STOP_TEST("repndecomp02.tst", 1);
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/tst/repndecomp03.tst
new/RepnDecomp-1.3.0/tst/repndecomp03.tst
--- old/RepnDecomp-1.2.1/tst/repndecomp03.tst 2022-03-03 00:51:44.000000000
+0100
+++ new/RepnDecomp-1.3.0/tst/repndecomp03.tst 2023-01-03 03:06:37.000000000
+0100
@@ -8,7 +8,7 @@
# taken. Note that the XML file in turn may have been generated by AutoDoc
# from some other input.
#
-gap> START_TEST( "repndecomp03.tst");
+gap> START_TEST("repndecomp03.tst");
# /doc/_Chunks.xml:261-287
gap> G := SymmetricGroup(3);;
@@ -57,4 +57,4 @@
true
#
-gap> STOP_TEST("repndecomp03.tst", 1 );
+gap> STOP_TEST("repndecomp03.tst", 1);
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/tst/repndecomp04.tst
new/RepnDecomp-1.3.0/tst/repndecomp04.tst
--- old/RepnDecomp-1.2.1/tst/repndecomp04.tst 2022-03-03 00:51:44.000000000
+0100
+++ new/RepnDecomp-1.3.0/tst/repndecomp04.tst 2023-01-03 03:06:37.000000000
+0100
@@ -8,7 +8,7 @@
# taken. Note that the XML file in turn may have been generated by AutoDoc
# from some other input.
#
-gap> START_TEST( "repndecomp04.tst");
+gap> START_TEST("repndecomp04.tst");
# /doc/_Chunks.xml:140-164
gap> G := SymmetricGroup(4);;
@@ -107,4 +107,4 @@
gap> REPN_ComputeUsingSerre(tau : irreps := irreps_H);;
#
-gap> STOP_TEST("repndecomp04.tst", 1 );
+gap> STOP_TEST("repndecomp04.tst", 1);
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/RepnDecomp-1.2.1/tst/repndecomp05.tst
new/RepnDecomp-1.3.0/tst/repndecomp05.tst
--- old/RepnDecomp-1.2.1/tst/repndecomp05.tst 2022-03-03 00:51:44.000000000
+0100
+++ new/RepnDecomp-1.3.0/tst/repndecomp05.tst 2023-01-03 03:06:37.000000000
+0100
@@ -8,7 +8,7 @@
# taken. Note that the XML file in turn may have been generated by AutoDoc
# from some other input.
#
-gap> START_TEST( "repndecomp05.tst");
+gap> START_TEST("repndecomp05.tst");
# /doc/_Chunks.xml:2-14
gap> G := DihedralGroup(8);;
@@ -55,4 +55,4 @@
true
#
-gap> STOP_TEST("repndecomp05.tst", 1 );
+gap> STOP_TEST("repndecomp05.tst", 1);
