Skip to content

removing files superceded by utils0-.tst #108

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
cdwensley wants to merge 3 commits into
base: master
Choose a base branch
from
Open

removing files superceded by utils0-.tst #108

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
7e47c83
removing files superceded by utils0-.tst
cdwensley Sep 1, 2026
17417f4
fixed unintended change in iterator.xml
cdwensley Sep 1, 2026
08c131b
fixed minor problem in groups test
cdwensley Sep 2, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
23 changes: 10 additions & 13 deletions doc/groups.xml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -401,24 +401,21 @@ The first of these is the zero map, the last is the identity.
<P/>
<Example><![CDATA[
gap> gens := [ (1,2,3,4), (1,2)(3,4) ];;
gap> d8 := Group( gens );;
gap> SetName( d8, "d8" );
gap> d8 := Group( gens );; SetName( d8, "d8" );
gap> c2 := Subgroup( d8, [ (2,4) ] );;
gap> SortedList( IdempotentEndomorphismsWithImage( gens, c2 ) );
[ [ (), (2,4) ], [ (2,4), () ] ]
gap> data:= IdempotentEndomorphismsData( d8 );;
gap> data.images[1];
[ [ (), () ] ]
gap> List( data.images, Length );
[ 1, 2, 2, 2, 2, 1 ]
gap> Length( data.images );
6
gap> all:= IdempotentEndomorphisms( d8 );;
gap> Length( all );
10
gap> all[1];
[ (1,2,3,4), (1,2)(3,4) ] -> [ (), () ]
gap> Size( Image( all[1] ) );
1
gap> Last( all ) = IdentityMapping( d8 );
gap> allim := List( all, m -> MappingGeneratorsImages(m)[2] );;
gap> ## the list of 10 sets of images sorted:
gap> allimpairs :=
> [ [ (), () ], [ (), (2,4) ], [ (2,4), () ], [ (), (1,3) ], [ (1,3), () ],
> [ (), (1,2)(3,4) ], [ (1,2)(3,4), (1,2)(3,4) ], [ (), (1,4)(2,3) ],
> [ (1,4)(2,3), (1,4)(2,3) ], [ (1,2,3,4), (1,2)(3,4) ] ];;
gap> ForAll( allim, m -> ( m in allimpairs ) );
true
]]></Example>
</Description>
Expand Down
25 changes: 24 additions & 1 deletion doc/iterator.xml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
<!-- -->
<!-- iterator.xml Utils documentation -->
<!-- -->
<!-- Copyright (C) 2015-2019, The GAP Group -->
<!-- Copyright (C) 2015-2026, The GAP Group -->
<!-- -->
<!-- ------------------------------------------------------------------- -->

Expand Down Expand Up @@ -54,6 +54,11 @@ gap> AllIsomorphisms( G, s3 );
gap> iter := AllIsomorphismsIterator( G, s3 );;
gap> for h in iter do Print( ImageElm( h, G.1 ) = (6,7), ", " ); od;
true, false, false, true, false, false,
gap> s4 := Group( (1,2),(2,3),(3,4) );;
gap> AllIsomorphismsNumber( s3, s4 );
0
gap> AllIsomorphisms( s3, s4 );
[ ]
]]></Example>
</Description>
</ManSection>
Expand Down Expand Up @@ -156,6 +161,24 @@ gap> NextIterator( pairs4 );
gap> IsDoneIterator( pairs4 );
true
]]></Example>

Some trivial cases:
<Example><![CDATA[
gap> iter0 := IteratorList( [ ] );;
gap> iter4 := IteratorList( [ 4 ] );;
gap> cart := CartesianIterator( iter0, iter0 );;
gap> IsDoneIterator( cart );
true
gap> cart := CartesianIterator( iter0, iter4 );;
gap> IsDoneIterator( cart );
true
gap> cart := CartesianIterator( iter4, iter0 );;
gap> IsDoneIterator( cart );
true
gap> pairs0 := UnorderedPairsIterator( iter0 );;
gap> IsDoneIterator( pairs0 );
true
]]></Example>
</Description>
</ManSection>

Expand Down
10 changes: 9 additions & 1 deletion doc/matrix.xml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
<!-- -->
<!-- matrix.xml Utils documentation -->
<!-- -->
<!-- Copyright (C) 2023, The GAP Group -->
<!-- Copyright (C) 2015-2026, The GAP Group -->
<!-- -->
<!-- ------------------------------------------------------------------- -->

Expand Down Expand Up @@ -83,6 +83,14 @@ gap> Display( M8 );
gap> L8 := DirectSumDecompositionMatrices( M8 );;
gap> Length( L8 );
16

gap> M3 := [ [0,0,7,0,0,0,0], [0,0,0,8,0,0,0], [0,0,0,0,9,0,0] ];;
gap> Display( M3 );
[ [ 0, 0, 7, 0, 0, 0, 0 ],
[ 0, 0, 0, 8, 0, 0, 0 ],
[ 0, 0, 0, 0, 9, 0, 0] ]
gap> L3 := DirectSumDecompositionMatrices( M3 );
[ [ [ [ 0, 0, 7 ] ], [ [ 8 ] ], [ [ 9, 0, 0 ] ] ] ]
]]></Example>
<P/>

Expand Down
3 changes: 3 additions & 0 deletions tst/gslp.tst
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,6 +5,9 @@
##
#Y Copyright (C) 2026, The GAP Group
##
##
## some tests other than those in the manual

gap> START_TEST( "gslp.tst" );

#
Expand Down
100 changes: 0 additions & 100 deletions tst/iterator.tst
View file
Open in desktop

This file was deleted.

109 changes: 0 additions & 109 deletions tst/lists.tst
View file
Open in desktop

This file was deleted.

24 changes: 24 additions & 0 deletions tst/manual.g
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
## utils.g
LoadPackage("utils");
Print( "running utils01.tst\n" );
Test( "tst/utils01.tst", rec(compareFunction := "uptowhitespace") );
Print( "running utils02.tst\n" );
Test( "tst/utils02.tst", rec(compareFunction := "uptowhitespace") );
Print( "running utils03.tst\n" );
Test( "tst/utils03.tst", rec(compareFunction := "uptowhitespace") );
Print( "running utils04.tst\n" );
Test( "tst/utils04.tst", rec(compareFunction := "uptowhitespace") );
Print( "running utils05.tst\n" );
Test( "tst/utils05.tst", rec(compareFunction := "uptowhitespace") );
Print( "running utils06.tst\n" );
Test( "tst/utils06.tst", rec(compareFunction := "uptowhitespace") );
Print( "running utils07.tst\n" );
Test( "tst/utils07.tst", rec(compareFunction := "uptowhitespace") );
Print( "running utils08.tst\n" );
Test( "tst/utils08.tst", rec(compareFunction := "uptowhitespace") );
Print( "running utils09.tst\n" );
Test( "tst/utils09.tst", rec(compareFunction := "uptowhitespace") );
Print( "running utils10.tst\n" );
Test( "tst/utils10.tst", rec(compareFunction := "uptowhitespace") );
Print( "running utils11.tst\n" );
Test( "tst/utils11.tst", rec(compareFunction := "uptowhitespace") );
Loading