Merge branch 'master' into mh/no-spurious-output

Author: dimpase

.github/workflows/CI.yml

@@ -32,6 +32,8 @@ jobs:
         include:
           - gap-branch: master # add one test in 32bit mode -- nostly for packages with kernel extension
             ABI: 32
+          - gap-branch: master
+            runs-on: macos-latest
 
     steps:
       - uses: actions/checkout@v2

.release

@@ -0,0 +1,5 @@
+#!/bin/sh
+# This file is executed by the `release` script from
+# https://github.com/gap-system/ReleaseTools
+
+rm -rf src/leon/autom4te.cache

PackageInfo.g

@@ -283,13 +283,6 @@ SetPackageInfo( rec(
     end,
 
 
-##  Suggest here if the package should be *automatically loaded* when GAP is 
-##  started.  This should usually be 'false'. Say 'true' only if your package 
-##  provides some improvements of the GAP library which are likely to enhance 
-##  the overall system performance for many users.
-
-  Autoload := false,
-
 ##  *Optional*, but recommended: path relative to package root to a file which 
 ##  contains as many tests of the package functionality as sensible.
 TestFile := "tst/guava.tst",

autogen.sh

@@ -8,5 +8,5 @@ autoheader
 # WORKAROUND: invoke automake (even though we don't use it) to ensure
 # that `install-sh` gets added; this works around a bug in older
 # versions of GNU autotools.
-automake --force-missing --add-missing --copy || :
+automake --force-missing --add-missing --copy >/dev/null 2>&1  || :
 autoconf

init.g

@@ -6,24 +6,24 @@
 #A                                                                 Lea Ruscio
 #A                                                               David Joyner
 #A                                                                  CJ, Tjhai
-#A                                                                 Joe Fields 
+#A                                                                 Joe Fields
 ##
 
-ReadPackage("guava", "lib/util2.gd"); 
-ReadPackage("guava", "lib/codeword.gd");   
-ReadPackage("guava", "lib/codegen.gd"); 
+ReadPackage("guava", "lib/util2.gd");
+ReadPackage("guava", "lib/codeword.gd");
+ReadPackage("guava", "lib/codegen.gd");
 ReadPackage("guava", "lib/matrices.gd");
-ReadPackage("guava", "lib/codeman.gd"); 
-ReadPackage("guava", "lib/nordrob.gd"); 
-ReadPackage("guava", "lib/util.gd"); 
-ReadPackage("guava", "lib/curves.gd"); 
-ReadPackage("guava", "lib/codeops.gd"); 
-ReadPackage("guava", "lib/bounds.gd"); 
-ReadPackage("guava", "lib/codefun.gd"); 
-ReadPackage("guava", "lib/decoders.gd"); 
+ReadPackage("guava", "lib/codeman.gd");
+ReadPackage("guava", "lib/nordrob.gd");
+ReadPackage("guava", "lib/util.gd");
+ReadPackage("guava", "lib/curves.gd");
+ReadPackage("guava", "lib/codeops.gd");
+ReadPackage("guava", "lib/bounds.gd");
+ReadPackage("guava", "lib/codefun.gd");
+ReadPackage("guava", "lib/decoders.gd");
 ReadPackage("guava", "lib/codecr.gd");
 ReadPackage("guava", "lib/codecstr.gd");
 ReadPackage("guava", "lib/codemisc.gd");
 ReadPackage("guava", "lib/codenorm.gd");
-ReadPackage("guava", "lib/tblgener.gd"); 
-ReadPackage("guava", "lib/toric.gd"); 
+ReadPackage("guava", "lib/tblgener.gd");
+ReadPackage("guava", "lib/toric.gd");

lib/bounds.gd

@@ -14,51 +14,51 @@
 #F  LowerBoundGilbertVarshamov( <n>, <d>, <q> )  . . .Gilbert-Varshamov bound
 ##
 ## added 9-2004 by wdj
-DeclareOperation("LowerBoundGilbertVarshamov", [IsInt, IsInt, IsInt]); 
+DeclareOperation("LowerBoundGilbertVarshamov", [IsInt, IsInt, IsInt]);
 
 #############################################################################
 ##
 #F  LowerBoundSpherePacking( <n>, <r>, <q> )  . . . sphere packing lower bound
 ##                                                 for unrestricted codes
 ##
 ## added 11-2004 by wdj
-DeclareOperation("LowerBoundSpherePacking", [IsInt, IsInt, IsInt]); 
+DeclareOperation("LowerBoundSpherePacking", [IsInt, IsInt, IsInt]);
 
 #############################################################################
 ##
 #F  UpperBoundHamming( <n>, <d>, <q> )  . . . . . . . . . . . . Hamming bound
 ##
-DeclareOperation("UpperBoundHamming", [IsInt, IsInt, IsInt]); 
+DeclareOperation("UpperBoundHamming", [IsInt, IsInt, IsInt]);
 
 #############################################################################
 ##
 #F  UpperBoundSingleton( <n>, <d>, <q> )  . . . . . . . . . . Singleton bound
 ##
-DeclareOperation("UpperBoundSingleton", [IsInt, IsInt, IsInt]);  
+DeclareOperation("UpperBoundSingleton", [IsInt, IsInt, IsInt]);
 
 #############################################################################
 ##
 #F  UpperBoundPlotkin( <n>, <d>, <q> )  . . . . . . . . . . . . Plotkin bound
 ##
-DeclareOperation("UpperBoundPlotkin", [IsInt, IsInt, IsInt]); 
+DeclareOperation("UpperBoundPlotkin", [IsInt, IsInt, IsInt]);
 
 #############################################################################
 ##
 #F  UpperBoundGriesmer( <n>, <d>, <q> ) . . . . . . . . . . .  Griesmer bound
 ##
-DeclareOperation("UpperBoundGriesmer", [IsInt, IsInt, IsInt]);  
+DeclareOperation("UpperBoundGriesmer", [IsInt, IsInt, IsInt]);
 
 #############################################################################
 ##
 #F  UpperBoundElias( <n>, <d>, <q> )  . . . . . . . . . . . . . . Elias bound
 ##
-DeclareOperation("UpperBoundElias", [IsInt, IsInt, IsInt]); 
+DeclareOperation("UpperBoundElias", [IsInt, IsInt, IsInt]);
 
 #############################################################################
 ##
 #F  UpperBoundJohnson( <n>, <d> ) . . . . . . . . . . Johnson bound for <q>=2
 ##
-DeclareOperation("UpperBoundJohnson", [IsInt, IsInt]); 
+DeclareOperation("UpperBoundJohnson", [IsInt, IsInt]);
 
 #############################################################################
 ##
@@ -68,19 +68,19 @@ DeclareOperation("UpperBoundJohnson", [IsInt, IsInt]);
 ##  least d over an alphabet Q of size q, using the minimum of the Hamming,
 ##  Plotkin and Singleton bound.
 ##
-DeclareOperation("UpperBound", [IsInt, IsInt, IsInt]); 
+DeclareOperation("UpperBound", [IsInt, IsInt, IsInt]);
 
 #############################################################################
 ##
 #F  IsPerfectCode( <C> )  . . . . . .  determines whether C is a perfect code
 ##
-DeclareProperty("IsPerfectCode", IsCode); 
+DeclareProperty("IsPerfectCode", IsCode);
 
 #############################################################################
 ##
 #F  IsMDSCode( <C> )  . . .  checks if C is a Maximum Distance Separable Code
 ##
-DeclareProperty("IsMDSCode", IsCode); 
+DeclareProperty("IsMDSCode", IsCode);
 
 #############################################################################
 ##
@@ -91,7 +91,7 @@ DeclareProperty("IsMDSCode", IsCode);
 ##  function UpperBound is not allways equal to the actual upperbound A(n,d)
 ##  thus the result may not be equal to 0 for all optimal codes!
 ##
-DeclareOperation("OptimalityCode", [IsCode]); 
+DeclareOperation("OptimalityCode", [IsCode]);
 
 #############################################################################
 ##
@@ -100,13 +100,13 @@ DeclareOperation("OptimalityCode", [IsCode]);
 ##  OptimalityLinearCode(C) returns the difference between the smallest known
 ##  upperbound on the size of a linear code and the actual size.
 ##
-DeclareOperation("OptimalityLinearCode", [IsCode]); 
+DeclareOperation("OptimalityLinearCode", [IsCode]);
 
 #############################################################################
 ##
 #F  BoundsMinimumDistance( <n>, <k>, <F> )  . .  gets data from bounds tables
 ##
 ##  LowerBoundMinimumDistance uses (n, k, q, true)
-##  LowerBoundMinimumDistance uses (n, k, q, false) 
-DeclareGlobalFunction("BoundsMinimumDistance"); 
+##  LowerBoundMinimumDistance uses (n, k, q, false)
+DeclareGlobalFunction("BoundsMinimumDistance");