Fixing typos

CHANGES.md

@@ -1182,7 +1182,7 @@ This is the first public release of GAP 4.9.
     compare the timing for `Sort([1..100000000] * 0)`. As a side
     effect, the result of sorting lists with equal entries may produce
     different answers compared to previous GAP versions. If you would
-    like to make your code independant of the exact employed sorting
+    like to make your code independent of the exact employed sorting
     algorithm, you can use the newly added `StableSort`, `StableSortBy`
     and `StableSortParallel`. (For some technical details, see
     [#609](https://github.com/gap-system/gap/pull/609)).
@@ -3033,7 +3033,7 @@ GAP 4.6.5 release:
     being called on a homomorphism whose image is not a permutation
     group. (Reported by Sebastian Gutsche)
 
-  - Fixed a bug in `ExponentsConjugateLayer` which occured, for
+  - Fixed a bug in `ExponentsConjugateLayer` which occurred, for
     example, in some calls of `SubgroupsSolvableGroup` (Reported
     by Ramon Esteban-Romero)
 

CONTRIBUTING.md

@@ -172,7 +172,7 @@ Please be careful to criticize constructively and not use dismissive language
 
 This section is based on <https://lornajane.net/posts/2015/code-reviews-before-you-even-run-the-code>.
 
-* Is it clear what feature / fix the contribution adresses?
+* Is it clear what feature / fix the contribution addresses?
 * If based on an issue, does it relate to exactly one issue?
 * Do the commit messages look good? Should some commits be squashed / broken up?
 * Does the list of changed files look sensible?

benchmark/transgrp/examine4

@@ -583,7 +583,7 @@ local m,z,k,i,j,l,s,e,ergs,sys,g,pool,lev,dran;
   else
     i:=lev;
   fi;
-  # search for the first occurence of a transitivable descendant
+  # search for the first occurrence of a transitivable descendant
   repeat
     l:=List(Concatenation(List([1..Length(z)+i-1],
          i->OrderedPartitions(i,Length(z)-1))),i->ShallowCopy(i-1));

bin/BuildPackages.sh

@@ -273,7 +273,7 @@ do
   # cut off the ending slash (if exists)
   PKG="${PKG%/}"
   # cut off everything before the first slash to only keep the package name
-  # (these two commands are mainly to accomodate the logs better,
+  # (these two commands are mainly to accommodate the logs better,
   # as they make no difference with changing directories)
   PKG="${PKG##*/}"
   if [[ -e "$CURDIR/$PKG/PackageInfo.g" ]]

dev/NameSpaces.tex

@@ -106,7 +106,7 @@ \subsection{In Packages}
 
 When packages files are read, that namespace should be open for
 Creation and Access, so that all variables created in a package,
-unless either they are refered to as \verb|GLOBAL$|\textit{name}, or
+unless either they are referred to as \verb|GLOBAL$|\textit{name}, or
 the package calls the namespace management functions to open some
 other namespace for creation. The package may define further private
 namespaces just like library code can. Packages can refer to variables

dev/modules.txt

@@ -50,7 +50,7 @@ To sum up everything:
 Name: 	   Modules	  	    Components		    Packages
 
 Idea/	   Software                 Optional loading        Authorship,
-Concept:   engineering		       			    Maintainance
+Concept:   engineering		       			    Maintenance
 
 Aims,      ``independent''          system will work        Refereeing,
 Require-     evolution,              without them,          ``fame and blame'',

doc/dev/main.xml

@@ -32,7 +32,7 @@ Other sections document certain conventions which are followed by the
 active members of The ⪆ Group. Some examples: there are several
 mailing lists which are used for different purposes; there is a mechanism
 how larger changes to the ⪆ system should be announced and discussed
-among the developers before they are commited, called <E>proposals</E>;
+among the developers before they are committed, called <E>proposals</E>;
 there is a concept of <E>modules</E> where  parts of the
 &GAP; system are assigned to specified maintainers.
 </Abstract>

etc/ci-gather-coverage.sh

@@ -4,7 +4,7 @@
 
 # This is currently only used for Travis CI integration, see .travis.yml
 # for details.
-# This is in a seperate script, because we always want to run it even if
+# This is in a separate script, because we always want to run it even if
 # the test script fails
 
 set -ex

etc/ci.sh

@@ -70,7 +70,7 @@ do
         cat "log/fail.log"
         exit 1
     else
-        echo "All packages were built succesfully"
+        echo "All packages were built successfully"
 
         #
         # Now that we built packages, we try to load them.

grp/perf0.grp

@@ -107,7 +107,7 @@
 ##  
 ##   l[3] (hpNumber)
 ##      is either a class
-##      number k or a list [k,i,j] or [k,i,j,k2,...,kn]. The tripel [k,i,j]
+##      number k or a list [k,i,j] or [k,i,j,k2,...,kn]. The triple [k,i,j]
 ##      means that the respective group  is listed in the k-th class of the
 ##      Holt-Plesken book under the number (i,j).  If the group also occurs
 ##      in some  additional  classes,  then  their  numbers  are  given  as

hpcgap/demo/Echelon.g

@@ -27,7 +27,7 @@
 ##  t1:=CurrentTime();res1:=TrigonalizeByThreads(m,4,5,40);;t2:=CurrentTime();
 ##  
 
-# (very?) temporary helper, until RecieveAnyChannel is available
+# (very?) temporary helper, until ReceiveAnyChannel is available
 # 
 # this version is bad, it eats up CPU cycles and doesn't provide a good
 # load balancing

hpcgap/demo/karatsuba.g

@@ -139,7 +139,7 @@ KaratsubaPolynomialMultiplicationExtRep:=function( f, g )
 local degf, degg, deg, n, halfn, nr, f1, f0, g1, g0, u, v, w, wuv, k, pos, pos1, val;
 # Zero polynomial will be represented as [ [  ], 0 ]
 # We took care that other representations of zero, for example [ [ 0, 0 ], 0 ] 
-# or [ [ 0, 0 ], 1 ], or [ [ 0 ], 1 ], can not occure, because we reduce
+# or [ [ 0, 0 ], 1 ], or [ [ 0 ], 1 ], can not occur, because we reduce
 # the presentation after adding polynomials in PlusLaurentPolynomialsExtRep
 # and subtracting them in MinusLaurentPolynomialsExtRep. Note that degree
 # determination is also based on this feature.

hpcgap/lib/helpbase.gi

@@ -134,7 +134,7 @@ BindGlobal( "TRANSATL", MakeImmutable(
 ##  "emphasize" and  "emphasise" may be used). However, this only creates 
 ##  a tiny and really neglectible overhead (try e.g. `??SizesCentralisers'
 ##  or `??Centralizers, Normalizers and Intersections'); however it ensures 
-##  that help searches may be successfull even if they use inconsistent 
+##  that help searches may be successful even if they use inconsistent 
 ##  spelling. In practice, we expect that the majority of help searches 
 ##  will match no more than one pattern. One could use the utility function 
 ##  `FindMultiSpelledHelpEntries' below to see that the help system contains 
@@ -270,7 +270,7 @@ end);
 ##  Analyse/Analyze, Factorisation/Factorization etc. 
 ##
 ##  "FindMultiSpelledHelpEntries" reports help entries that contains more
-##  than one occurence of spelling patterns from the `TRANSATL' list.
+##  than one occurrence of spelling patterns from the `TRANSATL' list.
 ##  It may falsely report entries containing the substring "Size" or "size",
 ##  since it's not possible to detect whether "size" is a part of another 
 ##  word or a word itselg (e.g. both spellings "emphasize" and  "emphasise" 

hpcgap/lib/polyrat.gi

@@ -1284,7 +1284,7 @@ local  p2, res, j, i,ii,o,d,b,lco,degs, step, cnew, sel, deli,
           # coefficients (to make it  primitive),we do  a slightly
           # weaker test:  (test of  leading   coeffs is  first   in
           # 'TrialQuotientRPF') this just should  reduce the number of
-          # 'ProductMod' neccessary.   the  absolute  part  of  the
+          # 'ProductMod' necessary.   the  absolute  part  of  the
           # product must  divide  the absolute  part of  f  up to a
           # divisor of <lc>
           q:=CoefficientsOfLaurentPolynomial(f)[1][1] / q * lc;

lib/basismut.gd

@@ -39,7 +39,7 @@
 ##  <Ref Oper="ShallowCopy"/> for a mutable basis returns a mutable
 ##  plain list containing the current basis vectors.
 ##  <!-- Also <Ref Attr="LeftActingDomain"/> (or the analogy for it) should be a basic-->
-##  <!-- operation; up to now, apparantly one can avoid it,-->
+##  <!-- operation; up to now, apparently one can avoid it,-->
 ##  <!-- but conceptually it should be available!-->
 ##  <P/>
 ##  Since mutable bases do not admit arbitrary changes of their lists of

lib/csetgrp.gi

@@ -1103,7 +1103,7 @@ local c, flip, maxidx, refineChainActionLimit, cano, tryfct, p, r, t,
 
   elif ValueOption("sisyphus")=true then
     # purely to allow for tests of up-step mechanism in smaller examples.
-    # This is creating unneccessary extra work and thus should never be used
+    # This is creating unnecessary extra work and thus should never be used
     # in practice, but will force some code to be run through.
     c:=Concatenation([TrivialSubgroup(G)],c);
     cano:=true;

lib/ctblsolv.gd

@@ -330,7 +330,7 @@ DeclareGlobalFunction( "ProjectiveCharDeg" );
 ##  <Description>
 ##  <A>G</A> must be a supersolvable group,
 ##  and <A>z</A> a central element in <A>G</A>.
-##  <Ref Func="CoveringTriplesCharacters"/> returns a list of tripels
+##  <Ref Func="CoveringTriplesCharacters"/> returns a list of triples
 ##  <M>[ T, K, e ]</M>
 ##  such that every irreducible character <M>\chi</M> of <A>G</A> with the
 ##  property that <M>\chi(<A>z</A>)</M> is a multiple of

lib/factgrp.gi

@@ -1117,7 +1117,7 @@ local gimg,img,dom,b,improve,bp,bb,i,k,bestdeg,subo,op,bc,bestblock,bdom,
 	bc:=First(b,i->dom[1] in i);
 	if subo<>fail and (Length(subo)<=subomax) then
 	  Info(InfoFactor,2,"try all seeds");
-	  # if the degree is not too big or if we are desparate then go for
+	  # if the degree is not too big or if we are desperate then go for
 	  # all blocks
 	  # greedy approach: take always locally best one (otherwise there
 	  # might be too much work to do)

lib/function.g

@@ -419,7 +419,7 @@ end);
 ##  ]]></Example>
 ##  <Ref Oper="CallFuncListWrap"/> differs only in that the result is a list.
 ##  This returned list is empty if the called function returned no value,
-##  else it contains the returned value as it's single member. This allows
+##  else it contains the returned value as its single member. This allows
 ##  wrapping functions which may, or may not return a value.
 ##
 ##  <Example><![CDATA[

lib/ghomperm.gi

@@ -1495,7 +1495,7 @@ InstallMethod( PreImagesRepresentative,"constituent homomorphism",
 function( hom, elm )
 local D,DP;
   if not HasStabChainMutable(Source(hom)) then
-    # do not enforce a stabchain if not neccessary -- it could be big
+    # do not enforce a stabchain if not necessary -- it could be big
     TryNextMethod();
   fi;
   D:=Enumerator(UnderlyingExternalSet(hom));

lib/grpfp.gi

@@ -593,7 +593,7 @@ local A,B,U,V,W,E,F,map;
   #  Then G>H if and only if the following two conditions hold:
   #  1) The image of G in B contains V.
   #  2) G contains ker(S->B) (so with 1 it is sufficient, this is trivially
-  #     neccessary as H contains this kernel).
+  #     necessary as H contains this kernel).
   #     This condition is fulfilled, if U>E
 
   #  To compute this, first note that F is generated (as normal subgroup) by

lib/grppc.gi

@@ -2360,7 +2360,7 @@ InstallTrueMethod( CanEasilyComputePcgs, IsGroup and HasFamilyPcgs );
 # InstallTrueMethod(CanEasilyTestMembership,CanEasilyComputePcgs); 
 # we cannot test membership using a pcgs
 
-# InstallTrueMethod(CanComputeSize, CanEasilyComputePcgs); #unneccessary
+# InstallTrueMethod(CanComputeSize, CanEasilyComputePcgs); #unnecessary
 
 #############################################################################
 ##

lib/grpprmcs.gi

@@ -81,7 +81,7 @@ end );
 ##  The program works for  permutation  groups  of  degree  < 2^20 = 1048576.
 ##  For higher degrees  `IsSimple'  and  `CasesCSPG'  must  be  extended with
 ##  longer lists of primitive  groups  from  extensions  in  Kantor's  tables
-##  (see JSC. 12(1991), pp. 517-526).  It may also be  neccessary  to  modify
+##  (see JSC. 12(1991), pp. 517-526).  It may also be  necessary  to  modify
 ##  `FindNormalCSPG'.
 ##
 ##  A general reference for the algorithm is:

lib/helpbase.gi

@@ -132,7 +132,7 @@ BindGlobal( "TRANSATL", MakeImmutable(
 ##  "emphasize" and  "emphasise" may be used). However, this only creates 
 ##  a tiny and really neglectible overhead (try e.g. `??SizesCentralisers'
 ##  or `??Centralizers, Normalizers and Intersections'); however it ensures 
-##  that help searches may be successfull even if they use inconsistent 
+##  that help searches may be successful even if they use inconsistent 
 ##  spelling. In practice, we expect that the majority of help searches 
 ##  will match no more than one pattern. One could use the utility function 
 ##  `FindMultiSpelledHelpEntries' below to see that the help system contains 
@@ -265,7 +265,7 @@ end);
 ##  Analyse/Analyze, Factorisation/Factorization etc. 
 ##
 ##  "FindMultiSpelledHelpEntries" reports help entries that contains more
-##  than one occurence of spelling patterns from the `TRANSATL' list.
+##  than one occurrence of spelling patterns from the `TRANSATL' list.
 ##  It may falsely report entries containing the substring "Size" or "size",
 ##  since it's not possible to detect whether "size" is a part of another 
 ##  word or a word itselg (e.g. both spellings "emphasize" and  "emphasise" 

lib/kbsemi.gi

@@ -214,7 +214,7 @@ function(kbrws,v)
 
       if ptc then
         #delete pairs of indexes that include i
-        #and change ocurrences of indexes k greater than i in the 
+        #and change occurrences of indexes k greater than i in the 
         #list of pairs and change them to k-1
         #So we'll construct a new list with the right pairs
         l:=[];

lib/matrix.gd

@@ -2104,7 +2104,7 @@ DeclareOperation("FieldOfMatrixList",[IsListOrCollection]);
 ##  <M>R</M> has a quotient field that can be represented, this quotient
 ##  field is returned instead.
 ##  In general <M>R</R> is not chosen to be as small as possible, but to
-##  be determined quickly without being unneccesarily large
+##  be determined quickly without being unnecessarily large
 ##  (see <Ref Attr="DefaultFieldOfMatrix"/>).
 ##  </Description>
 ##  </ManSection>

lib/meataxe.gi

@@ -3514,7 +3514,7 @@ SMTX_OrthogonalSign:=function(gm)
 
     #
     # Main loop of Thackray's algorithm, build up a totally isotropic
-    # subspace and restrict it's perp until the gap between is just 2 dimensional
+    # subspace and restrict its perp until the gap between is just 2 dimensional
     #
 
     while n > 2 do

lib/oprt.gi

@@ -1307,7 +1307,7 @@ local   orb,  stb,  rep,  p,  q,  img,  sch,  i,d,act,
 	    return rec( orbit := orb, stabilizer := stb );
 	  elif  ind=Length(orb) then
 	    # we have reached the full orbit. No further tests
-	    # neccessary
+	    # necessary
 
 	    # do we still need to tick off the orbit in `blist' to
 	    # please the caller?

lib/permdeco.gd

@@ -69,7 +69,7 @@ DeclareGlobalFunction("WreathActionChiefFactor");
 ## The option `limit' can be used to limit the orders of the solvable
 ## factors (if possible).
 ##
-## This is considered an old function that will be superceded by
+## This is considered an old function that will be superseded by
 ##  FittingFreeLiftSetup
 DeclareGlobalFunction("PermliftSeries");
 

lib/polyfinf.gi

@@ -134,7 +134,7 @@ local   br,  ind,  c,  facs,  deg,  px,  pow,  cyc,  gcd,d,powc,fc,fam;
       fi;
   od;
 
-  # if neccessary add irreducible <f> to the list of factors
+  # if necessary add irreducible <f> to the list of factors
   if 0 < DegreeOfLaurentPolynomial(f)  then
       Add(facs,f);
   fi;

lib/polyrat.gi

@@ -1270,7 +1270,7 @@ local  p2, res, j, i,ii,o,d,b,lco,degs, step, cnew, sel, deli,
           # coefficients (to make it  primitive),we do  a slightly
           # weaker test:  (test of  leading   coeffs is  first   in
           # 'TrialQuotientRPF') this just should  reduce the number of
-          # 'ProductMod' neccessary.   the  absolute  part  of  the
+          # 'ProductMod' necessary.   the  absolute  part  of  the
           # product must  divide  the absolute  part of  f  up to a
           # divisor of <lc>
           q:=CoefficientsOfLaurentPolynomial(f)[1][1] / q * lc;

lib/relation.gi

@@ -755,7 +755,7 @@ InstallMethod(StronglyConnectedComponents, "for general binary relations",
                 v := First(adj[u],x->color[x]=0);
 
                 ## If no undiscovered vertices exist pop the vertex u
-                ##   from the stack and record it's finish time and color
+                ##   from the stack and record its finish time and color
                 ##   it fully discovered
                 ##
                 if v=fail then
@@ -765,7 +765,7 @@ InstallMethod(StronglyConnectedComponents, "for general binary relations",
                     ftime[u] := time+1;
                     time := time +1;
 
-                ## Otherwise color the vertex, record it's discover
+                ## Otherwise color the vertex, record its discover
                 ##   time and predesessor edge, and push on the stack.
                 ##
                 else
@@ -1419,7 +1419,7 @@ InstallGlobalFunction(EquivalenceRelationByPartition,
 		Error("Equivalence relations only constructible over domains");
 	fi;
 
-	# make sure there are no repititions
+	# make sure there are no repetitions
 	if not IsSet(AsSortedList(Concatenation(subsX))) then
 		Error("Input does not describe a partition");
 	fi;
@@ -1580,7 +1580,7 @@ InstallGlobalFunction(EquivalenceRelationByPairsNC,
         forest := [C[1]];
 
         ##
-        ## Put each pair in it's appropriate block and merge blocks
+        ## Put each pair in its appropriate block and merge blocks
         ##     as necessary 
         ##
         for i in C do

lib/ringsc.gi

@@ -574,7 +574,7 @@ local p, j, f, fj, g, q, gj, m, k, i;
     od;
 
     if p>0 and IsBound(pivots[p]) then
-      # reduction occured at pivot element -- need to reduce further
+      # reduction occurred at pivot element -- need to reduce further
       j:=pivots[p];
       f:=l[j];
       if imgs<>false then

lib/sgpres.gi

@@ -2275,7 +2275,7 @@ end);
 
 # New implemention of the Modified Todd-Coxeter (MTC) algorithm, based on
 # Chapter 5  of the "Handbook of Computational Group Theory", by Derek F.
-# Holt (refered # to as "Handbook" from here on). Function names after the
+# Holt (referred # to as "Handbook" from here on). Function names after the
 # NEWTC_ agree with those of sections 5.2, 5.3 of the Handbook.
 
 NEWTC_AddDeduction:=function(list,ded)