~use latest fitfree.gd

lib/fitfree.gd

@@ -12,7 +12,7 @@
 ##
 
 BindGlobal("OVERRIDENICE",Maximum(NICE_FLAGS,
-	       RankFilter(IsMatrixGroup and IsFinite)));
+               RankFilter(IsMatrixGroup and IsFinite)));
 
 #############################################################################
 ##
@@ -35,7 +35,7 @@ DeclareInfoClass("InfoFitFree");
 ##  can be used for a group, that is whether a method for
 ##  <Ref Func="FittingFreeLiftSetup"/> is available for <A>grp</A>.
 ##  Note that this filter may change its value from <K>false</K> to
-##  <K>true</K>. 
+##  <K>true</K>.
 ##  </Description>
 ##  </ManSection>
 ##  <#/GAPDoc>
@@ -91,7 +91,7 @@ DeclareGlobalFunction("AttemptPermRadicalMethod");
 ##  the image group being
 ##  represented in a way that decomposition into generators will work
 ##  efficiently. In particular, it is possible to use
-##  <Ref Func="PreImagesRepresentativeNC"/> to take the pre-image of elements
+##  <Ref Func="PreImagesRepresentative"/> to take the pre-image of elements
 ##  in the image. For a subgroup <M>U\le G</M>, it is possible to apply
 ##  <Ref Func="RestrictedMapping"> to the homomorphism to obtain a
 ##  corresponding homomorphism for <M>U</M>.
@@ -125,7 +125,7 @@ InstallTrueMethod(CanComputeFittingFree,HasFittingFreeLiftSetup);
 ##  components:
 ##  <C>parentffs</C> The record returned by
 ##  <Ref Func="FittingFreeLiftSetup"> for <G>.
-##  <C>rest</C> A restriction of 
+##  <C>rest</C> A restriction of
 ##  the <C>factorhom</C> for <A>G</A> to <A>U</A>, defined on generators of
 ##  <A>U</A>.
 ##  <C>ker</C> The kernel of this map.
@@ -141,6 +141,7 @@ InstallTrueMethod(CanComputeFittingFree,HasFittingFreeLiftSetup);
 ##  </ManSection>
 ##  <#/GAPDoc>
 DeclareGlobalFunction("FittingFreeSubgroupSetup");
+DeclareOperation("DoFFSS",[IsGroup,IsGroup]);
 
 # This attribute is used for groups treated by constructive recognition and
 # a composition tree. It is declared in the library such that the function
@@ -172,7 +173,7 @@ DeclareGlobalFunction("SubgroupByFittingFreeData");
 # Utility function: function(pcgs,gens,ignoredepths)
 # for forming an induced modulo pcgs after correction on the lowest level
 # We will be in the situation that an IGS has been corrected only on the
-# lowest level, i.e. the inly obstacle to being an IGS is on the lowest
+# lowest level, i.e. the only obstacle to being an IGS is on the lowest
 # level. Thus the situation is that of a vector space and we do not need to
 # consider commutators and powers, but simply do a Gaussian elimination.
 DeclareGlobalFunction("TFMakeInducedPcgsModulo");
@@ -214,7 +215,7 @@ DeclareGlobalFunction("FittingFreeElementarySeries");
 ##  <Attr Name="DirectFactorsFittingFreeSocle" Arg='G'/>
 ##
 ##  <Description>
-##  for a finite fitting-free group <A>G</A>, this function retuns a list of
+##  for a finite fitting-free group <A>G</A>, this function returns a list of
 ##  the direct factors of the socle of <A>G</A>. If <A>G</A> is not
 ##  fitting-free then <K>fail</K> is returned.
 ##  </Description>