Fix typos in comments and documentation

README.hpcgap.md

@@ -69,7 +69,7 @@ using `IsHPCGAP`, like this:
   if IsHPCGAP then
      # perform HPC-GAP specific actions
   else
-    # perform altrnative actions for regular GAP
+    # perform alternative actions for regular GAP
   fi;
 ```
 

dev/NameSpaces.tex

@@ -29,7 +29,7 @@ \section{Changes to GAP Syntax}
 variable names''.  To resolve such names, one or more namespaces would
 be open for access to existing variables (open for access), and just one namespace would
 be open for creation of new variables (open for creation). If an
-unqalified variable name was referred to, and more than one of the
+unqualified variable name was referred to, and more than one of the
 namespaces open for access contained a variable with the given name,
 then this would be an error (``ambiguous variable reference'' or some
 such).

dev/listarith.tex

@@ -27,7 +27,7 @@ \section{Basics -- jump tables}
 Certain additional entries are initialized via a call to function like
 \verb|InstallZeroObject|. This takes one argument specifying whether
 to install the verbose or silent versions of the functions. These
-\verb|InstallXXXObject| functions also also called by
+\verb|InstallXXXObject| functions are also called by
 \verb|ChangeDoOperations| when tracing is enabled or disabled. They
 set the table entries for the cases when one or more argument  is of
 type between \verb|FIRST_EXTERNAL_TNUM| and \verb|LAST_EXTERNAL_TNUM|
@@ -97,14 +97,14 @@ \subsection{In listoper.c}
 scalar and the other not, else SumListList if both are vectors or
 empty or matrices. Diff is like Sum.
 
-For Prod, there are again four functions, ProdList redespatches,
+For Prod, there are again four functions, ProdList redispatches,
 ProdListScl and ProdSclList do the obvious and ProdListList is inner
 product. ProdList is installed if either argument is incomplete,
 ProdListScl or ProdSclList if just one argument is scalar,
 ProdListList for vector* anything else, ProdListScl
 for matrix * vector and ProdSclList for matrix * empty. 
 
-Quo just has QuoList installed if eithert argument is incomplete,
+Quo just has QuoList installed if either argument is incomplete,
 likewise Lquo and Pow. Additionally ProdListList is installed for
 \verb|vector ^ matrix|, and PowDefault (conjugate) for matrix * matrix. Comm
 is like Quo.
@@ -181,7 +181,7 @@ \section{Determining the Type of Plists}
 **   T_PLIST_DENSE              known only not to have a hole
 **   T_PLIST_DENSE_NHOM         known to be dense but not homogeneous *  **
 **   T_PLIST_DENSE_NHOM_SSORT   dense, non-hom but strictly sorted
-**   T_PLIST_DENSE_NHOM_NSORT   dense, non-hom, known not be be sorted
+**   T_PLIST_DENSE_NHOM_NSORT   dense, non-hom, known not to be sorted
 **   T_PLIST_EMPTY              the empty list
 **   T_PLIST_HOM                known to be homogeneous *
 **   T_PLIST_HOM_NSORT           etc

dev/modules.txt

@@ -10,7 +10,7 @@ each other:
 The first is a purely software engineering level of ``Modules''. A module is
 a piece of code which provides certain functionality via a defined set of
 interfacing functions. On a conceptual level the library is already split
-into modules, probably later this spearation will be made more explicit by
+into modules, probably later this separation will be made more explicit by
 attaching names and version numbers to modules.  Eventually it is intended
 to make modules identifiers that are not part of the interface to be
 inaccessible from outside the module.

dev/sacks.tex

@@ -48,7 +48,7 @@ \section{Basic Design}
 rewrite, so that it can cope with a workspace that consists of a
 number of separate memory extents, which we call \emph{sacks}. There
 is a frequent requirement in GASMAN to recognise whether an arbitrary
-value is a valid bag id. Part of the check involves conparisons with
+value is a valid bag id. Part of the check involves comparisons with
 the upper and lower bounds of the masterpointer area. To avoid slowing 
 this check down, we insist that the masterpointer area be entirely
 within one sack (the \emph{master sack}).

doc/dev/testing.xml

@@ -139,7 +139,7 @@ to check the validity of (in particular cross-references in)
 the ⪆ website.
 <P/>
 
-(Possible ingedients are <F>doc/test/CheckBooks.g</F> and
+(Possible ingredients are <F>doc/test/CheckBooks.g</F> and
 <F>dev/LinksOfAllHelpSections.g</F>.)
 <P/>
 
@@ -240,7 +240,7 @@ Then proceed as follows in the &GAP; root directory.
     Call <C>dev/ci.sh testpackagesloading</C>.
     This loads each accepted or deposited package in a new &GAP; session,
     then starts a new &GAP; session and calls <Ref BookName="ref" Func="LoadAllPackages"/>
-    to check that all packages may be loaded simultaneosuly.
+    to check that all packages may be loaded simultaneously.
     It require just a few minutes.
   </Item>
 </List>

doc/gapmacro.tex

@@ -477,7 +477,7 @@
 %    The labels formed inside TeX from the \makelabel commands maps
 %    underscores to | (needed to be a non-active character) and then
 %    converts to lowercase.
-% 4. Since GapDoc uses < and > in some of its labels a temporary re-defintion
+% 4. Since GapDoc uses < and > in some of its labels a temporary re-definition
 %    of <#1> was necessary, inside \@xplowr.
 % - GG 2001/06/11, 2001/09/02
 
@@ -1010,7 +1010,7 @@
 \outer\def\Bibliography{\EndMatter\doChapter\BibHeader{}%
   \begingroup\undoquotes\frenchspacing
   \parindent\bibindent
-  \pretolerance=5000 %badness allowed for hypenation
+  \pretolerance=5000 %badness allowed for hyphenation
   \tolerance=5000    %badness allowed before overfull boxes appear
   \parskip 1ex plus 0.5ex minus 0.5ex
   \def\begin##1##2{} \def\end##1{}
@@ -1045,7 +1045,7 @@
   \IndexMatter
   \bigskip
   \begindoublecolumns
-  \pretolerance=5000 %badness allowed for hypenation
+  \pretolerance=5000 %badness allowed for hyphenation
   \tolerance=5000    %badness allowed before overfull boxes appear
   \parindent 0pt \parskip 0pt \rightskip 0pt plus2em \emergencystretch 2em
   \everypar{\hangindent\smallmanindent}

doc/hpc/regions.xml

@@ -782,7 +782,7 @@ gap> l3;
 ]]></Example>
 
 Atomic statements must observe region ordering. That means that the highest precedence level of a region locked by an
-atomic statement must be less than the lowest precedene level of a region that is locked by the same thread at the time
+atomic statement must be less than the lowest precedence level of a region that is locked by the same thread at the time
 the atomic statement is executed.
     </Subsection>
   </Section>

doc/ref/matobj.xml

@@ -355,7 +355,7 @@ that do not delegate to <Ref Oper="NewVector"/> and
 <Section Label="Available Representations of Vector Objects">
 <Heading>Available Representations of Vector Objects</Heading>
 
-The following filters define vector objects for which the the functionality
+The following filters define vector objects for which the functionality
 described in this chapter is supported.
 
 <#Include Label="IsGF2VectorRep">
@@ -369,7 +369,7 @@ described in this chapter is supported.
 <Section Label="Available Representations of Matrix Objects">
 <Heading>Available Representations of Matrix Objects</Heading>
 
-The following filters define matrix objects for which the the functionality
+The following filters define matrix objects for which the functionality
 described in this chapter is supported.
 
 <#Include Label="IsGF2MatrixRep">

doc/ref/methsel.xml

@@ -121,7 +121,7 @@ as in this case).
 <P/>
 
 If no method has been installed which guarantees to produce a suitable
-objecty, a "No Method Found" error will be returned.
+object, a "No Method Found" error will be returned.
 <Log><![CDATA[
 gap> XCons(IsFullTransformationMonoid,4);
 Error, no method found! For debugging hints type ?Recovery from NoMethodFound

doc/ref/pcgs.xml

@@ -381,9 +381,9 @@ series. See also Section <Ref Sect="Special Pcgs"/> for a more explicit possibil
 <Section Label="Sum and Intersection of Pcgs">
 <Heading>Sum and Intersection of Pcgs</Heading>
 
-<!-- %eclaration{SumPcgs} -->
-<!-- %eclaration{IntersectionSumPcgs} -->
-<!-- %eclaration{NormalIntersectionPcgs} -->
+<!-- %declaration{SumPcgs} -->
+<!-- %declaration{IntersectionSumPcgs} -->
+<!-- %declaration{NormalIntersectionPcgs} -->
 <#Include Label="SumFactorizationFunctionPcgs">
 
 </Section>

doc/ref/preface.xml

@@ -47,7 +47,7 @@ To get started a new user may first look at parts of the
 A lot of the functionality of the system and a number of
 contributed extensions are provided as <Q>&GAP; packages</Q>
 which are developed independently of the core part of &GAP; and can be loaded
-into a &GAP; session. Each package comes with a its own manual which is
+into a &GAP; session. Each package comes with its own manual which is
 also available through the &GAP; help system.
 <P/>
 This manual is divided into chapters, sections and subsections.

doc/ref/reesmat.xml

@@ -27,7 +27,7 @@
   index set <M>J</M>, the semigroup <M>S</M> is the <E>underlying semigroup</E>
   of <M>R</M>, and the <E>matrix</E> <M>P</M> is the matrix of <M>S</M>. <P/>
 
-  Thoroughout this section, wherever the distinction is unimportant, we will
+  Throughout this section, wherever the distinction is unimportant, we will
   refer to Rees matrix or 0-matrix semigroups collectively as Rees matrix
   semigroups.<P/>
 

doc/ref/run.xml

@@ -511,7 +511,7 @@ Note that by default, the user specific ⪆ root directory
 is the first ⪆ root directory.
 So you can put your <F>gap.ini</F> and <F>gaprc</F> files into this directory.
 <P/>
-This mechanism substitutes the much less flexible reading of a users
+This mechanism substitutes the much less flexible reading of a user's
 <F>.gaprc</F> file in versions of &GAP; up to 4.4.
 For compatibility this <F>.gaprc</F> file is still read if the directory
 <C>GAPInfo.UserGapRoot</C> does not exist, see <Ref Sect="obsolete-gaprc"/>

etc/convert.pl

@@ -5,7 +5,7 @@
 #  convert.pl [-csti] [-f <frontpage>] [-n <pkgname>] <doc-dir> [<html-dir>]
 #
 # Requirements: Perl (might need to edit the first line of this file)
-#               TtH is not strictlty necessary but very desirable to treat
+#               TtH is not strictly necessary but very desirable to treat
 #               formulas.
 #
 #  Caveats:

etc/ctags.readme.md

@@ -56,7 +56,7 @@ do
 
 or, while your cursor is on the name of that function, press `<CTRL-]>`
 to jump to the first definition of that function. If for example an operation has
-several several methods installed, you can also do
+several methods installed, you can also do
 
     :ts <function-name>
 

grp/classic.gi

@@ -2057,7 +2057,7 @@ end );
 ##
 #F  IsSquareFFE( fld, e) . . . . . . . Tests whether <e> is a square in <fld>
 ##
-## For an finite field element <e> of <fld> this function returns
+## For a finite field element <e> of <fld> this function returns
 ## true if <e> is a square element in <fld> and otherwise false.
 BindGlobal( "IsSquareFFE", function( fld, e )
     local char, q;

grp/imf.gd

@@ -54,7 +54,7 @@ DeclareAttribute( "ImfRecord", IsGroup, "mutable" );
 ##
 ##  'BaseShortVectors' expects as argument an  orbit of short vectors  under
 ##  some  imf  matrix  group  of  dimension  dim,  say.  This  orbit  can  be
-##  considered  as  a set of generatos  of a  dim-dimensional  Q-vectorspace.
+##  considered  as  a set of generators  of a  dim-dimensional  Q-vectorspace.
 ##  'BaseShortVectors' determines a subset B of <orbit> which is a base
 ##  of that vectorspace, and it returns a list of two lists containing
 ##

grp/imf.grp

@@ -15,7 +15,7 @@
 ##  Each entry IMFList[dim] of IMFList is a record which contains information
 ##  about the  Z-class  representative groups  (in case  dim < 12  or  dim in
 ##  {13,17,19,23}, or about the Q-class representative groups (in case dim in
-##  {12,14,15,16,18,20,21,22,24,25,26,27,28,29,30,31}) of diminsion dim. More
+##  {12,14,15,16,18,20,21,22,24,25,26,27,28,29,30,31}) of dimension dim. More
 ##  precisely, each of these records contains the following components:
 ##
 ##  IMFList[dim].size               the group size,

grp/simple.gd

@@ -56,7 +56,7 @@ DeclareGlobalFunction("SimpleGroup");
 ##  <Func Name="EpimorphismFromClassical" Arg='G'/>
 ##
 ##  <Description>
-##  For a nonabelian (almost) simple group this homomorphsim will try to construct an
+##  For a nonabelian (almost) simple group this homomorphism will try to construct an
 ##  epimorphism from a classical group onto it (or return fail if it does
 ##  not work or is not yet implemented).
 ##  </Description>

hpcgap/demo/Echelon.g

@@ -137,7 +137,7 @@ end;
 ##  times and afterwards the rest is done in a single interval.
 ##  The nice point is here that the total running time is almost the same for 
 ##  a large range of values for num and rounds. This means we have split the
-##  whole work into many small tasks with neglectible overhead.
+##  whole work into many small tasks with negligible overhead.
 ##  
 ##  I have played with various possibilities to vary the lengths of the
 ##  intervals of rows given to TrigonalizeSubset during the algorithm.

hpcgap/demo/atomic.g

@@ -164,7 +164,7 @@ od;
 
 # atomic readwrite l do
 #  for i in [1..nr] do
-#    atomic readwrite l[i] do # otherwise an error (no recurisve)
+#    atomic readwrite l[i] do # otherwise an error (no recursive)
 #      Print( l[i], "\n" ); # Print(l) gives an error
 #    od;  
 #  od;

hpcgap/demo/karatsuba.g

@@ -8,8 +8,8 @@
 #############################################################################
 # 
 # Must be >=3 for correct work. May depend on the coefficients field.
-# We use some emprically determined value which may later depend on
-# a number of threads and on the ring of coeficients
+# We use some empirically determined value which may later depend on
+# a number of threads and on the ring of coefficients
 # 
 KARATSUBA_CUTOFF := 100; # for sequential mode
 

hpcgap/demo/parorbit/parallelorbit1.g

@@ -188,7 +188,7 @@ Measure := function(gens,pt,op,n)
   computebandwidth := 1.0/timeperop;
   Print(computebandwidth,"\n");
 
-  # Now hash lookup bandwith:
+  # Now hash lookup bandwidth:
   Print("Measuring lookup bandwidth... \c");
   ht := HTCreate(pt,rec( hashlen := NextPrimeInt(2*k*n) ));
   # Store things in the hash:

hpcgap/demo/parorbit/parallelorbit2.g

@@ -235,7 +235,7 @@ Measure := function(gens,pt,op,n)
   computebandwidth := 1.0/timeperop;
   Print(computebandwidth,"\n");
 
-  # Now hash lookup bandwith:
+  # Now hash lookup bandwidth:
   Print("Measuring lookup bandwidth... \c");
   ht := HTCreate(pt,rec( hashlen := NextPrimeInt(2*k*n) ));
   # Store things in the hash:

hpcgap/demo/parorbit/parallelorbit3.g

@@ -269,7 +269,7 @@ Measure := function(gens,pt,op,n)
   computebandwidth := 1.0/timeperop;
   Print(computebandwidth,"\n");
 
-  # Now hash lookup bandwith:
+  # Now hash lookup bandwidth:
   Print("Measuring lookup bandwidth... \c");
   ht := HTCreate(pt,rec( hashlen := NextPrimeInt(2*k*n) ));
   # Store things in the hash:

hpcgap/demo/strassen.g

@@ -1,6 +1,6 @@
 Read("demo/bench.g");
 #
-# This is basically intended to be the simplkest natural parallel 
+# This is basically intended to be the simplest natural parallel 
 # implementation of Strassen-Winograd. Also included is a sequential version
 # and a parallel divide-and-conquer that does not use Strassen (so 8 recursive
 # calls instead of 7).

hpcgap/demo/sumeuler.g

@@ -154,7 +154,7 @@ Compare( SumIntegers, 1, 10^9, 10^6); # 24.2 on 32 cores, 31.2 on 64 cores
 Compare( SumEulerByDefinition, 1, 10^4, 10^2); # 7.1 on 8 cores, 12.5 on 16, 19.5 on 32, 30.1 on 64
 Compare( SumEulerByDefinition, 1, 10^5, 10^2); # 7.62 on 8 cores, 13.3 on 16, 25.2 on 32 cores, 38x on 64 cores
 Compare( SummatoryLiouvilleFunction, 1, 10^7, 10^4); # 6.8 on 8 cores, 20x on 64 cores
-Compare( SummatoryLiouvilleFunction, 1, 10^7, 10^5); # 18x on 64 cores (24x speedup with with SCSCP on 64 cores)
+Compare( SummatoryLiouvilleFunction, 1, 10^7, 10^5); # 18x on 64 cores (24x speedup with SCSCP on 64 cores)
 Compare( SummatoryLiouvilleFunction, 1, 10^6, 10^3); # 6.1 on 8 cores, 16x on 64 cores
 Compare( SumEulerByFormula, 1, 10^7, 10^4); # 6.3 on 8 cores, 26x on 64 cores
 Compare( SumNrPrimeFactors, 1, 10^6, 10^3); # 28x on 64 cores

hpcgap/demo/sumliouville.c

@@ -1,5 +1,5 @@
 
-/* The Liouville function on a integer n is L(n) = (-1)^r where r is
+/* The Liouville function on an integer n is L(n) = (-1)^r where r is
    the number of prime factors in the prime factorization of n (L(1) = 1).
    This program is called as 
            sumliouville begin end 

hpcgap/demo/sumliouville2.c

@@ -1,5 +1,5 @@
 
-/* The Liouville function on a integer n is L(n) = (-1)^r where r is
+/* The Liouville function on an integer n is L(n) = (-1)^r where r is
    the number of prime factors in the prime factorization of n (L(1) = 1).
    This program is called as 
            sumliouville2 begin end intlen

hpcgap/lib/basis.gi

@@ -748,7 +748,7 @@ end );
 ##  A finite vector space can be handled via the mechanism of nice bases.
 ##  We exclude the situation that all given generators are zero (and thus the
 ##  vector space is trivial) because such a space should be handled be the
-##  mechanism that deals with nontrivial spaces caontaining it,
+##  mechanism that deals with nontrivial spaces containing it,
 ##  for example in order to admit a consistent ordering of spaces via `\<'.
 ##
 InstallHandlingByNiceBasis( "IsGenericFiniteSpace", rec(

hpcgap/lib/helpbase.gi

@@ -127,7 +127,7 @@ BindGlobal( "TRANSATL", MakeImmutable(
 ##  substring "Size" or "size", since it's not possible to detect whether
 ##  "size" is a part of another word or a word itself (e.g. both spellings
 ##  "emphasize" and  "emphasise" may be used). However, this only creates
-##  a tiny and really neglectible overhead (try e.g. `??SizesCentralisers'
+##  a tiny and really negligible overhead (try e.g. `??SizesCentralisers'
 ##  or `??Centralizers, Normalizers and Intersections'); however it ensures
 ##  that help searches may be successful even if they use inconsistent
 ##  spelling. In practice, we expect that the majority of help searches

hpcgap/lib/hpc/thread1.g

@@ -8,7 +8,7 @@
 ##
 ##  SPDX-License-Identifier: GPL-2.0-or-later
 ##
-##  This file provides the necessary thread initialization code code needed
+##  This file provides the necessary thread initialization code needed
 ##  early in GAP's initialization process. The rest can be found in thread.g.
 ##
 

hpcgap/lib/rwspcgrp.gi

@@ -1015,7 +1015,7 @@ function( efam, gens, rels, conflicts )
     for rel  in rels  do
         n := NumberSyllables(rel);
 
-        # a word with only one or two syllabel is a power
+        # a word with only one or two syllables is a power
         if n = 1 or n = 2  then
             Add( powlst, rel );
 

hpcgap/lib/vec8bit.gi

@@ -634,7 +634,7 @@ function(F,v)
   fi;
     # otherwise we must be a bit more clever
   if 0 = DegreeOverPrimeField(F) mod LogInt(q,Characteristic(F)) then
-    return true;    # degrees ovber prime field OK
+    return true;    # degrees over prime field OK
   fi;
   TryNextMethod(); # the vector still might be written over a too-large
   # field, so we can't say `no'.

lib/algebra.gi

@@ -3427,7 +3427,7 @@ InstallAccessToGenerators( IsMagmaRingModuloRelations and IsRingWithOne,
 #M  CentralIdempotentsOfAlgebra( <A> )
 ##
 ##   Let A be an associative algebra with one. We construct a maximal
-##   system of orthogonal primitive idemoptents in the centre of A.
+##   system of orthogonal primitive idempotents in the centre of A.
 ##   First we let B be the centre of A and Q the
 ##   the semisimple commutative associative algebra A/Rad(A).
 ##   We calculate a complete set of orthogonal idempotents in `Q'