Replace Length(Filtered(...)) by Number(...)

doc/ref/testconsistency.g

@@ -109,7 +109,7 @@ for elt in x do
         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
+        if Number( 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;

lib/clas.gi

@@ -761,7 +761,7 @@ local rcls, cl, mark, rep, c, o, cop, same, sub, pow, p, i, j,closure,
   rcls:=[];
   cl:=ConjugacyClasses(G);
 
-  if Length(Filtered(cl,x->Size(x)<10))<10000 then
+  if Number(cl,x->Size(x)<10)<10000 then
     # trigger for cheap element test
     for i in [1..Length(cl)] do
       if Size(cl[i])<10 then AsSSortedList(cl[i]);fi;

lib/ctblauto.gi

@@ -509,7 +509,7 @@ InstallMethod( MatrixAutomorphisms,
     Info( InfoMatrix, 2,
           "MatAutomorphisms: There are ", Length( permutations ),
           " families (",
-          Length( Filtered( permutations, x -> Length(x) =1 ) ),
+          Number( permutations, x -> Length(x) =1 ),
           " trivial)" );
 
     for i in [ 1 .. Length( famreps ) ] do

lib/ctblpope.gi

@@ -1494,7 +1494,7 @@ InstallGlobalFunction( PermCandidates,
 
     Info( InfoCharacterTable, 2,
           "PermCandidates: unique columns erased, there are ",
-          Length( Filtered( nonzerocol, x -> x ) ), " columns left,\n",
+          Number( nonzerocol, x -> x ), " columns left,\n",
           "#I    the number of constituents is ", Length( matrix ), "." );
 
     # step 3: collapse
@@ -2018,8 +2018,8 @@ InstallGlobalFunction( PermCandidatesFaithful,
           "PermCandidatesFaithful: There are ",
           Length( matrix ), " possible constituents,\n",
           "#I    the number of unknown values is ",
-          Length( Filtered( [ 1 .. nccl ],
-                  x -> not IsBound( faithful[x] ) ) ),
+          Number( [ 1 .. nccl ],
+                  x -> not IsBound( faithful[x] ) ),
           ";\n",
           "#I    now trying to collapse the matrix" );
 

lib/grp.gi

@@ -4528,7 +4528,7 @@ function( g )
         return [ g ];
     else
         p := f[1];
-        x := Length( Filtered( f, y -> y = p ) );
+        x := Number( f, y -> y = p );
         q := p ^ x;
         r := o / q;
         gcd := Gcdex ( q, r );
@@ -4553,7 +4553,7 @@ function( g, p )
     if o = 1 then return g; fi;
 
     f := FactorsInt( o );
-    x := Length( Filtered( f, x -> x = p ) );
+    x := Number( f, x -> x = p );
     if x = 0 then return g^o; fi;
 
     q := p ^ x;

lib/randiso2.gi

@@ -155,7 +155,7 @@ SplitUpSublistsByFpFunc := function( list )
       fi;
    od;
    Info( InfoRandIso, 2, "   Iso: found ", Length(result)," classes incl. ",
-          Length( Filtered( result, IsRecord ) )," unique groups");
+          Number( result, IsRecord )," unique groups");
    return result;
 end;
 

tst/testinstall/pgroups.tst

@@ -191,16 +191,16 @@ true
 gap> IsPowerfulPGroup(H);
 true
 gap> myList:=AllSmallGroups(5^4);;
-gap> Length(Filtered(myList,g->IsPowerfulPGroup(g)));
+gap> Number(myList,g->IsPowerfulPGroup(g));
 9
 gap> newList:=AllSmallGroups(5^4);;
 gap> for g in newList do
 > RankPGroup(g);
 > Agemo(g,5);
 > od;
-gap> Length(Filtered(newList,g->IsPowerfulPGroup(g)));
+gap> Number(newList,g->IsPowerfulPGroup(g));
 9
 gap> myList:=AllSmallGroups(2^4);;
-gap> Length(Filtered(myList,g->IsPowerfulPGroup(g)));
+gap> Number(myList,g->IsPowerfulPGroup(g));
 6
 gap> STOP_TEST("pgroups.tst", 1);