tests: fix failing McAlister triples tests

semigroups · Jun 5, 2017 · 416b709 · 416b709
1 parent ec00c41
commit 416b709
Show file tree

Hide file tree

Showing 2 changed files with 10 additions and 10 deletions.
diff --git a/tst/extreme/semieunit.tst b/tst/extreme/semieunit.tst
@@ -1,13 +1,13 @@
 #############################################################################
 ##
-#W  extreme/eunittest.tst
+#W  extreme/semieunit.tst
 #Y  Copyright (C) 2016                                    Christopher Russell 
 ##
 ##  Licensing information can be found in the README file of this package.
 ##
 #############################################################################
 ##
-gap> START_TEST("Semigroups package: standard/congrees.tst");
+gap> START_TEST("Semigroups package: standard/semieunit.tst");
 gap> LoadPackage("semigroups", false);;
 gap> LoadPackage("Digraphs", false);;
 gap> LoadPackage("smallsemi", false);;
@@ -22,7 +22,7 @@ gap> inv_semigroups := AllSmallSemigroups([2 .. 7], IsInverseSemigroup, true);;
 gap> e_unitary_semigroups := Filtered(inv_semigroups, IsEUnitaryInverseSemigroup);;
 gap> triples := ShallowCopy(e_unitary_semigroups);;
 gap> Apply(triples, a -> AsSemigroup(IsPartialPermSemigroup, a));;
-gap> Apply(triples, a -> McAlisterTriple(a));;
+gap> Apply(triples, a -> IsomorphismMcAlisterTriple(a));;
 gap> BruteForceIsoCheck := function(iso)
 >   local x, y;
 >   if not IsInjective(iso) or not IsSurjective(iso) then

diff --git a/tst/standard/semieunit.tst b/tst/standard/semieunit.tst
@@ -1,13 +1,13 @@
 #############################################################################
 ##
-#W  standard/eunittest.tst
+#W  standard/semieunit.tst
 #Y  Copyright (C) 2016                                    Christopher Russell
 ##
 ##  Licensing information can be found in the README file of this package.
 ##
 #############################################################################
 ##
-gap> START_TEST("Semigroups package: standard/congrees.tst");
+gap> START_TEST("Semigroups package: standard/semieunit.tst");
 gap> LoadPackage("semigroups", false);;
 gap> LoadPackage("Digraphs", false);;
 
@@ -82,32 +82,32 @@ Condition M4 not satisfied - see documentation for details,
 # Test creating a McAlister triple from a partial perm semigroup
 gap> ps := InverseSemigroup([PartialPerm([2, 3, 4, 5], [1, 3, 5, 4]),
 > PartialPerm([2, 3, 4, 5], [1, 4, 5, 3])]);;
-gap> Mps := McAlisterTriple(ps);;
+gap> Mps := IsomorphismMcAlisterTriple(ps);;
 gap> Image(Mps);
 [ (1, ()), (1, (2,3)), (1, (1,2)), (1, (1,2,3)), (1, (1,3,2)), (1, (1,3)), 
   (2, ()), (2, (2,3)), (2, (1,2,3)), (2, (1,3)), (3, ()), (3, (2,3)), 
   (3, (1,2)), (3, (1,3,2)) ]
-gap> Range(Mps);
+gap> AsMcAlisterTriple(ps);
 <McAlister triple over Group([ (2,3), (1,2,3), (2,3), (1,3,2) ])>
 gap> ps := InverseSemigroup([PartialPerm([1, 4, 6, 7], [1, 4, 6, 7]),
 >   PartialPerm([2, 3, 6, 7], [2, 3, 6, 7]), PartialPerm([6, 7], [6, 7]),
 >   PartialPerm([2, 3, 5, 6, 7], [2, 3, 5, 6, 7]),
 >   PartialPerm([1, 4, 6, 7], [2, 3, 7, 6]),
 >   PartialPerm([2, 3, 6, 7], [1, 4, 7, 6]), PartialPerm([6, 7], [7, 6])]);;
-gap> Mps := McAlisterTriple(ps);;
+gap> Mps := IsomorphismMcAlisterTriple(ps);;
 gap> Image(Mps);
 [ (1, ()), (1, (1,2)), (2, ()), (3, ()), (3, (1,2)), (5, ()), (5, (1,2)) ]
 gap> Elements(Range(Mps));
 [ (1, ()), (1, (1,2)), (2, ()), (3, ()), (3, (1,2)), (5, ()), (5, (1,2)) ]
 gap> IsWholeFamily(Image(Mps));
 true
-gap> Range(Mps);
+gap> AsMcAlisterTriple(ps);
 <McAlister triple over Group([ (), (), (), (1,2), (1,2), (1,2) ])>
 
 # Test McAlisterTriple with bad input
 gap> T := Semigroup([PartialPerm([1], [3]),
 > PartialPerm([1, 2, 3], [2, 3, 1]), PartialPerm([1, 3], [2, 3])]);;
-gap> McAlisterTriple(T);
+gap> AsMcAlisterTriple(T);
 Error, Semigroups: McAlisterTriple: 
 semigroup is not E-unitary,