Merge branch 'stable-4.8'

bin/BuildPackages.sh

@@ -78,23 +78,16 @@ build_carat() {
 # this out until a user complains.
 # It is not possible to move around compiled binaries because these have the
 # path to some data files burned in.
-tar xzpf carat-2.1b1.tgz
-rm -f bin
+zcat carat-2.1b1.tgz | tar pxf -
 ln -s carat-2.1b1/bin bin
-cd carat-2.1b1/functions
-# Install the include Gmp first.
-# (If you have already Gmp on your system, you can delete the file
-# gmp-*.tar.gz and delete the target 'Gmp' from the target 'ALL' in
-# carat-2.1b1/Makefile.)
-tar xzpf gmp-*.tar.gz
-cd ..
-$MAKE TOPDIR=`pwd` Links
-# Note that Gmp may use processor specific code, so this step may not be ok
-# for a network installation if you want to use the package on older computers
-# as well.
-$MAKE TOPDIR=`pwd` Gmp
-# And now the actual Carat programs.
-$MAKE TOPDIR=`pwd` CFLAGS='-O2'
+cd carat-2.1b1
+make TOPDIR=`pwd`
+chmod -R a+rX .
+cd bin
+aa=`./config.guess`
+for x in "`ls -d1 $GAPDIR/bin/${aa}*`"; do
+ ln -s "$aa" "`basename $x`"
+done
 )
 }
 

cnf/gac.in

@@ -129,6 +129,7 @@ OBJECTS="\
     plist.o \
     pperm.o \
     precord.o \
+    profile.o \
     range.o \
     rational.o \
     read.o \

doc/changes/changes48.xml

@@ -362,6 +362,117 @@ Fix for using Firefox as a default help viewer with
 </Subsection>
 </Section>
 
+<Section Label="gap484">
+<Heading>&GAP; 4.8.4 (June 2016)</Heading>
+
+<Subsection Label="Changes in the core GAP system introduced in GAP 4.8.4">
+<Heading>Changes in the core &GAP; system introduced in &GAP; 4.8.4</Heading>
+
+New features:
+<List>
+<Item>
+<!-- #737 -->
+The &GAP; distribution now includes <F>bin/BuildPackages.sh</F>, a script which
+can be started from the <F>pkg</F> directory via <C>../bin/BuildPackages.sh</C>
+and will attempt to build as many packages as possible. It replaces the
+<F>InstPackages.sh</F> script which was not a part of the &GAP; distribution
+and had to be downloaded separately from the &GAP; website. The new script is
+more robust and simplifies adding new packages with binaries, as it requires no
+adjustments if the new package supports the standard <C>./configure; make</C>
+build procedure.
+</Item>
+</List>
+
+Improved and extended functionality:
+<List>
+<Item>
+<!-- #678 -->
+<Ref Func="SimpleGroup" BookName="ref"/> now produces more informative error
+message in the case when <Ref Func="AtlasGroup" BookName="AtlasRep"/> could
+not load the requested group.
+</Item>
+<Item>
+<!-- #610 -->
+An info message with the suggestion to use
+<Ref InfoClass="InfoPackageLoading" BookName="ref"/> will now be displayed
+when <Ref Func="LoadPackage" BookName="ref"/> returns <K>fail</K>
+(unless &GAP; is started with <C>-b</C> option).
+</Item>
+<Item>
+<!-- #728 -->
+The build system will now enable C++ support in GMP
+only if a working C++ compiler is detected.
+</Item>
+<Item>
+<!-- #757 -->
+More checks were added when embedding coefficient rings or rational numbers
+into polynomial rings in order to forbid adding polynomials in different
+characteristic.
+</Item>
+</List>
+
+Fixed bugs that could lead to crashes:
+<List>
+<Item>
+<!-- #685 -->
+Fixed the crash in <C>--cover</C> mode when reading files
+with more than 65,536 lines.
+</Item>
+</List>
+
+Fixed bugs that could lead to incorrect results:
+<List>
+<Item>
+<!-- #741 -->
+Fixed an error in the code for partial permutations that
+occurred on big-endian systems. [Reported by Bill Allombert]
+</Item>
+<Item>
+<!-- #766 -->
+Fixed the kernel method for <Ref Oper="Remove" BookName="ref"/> with
+one argument, which failed to reduce the length of a list to the
+position of the last bound entry. [Reported by Peter Schauenburg]
+</Item>
+</List>
+
+Fixed bugs that could lead to break loops:
+<List>
+<Item>
+<!-- #679 -->
+Fixed the break loop while using <Ref Oper="Factorization" BookName="ref"/>
+on permutation groups by removing some old code that relied on further caching
+in <C>Factorization</C>. [Reported by Grahame Erskine]
+</Item>
+<Item>
+<!-- #681 -->
+Fixed a problem with computation of maximal subgroups in an almost
+simple group. [Reported by Ramon Esteban Romero]
+</Item>
+<Item>
+<!-- #773 -->
+Added missing methods for <Ref Oper="Intersection2" BookName="ref"/>
+when one of the arguments is an empty list. [Reported by Wilf Wilson]
+</Item>
+</List>
+
+Other fixed bugs:
+<List>
+<Item>
+<!-- #770 -->
+Fixed several bugs in <Ref Func="RandomPrimitivePolynomial" BookName="ref"/>.
+[Reported by Nusa Zidaric]
+</Item>
+<Item>
+<!-- #781 -->
+Fixed several problems with <Ref Oper="Random" BookName="ref"/>
+on long lists in 64-bit GAP installations.
+</Item>
+</List>
+
+</Subsection>
+
+</Section>
+
 </Chapter>
 
 

doc/ref/testconsistency.g

@@ -101,13 +101,20 @@ for elt in x do
     else
       obj := EvalString( name );
       man := ManSectionType( obj );
-      # we allow to use "Meth" for "Oper" but probably should issue a warning
-      # if there is no at least one "Oper" for any "Meth"
+      # we allow to use "Meth" for "Oper", "Attr", "Prop" but issue a warning
+      # if there is no at least one "Oper", "Attr" or "Prop" for any "Meth"
       if ( man <> elt.name ) and not ( man in ["Attr","Prop","Oper"] and elt.name="Meth") then
         pos:=OriginalPositionDocument(doc[2],elt.start);
         Print( pos[1], ":", pos[2], " : ", name, " uses ", elt.name, " instead of ", man, "\n");
         errcount:=errcount+1;
       fi;
+      if elt.name="Meth" then
+        if Length( Filtered( x, t -> t.attributes.Name=name and t.name in ["Attr","Prop","Oper"] ) ) = 0 then
+          pos:=OriginalPositionDocument(doc[2],elt.start);
+          Print( pos[1], ":", pos[2], " : ", name, " uses Meth with no matching Oper/Attr/Prop\n" );
+          errcount:=errcount+1;
+        fi;
+      fi;
     fi;
   fi;
 od;

lib/alglie.gd

@@ -431,7 +431,7 @@ DeclareSynonymAttr( "NonLieNilpotentElement", NonNilpotentElement);
 ##
 ##  <#GAPDoc Label="AdjointAssociativeAlgebra">
 ##  <ManSection>
-##  <Attr Name="AdjointAssociativeAlgebra" Arg='L, K'/>
+##  <Oper Name="AdjointAssociativeAlgebra" Arg='L, K'/>
 ##
 ##  <Description>
 ##  is the associative matrix algebra (with 1) generated by the matrices of
@@ -791,7 +791,7 @@ DeclareOperation("PClosureSubalgebra", [IsLieAlgebra and IsJacobianElementCollec
 ##
 ##  <#GAPDoc Label="FindSl2">
 ##  <ManSection>
-##  <Oper Name="FindSl2" Arg='L, x'/>
+##  <Func Name="FindSl2" Arg='L, x'/>
 ##
 ##  <Description>
 ##  This function tries to find a subalgebra <M>S</M> of the Lie algebra 

lib/ffe.gd

@@ -168,8 +168,8 @@
 ##
 ##  <#GAPDoc Label="DefaultField:ffe">
 ##  <ManSection>
-##  <Meth Name="DefaultField" Arg='list' Label="for finite field elements"/>
-##  <Meth Name="DefaultRing" Arg='list' Label="for finite field elements"/>
+##  <Func Name="DefaultField" Arg='list' Label="for finite field elements"/>
+##  <Func Name="DefaultRing" Arg='list' Label="for finite field elements"/>
 ##
 ##  <Description>
 ##  <Ref Func="DefaultField" Label="for finite field elements"/> and

lib/grp.gd

@@ -2893,7 +2893,7 @@ DeclareOperation( "IsCharacteristicSubgroup", [IsGroup,IsGroup] );
 ##
 ##  <#GAPDoc Label="IsPNilpotent">
 ##  <ManSection>
-##  <Func Name="IsPNilpotent" Arg='G, p'/>
+##  <Oper Name="IsPNilpotent" Arg='G, p'/>
 ##
 ##  <Description>
 ##  A group is <M>p</M>-nilpotent if it possesses a normal <M>p</M>-complement.
@@ -2910,7 +2910,7 @@ KeyDependentOperation( "IsPNilpotent", IsGroup, IsPosInt, "prime" );
 ##
 ##  <#GAPDoc Label="IsPSolvable">
 ##  <ManSection>
-##  <Func Name="IsPSolvable" Arg='G, p'/>
+##  <Oper Name="IsPSolvable" Arg='G, p'/>
 ##
 ##  <Description>
 ##  A finite group is <M>p</M>-solvable if every chief factor either has
@@ -3112,7 +3112,7 @@ KeyDependentOperation( "PCentralSeries", IsGroup, IsPosInt, "prime" );
 ##
 ##  <#GAPDoc Label="PRump">
 ##  <ManSection>
-##  <Func Name="PRump" Arg='G, p'/>
+##  <Oper Name="PRump" Arg='G, p'/>
 ##
 ##  <Description>
 ##  For a prime <M>p</M>, the <E><A>p</A>-rump</E> of a group <A>G</A> is
@@ -4052,8 +4052,8 @@ DeclareAttribute( "IsomorphismFpGroup", IsGroup );
 ##
 ##  <#GAPDoc Label="IsomorphismFpGroupByGenerators">
 ##  <ManSection>
-##  <Attr Name="IsomorphismFpGroupByGenerators" Arg='G,gens[,string]'/>
-##  <Attr Name="IsomorphismFpGroupByGeneratorsNC" Arg='G,gens,string'/>
+##  <Func Name="IsomorphismFpGroupByGenerators" Arg='G,gens[,string]'/>
+##  <Oper Name="IsomorphismFpGroupByGeneratorsNC" Arg='G,gens,string'/>
 ##
 ##  <Description>
 ##  returns an isomorphism from a finite group <A>G</A>
@@ -4297,7 +4297,7 @@ DeclareGlobalFunction( "PowerMapOfGroupWithInvariants" );
 ##
 ##  <#GAPDoc Label="HasAbelianFactorGroup">
 ##  <ManSection>
-##  <Oper Name="HasAbelianFactorGroup" Arg='G, N'/>
+##  <Func Name="HasAbelianFactorGroup" Arg='G, N'/>
 ##
 ##  <Description>
 ##  tests whether <A>G</A> <M>/</M> <A>N</A> is abelian
@@ -4340,7 +4340,7 @@ DeclareGlobalFunction("HasSolvableFactorGroup");
 ##
 ##  <#GAPDoc Label="HasElementaryAbelianFactorGroup">
 ##  <ManSection>
-##  <Oper Name="HasElementaryAbelianFactorGroup" Arg='G, N'/>
+##  <Func Name="HasElementaryAbelianFactorGroup" Arg='G, N'/>
 ##
 ##  <Description>
 ##  tests whether <A>G</A> <M>/</M> <A>N</A> is elementary abelian

lib/grpfp.gd

@@ -216,7 +216,7 @@ InstallTrueMethod(CanEasilyTestMembership, IsSubgroupFgGroup and IsWholeFamily);
 ##
 ##  <#GAPDoc Label="IsFpGroup">
 ##  <ManSection>
-##  <Func Name="IsFpGroup" Arg='G'/>
+##  <Filt Name="IsFpGroup" Arg='G'/>
 ##
 ##  <Description>
 ##  is a synonym for

lib/grppc.gd

@@ -286,7 +286,7 @@ DeclareAttribute( "GeneralizedPcgs", IsGroup );
 ##
 ##  <#GAPDoc Label="CanEasilyComputePcgs">
 ##  <ManSection>
-##  <Func Name="CanEasilyComputePcgs" Arg='grp'/>
+##  <Filt Name="CanEasilyComputePcgs" Arg='grp'/>
 ##
 ##  <Description>
 ##  This filter indicates whether it is possible to compute a pcgs for

lib/grppclat.gd

@@ -68,7 +68,7 @@ DeclareGlobalFunction("InvariantElementaryAbelianSeries");
 ##
 ##  <#GAPDoc Label="InducedAutomorphism">
 ##  <ManSection>
-##  <Oper Name="InducedAutomorphism" Arg='epi, aut'/>
+##  <Func Name="InducedAutomorphism" Arg='epi, aut'/>
 ##
 ##  <Description>
 ##  Let <A>aut</A> be an automorphism of a group <M>G</M> and <A>epi</A> be

lib/lierep.gd

@@ -805,7 +805,7 @@ DeclareCategory( "IsBasisOfWeightRepElementSpace", IsBasis );
 ##
 ##  <#GAPDoc Label="HighestWeightModule">
 ##  <ManSection>
-##  <Func Name="HighestWeightModule" Arg='L, wt'/>
+##  <Oper Name="HighestWeightModule" Arg='L, wt'/>
 ##
 ##  <Description>
 ##  returns the highest weight module with highest weight <A>wt</A> of the

lib/matint.gd

@@ -195,7 +195,7 @@ DeclareOperation("SmithNormalFormIntegerMatTransforms",[IsMatrix]);
 ##
 ##  <#GAPDoc Label="DiagonalizeIntMat">
 ##  <ManSection>
-##  <Oper Name="DiagonalizeIntMat" Arg='mat'/>
+##  <Func Name="DiagonalizeIntMat" Arg='mat'/>
 ##
 ##  <Description>
 ##  This function changes <A>mat</A> to its SNF.
@@ -233,7 +233,7 @@ DeclareGlobalFunction( "DiagonalizeIntMat" );
 ##
 ##  <#GAPDoc Label="NormalFormIntMat">
 ##  <ManSection>
-##  <Oper Name="NormalFormIntMat" Arg='mat, options'/>
+##  <Func Name="NormalFormIntMat" Arg='mat, options'/>
 ##
 ##  <Description>
 ##  This general operation for computation of various Normal Forms
@@ -338,7 +338,7 @@ DeclareAttribute( "BaseIntMat",
 ##
 ##  <#GAPDoc Label="BaseIntersectionIntMats">
 ##  <ManSection>
-##  <Attr Name="BaseIntersectionIntMats" Arg='m,n'/>
+##  <Oper Name="BaseIntersectionIntMats" Arg='m,n'/>
 ##
 ##  <Description>
 ##  If <A>m</A> and <A>n</A> are matrices with integral entries,
@@ -365,7 +365,7 @@ DeclareOperation( "BaseIntersectionIntMats",
 ##
 ##  <#GAPDoc Label="ComplementIntMat">
 ##  <ManSection>
-##  <Attr Name="ComplementIntMat" Arg='full, sub'/>
+##  <Oper Name="ComplementIntMat" Arg='full, sub'/>
 ##
 ##  <Description>
 ##  Let <A>full</A> be a list of integer vectors generating an integral row
@@ -522,7 +522,7 @@ DeclareAttribute( "AbelianInvariantsOfList", IsCyclotomicCollection );
 ##
 ##  <#GAPDoc Label="DeterminantIntMat">
 ##  <ManSection>
-##  <Oper Name="DeterminantIntMat" Arg='mat'/>
+##  <Func Name="DeterminantIntMat" Arg='mat'/>
 ##
 ##  <Description>
 ##  <Index Subkey="integer matrix">determinant</Index>

lib/matrix.gd

@@ -122,7 +122,7 @@ DeclareOperation("IsLowerTriangularMat",[IsMatrix]);
 ##
 ##  <#GAPDoc Label="DiagonalOfMat">
 ##  <ManSection>
-##  <Oper Name="DiagonalOfMat" Arg='mat'/>
+##  <Func Name="DiagonalOfMat" Arg='mat'/>
 ##
 ##  <Description>
 ##  returns the diagonal of the matrix <A>mat</A>. If <A>mat</A> is not a

lib/oprt.gd

@@ -1927,7 +1927,7 @@ DeclareOperation( "PermutationCycleOp",
 ##
 ##  <#GAPDoc Label="Cycle">
 ##  <ManSection>
-##  <Oper Name="Cycle" Arg='g, Omega, pnt[, act]'/>
+##  <Func Name="Cycle" Arg='g, Omega, pnt[, act]'/>
 ##
 ##  <Description>
 ##  returns a list of the points in the cycle of <A>pnt</A> under the action
@@ -1947,7 +1947,7 @@ DeclareOperation( "CycleOp", [ IsObject, IsList, IsObject, IsFunction ] );
 ##
 ##  <#GAPDoc Label="Cycles">
 ##  <ManSection>
-##  <Oper Name="Cycles" Arg='g, Omega[, act]'/>
+##  <Func Name="Cycles" Arg='g, Omega[, act]'/>
 ##
 ##  <Description>
 ##  returns a list of the cycles (as lists of points) of the action of the
@@ -1967,7 +1967,7 @@ DeclareOperation( "CyclesOp", [ IsObject, IsList, IsFunction ] );
 ##
 ##  <#GAPDoc Label="CycleLength">
 ##  <ManSection>
-##  <Oper Name="CycleLength" Arg='g, Omega, pnt[, act]'/>
+##  <Func Name="CycleLength" Arg='g, Omega, pnt[, act]'/>
 ##
 ##  <Description>
 ##  returns the length of the cycle of <A>pnt</A> under the action of the element