/usr/share/gap/lib/transatl.g is in gap-libs 4r7p9-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 | #############################################################################
##
#W transatl.g GAP library Alexander Hulpke
##
##
#Y Copyright (C) 2005 The GAP Group
##
## This file contains synonym declarations for function sthat are spelled
## differently on different sides of the Atlantic, such as
## `Stabilizer/Stabiliser' and `Solvable/Soluble'.
##
#############################################################################
##
#F Transatlantic(name)
##
## Declare a synonym for the name according as it would be on the other
## side of the Atlantic Ocean.
BindGlobal("Transatlantic",function(arg)
local fct,attr,name,new,p;
fct := arg[1];
if Length(arg) > 1 then
attr:=arg[2];
else
attr:=false;
fi;
name:=NameFunction(fct);
new:=ShallowCopy(name);
p:=PositionSublist(name,"lizer");
if p<>fail then
new:=ShallowCopy(name);
new[p+2]:='s';
fi;
p:=PositionSublist(name,"liser");
if p<>fail then
new:=ShallowCopy(name);
new[p+2]:='z';
fi;
p:=PositionSublist(name,"olvable");
if p<>fail then
new:=ReplacedString(name,"olvable","oluble");
fi;
p:=PositionSublist(name,"oluble");
if p<>fail then
new:=ReplacedString(name,"oluble","olvable");
fi;
p:=PositionSublist(name,"enter");
if p<>fail then
new:=ReplacedString(name,"enter","entre");
fi;
p:=PositionSublist(name,"entre");
if p<>fail then
new:=ReplacedString(name,"entre","enter");
fi;
if attr then
DeclareSynonymAttr(new,fct);
else
DeclareSynonym(new,fct);
fi;
end);
# the following list is taken from gd files. It is possible that functions
# are defined in .gi files whose names do not get translated.
Transatlantic(ApproximateSuborbitsStabilizerPermGroup);
Transatlantic(Centralizer);
Transatlantic(CentralizerOp);
Transatlantic(CentralizerInParent);
Transatlantic(CentralizerInFiniteDimensionalAlgebra);
Transatlantic(CentralizerInGLnZ);
Transatlantic(CentralizerModulo);
Transatlantic(CentralizerNormalCSPG);
Transatlantic(CentralizerNormalTransCSPG);
Transatlantic(CentralizerSizeLimitConsiderFunction);
Transatlantic(CentralizerTransSymmCSPG);
Transatlantic(CentralizerWreath);
Transatlantic(ClassesSolvableGroup);
Transatlantic(ComplementClassesRepresentativesSolvableNC);
Transatlantic(CONextCentralizer);
Transatlantic(EpimorphismSolvableQuotient);
Transatlantic(ExternalOrbitsStabilizers);
Transatlantic(FullMatrixAlgebraCentralizer);
Transatlantic(GaloisStabilizer);
#Transatlantic(InfoPcNormalizer);
Transatlantic(InsertTrivialStabilizer);
Transatlantic(IsConjugacyClassSubgroupsByStabilizerRep);
Transatlantic(IsExternalOrbitByStabilizerRep);
Transatlantic(IsFixedStabilizer);
Transatlantic(IsLieSolvable);
Transatlantic(IsPSolvable);
Transatlantic(IsSolvableGroup);
Transatlantic(IsSolvableTom);
Transatlantic(LieCentralizer);
Transatlantic(LieCentralizerInParent);
Transatlantic(LieNormalizer);
Transatlantic(LieNormalizerInParent);
Transatlantic(LieSolvableRadical);
Transatlantic(Normalizer);
Transatlantic(NormalizerOp);
Transatlantic(NormalizerInParent);
Transatlantic(NormalizerInGLnZ);
Transatlantic(NormalizerInGLnZBravaisGroup);
Transatlantic(NormalizerStabCSPG);
Transatlantic(NormalizersTom);
Transatlantic(NormalizerTom);
Transatlantic(OrbitStabilizer);
Transatlantic(OrbitStabilizerAlgorithm);
Transatlantic(PartitionStabilizerPermGroup);
Transatlantic(Pcgs_OrbitStabilizer);
Transatlantic(Pcgs_OrbitStabilizer_Blist);
Transatlantic(Pcs_OrbitStabilizer);
Transatlantic(RationalClassesSolvableGroup);
Transatlantic(SolvableNormalClosurePermGroup);
Transatlantic(SolvableQuotient);
Transatlantic(Stabilizer);
Transatlantic(StabilizerFunc);
Transatlantic(StabilizerOfBlockNC);
Transatlantic(StabilizerOfExternalSet);
Transatlantic(StabilizerOp);
Transatlantic(StabilizerPcgs);
Transatlantic(SubgroupsOrbitsAndNormalizers);
Transatlantic(SubgroupsSolvableGroup);
Transatlantic(VerifyStabilizer);
# optional args:
# list of names to check (default NamesGVars()),
# list of pairs to substitute
BindGlobal("CheckSynonyms", function(arg)
local pairs, a, p2, allnames, md, mnd, nid, ok, d, nd, pos, n2, doc, p, n;
# default pairs to check
pairs := [ [ "lizer", "liser" ],
[ "enter", "entre" ],
[ "Solvable", "Soluble" ],
];
# default names to check
allnames := NamesGVars();
# can be overwritten by arguments
for a in arg do
if IsList(a) and ForAll(a, IsString) then
allnames := a;
fi;
if IsList(a) and ForAll(a, b-> IsList(b) and ForAll(b, IsString)) then
pairs := ShallowCopy(a);
fi;
od;
# only consider bound names
allnames := Set(Filtered(allnames, IsBoundGlobal));
# add lowercase pairs and interchanged pairs
for p in pairs do
p2 := List(p, LowercaseString);
if not p2 in pairs then
Add(pairs, p2);
fi;
od;
Append(pairs, List(pairs, p-> [p[2], p[1]]));
md := [];
mnd := [];
nid := [];
ok := [];
d := [];
nd := [];
for p in pairs do
Print("Checking pair ", p, "\n");
for n in allnames do
pos := PositionSublist(n, p[1]);
if pos <> fail then
n2 := SubstitutionSublist(n, p[1], p[2]);
doc := List([n,n2], IsDocumentedWord);
if not n2 in allnames then
if doc = [false, false] then
Add(mnd, [n,n2]);
else
Add(md, [n,n2]);
fi;
else
if not IsIdenticalObj(ValueGlobal(n), ValueGlobal(n2)) then
Add(nid, [n, n2]);
else
if doc = [true, true] then
AddSet(ok, Set([n,n2]));
elif doc = [false, false] then
Add(nd, [n, n2]);
elif IsSet([n,n2]) then
Add(d, [n, n2]);
fi;
fi;
fi;
fi;
od;
od;
if Length(nid) > 0 then
Print("\nThese should be synonyms but have non-identical values:\n");
for p in nid do
Print(" ",p[1]," / ",p[2],"\n");
od;
fi;
if Length(md) > 0 then
Print("\nDocumented variables with missing synonym:\n");
for p in md do
Print(" ",p[1]," / ",p[2],"\n");
od;
fi;
if Length(d) > 0 then
Print("\nOne of these synonyms is not documented:\n");
for p in d do
Print(" ",p[1]," / ",p[2],"\n");
od;
fi;
if Length(nd) > 0 then
Print("\nSynonyms without documentation:\n");
for p in nd do
Print(" ",p[1]," / ",p[2],"\n");
od;
fi;
if Length(mnd) > 0 then
Print("\nUndocumented variables with missing synonym:\n");
for p in mnd do
Print(" ",p[1]," / ",p[2],"\n");
od;
fi;
if Length(ok) > 0 then
Print("\nOK, synonyms which are both documented:\n");
for p in ok do
Print(" ",p[1]," / ",p[2],"\n");
od;
fi;
end);
|