Update test output for compatibility with pluralisation changes in GAP

tst/standard/digraph.tst

@@ -563,12 +563,21 @@ gap> DigraphNrVertices(RandomDigraph(200, 0.854));
 200
 gap> IsMultiDigraph(RandomDigraph(1000));
 false
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> RandomDigraph(0);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `RandomDigraph' on 1 argument
+gap> RandomDigraph("a");
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `RandomDigraph' on 1 argument
+#@else
 gap> RandomDigraph(0);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `RandomDigraph' on 1 arguments
 gap> RandomDigraph("a");
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `RandomDigraph' on 1 arguments
+#@fi
 gap> RandomDigraph(4, 0);
 <immutable empty digraph with 4 vertices>
 gap> RandomDigraph(10, 1.01);
@@ -631,9 +640,15 @@ gap> DigraphNrVertices(gr);
 100
 gap> DigraphNrEdges(gr);
 1000
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> RandomMultiDigraph(0);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `RandomMultiDigraph' on 1 argument
+#@else
 gap> RandomMultiDigraph(0);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `RandomMultiDigraph' on 1 arguments
+#@fi
 gap> RandomMultiDigraph(0, 1);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `RandomMultiDigraph' on 2 arguments
@@ -655,9 +670,15 @@ gap> RandomTournament(IsMutableDigraph, 10);
 gap> RandomLattice(25);;
 gap> RandomLattice(1);
 <immutable digraph with 1 vertex, 1 edge>
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> RandomLattice(-1);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `RandomLattice' on 1 argument
+#@else
 gap> RandomLattice(-1);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `RandomLattice' on 1 arguments
+#@fi
 
 # The list of random lattice Digraph6Strings D was generated by running:
 # D := List([1 .. 100], x -> Digraph6String(RandomLattice(7)));

tst/standard/examples.tst

@@ -86,9 +86,15 @@ gap> EmptyDigraph(IsMutableDigraph, -1);
 Error, the argument <n> must be a non-negative integer,
 
 #  CycleDigraph
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> gr := CycleDigraph(0);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `CycleDigraph' on 1 argument
+#@else
 gap> gr := CycleDigraph(0);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `CycleDigraph' on 1 arguments
+#@fi
 gap> gr := CycleDigraph(1);
 <immutable digraph with 1 vertex, 1 edge>
 gap> AutomorphismGroup(gr) = Group(());
@@ -106,9 +112,15 @@ gap> gr = DigraphCycle(IsImmutableDigraph, 6);
 true
 
 #  ChainDigraph
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> gr := ChainDigraph(0);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `ChainDigraph' on 1 argument
+#@else
 gap> gr := ChainDigraph(0);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `ChainDigraph' on 1 arguments
+#@fi
 gap> gr := ChainDigraph(1);
 <immutable empty digraph with 1 vertex>
 gap> IsEmptyDigraph(gr);
@@ -490,9 +502,15 @@ gap> D := AndrasfaiGraph(3);
 vertices, 24 edges>
 gap> IsIsomorphicDigraph(D, MobiusLadderGraph(4));
 true
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> AndrasfaiGraph(0);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `AndrasfaiGraph' on 1 argument
+#@else
 gap> AndrasfaiGraph(0);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `AndrasfaiGraph' on 1 arguments
+#@fi
 
 # BinomialTreeGraph
 gap> D := BinomialTreeGraph(6);
@@ -507,9 +525,15 @@ gap> DigraphEdges(D);
   [ 15, 13 ], [ 15, 16 ], [ 16, 15 ] ]
 gap> BinomialTreeGraph(1);
 <immutable empty digraph with 1 vertex>
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> BinomialTreeGraph(0);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `BinomialTreeGraph' on 1 argument
+#@else
 gap> BinomialTreeGraph(0);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `BinomialTreeGraph' on 1 arguments
+#@fi
 
 # BondyGraph
 gap> D := BondyGraph(2);
@@ -571,9 +595,15 @@ gap> D := HalvedCubeGraph(3);
 <immutable Hamiltonian symmetric digraph with 4 vertices, 12 edges>
 gap> IsIsomorphicDigraph(D, CompleteDigraph(4));
 true
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> HalvedCubeGraph(-1);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `HalvedCubeGraph' on 1 argument
+#@else
 gap> HalvedCubeGraph(-1);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `HalvedCubeGraph' on 1 arguments
+#@fi
 
 # HanoiGraph
 gap> D := HanoiGraph(1);
@@ -588,9 +618,15 @@ gap> IsHamiltonianDigraph(gr);
 true
 gap> IsPlanarDigraph(DigraphMutableCopy(gr));
 true
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> HanoiGraph(0);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `HanoiGraph' on 1 argument
+#@else
 gap> HanoiGraph(0);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `HanoiGraph' on 1 arguments
+#@fi
 
 # HelmGraph
 gap> D := HelmGraph(6);
@@ -660,9 +696,15 @@ gap> D := LindgrenSousselierGraph(1);
 <immutable symmetric digraph with 10 vertices, 30 edges>
 gap> AutomorphismGroup(D) = Group([(4, 8)(5, 7)(9, 10), (2, 10, 9)(3, 4, 5, 6, 7, 8), (1, 2, 3, 4, 10)(5, 7, 9, 6, 8)]);
 true
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> LindgrenSousselierGraph(0);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `LindgrenSousselierGraph' on 1 argument
+#@else
 gap> LindgrenSousselierGraph(0);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `LindgrenSousselierGraph' on 1 arguments
+#@fi
 gap> LindgrenSousselierGraph(3);
 <immutable symmetric digraph with 22 vertices, 70 edges>
 gap> IsIsomorphicDigraph(LindgrenSousselierGraph(1), GeneralisedPetersenGraph(5, 2));
@@ -705,9 +747,15 @@ gap> IsIsomorphicDigraph(D, DigraphSymmetricClosure(ChainDigraph(4)));
 true
 gap> PathGraph(1);
 <immutable empty digraph with 1 vertex>
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> PathGraph(0);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `PathGraph' on 1 argument
+#@else
 gap> PathGraph(0);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `PathGraph' on 1 arguments
+#@fi
 
 # PermutationStarGraph
 gap> D := PermutationStarGraph(3, 2);
@@ -771,9 +819,15 @@ gap> D := WalshHadamardGraph(2);
 <immutable symmetric digraph with 8 vertices, 16 edges>
 gap> IsIsomorphicDigraph(D, CycleGraph(8));
 true
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> WalshHadamardGraph(0);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `WalshHadamardGraph' on 1 argument
+#@else
 gap> WalshHadamardGraph(0);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `WalshHadamardGraph' on 1 arguments
+#@fi
 
 # WebGraph
 gap> D := WebGraph(3);

tst/standard/io.tst

@@ -460,9 +460,15 @@ gap> gr := TCodeDecoder("12 3 0 10 6 2 8 8");
 <immutable digraph with 12 vertices, 3 edges>
 gap> OutNeighbours(gr);
 [ [ 11 ], [  ], [  ], [  ], [  ], [  ], [ 3 ], [  ], [ 9 ], [  ], [  ], [  ] ]
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> gr := TCodeDecoder(3);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `TCodeDecoder' on 1 argument
+#@else
 gap> gr := TCodeDecoder(3);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `TCodeDecoder' on 1 arguments
+#@fi
 gap> gr := TCodeDecoder("gr 5");
 Error, the 2nd argument <s> must be a string of space-separated non-negative i\
 ntegers,

tst/standard/oper.tst

@@ -2872,9 +2872,15 @@ gap> IsOrderFilter(D, [1, 4]);
 false
 gap> IsOrderFilter(D, [4]);
 false
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> IsOrderFilter(4);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 1st choice method found for `IsOrderFilter' on 1 argument
+#@else
 gap> IsOrderFilter(4);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `IsOrderFilter' on 1 arguments
+#@fi
 gap> IsOrderFilter(D, 4);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 1st choice method found for `IsOrderFilter' on 2 arguments

tst/standard/weights.tst

@@ -252,10 +252,17 @@ gap> EdgeWeightedDigraphShortestPath(d, 1, 2);
 # Shortest paths: negative cycle
 gap> d := EdgeWeightedDigraph([[2], [3], [1]], [[-3], [-5], [-7]]);
 <immutable digraph with 3 vertices, 3 edges>
+#@if CompareVersionNumbers(ReplacedString(GAPInfo.Version, "dev", ""), "4.16")
+gap> EdgeWeightedDigraphShortestPaths(d);
+Error, no method found! For debugging hints type ?Recovery from NoMethodFound
+Error, no 2nd choice method found for `EdgeWeightedDigraphShortestPaths' on 1 \
+argument
+#@else
 gap> EdgeWeightedDigraphShortestPaths(d);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound
 Error, no 2nd choice method found for `EdgeWeightedDigraphShortestPaths' on 1 \
 arguments
+#@fi
 
 # Shortest paths: source not in graph neg int
 gap> EdgeWeightedDigraphShortestPaths(d, -1);
@@ -405,4 +412,4 @@ gap> Unbind(tree);
 
 #
 gap> DIGRAPHS_StopTest();
-gap> STOP_TEST("Digraphs package: standard/weights.tst", 0);
+gap> STOP_TEST("Digraphs package: standard/weights.tst", 0);