Script 'mail_helper' called by obssrc
Hello community,

here is the log from the commit of package gap-fplsa for openSUSE:Factory 
checked in at 2024-03-25 21:09:24
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Comparing /work/SRC/openSUSE:Factory/gap-fplsa (Old)
 and      /work/SRC/openSUSE:Factory/.gap-fplsa.new.1905 (New)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Package is "gap-fplsa"

Mon Mar 25 21:09:24 2024 rev:2 rq:1160999 version:1.2.6

Changes:
--------
--- /work/SRC/openSUSE:Factory/gap-fplsa/gap-fplsa.changes      2023-12-28 
22:57:56.406712795 +0100
+++ /work/SRC/openSUSE:Factory/.gap-fplsa.new.1905/gap-fplsa.changes    
2024-03-25 21:15:07.672449142 +0100
@@ -1,0 +2,6 @@
+Sat Mar 23 21:38:48 UTC 2024 - Jan Engelhardt <[email protected]>
+
+- Update to release 1.2.6
+  * Janitorial changes only
+
+-------------------------------------------------------------------

Old:
----
  FPLSA-1.2.5.tar.gz

New:
----
  FPLSA-1.2.6.tar.gz

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Other differences:
------------------
++++++ gap-fplsa.spec ++++++
--- /var/tmp/diff_new_pack.LNZmFm/_old  2024-03-25 21:15:08.176467648 +0100
+++ /var/tmp/diff_new_pack.LNZmFm/_new  2024-03-25 21:15:08.180467794 +0100
@@ -1,7 +1,7 @@
 #
 # spec file for package gap-fplsa
 #
-# Copyright (c) 2022 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-fplsa
-Version:        1.2.5
+Version:        1.2.6
 Release:        0
 Summary:        GAP: Finitely Presented Lie Algebras
 License:        GPL-2.0-or-later

++++++ FPLSA-1.2.5.tar.gz -> FPLSA-1.2.6.tar.gz ++++++
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/CHANGES new/FPLSA-1.2.6/CHANGES
--- old/FPLSA-1.2.5/CHANGES     2022-03-10 23:07:34.000000000 +0100
+++ new/FPLSA-1.2.6/CHANGES     2023-01-03 17:36:27.000000000 +0100
@@ -1,5 +1,9 @@
 This file describes changes in the FPLSA package.
 
+1.2.6 (2023-01-03)
+  - Enhance the `configure` script to accept `--with-gaproot=PATH`
+  - Minor janitorial changes
+
 1.2.5 (2022-03-10)
   - Improve buildsystem
   - PackageInfo.g: update Max Horn's address (again)
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/PackageInfo.g 
new/FPLSA-1.2.6/PackageInfo.g
--- old/FPLSA-1.2.5/PackageInfo.g       2022-03-10 23:07:34.000000000 +0100
+++ new/FPLSA-1.2.6/PackageInfo.g       2023-01-03 17:36:27.000000000 +0100
@@ -5,8 +5,8 @@
 SetPackageInfo( rec(
 PackageName := "FPLSA",
 Subtitle := "Finitely Presented Lie Algebras",
-Version := "1.2.5",
-Date := "10/03/2022", # dd/mm/yyyy format
+Version := "1.2.6",
+Date := "03/01/2023", # dd/mm/yyyy format
 License := "GPL-2.0-or-later",
 
 Persons := [
@@ -65,7 +65,7 @@
 PackageDoc := rec(
   BookName := "fplsa",
   ArchiveURLSubset := [ "doc" ],
-  HTMLStart := "doc/chap0.html",
+  HTMLStart := "doc/chap0_mj.html",
   PDFFile := "doc/manual.pdf",
   SixFile := "doc/manual.six",
   LongTitle := "Interface to fast external Lie Todd-Coxeter Program",
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/README.md new/FPLSA-1.2.6/README.md
--- old/FPLSA-1.2.5/README.md   2022-03-10 23:07:34.000000000 +0100
+++ new/FPLSA-1.2.6/README.md   2023-01-03 17:36:27.000000000 +0100
@@ -54,7 +54,7 @@
 #### Configuring and Compiling the C part
 
 You have to change your current working directory to the subdirectory
-FPLSA lives in. Starting from the `pkg` dirctory of your GAP
+FPLSA lives in. Starting from the `pkg` directory of your GAP
 installation, you can do this via this command (replace `X.Y` with
 the actual version):
 
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/configure new/FPLSA-1.2.6/configure
--- old/FPLSA-1.2.5/configure   2022-03-10 23:07:34.000000000 +0100
+++ new/FPLSA-1.2.6/configure   2023-01-03 17:36:27.000000000 +0100
@@ -1,17 +1,36 @@
 #!/bin/sh
 # usage: configure gappath
-# this script creates a `Makefile' from `Makefile.in' 
-if test -z "$1"; then
-  GAPPATH=../..; echo "Using ../.. as default GAP path";
-else
-  GAPPATH="$1";
-fi
-if test ! -r "$GAPPATH/sysinfo.gap"; then
-  echo "Please give correct GAP path as argument (and make sure that GAP"
-  echo "is already properly installed)."
-  exit
+# this script creates a `Makefile' from `Makefile.in'
+
+set -e
+
+GAPPATH=../..
+while test "$#" -ge 1 ; do
+  option="$1" ; shift
+  case "$option" in
+    --with-gaproot=*) GAPPATH=${option#--with-gaproot=}; ;;
+    -*)               echo "ERROR: unsupported argument $option" ; exit 1;;
+    *)                GAPPATH="$option" ;;
+  esac
+done
+
+if test ! -r "$GAPPATH/sysinfo.gap" ; then
+    echo
+    echo "No file $GAPPATH/sysinfo.gap found."
+    echo
+    echo "Usage: ./configure [GAPPATH]"
+    echo "       where GAPPATH is a path to your GAP installation"
+    echo "       (The default for GAPPATH is \"../..\")"
+    echo
+    echo "Either your GAPPATH is incorrect or the GAP it is pointing to"
+    echo "is not properly compiled (do \"./configure && make\" there first)."
+    echo
+    echo "Aborting... No Makefile is generated."
+    echo
+    exit 1
 fi
 
+echo "Using settings from $GAPPATH/sysinfo.gap"
 rm -f Makefile
 . "$GAPPATH/sysinfo.gap"
 sed \
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/doc/FPLSA.toc 
new/FPLSA-1.2.6/doc/FPLSA.toc
--- old/FPLSA-1.2.5/doc/FPLSA.toc       2022-03-10 23:07:48.000000000 +0100
+++ new/FPLSA-1.2.6/doc/FPLSA.toc       1970-01-01 01:00:00.000000000 +0100
@@ -1,8 +0,0 @@
-\contentsline {chapter}{\numberline {1}\textcolor {Chapter }{The FPLSA 
Package}}{3}{chapter.1}%
-\contentsline {section}{\numberline {1.1}\textcolor {Chapter }{Main 
Functions}}{3}{section.1.1}%
-\contentsline {subsection}{\numberline {1.1.1}\textcolor {Chapter 
}{SCAlgebraInfoOfFpLieAlgebra}}{3}{subsection.1.1.1}%
-\contentsline {subsection}{\numberline {1.1.2}\textcolor {Chapter }{ 
IsomorphicSCAlgebra}}{4}{subsection.1.1.2}%
-\contentsline {section}{\numberline {1.2}\textcolor {Chapter }{Auxiliary 
Variables of FPLSA}}{4}{section.1.2}%
-\contentsline {subsection}{\numberline {1.2.1}\textcolor {Chapter 
}{FPLSA}}{4}{subsection.1.2.1}%
-\contentsline {section}{\numberline {1.3}\textcolor {Chapter }{Installing the 
FPLSA Package}}{5}{section.1.3}%
-\contentsline {chapter}{Index}{7}{section*.2}%
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/doc/FPLSA.xml 
new/FPLSA-1.2.6/doc/FPLSA.xml
--- old/FPLSA-1.2.5/doc/FPLSA.xml       2022-03-10 23:07:43.000000000 +0100
+++ new/FPLSA-1.2.6/doc/FPLSA.xml       2023-01-03 17:36:40.000000000 +0100
@@ -3,9 +3,7 @@
 <!-- This is an automatically generated file. -->
 <!DOCTYPE Book SYSTEM "gapdoc.dtd"
 [
-<!ENTITY fplsa '<Package>fplsa</Package>'>
-<!ENTITY see '<Alt Only="LaTeX">$\to$</Alt><Alt Not="LaTeX">--&gt;</Alt>'>
-<!ENTITY FPLSA '<Package>FPLSA</Package>'>
+    [<#Include SYSTEM "_entities.xml">
 ]
 >
 <Book Name="fplsa">
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/doc/_entities.xml 
new/FPLSA-1.2.6/doc/_entities.xml
--- old/FPLSA-1.2.5/doc/_entities.xml   1970-01-01 01:00:00.000000000 +0100
+++ new/FPLSA-1.2.6/doc/_entities.xml   2023-01-03 17:36:40.000000000 +0100
@@ -0,0 +1,2 @@
+<!ENTITY fplsa '<Package>fplsa</Package>'>
+<!ENTITY FPLSA '<Package>FPLSA</Package>'>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/doc/chap0.html 
new/FPLSA-1.2.6/doc/chap0.html
--- old/FPLSA-1.2.5/doc/chap0.html      2022-03-10 23:07:48.000000000 +0100
+++ new/FPLSA-1.2.6/doc/chap0.html      2023-01-03 17:36:44.000000000 +0100
@@ -29,10 +29,10 @@
 <h2>Finitely Presented Lie Algebras</h2>
 
 <p>
-    1.2.5</p>
+    1.2.6</p>
 
 <p>
-    10 March 2022
+    3 January 2023
   </p>
 
 </div>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/doc/chap0.txt 
new/FPLSA-1.2.6/doc/chap0.txt
--- old/FPLSA-1.2.5/doc/chap0.txt       2022-03-10 23:07:43.000000000 +0100
+++ new/FPLSA-1.2.6/doc/chap0.txt       2023-01-03 17:36:40.000000000 +0100
@@ -6,10 +6,10 @@
                         Finitely Presented Lie Algebras 
   
   
-                                     1.2.5
+                                     1.2.6
   
   
-                                 10 March 2022
+                                 3 January 2023
   
   
                                  Vladimir Gerdt
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/doc/chap0_mj.html 
new/FPLSA-1.2.6/doc/chap0_mj.html
--- old/FPLSA-1.2.5/doc/chap0_mj.html   2022-03-10 23:07:48.000000000 +0100
+++ new/FPLSA-1.2.6/doc/chap0_mj.html   2023-01-03 17:36:44.000000000 +0100
@@ -32,10 +32,10 @@
 <h2>Finitely Presented Lie Algebras</h2>
 
 <p>
-    1.2.5</p>
+    1.2.6</p>
 
 <p>
-    10 March 2022
+    3 January 2023
   </p>
 
 </div>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/doc/chap1.html 
new/FPLSA-1.2.6/doc/chap1.html
--- old/FPLSA-1.2.5/doc/chap1.html      2022-03-10 23:07:48.000000000 +0100
+++ new/FPLSA-1.2.6/doc/chap1.html      2023-01-03 17:36:44.000000000 +0100
@@ -50,7 +50,7 @@
 
 <h4>1.1 <span class="Heading">Main Functions</span></h4>
 
-<p>A finitely presented Lie algebra is a quotient of a free Lie algebra by an 
ideal generated by a finite number of elements. In <strong 
class="pkg">GAP</strong> a free Lie algebra can be created by the command <code 
class="code">FreeLieAlgebra</code>; we refer to the <strong 
class="pkg">GAP</strong> Reference Manual for more details. A finitely 
presented Lie algebra <var class="Arg">K</var> can be constructed by <code 
class="code"><var class="Arg">K</var> := <var class="Arg">L</var>/<var 
class="Arg">rels</var></code>, where <var class="Arg">L</var> is a free Lie 
algebra and <var class="Arg">rels</var> a list of elements of <var 
class="Arg">L</var> that constitute the relations that hold in <var 
class="Arg">K</var>. Given a finitle presented Lie algebra we want to calculate 
a basis and a multiplication table of it. The interface to the <strong 
class="pkg">FPLSA</strong> package comes with two related functions for doing 
that.</p>
+<p>A finitely presented Lie algebra is a quotient of a free Lie algebra by an 
ideal generated by a finite number of elements. In <strong 
class="pkg">GAP</strong> a free Lie algebra can be created by the command <code 
class="code">FreeLieAlgebra</code>; we refer to the <strong 
class="pkg">GAP</strong> Reference Manual for more details. A finitely 
presented Lie algebra <var class="Arg">K</var> can be constructed by <code 
class="code"><var class="Arg">K</var> := <var class="Arg">L</var>/<var 
class="Arg">rels</var></code>, where <var class="Arg">L</var> is a free Lie 
algebra and <var class="Arg">rels</var> a list of elements of <var 
class="Arg">L</var> that constitute the relations that hold in <var 
class="Arg">K</var>. Given a finitely presented Lie algebra we want to 
calculate a basis and a multiplication table of it. The interface to the 
<strong class="pkg">FPLSA</strong> package comes with two related functions for 
doing that.</p>
 
 <p><a id="X8019B72B8298566A" name="X8019B72B8298566A"></a></p>
 
@@ -88,7 +88,7 @@
 <h5>1.1-2  IsomorphicSCAlgebra</h5>
 
 <div class="func"><table class="func" width="100%"><tr><td 
class="tdleft"><code class="func">&#8227;  IsomorphicSCAlgebra</code>( <var 
class="Arg">K</var>[, <var class="Arg">bound</var>] )</td><td 
class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
-<p>computes a Lie algebra given by a multiplication table isomorphic to the 
finitely presented Lie algebra <var class="Arg">K</var>. If the optional 
parameter <var class="Arg">bound</var> is specified the computation will be 
carried out using monomials of degree at most <var class="Arg">bound</var>. If 
<var class="Arg">bound</var> is not specified, then it will initially be set to 
10000. If this does not suffice to calculate a multiplication tabel of the 
algebra, then the bound will be increased until a multiplication table is 
found. If the computation was successful then a structure constants algebra 
will be returned isomorphic to <var class="Arg">K</var>. Otherwise <code 
class="keyw">fail</code> will be returned.</p>
+<p>computes a Lie algebra given by a multiplication table isomorphic to the 
finitely presented Lie algebra <var class="Arg">K</var>. If the optional 
parameter <var class="Arg">bound</var> is specified the computation will be 
carried out using monomials of degree at most <var class="Arg">bound</var>. If 
<var class="Arg">bound</var> is not specified, then it will initially be set to 
10000. If this does not suffice to calculate a multiplication table of the 
algebra, then the bound will be increased until a multiplication table is 
found. If the computation was successful then a structure constants algebra 
will be returned isomorphic to <var class="Arg">K</var>. Otherwise <code 
class="keyw">fail</code> will be returned.</p>
 
 
 <div class="example"><pre>
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/doc/chap1.txt 
new/FPLSA-1.2.6/doc/chap1.txt
--- old/FPLSA-1.2.5/doc/chap1.txt       2022-03-10 23:07:43.000000000 +0100
+++ new/FPLSA-1.2.6/doc/chap1.txt       2023-01-03 17:36:40.000000000 +0100
@@ -20,7 +20,7 @@
   can  be created by the command FreeLieAlgebra; we refer to the 
GAP Reference
   Manual  for  more  details.  A  finitely  presented  Lie  algebra  
K  can be
   constructed by K := 
L/rels, where L is a free Lie 
algebra and rels a list of
-  elements  of L that constitute the relations that hold in 
K. Given a finitle
+  elements of L that constitute the relations that hold in 
K. Given a finitely
   presented  Lie  algebra  we  want  to calculate a basis and a multiplication
   table  of  it.  The  interface  to  the FPLSA package comes with 
two related
   functions for doing that.
@@ -70,7 +70,7 @@
   finitely  presented  Lie  algebra  K.  If  the  optional  
parameter bound is
   specified  the  computation will be carried out using monomials of degree at
   most  bound.  If  bound  is  not specified, then it will 
initially be set to
-  10000.  If  this does not suffice to calculate a multiplication tabel of the
+  10000.  If  this does not suffice to calculate a multiplication table of the
   algebra,  then  the  bound will be increased until a multiplication table is
   found.  If the computation was successful then a structure constants algebra
   will be returned isomorphic to K. Otherwise fail will be 
returned.
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/doc/chap1_mj.html 
new/FPLSA-1.2.6/doc/chap1_mj.html
--- old/FPLSA-1.2.5/doc/chap1_mj.html   2022-03-10 23:07:48.000000000 +0100
+++ new/FPLSA-1.2.6/doc/chap1_mj.html   2023-01-03 17:36:44.000000000 +0100
@@ -53,7 +53,7 @@
 
 <h4>1.1 <span class="Heading">Main Functions</span></h4>
 
-<p>A finitely presented Lie algebra is a quotient of a free Lie algebra by an 
ideal generated by a finite number of elements. In <strong 
class="pkg">GAP</strong> a free Lie algebra can be created by the command <code 
class="code">FreeLieAlgebra</code>; we refer to the <strong 
class="pkg">GAP</strong> Reference Manual for more details. A finitely 
presented Lie algebra <var class="Arg">K</var> can be constructed by <code 
class="code"><var class="Arg">K</var> := <var class="Arg">L</var>/<var 
class="Arg">rels</var></code>, where <var class="Arg">L</var> is a free Lie 
algebra and <var class="Arg">rels</var> a list of elements of <var 
class="Arg">L</var> that constitute the relations that hold in <var 
class="Arg">K</var>. Given a finitle presented Lie algebra we want to calculate 
a basis and a multiplication table of it. The interface to the <strong 
class="pkg">FPLSA</strong> package comes with two related functions for doing 
that.</p>
+<p>A finitely presented Lie algebra is a quotient of a free Lie algebra by an 
ideal generated by a finite number of elements. In <strong 
class="pkg">GAP</strong> a free Lie algebra can be created by the command <code 
class="code">FreeLieAlgebra</code>; we refer to the <strong 
class="pkg">GAP</strong> Reference Manual for more details. A finitely 
presented Lie algebra <var class="Arg">K</var> can be constructed by <code 
class="code"><var class="Arg">K</var> := <var class="Arg">L</var>/<var 
class="Arg">rels</var></code>, where <var class="Arg">L</var> is a free Lie 
algebra and <var class="Arg">rels</var> a list of elements of <var 
class="Arg">L</var> that constitute the relations that hold in <var 
class="Arg">K</var>. Given a finitely presented Lie algebra we want to 
calculate a basis and a multiplication table of it. The interface to the 
<strong class="pkg">FPLSA</strong> package comes with two related functions for 
doing that.</p>
 
 <p><a id="X8019B72B8298566A" name="X8019B72B8298566A"></a></p>
 
@@ -91,7 +91,7 @@
 <h5>1.1-2  IsomorphicSCAlgebra</h5>
 
 <div class="func"><table class="func" width="100%"><tr><td 
class="tdleft"><code class="func">&#8227;  IsomorphicSCAlgebra</code>( <var 
class="Arg">K</var>[, <var class="Arg">bound</var>] )</td><td 
class="tdright">(&nbsp;function&nbsp;)</td></tr></table></div>
-<p>computes a Lie algebra given by a multiplication table isomorphic to the 
finitely presented Lie algebra <var class="Arg">K</var>. If the optional 
parameter <var class="Arg">bound</var> is specified the computation will be 
carried out using monomials of degree at most <var class="Arg">bound</var>. If 
<var class="Arg">bound</var> is not specified, then it will initially be set to 
10000. If this does not suffice to calculate a multiplication tabel of the 
algebra, then the bound will be increased until a multiplication table is 
found. If the computation was successful then a structure constants algebra 
will be returned isomorphic to <var class="Arg">K</var>. Otherwise <code 
class="keyw">fail</code> will be returned.</p>
+<p>computes a Lie algebra given by a multiplication table isomorphic to the 
finitely presented Lie algebra <var class="Arg">K</var>. If the optional 
parameter <var class="Arg">bound</var> is specified the computation will be 
carried out using monomials of degree at most <var class="Arg">bound</var>. If 
<var class="Arg">bound</var> is not specified, then it will initially be set to 
10000. If this does not suffice to calculate a multiplication table of the 
algebra, then the bound will be increased until a multiplication table is 
found. If the computation was successful then a structure constants algebra 
will be returned isomorphic to <var class="Arg">K</var>. Otherwise <code 
class="keyw">fail</code> will be returned.</p>
 
 
 <div class="example"><pre>
Binary files old/FPLSA-1.2.5/doc/manual.pdf and new/FPLSA-1.2.6/doc/manual.pdf 
differ
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/doc/manual.xml 
new/FPLSA-1.2.6/doc/manual.xml
--- old/FPLSA-1.2.5/doc/manual.xml      2022-03-10 23:07:34.000000000 +0100
+++ new/FPLSA-1.2.6/doc/manual.xml      2023-01-03 17:36:27.000000000 +0100
@@ -24,7 +24,7 @@
 A finitely presented Lie algebra
 <A>K</A> can be constructed by <C><A>K</A> := <A>L</A>/<A>rels</A></C>, where 
<A>L</A> is a free Lie algebra
 and <A>rels</A> a list of elements of <A>L</A> that constitute the relations 
-that hold in <A>K</A>. Given a finitle presented Lie algebra we want to 
calculate 
+that hold in <A>K</A>. Given a finitely presented Lie algebra we want to 
calculate 
 a basis and a multiplication table of it. The interface to the &FPLSA;
 package comes with two related functions for doing that. 
 <P/>
@@ -78,7 +78,7 @@
 If the optional parameter <A>bound</A> is specified the computation will
 be carried out using monomials of degree at most <A>bound</A>. 
 If <A>bound</A> is not specified, then it will initially be set to
-10000. If this does not suffice to calculate a multiplication tabel
+10000. If this does not suffice to calculate a multiplication table
 of the algebra, then the bound will be increased until a multiplication
 table is found.
   
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/doc/title.xml 
new/FPLSA-1.2.6/doc/title.xml
--- old/FPLSA-1.2.5/doc/title.xml       2022-03-10 23:07:43.000000000 +0100
+++ new/FPLSA-1.2.6/doc/title.xml       2023-01-03 17:36:40.000000000 +0100
@@ -9,7 +9,7 @@
     Finitely Presented Lie Algebras
   </Subtitle>
   <Version>
-    1.2.5
+    1.2.6
   </Version>
   <Author>
     Vladimir Gerdt<Alt Only="LaTeX"><Br/></Alt>
@@ -24,6 +24,6 @@
 
   </Author>
   <Date>
-    10 March 2022
+    3 January 2023
   </Date>
   </TitlePage>
\ No newline at end of file
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/gap/fplsa.g new/FPLSA-1.2.6/gap/fplsa.g
--- old/FPLSA-1.2.5/gap/fplsa.g 2022-03-10 23:07:34.000000000 +0100
+++ new/FPLSA-1.2.6/gap/fplsa.g 2023-01-03 17:36:27.000000000 +0100
@@ -308,11 +308,11 @@
 ##  If the optional parameter <bound> is specified the computation will
 ##  be carried out using monomials of degree at most <bound>.
 ##  If <bound> is not specified, then it will initially be set to
-##  10000. If this does not suffice to calculate a multiplication tabel
+##  10000. If this does not suffice to calculate a multiplication table
 ##  of the algebra, then the bound will be increased until a multiplication
 ##  table is found.
 ##
-##  If the computation was succesful a structure constants algebra
+##  If the computation was successful a structure constants algebra
 ##  will be returned isomorphic to <K>. Otherwise `fail'
 ##  will be returned.
 ##
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/src/README new/FPLSA-1.2.6/src/README
--- old/FPLSA-1.2.5/src/README  2022-03-10 23:07:34.000000000 +0100
+++ new/FPLSA-1.2.6/src/README  2023-01-03 17:36:27.000000000 +0100
@@ -12,9 +12,9 @@
 fplsa4.gap - output in the form readable by GAP
 
 The directory for input files can be set in fplsa4.ini.
-By default, the input files have extention *.in, i.e.,
-if your file has such extention you can omit the extention
-at the program run. If your file has no extention, you
+By default, the input files have extension *.in, i.e.,
+if your file has such extension you can omit the extension
+at the program run. If your file has no extension, you
 must add the dot to its name.
 
 Normally input looks like this:
@@ -34,7 +34,7 @@
 any place (this comment you can use in fplsa4.ini also).
 You can omit any above item except of Generators, because
 without generators the task looses any sense.
-If you omit Weghts, the program sets all them = 1.
+If you omit Weights, the program sets all them = 1.
 If you omit Limiting weight, the program asks for it.
 If you omit relations, the program computes free algebra
 (infinite-dimensional in most cases).
@@ -47,8 +47,8 @@
 (parametric) polynomials the sign "^" is used before degree.
 You can use in input relations fractions as coefficients 
 (The program removes denominators  itself)   
-If you type the name of inexisting file, the program can
-constract it in the process of dialogue.BTW, to compute
+If you type the name of a nonexistent file, the program can
+construct it in the process of dialogue. BTW, to compute
 algebras with parameters remains still too dangerous,          !!!
 because work with them uses some rather complicated functions
 (such as multivariate polynomial GCD), which were not yet
@@ -77,7 +77,7 @@
 GNU - 32bit compiler if set on, otherwise 16bit. You have to keep
     it on all the time
 SPACE_STATISTICS - computes and prints the maximum space used.
-    This computation does not take too much time, so it can be on everytime.
+    This computation does not take too much time, so it can be on every time.
 INTEGER_ALLOCATION_CHECK - controls allocation of heap memory for big 
     integers. You have to set it on in the case of unclear program crash.
 POLY_ARRAY_ALLOCATION_CHECK - controls allocation in stack of working arrays
@@ -91,7 +91,7 @@
           program requests for name of file and limiting weight,
           so you have to set file name in command line and limiting
           weight in input file (or guess when to type them). 
-DEBUG, MEMORY, D_* - set on debugging and checking possible memory losts,
+DEBUG, MEMORY, D_* - set on debugging and checking possible memory lost,
     too difficult to explain how to use these abilities. They are useful
     rather for me. 
 LEFT_COMMENT, RIGHT_COMMENT, SUBSCRIPT_INPUT_SIGN, ODD_GENERATOR_INPUT_SIGN
@@ -104,7 +104,7 @@
     i.e., maximum name length should be 63.
 GAP_WIDTH - width of page in the *.gap file. Currently it is 79 to
     keep right margin visible.
-There are also other constants and macrodefinitions, but they are useful for 
+There are also other constants and macro definitions, but they are useful for 
 me only.
 Of course, you can organize the control of compilation via UNIX "make" file,
 but I don't know how to "make" such files. As to me, they only muddle
@@ -120,7 +120,7 @@
 Value can be either Boolean constant (Yes, No), or decimal number
 or text string.
 Determining text has essential initial part sufficient to separate
-alternatives. Within this part you have to remain everithing including
+alternatives. Within this part you have to remain everything including
 blanks as it is.
  
 Crude time: - The GNU C uses one 32bit word to count clock ticks.
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/FPLSA-1.2.5/src/fplsa4.c new/FPLSA-1.2.6/src/fplsa4.c
--- old/FPLSA-1.2.5/src/fplsa4.c        2022-03-10 23:07:34.000000000 +0100
+++ new/FPLSA-1.2.6/src/fplsa4.c        2023-01-03 17:36:27.000000000 +0100
@@ -35,7 +35,7 @@
 #define SPACE_STATISTICS  /* Space statistics ?? */
 //#define INTEGER_MAX_SIZE  /* Multiprecision number maximum size ?? */
 //#define INTEGER_ALLOCATION_CHECK  /* Control of integer allocations ?? */
-//#define POLY_ARRAY_ALLOCATION_CHECK /* Control of allocations of ?? 
plynomial arrays in stack */
+//#define POLY_ARRAY_ALLOCATION_CHECK /* Control of allocations of ?? 
polynomial arrays in stack */
 
 /* GAP output ?? */
 /* Avoid message file, session file,                              */
@@ -2195,14 +2195,14 @@
 }
 /*=ReduceRelations=====================================================
   Reduce the system of relations starting from Ith one. For further
-  differentiations returns lowest new positon (or starting one int).
+  differentiations returns lowest new position (or starting one int).
 */
 int ReduceRelations(int i)
 {
   int i_min, j, lordj, lordl, min_gen, lmoni, k, l, m;
   uint ai, aj;
   i_min = i;
-  do           /* While relations with new leading monomialsls arise */
+  do           /* While relations with new leading monomials arise */
     if(RELATION_TO_BE_SUBSTITUTED(i))
     {
 IN_REDUCE_RELATIONS  /*----------------------------------------------*/

Reply via email to