Skip to content

Commit

Permalink
Remove tabs in files starting with "a"
Browse files Browse the repository at this point in the history
  • Loading branch information
james-d-mitchell authored and fingolfin committed Dec 14, 2022
1 parent cd51b34 commit 86bc34d
Show file tree
Hide file tree
Showing 11 changed files with 266 additions and 265 deletions.
4 changes: 2 additions & 2 deletions lib/addgphom.gi
Original file line number Diff line number Diff line change
Expand Up @@ -31,7 +31,7 @@ local map;
IsSPMappingByFunctionRep
and IsSingleValued
and IsTotal
and IsGroupToAdditiveGroupHomomorphism ),
and IsGroupToAdditiveGroupHomomorphism ),
rec( fun:= arg[3] ) );

# inverse function given
Expand All @@ -43,7 +43,7 @@ local map;
ElementsFamily(FamilyObj(arg[2]))),
IsSPMappingByFunctionWithInverseRep
and IsBijective
and IsGroupToAdditiveGroupHomomorphism ),
and IsGroupToAdditiveGroupHomomorphism ),
rec( fun := arg[3],
invFun := arg[4] ) );

Expand Down
6 changes: 3 additions & 3 deletions lib/adjoin.gi
Original file line number Diff line number Diff line change
Expand Up @@ -142,10 +142,10 @@ end);

InstallMethod(MonoidByAdjoiningIdentity, [IsSemigroup and HasGeneratorsOfSemigroup],
function( s )
local m;
local m;
m:=Monoid(List(GeneratorsOfSemigroup(s), MonoidByAdjoiningIdentityElt));
SetUnderlyingSemigroupOfMonoidByAdjoiningIdentity(m, s);
return m;
SetUnderlyingSemigroupOfMonoidByAdjoiningIdentity(m, s);
return m;
end);

###########################################################################
Expand Down
2 changes: 1 addition & 1 deletion lib/algebra.gi
Original file line number Diff line number Diff line change
Expand Up @@ -1836,7 +1836,7 @@ InstallMethod( IsSubset,
# catch trivial case
if IsSubset(GeneratorsOfLeftOperatorRing(D1),
GeneratorsOfLeftOperatorRing(D2)) then
return true;
return true;
fi;
return IsSubset( D1, GeneratorsOverIntersection( D2,
GeneratorsOfLeftOperatorRing( D2 ),
Expand Down
46 changes: 23 additions & 23 deletions lib/algfld.gi
Original file line number Diff line number Diff line change
Expand Up @@ -78,8 +78,8 @@ function(f,p,check)

impattr:=IsAlgebraicElement and CanEasilySortElements and IsZDFRE;
fam:=NewFamily("AlgebraicElementsFamily(...)",IsAlgebraicElement,
impattr,
IsAlgebraicElementFamily and CanEasilySortElements);
impattr,
IsAlgebraicElementFamily and CanEasilySortElements);

# The two types
fam!.baseType := NewType(fam,IsAlgBFRep);
Expand Down Expand Up @@ -194,7 +194,7 @@ if Length(extra)>0 and IsString(extra[1]) then
if IsFinite(f) then
SetIsFinite(e,true);
if HasSize(f) then
SetSize(e,Size(f)^fam!.deg);
SetSize(e,Size(f)^fam!.deg);
fi;
else
SetIsNumberField(e,true);
Expand Down Expand Up @@ -501,10 +501,10 @@ local fam,b,d,i;
# and whether the vector is too short.
i:=Length(b)+1;
while i<=fam!.deg do
if not IsBound(b[i]) then
b[i]:=fam!.zeroCoefficient;
fi;
i:=i+1;
if not IsBound(b[i]) then
b[i]:=fam!.zeroCoefficient;
fi;
i:=i+1;
od;
return Objectify(fam!.extType,[b]);
fi;
Expand Down Expand Up @@ -1036,7 +1036,7 @@ local fam;
fam:=FamilyObj(elms[1]);
if ForAll(elms,i->FamilyObj(i)=fam) then
if IsBound(fam!.wholeExtension) then
return fam!.wholeExtension;
return fam!.wholeExtension;
fi;
fi;
fi;
Expand All @@ -1062,9 +1062,9 @@ local l,f,i,j,k,gens;
for j in i do
for k in j do
if not k in f then
gens:=Concatenation(gens,[k]);
f:=DefaultFieldByGenerators(gens);
fi;
gens:=Concatenation(gens,[k]);
f:=DefaultFieldByGenerators(gens);
fi;
od;
od;
od;
Expand Down Expand Up @@ -1118,14 +1118,14 @@ local coeffring, basring, theta, xind, yind, x, y, coeffs, G, c, val, k, T,
G:= Zero( basring );
for i in [ 1 .. Length( coeffs ) ] do
if IsAlgBFRep( coeffs[i] ) then
G:= G + coeffs[i]![1] * x^i;
G:= G + coeffs[i]![1] * x^i;
else
c:= coeffs[i]![1];
val:= c[1];
for j in [ 2 .. Length( c ) ] do
val:= val + c[j] * y^(j-1);
od;
G:= G + val * x^i;
c:= coeffs[i]![1];
val:= c[1];
for j in [ 2 .. Length( c ) ] do
val:= val + c[j] * y^(j-1);
od;
G:= G + val * x^i;
fi;
od;

Expand Down Expand Up @@ -1234,7 +1234,7 @@ local opt,irrfacs, coeffring, i, factors, ind, coeffs, val,
val:= coeffs[2];
coeffs:= coeffs[1];
factors:= ListWithIdenticalEntries( val,
IndeterminateOfUnivariateRationalFunction( pol ) );
IndeterminateOfUnivariateRationalFunction( pol ) );

if Length( coeffs ) = 1 then

Expand All @@ -1249,7 +1249,7 @@ local opt,irrfacs, coeffring, i, factors, ind, coeffs, val,
# The polynomial is a linear polynomial times a power of the indet.
factors[1]:= coeffs[2] * factors[1];
factors[ val+1 ]:= LaurentPolynomialByExtRepNC( FamilyObj( pol ),
[coeffs[1] / coeffs[2], One(coeffring)],0,ind );
[coeffs[1] / coeffs[2], One(coeffring)],0,ind );
StoreFactorsPol( coeffring, pol, factors );
PopOptions();
return factors;
Expand Down Expand Up @@ -1279,9 +1279,9 @@ local opt,irrfacs, coeffring, i, factors, ind, coeffs, val,
Add( factors, factor );
q:= Quotient( R, g, factor );
while q <> fail do
Add( factors, factor );
g:= q;
q:= Quotient( R, g, factor );
Add( factors, factor );
g:= q;
q:= Quotient( R, g, factor );
od;
od;
fi;
Expand Down
42 changes: 21 additions & 21 deletions lib/alghom.gi
Original file line number Diff line number Diff line change
Expand Up @@ -63,8 +63,8 @@ InstallMethod( AlgebraGeneralMappingByImages,
function( S, R, gens, imgs )

local map, # general mapping from <S> to <R>, result
filter,
i,basic;
filter,
i,basic;

# Handle the case that `gens' is a basis or empty.
# We can form a left module general mapping directly.
Expand All @@ -89,22 +89,22 @@ InstallMethod( AlgebraGeneralMappingByImages,

# type setting
filter:=IsSPGeneralMapping
and IsAlgebraGeneralMapping
and IsAlgebraGeneralMappingByImagesDefaultRep;
and IsAlgebraGeneralMapping
and IsAlgebraGeneralMappingByImagesDefaultRep;

#special case: test whether polynomial ring is mapped via 1 and free
#generators
if IsPolynomialRing(S) then
basic:=ForAll(imgs,x->ForAll(imgs,y->x*y=y*x));
for i in [1..Length(gens)] do
if IsOne(gens[i]) then
if not IsOne(imgs[i]) then basic:=false;fi;
elif not gens[i] in IndeterminatesOfPolynomialRing(S) then
basic:=false;
fi;
if IsOne(gens[i]) then
if not IsOne(imgs[i]) then basic:=false;fi;
elif not gens[i] in IndeterminatesOfPolynomialRing(S) then
basic:=false;
fi;
od;
if basic=true then
filter:=filter and IsPolynomialRingDefaultGeneratorMapping;
filter:=filter and IsPolynomialRingDefaultGeneratorMapping;
fi;
fi;

Expand Down Expand Up @@ -215,7 +215,7 @@ InstallMethod( AlgebraHomomorphismByFunction,
[ IsAlgebra, IsAlgebra, IsFunction ],
function( A, B, f )
return Objectify( TypeOfDefaultGeneralMapping( A, B,
IsSPMappingByFunctionRep and IsAlgebraHomomorphism ), rec(fun:=f) );
IsSPMappingByFunctionRep and IsAlgebraHomomorphism ), rec(fun:=f) );
end);

InstallMethod(AlgebraWithOneHomomorphismByFunction,
Expand All @@ -224,7 +224,7 @@ InstallMethod(AlgebraWithOneHomomorphismByFunction,
[ IsAlgebraWithOne, IsAlgebraWithOne, IsFunction ],
function( A, B, f )
return Objectify( TypeOfDefaultGeneralMapping( A, B,
IsSPMappingByFunctionRep and IsAlgebraWithOneHomomorphism ),
IsSPMappingByFunctionRep and IsAlgebraWithOneHomomorphism ),
rec(fun:=f) );
end);

Expand Down Expand Up @@ -254,8 +254,8 @@ function( map )
local mapi;
mapi:=MappingGeneratorsImages(map);
Print( "AlgebraWithOneHomomorphismByImages( ",
Source( map ), ", ", Range( map ), ", ",
mapi[1], ", ", mapi[2], " )" );
Source( map ), ", ", Range( map ), ", ",
mapi[1], ", ", mapi[2], " )" );
end );

InstallMethod( PrintObj, "for an algebra hom. b.i.", true,
Expand All @@ -265,8 +265,8 @@ function( map )
local mapi;
mapi:=MappingGeneratorsImages(map);
Print( "AlgebraHomomorphismByImages( ",
Source( map ), ", ", Range( map ), ", ",
mapi[1], ", ", mapi[2], " )" );
Source( map ), ", ", Range( map ), ", ",
mapi[1], ", ", mapi[2], " )" );
end );

InstallMethod( PrintObj, "for an algebra-with-one g.m.b.i", true,
Expand All @@ -276,8 +276,8 @@ function( map )
local mapi;
mapi:=MappingGeneratorsImages(map);
Print( "AlgebraWithOneGeneralMappingByImages( ",
Source( map ), ", ", Range( map ), ", ",
mapi[1], ", ", mapi[2], " )" );
Source( map ), ", ", Range( map ), ", ",
mapi[1], ", ", mapi[2], " )" );
end );

InstallMethod( PrintObj, "for an algebra g.m.b.i", true,
Expand All @@ -287,8 +287,8 @@ function( map )
local mapi;
mapi:=MappingGeneratorsImages(map);
Print( "AlgebraGeneralMappingByImages( ",
Source( map ), ", ", Range( map ), ", ",
mapi[1], ", ", mapi[2], " )" );
Source( map ), ", ", Range( map ), ", ",
mapi[1], ", ", mapi[2], " )" );
end );


Expand Down Expand Up @@ -662,7 +662,7 @@ InstallMethod( CompositionMapping2,
local comp, # composition of <map2> and <map1>, result
gens,
genimages,
mapi1,mapi2;
mapi1,mapi2;

mapi1:=MappingGeneratorsImages(map1);
mapi2:=MappingGeneratorsImages(map2);
Expand Down
17 changes: 9 additions & 8 deletions lib/alglie.gi
Original file line number Diff line number Diff line change
Expand Up @@ -1141,7 +1141,7 @@ InstallMethod( PthPowerImage,

InstallMethod( PthPowerImage, "for an element of a restricted Lie algebra",
[ IsJacobianElement ], # weaker filter, we maybe only discovered later
# that the algebra is restricted
# that the algebra is restricted
function(x)
local fam;
fam := FamilyObj(x);
Expand All @@ -1157,7 +1157,7 @@ InstallMethod( PthPowerImage, "for an element of a restricted Lie algebra and an
if not IsBound(fam!.pMapping) then TryNextMethod(); fi;
while n>0 do
x := PTHPOWERIMAGE_PPI_VEC(fam!.fullSCAlgebra,fam!.zerocoeff,Characteristic(fam),fam!.basisVectors,fam!.pMapping,ExtRepOfObj(x),x);
n := n-1;
n := n-1;
od;
return x;
end);
Expand All @@ -1168,10 +1168,10 @@ InstallMethod( PClosureSubalgebra, "for a subalgebra of restricted jacobian elem
local i, p, oldA;

repeat
oldA := A;
oldA := A;
for i in Basis(oldA) do
A := ClosureLeftModule(A,PthPowerImage(i));
od;
A := ClosureLeftModule(A,PthPowerImage(i));
od;
until A=oldA;
return A;
end);
Expand Down Expand Up @@ -3748,13 +3748,14 @@ InstallGlobalFunction( FreeLieAlgebra, function( arg )
z := Concatenation(x[1],y[1]);
if z<y[1] and x[1]<y[1] and (x[2]=fail or x[2]>=y[1]) then
Add(B[d],[z,y[1],x[3]*y[3]]);

fi;
od; od;
od;
od;
if degree<1 then B := []; else B := B[degree]; fi;
return FreeLeftModule( R, List( B,
p->ElementOfMagmaRing( F, zero, [ one ], [ p[3] ] )), Zero(L));
p->ElementOfMagmaRing( F, zero, [ one ], [ p[3] ] )), Zero(L));
end) );
# Return the ring.
return L;
Expand Down Expand Up @@ -3892,9 +3893,9 @@ InstallMethod( NormalizedElementOfMagmaRingModuloRelations,
fi;
od;

if u[1]=u[2] then
if u[1]=u[2] then
# the whole expression `s' reduces to zero.
ll:= Filtered([1..Length(todo)], x->x<>k);
ll:= Filtered([1..Length(todo)], x->x<>k);
todo:= todo{ll};
else
if Flat([u[1]]) > Flat([u[2]]) then
Expand Down
6 changes: 3 additions & 3 deletions lib/algliess.gi
Original file line number Diff line number Diff line change
Expand Up @@ -1269,7 +1269,7 @@ SimpleLieAlgebraTypeM := function (n, F)
WBracket, # The commutator of two elements of WBasis
# w.r.t. WProduct.
degrees, # The list of degrees of different components.
GradingFunction, # The function giving the grading components.
GradingFunction, # The function giving the grading components.
tildify, clean, # Utility functions.
table, i, w1, j, w2, result, term, prod, x2, x1, d;
# Temporary results and counters.
Expand Down Expand Up @@ -1588,8 +1588,8 @@ SimpleLieAlgebraTypeM := function (n, F)
# end;
# SetGrading (result,
# rec (min_degree := -3,
# max_degree := 3 * (5^n1 + 5^n2) - 7,
# source := Integers,
# max_degree := 3 * (5^n1 + 5^n2) - 7,
# source := Integers,
# hom_components := GradingFunction));

return result;
Expand Down
2 changes: 1 addition & 1 deletion lib/algmat.gi
Original file line number Diff line number Diff line change
Expand Up @@ -1121,7 +1121,7 @@ InstallGlobalFunction( FullMatrixAlgebraCentralizer, function( F, lst )
if len = 0 then
Error( "cannot compute the centralizer of an empty set" );
elif not (IsSubset( F, DefaultScalarDomainOfMatrixList( lst ) ) or
IsSubset( F, FieldOfMatrixList( lst ) ) ) then
IsSubset( F, FieldOfMatrixList( lst ) ) ) then
Error( "not all entries of the matrices in <lst> lie in <F>" );
fi;

Expand Down
14 changes: 7 additions & 7 deletions lib/algsc.gi
Original file line number Diff line number Diff line change
Expand Up @@ -243,21 +243,21 @@ InstallMethod( String,
zero:= Zero( elm[1] );

if elm[ depth ] <> one then
Add(s,'(');
Append(s,String(elm[ depth ]));
Append(s, ")*" );
Add(s,'(');
Append(s,String(elm[ depth ]));
Append(s, ")*" );
fi;
Append(s, names[ depth ] );

for i in [ depth+1 .. len ] do
if elm[i] <> zero then
Add(s, '+' );
if elm[i] <> one then
Add(s,'(');
Append(s,String(elm[ i ]));
Append(s, ")*" );
Add(s,'(');
Append(s,String(elm[ i ]));
Append(s, ")*" );
fi;
Append(s, names[ i ] );
Append(s, names[ i ] );
fi;
od;

Expand Down
2 changes: 1 addition & 1 deletion lib/arith.gd
Original file line number Diff line number Diff line change
Expand Up @@ -1533,7 +1533,7 @@ DeclareOperationKernel( "AdditiveInverseSameMutability",
#O `<elm1>-<elm2>' . . . . . . . . . . . . . . . difference of two elements
##
DeclareOperationKernel( "-",
[ IsExtAElement, IsNearAdditiveElementWithInverse ], DIFF );
[ IsExtAElement, IsNearAdditiveElementWithInverse ], DIFF );


#############################################################################
Expand Down
Loading

0 comments on commit 86bc34d

Please sign in to comment.