Update test output for compatibility with pluralization and formatting changes in GAP

Author: wilfwilson

tst/standard/attributes/translat.tst

@@ -69,9 +69,15 @@ gap> Size(GeneratorsOfSemigroup(H));
 9
 
 # Monogenic semigroups
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> S := MonogenicSemigroup(6, 3);
+<commutative non-regular transformation semigroup of size 8, degree 9 with 
+ 1 generator>
+#@else
 gap> S := MonogenicSemigroup(6, 3);
 <commutative non-regular transformation semigroup of size 8, degree 9 with 1 
  generator>
+#@fi
 gap> L := LeftTranslations(S);
 <the semigroup of left translations of <commutative non-regular 
  transformation semigroup of size 8, degree 9 with 1 generator>>
@@ -126,9 +132,15 @@ gap> L := LeftTranslations(S);
 <the semigroup of left translations of <regular semigroup with 4 generators>>
 gap> Size(L);
 81
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> R := RightTranslations(S);
+<the semigroup of right translations of <0-simple regular semigroup with 
+ 4 generators>>
+#@else
 gap> R := RightTranslations(S);
 <the semigroup of right translations of <0-simple regular semigroup with 4 
  generators>>
+#@fi
 gap> Size(R);
 81
 gap> S := ReesZeroMatrixSemigroup(G, mat);;

tst/standard/elements/bipart.tst

@@ -497,9 +497,15 @@ gap> BipartitionByIntRep([1, 2, 3]);
 Error, the degree of a bipartition must be even, found 3
 
 # bipartition: BipartitionByIntRep 2/5
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> BipartitionByIntRep([1, 2, 3, "a"]);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `BipartitionByIntRep' on 1 argument
+#@else
 gap> BipartitionByIntRep([1, 2, 3, "a"]);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `BipartitionByIntRep' on 1 arguments
+#@fi
 
 # bipartition: BipartitionByIntRep 3/5
 gap> BipartitionByIntRep([1, 2, 3, 5]);

tst/standard/elements/maxplusmat.tst

@@ -454,9 +454,15 @@ false
 # maxplusmat: RadialEigenvector for a max-plus matrix with SpectralRadius = 0
 gap> RadialEigenvector(Matrix(IsMaxPlusMatrix, [[0, -3], [-2, -10]]));
 [ 0, -2 ]
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> RadialEigenvector(Matrix(IsMaxPlusMatrix, [[3, -3], [-2, -10]]));
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 2nd choice method found for `RadialEigenvector' on 1 argument
+#@else
 gap> RadialEigenvector(Matrix(IsMaxPlusMatrix, [[3, -3], [-2, -10]]));
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 2nd choice method found for `RadialEigenvector' on 1 arguments
+#@fi
 gap> SpectralRadius(Matrix(IsMaxPlusMatrix, [[0, -3], [-2, -10]]));
 0
 

tst/standard/elements/pbr.tst

@@ -56,9 +56,15 @@ gap> DegreeOfPBRCollection([x]);
 2
 gap> DegreeOfPBRCollection([y]);
 3
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> DegreeOfPBRCollection([x, y]);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `DegreeOfPBRCollection' on 1 argument
+#@else
 gap> DegreeOfPBRCollection([x, y]);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `DegreeOfPBRCollection' on 1 arguments
+#@fi
 gap> coll := [x, y];;
 gap> IsPBRCollection(coll);
 false
@@ -317,27 +323,45 @@ gap> Inverse(x);
 fail
 
 # pbr, EmptyPBR, 1
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> EmptyPBR(0);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `EmptyPBR' on 1 argument
+#@else
 gap> EmptyPBR(0);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `EmptyPBR' on 1 arguments
+#@fi
 gap> EmptyPBR(1);
 PBR([ [  ] ], [ [  ] ])
 gap> EmptyPBR(2);
 PBR([ [  ], [  ] ], [ [  ], [  ] ])
 
 # pbr, IdentityPBR, 1
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> IdentityPBR(0);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `IdentityPBR' on 1 argument
+#@else
 gap> IdentityPBR(0);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `IdentityPBR' on 1 arguments
+#@fi
 gap> IdentityPBR(1);
 PBR([ [ -1 ] ], [ [ 1 ] ])
 gap> IdentityPBR(2);
 PBR([ [ -1 ], [ -2 ] ], [ [ 1 ], [ 2 ] ])
 
 # pbr, UniversalPBR, 1
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> UniversalPBR(0);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `UniversalPBR' on 1 argument
+#@else
 gap> UniversalPBR(0);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `UniversalPBR' on 1 arguments
+#@fi
 gap> UniversalPBR(1);
 PBR([ [ -1, 1 ] ], [ [ -1, 1 ] ])
 gap> UniversalPBR(2);

tst/standard/ideals/ideals.tst

@@ -246,9 +246,15 @@ gap> x := Transformation([13, 4, 1, 2, 14, 14, 7, 12, 4, 9, 2, 14, 5, 14, 13,
 > 18, 15, 8, 18, 9]);;
 gap> y := Transformation([13, 15, 7, 18, 4, 2, 8, 12, 10, 7, 8, 11, 12, 12, 17,
 > 6, 13, 9, 16, 13]);;
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> T := DirectProduct(Semigroup(x), Semigroup(y));
+<commutative transformation semigroup of size 45, degree 40 with 
+ 13 generators>
+#@else
 gap> T := DirectProduct(Semigroup(x), Semigroup(y));
 <commutative transformation semigroup of size 45, degree 40 with 13 
  generators>
+#@fi
 gap> z := Transformation([14, 2, 14, 4, 14, 14, 7, 14, 2, 4, 4, 14, 14, 14, 14,
 > 14, 14, 14, 14, 4, 32, 31, 28, 28, 31, 32, 32, 31, 31, 28, 32, 28, 31, 31, 28,
 > 28, 32, 32, 31, 32]);;

tst/standard/libsemigroups/froidure-pin.tst

@@ -445,9 +445,15 @@ gap> S := Semigroup(Matrix(IsMaxPlusMatrix,
 <commutative semigroup of 3x3 max-plus matrices with 1 generator>
 gap> Enumerate(S, 8194);
 <commutative semigroup of 3x3 max-plus matrices with 1 generator>
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> en := Enumerator(S);
+<enumerator of <commutative semigroup of 3x3 max-plus matrices with 
+ 1 generator>>
+#@else
 gap> en := Enumerator(S);
 <enumerator of <commutative semigroup of 3x3 max-plus matrices with 1 
  generator>>
+#@fi
 gap> en[100];
 Matrix(IsMaxPlusMatrix, [[388, 394, 386], [394, 400, 392], [390, 396, 388]])
 gap> PositionCanonical(S, en[100]);
@@ -585,9 +591,15 @@ true
 gap> S := Semigroup(Matrix(IsMaxPlusMatrix,
 > [[1, -infinity, 2], [-2, 4, -infinity], [1, 0, 3]]));
 <commutative semigroup of 3x3 max-plus matrices with 1 generator>
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> N := EnumeratorCanonical(S); 
+<enumerator of <commutative semigroup of 3x3 max-plus matrices with 
+ 1 generator>>
+#@else
 gap> N := EnumeratorCanonical(S); 
 <enumerator of <commutative semigroup of 3x3 max-plus matrices with 1 
  generator>>
+#@fi
 gap> ForAll([1 .. 1000], x -> Position(N, N[x]) = x);
 true
 gap> ForAll([1 .. 1000], x -> N[x] in N);

tst/standard/semigroups/grpperm.tst

@@ -395,9 +395,15 @@ gap> Range(map);
 Group([ (1,3)(2,5)(4,6), (1,4,5)(2,6,3) ])
 
 # IsomorphismPermGroup, infinite 1 / 1
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> IsomorphismPermGroup(FreeMonoid(3));
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 2nd choice method found for `IsomorphismPermGroup' on 1 argument
+#@else
 gap> IsomorphismPermGroup(FreeMonoid(3));
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 2nd choice method found for `IsomorphismPermGroup' on 1 arguments
+#@fi
 
 # IsomorphismPermGroup, for a block bijection semigroup
 gap> S := Semigroup(Bipartition([[1, 2, -3, -4], [3, 4, -1, -2]]));;

tst/standard/semigroups/semifp.tst

@@ -69,9 +69,15 @@ gap> IsomorphismFpMonoid(FreeMonoid(2));
 <fp monoid with 2 generators and 0 relations of length 2>
 
 # Test IsomorphismFpSemigroup, infinite
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> IsomorphismFpSemigroup(FreeInverseSemigroup(2));
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 3rd choice method found for `IsomorphismFpSemigroup' on 1 argument
+#@else
 gap> IsomorphismFpSemigroup(FreeInverseSemigroup(2));
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 3rd choice method found for `IsomorphismFpSemigroup' on 1 arguments
+#@fi
 
 # BruteForceIsoCheck helper functions
 gap> BruteForceIsoCheck := function(iso)

tst/standard/semigroups/semipperm.tst

@@ -2006,9 +2006,15 @@ true
 #  semipperm: IsomorphismPartialPermSemigroup, for a zero group, 3
 gap> S := Range(InjectionZeroMagma(SL(2, 2)));
 <SL(2,2) with 0 adjoined>
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> map := IsomorphismPartialPermSemigroup(S);
+<SL(2,2) with 0 adjoined> -> <inverse partial perm monoid of rank 3 with 
+  3 generators>
+#@else
 gap> map := IsomorphismPartialPermSemigroup(S);
 <SL(2,2) with 0 adjoined> -> <inverse partial perm monoid of rank 3 with 3 
   generators>
+#@fi
 gap> Range(map);
 <inverse partial perm monoid of rank 3 with 3 generators>
 gap> BruteForceIsoCheck(map);
@@ -2138,11 +2144,19 @@ gap> DigraphOfActionOnPoints(S, 3);
 # SmallerDegreePartialPermRepresentation for a non-partial perm semigroup
 gap> S := UniformBlockBijectionMonoid(4);
 <inverse block bijection monoid of degree 4 with 3 generators>
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> map := SmallerDegreePartialPermRepresentation(S);
+CompositionMapping( <inverse partial perm monoid of size 131, rank 131 with 
+  3 generators> -> <inverse partial perm monoid of rank 10 with 3 generators>,
+<inverse block bijection monoid of size 131, degree 4 with 3 generators> -> 
+<inverse partial perm monoid of size 131, rank 131 with 3 generators> )
+#@else
 gap> map := SmallerDegreePartialPermRepresentation(S);
 CompositionMapping( <inverse partial perm monoid of size 131, rank 131 with 3 
   generators> -> <inverse partial perm monoid of rank 10 with 3 generators>, 
 <inverse block bijection monoid of size 131, degree 4 with 3 generators> -> 
 <inverse partial perm monoid of size 131, rank 131 with 3 generators> )
+#@fi
 gap> S.1 ^ map in Range(map);
 true
 
@@ -2154,11 +2168,19 @@ gap> C := SemigroupCongruence(S,
 >  Bipartition([[1, -1], [2, -2], [3, -3], [4, -4]])]);
 <2-sided semigroup congruence over <inverse block bijection monoid 
  of size 339, degree 4 with 3 generators> with 1 generating pairs>
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> map := SmallerDegreePartialPermRepresentation(Source(C));
+CompositionMapping( <inverse partial perm monoid of size 339, rank 339 with 
+  3 generators> -> <inverse partial perm monoid of rank 14 with 3 generators>,
+<inverse block bijection monoid of size 339, degree 4 with 3 generators> -> 
+<inverse partial perm monoid of size 339, rank 339 with 3 generators> )
+#@else
 gap> map := SmallerDegreePartialPermRepresentation(Source(C));
 CompositionMapping( <inverse partial perm monoid of size 339, rank 339 with 3 
   generators> -> <inverse partial perm monoid of rank 14 with 3 generators>, 
 <inverse block bijection monoid of size 339, degree 4 with 3 generators> -> 
 <inverse partial perm monoid of size 339, rank 339 with 3 generators> )
+#@fi
 gap> List(GeneratingPairsOfSemigroupCongruence(C), x -> OnTuples(x, map));
 [ [ <empty partial perm>, 
       <identity partial perm on 

tst/standard/semigroups/semirms.tst

@@ -2910,9 +2910,15 @@ gap> S := Monoid([
 >  Transformation([2, 3, 3, 1]), Transformation([3, 2, 3, 1]),
 >  Transformation([3, 3, 1, 2]), Transformation([3, 4, 1, 1]),
 >  Transformation([4, 1, 2, 2]), Transformation([4, 2, 3, 3])]);;
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> R := ReesMatrixSemigroup(S, [[IdentityTransformation]]);
+<Rees matrix semigroup 1x1 over <transformation monoid of degree 4 with 
+  8 generators>>
+#@else
 gap> R := ReesMatrixSemigroup(S, [[IdentityTransformation]]);
 <Rees matrix semigroup 1x1 over <transformation monoid of degree 4 with 8 
   generators>>
+#@fi
 gap> IsIdempotentGenerated(R);
 true