diff --git a/doc/groups.xml b/doc/groups.xml index e253ca7..35f0cf2 100644 --- a/doc/groups.xml +++ b/doc/groups.xml @@ -401,24 +401,21 @@ The first of these is the zero map, the last is the identity.

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 ]]> diff --git a/doc/iterator.xml b/doc/iterator.xml index 9eba053..ea4589a 100644 --- a/doc/iterator.xml +++ b/doc/iterator.xml @@ -2,7 +2,7 @@ - + @@ -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 ); +[ ] ]]> @@ -156,6 +161,24 @@ gap> NextIterator( pairs4 ); gap> IsDoneIterator( pairs4 ); true ]]> + +Some trivial cases: + 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 +]]> diff --git a/doc/matrix.xml b/doc/matrix.xml index 13f7433..894c044 100644 --- a/doc/matrix.xml +++ b/doc/matrix.xml @@ -2,7 +2,7 @@ - + @@ -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 ] ] ] ] ]]>

diff --git a/tst/gslp.tst b/tst/gslp.tst index 5d4f7bf..b2ec1a9 100644 --- a/tst/gslp.tst +++ b/tst/gslp.tst @@ -5,6 +5,9 @@ ## #Y Copyright (C) 2026, The GAP Group ## +## +## some tests other than those in the manual + gap> START_TEST( "gslp.tst" ); # diff --git a/tst/iterator.tst b/tst/iterator.tst deleted file mode 100644 index 36a8799..0000000 --- a/tst/iterator.tst +++ /dev/null @@ -1,100 +0,0 @@ -#@local c3c3, cart, G, h, it1, it2, iter, iter0, iter4, iterL -#@local L, n, pairs0, pairs4, pairsL, s3, s4 - -############################################################################## -## -#W iterator.tst Utils Package -## -#Y Copyright (C) 2015-2022, The GAP Group -## - -gap> ReadPackage( "utils", "tst/loadall.g" );; -gap> UtilsLoadingComplete; -true - -## SubSection 7.1.1 -gap> G := DihedralGroup(6);; -gap> s3 := Group( (5,6), (6,7) );; -gap> iter := AllIsomorphismsIterator( G, s3 );; -gap> NextIterator( iter ); -[ f1, f2 ] -> [ (6,7), (5,6,7) ] -gap> n := AllIsomorphismsNumber( G, s3 ); -6 -gap> AllIsomorphisms( G, s3 ); -[ [ f1, f2 ] -> [ (6,7), (5,6,7) ], [ f1, f2 ] -> [ (5,7), (5,6,7) ], - [ f1, f2 ] -> [ (5,6), (5,7,6) ], [ f1, f2 ] -> [ (6,7), (5,7,6) ], - [ f1, f2 ] -> [ (5,7), (5,7,6) ], [ f1, f2 ] -> [ (5,6), (5,6,7) ] ] -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 ); -[ ] - -## SubSection 7.1.2 -gap> c3c3 := Group( (1,2,3), (4,5,6) );; -gap> iter := AllSubgroupsIterator( c3c3 ); - -gap> while not IsDoneIterator(iter) do Print(NextIterator(iter),"\n"); od; -Group( () ) -Group( [ (4,5,6) ] ) -Group( [ (1,2,3) ] ) -Group( [ (1,2,3)(4,5,6) ] ) -Group( [ (1,3,2)(4,5,6) ] ) -Group( [ (4,5,6), (1,2,3) ] ) - -## Subsection 7.2.1 -gap> it1 := Iterator( [ 1, 2, 3 ] );; -gap> it2 := Iterator( [ 4, 5, 6 ] );; -gap> iter := CartesianIterator( it1, it2 );; -gap> while not IsDoneIterator(iter) do Print(NextIterator(iter),"\n"); od; -[ 1, 4 ] -[ 1, 5 ] -[ 1, 6 ] -[ 2, 4 ] -[ 2, 5 ] -[ 2, 6 ] -[ 3, 4 ] -[ 3, 5 ] -[ 3, 6 ] -gap> ## try some trivial cases -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 - -## Subsection 6.2.2 -gap> L := [6,7,8,9];; -gap> iterL := IteratorList( L );; -gap> pairsL := UnorderedPairsIterator( iterL );; -gap> while not IsDoneIterator(pairsL) do Print(NextIterator(pairsL),"\n"); od; -[ 6, 6 ] -[ 6, 7 ] -[ 7, 7 ] -[ 6, 8 ] -[ 7, 8 ] -[ 8, 8 ] -[ 6, 9 ] -[ 7, 9 ] -[ 8, 9 ] -[ 9, 9 ] -gap> iter4 := IteratorList( [ 4 ] ); - -gap> pairs4 := UnorderedPairsIterator(iter4); - -gap> NextIterator( pairs4 ); -[ 4, 4 ] -gap> IsDoneIterator( pairs4 ); -true -gap> pairs0 := UnorderedPairsIterator( iter0 );; -gap> IsDoneIterator( pairs0 ); -true diff --git a/tst/lists.tst b/tst/lists.tst deleted file mode 100644 index 6407a69..0000000 --- a/tst/lists.tst +++ /dev/null @@ -1,109 +0,0 @@ -#@local C, c4, d16, gens, i, J, K, L, n, P, trans - -############################################################################## -## -#W lists.tst Utils Package -## -#Y Copyright (C) 2015-2022, The GAP Group -## - -gap> ReadPackage( "utils", "tst/loadall.g" );; -gap> UtilsLoadingComplete; -true - -## SubSection 3.1.1 -gap> List( [1..12], n->n^3 ); -[ 1, 8, 27, 64, 125, 216, 343, 512, 729, 1000, 1331, 1728 ] -gap> DifferencesList( last ); -[ 7, 19, 37, 61, 91, 127, 169, 217, 271, 331, 397 ] -gap> DifferencesList( last ); -[ 12, 18, 24, 30, 36, 42, 48, 54, 60, 66 ] -gap> DifferencesList( last ); -[ 6, 6, 6, 6, 6, 6, 6, 6, 6 ] -gap> L := [ 0 ];; -gap> DifferencesList( L ); -[ ] -gap> L := [ ];; -gap> DifferencesList( L ); -[ ] - -## SubSection 3.1.2 -gap> List( [0..10], n -> Factorial(n) ); -[ 1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800 ] -gap> QuotientsList( last ); -[ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ] -gap> L := [ 1, 3, 5, -1, -3, -5 ];; -gap> QuotientsList( L ); -[ 3, 5/3, -1/5, 3, 5/3 ] -gap> FloatQuotientsList( L ); -[ 3., 1.66667, -0.2, 3., 1.66667 ] -gap> QuotientsList( [ 2, 1, 0, -1, -2 ] ); -[ 1/2, 0, fail, 2 ] -gap> FloatQuotientsList( [1..10] ); -[ 2., 1.5, 1.33333, 1.25, 1.2, 1.16667, 1.14286, 1.125, 1.11111 ] -gap> Product( last ); -10. - -## SubSection 3.1.3 -gap> L := [1..20];; L[1]:=13;; -gap> for i in [1..19] do -> if IsOddInt(L[i]) then L[i+1]:=3*L[i]+1; else L[i+1]:=L[i]/2; fi; -> od; -gap> L; -[ 13, 40, 20, 10, 5, 16, 8, 4, 2, 1, 4, 2, 1, 4, 2, 1, 4, 2, 1, 4 ] -gap> SearchCycle( L ); -[ 1, 4, 2 ] -gap> n := 1;; L := [n];; -gap> for i in [1..100] do n:=(n^2+1) mod 1093; Add(L,n); od; -gap> L; -[ 1, 2, 5, 26, 677, 363, 610, 481, 739, 715, 795, 272, 754, 157, 604, 848, - 1004, 271, 211, 802, 521, 378, 795, 272, 754, 157, 604, 848, 1004, 271, - 211, 802, 521, 378, 795, 272, 754, 157, 604, 848, 1004, 271, 211, 802, 521, - 378, 795, 272, 754, 157, 604, 848, 1004, 271, 211, 802, 521, 378, 795, 272, - 754, 157, 604, 848, 1004, 271, 211, 802, 521, 378, 795, 272, 754, 157, 604, - 848, 1004, 271, 211, 802, 521, 378, 795, 272, 754, 157, 604, 848, 1004, - 271, 211, 802, 521, 378, 795, 272, 754, 157, 604, 848, 1004 ] -gap> C := SearchCycle( L ); -[ 157, 604, 848, 1004, 271, 211, 802, 521, 378, 795, 272, 754 ] -gap> P := Positions( L, 157 ); -[ 14, 26, 38, 50, 62, 74, 86, 98 ] -gap> Length( C ); DifferencesList( P ); -12 -[ 12, 12, 12, 12, 12, 12, 12 ] - -## SubSection 3.1.4 -## this manual example not tested as answers vary from run to run -## gap> RandomCombination( [1..49], 6 ); -## [ 3, 5, 21, 24, 27, 31 ] - - -## SubSection 3.2.1 -gap> J := [ [1,2,3], [3,4], [3,4], [1,2,4] ];; -gap> DistinctRepresentatives( J ); -[ 1, 3, 4, 2 ] -gap> K := [ [3,4], [1,2], [2,3], [2,3,4] ];; -gap> CommonRepresentatives( J, K ); -[ [ 3, 3, 3, 1 ], [ 1, 3, 4, 2 ] ] -gap> d16 := DihedralGroup( IsPermGroup, 16 ); SetName( d16, "d16" ); -Group([ (1,2,3,4,5,6,7,8), (2,8)(3,7)(4,6) ]) -gap> c4 := Subgroup( d16, [ d16.1^2 ] ); SetName( c4, "c4" ); -Group([ (1,3,5,7)(2,4,6,8) ]) -gap> RightCosets( d16, c4 ); -[ RightCoset(c4,()), RightCoset(c4,(2,8)(3,7)(4,6)), RightCoset(c4,(1,8,7,6,5, - 4,3,2)), RightCoset(c4,(1,8)(2,7)(3,6)(4,5)) ] -gap> trans := CommonTransversal( d16, c4 ); -[ (), (2,8)(3,7)(4,6), (1,2,3,4,5,6,7,8), (1,2)(3,8)(4,7)(5,6) ] -gap> IsCommonTransversal( d16, c4, trans ); -true - -## SubSection 3.3.1 -gap> gens := GeneratorsOfGroup( DihedralGroup(12) ); -[ f1, f2, f3 ] -gap> String( gens ); -"[ f1, f2, f3 ]" -gap> BlankFreeString( gens ); -"[f1,f2,f3]" - -############################################################################# -## -#E lists.tst . . . . . . . . . . . . . . . . . . . . . . . . . . . ends here diff --git a/tst/manual.g b/tst/manual.g new file mode 100755 index 0000000..e8aedd6 --- /dev/null +++ b/tst/manual.g @@ -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") ); diff --git a/tst/matrix.tst b/tst/matrix.tst deleted file mode 100644 index 78da41d..0000000 --- a/tst/matrix.tst +++ /dev/null @@ -1,80 +0,0 @@ -#@local M6, L6, M4, L4, M8, L8, L, A, M3, L3, M5, L5; -############################################################################## -## -#W matrix.tst Utils Package -## -#Y Copyright (C) 2015-2023, The GAP Group -## - -gap> ReadPackage( "utils", "tst/loadall.g" );; -gap> UtilsLoadingComplete; -true - -## SubSection 9.1.1 -gap> M6 := [ [1,2,0,0,0,0], [3,4,0,0,0,0], [5,6,0,0,0,0], -> [0,0,9,0,0,0], [0,0,0,1,2,3], [0,0,0,4,5,6] ];; -gap> Display( M6 ); -[ [ 1, 2, 0, 0, 0, 0 ], - [ 3, 4, 0, 0, 0, 0 ], - [ 5, 6, 0, 0, 0, 0 ], - [ 0, 0, 9, 0, 0, 0 ], - [ 0, 0, 0, 1, 2, 3 ], - [ 0, 0, 0, 4, 5, 6 ] ] -gap> L6 := DirectSumDecompositionMatrices( M6 ); -[ [ [ [ 1, 2 ], [ 3, 4 ], [ 5, 6 ] ], [ [ 9 ] ], [ [ 1, 2, 3 ], [ 4, 5, 6 ] ] - ] ] - -gap> M4 := [ [0,3,0,0], [0,0,0,0], [0,0,0,0], [0,0,4,0] ];; -gap> Display( M4 ); -[ [ 0, 3, 0, 0 ], - [ 0, 0, 0, 0 ], - [ 0, 0, 0, 0 ], - [ 0, 0, 4, 0 ] ] -gap> L4 := DirectSumDecompositionMatrices( M4 ); -[ [ [ [ 0, 3 ] ], [ [ 0, 0 ], [ 0, 0 ], [ 4, 0 ] ] ], - [ [ [ 0, 3 ], [ 0, 0 ] ], [ [ 0, 0 ], [ 4, 0 ] ] ], - [ [ [ 0, 3 ], [ 0, 0 ], [ 0, 0 ] ], [ [ 4, 0 ] ] ] ] -gap> for L in L4 do -> A := DirectSumMat( L );; -> if ( A = M4 ) then Print( "yes, A = M4\n" ); fi; -> od; -yes, A = M4 -yes, A = M4 -yes, A = M4 - -gap> M8 := DirectSumMat( M4, M4 );; -gap> Display( M8 ); -[ [ 0, 3, 0, 0, 0, 0, 0, 0 ], - [ 0, 0, 0, 0, 0, 0, 0, 0 ], - [ 0, 0, 0, 0, 0, 0, 0, 0 ], - [ 0, 0, 4, 0, 0, 0, 0, 0 ], - [ 0, 0, 0, 0, 0, 3, 0, 0 ], - [ 0, 0, 0, 0, 0, 0, 0, 0 ], - [ 0, 0, 0, 0, 0, 0, 0, 0 ], - [ 0, 0, 0, 0, 0, 0, 4, 0 ] ] -gap> L8 := DirectSumDecompositionMatrices( M8 );; -gap> Length( L8 ); -16 - -gap> M3 := [ [0,0,0,7,0,0,0], [0,0,0,0,8,0,0], [0,0,0,0,0,9,0] ];; -gap> Display( M3 ); -[ [ 0, 0, 0, 7, 0, 0, 0 ], - [ 0, 0, 0, 0, 8, 0, 0 ], - [ 0, 0, 0, 0, 0, 9, 0 ] ] -gap> L3 := DirectSumDecompositionMatrices( M3 ); -[ [ [ [ 0, 0, 0, 7 ] ], [ [ 8 ] ], [ [ 9, 0 ] ] ] ] - -gap> M5 := [ [1,2,0,0,0], [3,4,0,0,0], [0,0,0,0,0], -> [0,0,0,6,7], [0,0,0,8,9] ];; -gap> Display(M5); -[ [ 1, 2, 0, 0, 0 ], - [ 3, 4, 0, 0, 0 ], - [ 0, 0, 0, 0, 0 ], - [ 0, 0, 0, 6, 7 ], - [ 0, 0, 0, 8, 9 ] ] -gap> L5 := DirectSumDecompositionMatrices( M5 ); -[ [ [ [ 1, 2 ], [ 3, 4 ] ], [ [ 0 ] ], [ [ 6, 7 ], [ 8, 9 ] ] ] ] - -############################################################################# -## -#E matrix.tst . . . . . . . . . . . . . . . . . . . . . . . . . . ends here diff --git a/tst/number.tst b/tst/number.tst deleted file mode 100644 index b61c7b8..0000000 --- a/tst/number.tst +++ /dev/null @@ -1,80 +0,0 @@ -#@local i, iter, n, p, sum - -############################################################################## -## -#W number.tst Utils Package Stefan Kohl -## -#Y Copyright (C) 2015-2022, The GAP Group -## - -gap> ReadPackage( "utils", "tst/loadall.g" );; -gap> UtilsLoadingComplete; -true - -## SubSection 4.1.1 -gap> AllSmoothIntegers( 3, 1000 ); -[ 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 32, 36, 48, 54, 64, 72, 81, 96, - 108, 128, 144, 162, 192, 216, 243, 256, 288, 324, 384, 432, 486, 512, 576, - 648, 729, 768, 864, 972 ] -gap> AllSmoothIntegers( [5,11,17], 1000 ); -[ 1, 5, 11, 17, 25, 55, 85, 121, 125, 187, 275, 289, 425, 605, 625, 935 ] -gap> Length( last ); -16 -gap> List( [3..20], n -> Length( AllSmoothIntegers( [5,11,17], 10^n ) ) ); -[ 16, 29, 50, 78, 114, 155, 212, 282, 359, 452, 565, 691, 831, 992, 1173, - 1374, 1595, 1843 ] - -## SubSection 4.1.2 -gap> AllProducts([1..4],3); -[ 1, 2, 3, 4, 2, 4, 6, 8, 3, 6, 9, 12, 4, 8, 12, 16, 2, 4, 6, 8, 4, 8, 12, - 16, 6, 12, 18, 24, 8, 16, 24, 32, 3, 6, 9, 12, 6, 12, 18, 24, 9, 18, 27, - 36, 12, 24, 36, 48, 4, 8, 12, 16, 8, 16, 24, 32, 12, 24, 36, 48, 16, 32, - 48, 64 ] -gap> Set(last); -[ 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 32, 36, 48, 64 ] -gap> AllProducts( [(1,2,3),(2,3,4)], 2 ); -[ (2,4,3), (1,2)(3,4), (1,3)(2,4), (1,3,2) ] - -## SubSection 4.1.3 -gap> RestrictedPartitions( 20, [4..10] ); -[ [ 4, 4, 4, 4, 4 ], [ 5, 5, 5, 5 ], [ 6, 5, 5, 4 ], [ 6, 6, 4, 4 ], - [ 7, 5, 4, 4 ], [ 7, 7, 6 ], [ 8, 4, 4, 4 ], [ 8, 6, 6 ], [ 8, 7, 5 ], - [ 8, 8, 4 ], [ 9, 6, 5 ], [ 9, 7, 4 ], [ 10, 5, 5 ], [ 10, 6, 4 ], - [ 10, 10 ] ] -gap> RestrictedPartitionsWithoutRepetitions( 20, [4..10] ); -[ [ 10, 6, 4 ], [ 9, 7, 4 ], [ 9, 6, 5 ], [ 8, 7, 5 ] ] -gap> RestrictedPartitionsWithoutRepetitions( 10^2, List([1..10], n->n^2 ) ); -[ [ 100 ], [ 64, 36 ], [ 49, 25, 16, 9, 1 ] ] - -## SubSection 4.1.4 -gap> n := 2^251;; -gap> NextProbablyPrimeInt( n ); -3618502788666131106986593281521497120414687020801267626233049500247285301313 - -## SubSection 4.1.6 -gap> iter := PrimeNumbersIterator();; -gap> for i in [1..100] do p := NextIterator(iter); od; -gap> p; -541 -gap> sum := 0;; -gap> ## "prime number race" 1 vs. 3 mod 4 -gap> for p in PrimeNumbersIterator() do -> if p <> 2 then sum := sum + E(4)^(p-1); fi; -> if sum > 0 then break; fi; -> od; -gap> p; -26861 - -## this final example takes quite a while: use examples/number.g -## gap> sum := 0;; -## gap> ## "prime number race" 1 vs. 5 mod 8 -## gap> for p in PrimeNumbersIterator() do -## > if p mod 8 in [1,5] then sum := sum + E(4)^((p-1)/2); fi; -## > if sum > 0 then break; fi; -## > od; -## gap> p; -## 588067889 - -############################################################################# -## -#E number.tst . . . . . . . . . . . . . . . . . . . . . . . . . . ends here diff --git a/tst/others.tst b/tst/others.tst deleted file mode 100644 index 4a07480..0000000 --- a/tst/others.tst +++ /dev/null @@ -1,79 +0,0 @@ -#@local a, F2, f, g, relq8, q8, M, s1, n1, n2, N, s2; -############################################################################ -## -#W others.tst Utils Package -## -#Y Copyright (C) 2015-2025, The GAP Group -## - -gap> ReadPackage( "utils", "tst/loadall.g" );; -gap> UtilsLoadingComplete; -true - -## SubSection 10.1.1 -## this manual example is not tested to avoid creating files triv.* -## gap> LogTo( "triv.log" ); -## gap> a := 33^5; -## 39135393 -## gap> LogTo(); -## gap> Log2HTML( "triv.log" ); - -## SubSection 10.2.1 -gap> IntOrInfinityToLaTeX( 10^3 ); -"1000" -gap> IntOrInfinityToLaTeX( infinity ); -"\\infty" - -## SubSection 10.2.2 -gap> LaTeXStringFactorsInt( Factorial(12) ); -"2^{10} \\cdot 3^5 \\cdot 5^2 \\cdot 7 \\cdot 11" - -## SubSection 10.3.1 -gap> ## permutation groups -gap> ConvertToMagmaInputString( Group( (1,2,3,4,5), (3,4,5) ) ); -"PermutationGroup<5|(1,2,3,4,5),\n(3,4,5)>;\n" -gap> ConvertToMagmaInputString( Group( (1,2,3,4,5) ), "c5" ); -"c5 := PermutationGroup<5|(1,2,3,4,5)>;\n" -gap> ## pc-group -gap> ConvertToMagmaInputString( DihedralGroup( IsPcGroup, 10 ) ); -"PolycyclicGroup< f1,f2 |\nf1^2,\nf2^5,\nf2^f1 = f2^4\n>;\n" -gap> ## fp-group -gap> F2 := FreeGroup( 2 );; -gap> f := F2.1;; g := F2.2;; -gap> relq8 := [ f^4, g^4, f*g*f*g^-1, f^2*g^2 ];; -gap> q8 := F2/relq8;; -gap> ConvertToMagmaInputString( q8 ); -no conversion function yet available for fp-groups -fail -gap> ## matrix group -gap> M := GL(2,5);; Size(M); -480 -gap> s1 := ConvertToMagmaInputString( M ); -"F := GF(5);\nP := GL(2,F);\ngens := [\nP![2,0,0,1],\nP![4,1,4,0]\n];\nsub

;\n" -gap> Print( s1 ); -F := GF(5); -P := GL(2,F); -gens := [ -P![2,0,0,1], -P![4,1,4,0] -]; -sub

; -gap> n1 := [ [ Z(9)^0, Z(9)^0 ], [ Z(9)^0, Z(9) ] ];; -gap> n2 := [ [ Z(9)^0, Z(9)^3 ], [ Z(9)^4, Z(9)^2 ] ];; -gap> N := Group( n1, n2 );; Size( N ); -5760 -gap> s2 := ConvertToMagmaInputString( N, "gpN" );; -gap> Print( s2 ); -F := GF(3^2); -P := GL(2,F); -w := PrimitiveElement(F); -gens := [ -P![ 1, 1, 1,w^1], -P![ 1,w^3, 2,w^2] -]; -gpN := sub

; - -############################################################################# -## -#E others.tst . . . . . . . . . . . . . . . . . . . . . . . . . . ends here diff --git a/tst/print.tst b/tst/print.tst deleted file mode 100644 index 5a8a57b..0000000 --- a/tst/print.tst +++ /dev/null @@ -1,48 +0,0 @@ -#@local L, s5 - -############################################################################## -## -#W print.tst Utils Package -## -#Y Copyright (C) 2015-2022, The GAP Group -## - -gap> ReadPackage( "utils", "tst/loadall.g" );; -gap> UtilsLoadingComplete; -true - -## SubSection 2.1.1 -gap> L := List( [1..20], n -> n^5 );; -gap> PrintSelection( L, [18..20] ); -18 : 1889568 -19 : 2476099 -20 : 3200000 -gap> PrintSelection( L, 2, 9 ); -2 : 32 -11 : 161051 -20 : 3200000 -gap> PrintSelection( L, 2, 3, 11 ); -2 : 32 -5 : 3125 -8 : 32768 -11 : 161051 -gap> s5 := SymmetricGroup( 5 );; -gap> PrintSelection( s5, [30,31,100,101] ); -30 : (1,5)(3,4) -31 : (1,5,2) -100 : (1,4,3) -101 : (1,4)(3,5) -gap> PrintSelection( s5, 1, 30 ); -1 : () -31 : (1,5,2) -61 : (1,2,3) -91 : (1,3,5,2,4) -gap> PrintSelection( s5, 9, 11, 43 ); -9 : (2,5,3) -20 : (2,4) -31 : (1,5,2) -42 : (1,5,2,3,4) - -############################################################################# -## -#E print.tst . . . . . . . . . . . . . . . . . . . . . . . . . . . ends here diff --git a/tst/record.tst b/tst/record.tst deleted file mode 100644 index 8799aef..0000000 --- a/tst/record.tst +++ /dev/null @@ -1,65 +0,0 @@ -#@local r, defaults, PrintDimensions, mydim - -############################################################################## -## -#W record.tst Utils Package -## -#Y Copyright (C) 2015-2022, The GAP Group -## - -gap> ReadPackage( "utils", "tst/loadall.g" );; -gap> UtilsLoadingComplete; -true - -## SubSection 8.1.1 -gap> r := rec( a := 1, b := 2, c := 3 );; -gap> AssignGlobals( r ); -The following global variables have been assigned: -[ "a", "b", "c" ] -gap> [ a, b, c ]; -[ 1, 2, 3 ] - -## SubSection 8.2.1 -gap> defaults := rec( a := 1, b := 2, c := 3 );; -gap> OptionRecordWithDefaults( defaults, rec( a := 6) ); -rec( a := 6, b := 2, c := 3 ) -gap> OptionRecordWithDefaults( defaults, rec( b := 7, c := 8 ) ); -rec( a := 1, b := 7, c := 8 ) -gap> OptionRecordWithDefaults( defaults, [ ] ); -rec( a := 1, b := 2, c := 3 ) -gap> OptionRecordWithDefaults( defaults, [ rec( c := 8 ) ] ); -rec( a := 1, b := 2, c := 8 ) -gap> OptionRecordWithDefaults( defaults, rec( d := 9 ) ); -Error, Unknown option: d -gap> OptionRecordWithDefaults( defaults, [ rec( b := 7 ), rec( c := 8 ) ] ); -Error, Too many arguments for function -gap> OptionRecordWithDefaults( defaults, 5 ); -Error, Options should be a record -gap> OptionRecordWithDefaults( defaults, [6,7,8] ); -Error, Too many arguments for function - -gap> PrintDimensions := function( arg ) -> local nargs, dim, order, V, L, len, K, i; -> nargs := Length( arg ); -> dim := [ arg[1]!.height, arg[1]!.width, arg[1]!.depth ]; -> order := rec( h := 1, w := 2, d := 3 ); -> V := [ "height", "width", "depth" ]; -> if ( nargs > 1 ) and IsRecord( arg[2] ) then -> order := OptionRecordWithDefaults( order, arg[2] ); -> fi; -> L := [ order!.h, order!.w, order!.d ]; -> len := Length( L ); -> K := [ 1..len ]; -> SortParallel( L, K ); -> Print( "dimensions: " ); -> Print( V[K[1]], " = ", dim[K[1]], ", " ); -> Print( V[K[2]], " = ", dim[K[2]], ", " ); -> Print( V[K[3]], " = ", dim[K[3]], "\n" ); -> end;; - -gap> mydim := rec( height := 45, width := 31, depth := 17 ); -rec( depth := 17, height := 45, width := 31 ) -gap> PrintDimensions( mydim ); -dimensions: height = 45, width = 31, depth = 17 -gap> PrintDimensions( mydim, rec( h:=3, w:=1, d:=2 ) ); -dimensions: width = 31, depth = 17, height = 45