Commit v4.alpha33

doc/ref/domain.tex

@@ -34,18 +34,19 @@
 i.e., since
 $$ \hbox{`<super_req> = <sub_req> and <prop>',} $$
 the contraposition of the statement is also used:
-$$\vbox{\halign{\hfil#\ &#\hfil\quad i.e.,\ &\hfil#\ &#\hfil\cr%
-if&`<sub_req>( <super> )'&if&`IsGroup( <super> )'\cr
-and&`<sub_req>( <sub> )'&and&`IsGroup( <sub> )'\cr
-and&`Tester( <prop> )( <sub> ) and not <prop>( <sub> )'&and&
+$$
+\vbox{\halign{\hfil#\ &#\hfil\quad&#\ &\hfil#\ &#\hfil\cr%
+if& `<sub_req>( <super> )'& i.e.,& if& `IsGroup( <super> )'\cr
+and& `<sub_req>( <sub> )'& i.e.,& and& `IsGroup( <sub> )'\cr
+and& `Tester( <prop> )( <sub> ) and not <prop>( <sub> )'& i.e.,& and&
   `not IsSolvableGroup( <sub> )'\cr
-then&`Setter( <prop> )( <super>, false )'&then&
+then& `Setter( <prop> )( <super>, false )'& i.e.,& then&
   `SetIsSolvableGroup( <super>, false )'.\cr}}$$
 Both implications
-$$ \eqalignno{\hbox{`IsSolvableGroup( <super> )'}&\Rightarrow
+$$ \eqalignno{\hbox{`IsSolvableGroup( <super> )'}& \Rightarrow
    \hbox{`IsSolvableGroup( <sub> )'}\cr
    \noalign{\line{and}}
-   \hbox{`not IsSolvableGroup( <sub> )'}&\Rightarrow
+   \hbox{`not IsSolvableGroup( <sub> )'}& \Rightarrow
    \hbox{`not IsSolvableGroup( <super> )'}\cr} $$
 are declared by  the one call  of `InstallSubsetMaintainedMethod' and are
 exploited by the one call of `UseSubsetRelation'.
@@ -63,11 +64,12 @@
 <prop> )( <factor>, true )'. The contraposition is valid if
 $$ \hbox{`<numer_req> = <factor_req> and <prop>'} $$
 and means that
-$$\vbox{\halign{\hfil#\ &#\hfil\cr%
-if&`<factor_req>( <factor> )'\cr
-and&`<factor_req>( <denom> )'\cr
-and&`Tester( <prop> )( <factor> ) and not <prop>( <factor> )'\cr
-then&`Setter( <prop> )( <denom>, false )'.\cr}}$$
+$$
+\vbox{\halign{\hfil#\ & #\hfil\cr%
+if& `<factor_req>( <factor> )'\cr
+and& `<factor_req>( <denom> )'\cr
+and& `Tester( <prop> )( <factor> ) and not <prop>( <factor> )'\cr
+then& `Setter( <prop> )( <denom>, false )'.\cr}}$$
 
 Finally, there is a class of maintained methods for the case of isomophic
 domains.

lib/files.gd

@@ -280,6 +280,33 @@ LoadDynamicModule := function( arg )
 end;
 
 
+#############################################################################
+##
+#V  EDITOR  . . . . . . . . . . . . . . . . . . . . default editor for `Edit'
+##
+EDITOR := "vi";
+
+
+#############################################################################
+##
+#F  Edit( <filename> )  . . . . . . . . . . . . . . . . .  edit and read file
+##
+Edit := function( name )
+    local   editor,  ret;
+
+    editor := Filename( DirectoriesSystemPrograms(), EDITOR );
+    if editor = fail  then
+        Error( "cannot locate editor `", EDITOR, "'" );
+    fi;
+    ret := Process( DirectoryCurrent(), editor, InputTextUser(), 
+                    OutputTextUser(), [ name ] );
+    if ret <> 0  then
+        Error( "editor returned ", ret );
+    fi;
+    Read(name);
+end;
+
+
 #############################################################################
 ##
 

lib/integer.gd

@@ -357,6 +357,24 @@ FactorsInt := NewOperationArgs( "FactorsInt" );
 Gcdex := NewOperationArgs( "Gcdex" );
 
 
+#############################################################################
+##
+#F  IsEvenInt( <n> )  . . . . . . . . . . . . . . . . . . test if <n> is even
+##
+IsEvenInt := function( n )
+    return n mod 2 = 0;
+end;
+
+
+#############################################################################
+##
+#F  IsOddInt( <n> ) . . . . . . . . . . . . . . . . . . .  test if <n> is odd
+##
+IsOddInt := function( n )
+    return n mod 2 = 1;
+end;
+
+
 #############################################################################
 ##
 #F  IsPrimeInt( <n> ) . . . . . . . . . . . . . . . . . . .  test for a prime

lib/read6.g

@@ -30,3 +30,4 @@ ReadTrans( "trans.grp" );
 ##
 ReadPrim( "irredsol.grp" );
 ReadPrim( "primitiv.gi" );
+ReadPrim( "primitiv.grp" );