[Mupad-combinat-commits] SF.net SVN: mupad-combinat: [7528] trunk/MuPAD-Combinat/lib/DOMAINS/ CATEGORY/ModuleWithBasis.mu

[<nt...@us...>]

Revision: 7528
          http://mupad-combinat.svn.sourceforge.net/mupad-combinat/?rev=7528&view=rev
Author:   nthiery
Date:     2008-05-17 14:56:53 -0700 (Sat, 17 May 2008)

Log Message:
-----------
Type::Function -> Type::Morphism()

Modified Paths:
--------------
    trunk/MuPAD-Combinat/lib/DOMAINS/CATEGORY/ModuleWithBasis.mu

Modified: trunk/MuPAD-Combinat/lib/DOMAINS/CATEGORY/ModuleWithBasis.mu
===================================================================
--- trunk/MuPAD-Combinat/lib/DOMAINS/CATEGORY/ModuleWithBasis.mu	2008-05-17 21:55:44 UTC (rev 7527)
+++ trunk/MuPAD-Combinat/lib/DOMAINS/CATEGORY/ModuleWithBasis.mu	2008-05-17 21:56:53 UTC (rev 7528)
@@ -656,7 +656,7 @@
     mapterms := dom::mapsupport; // backward compatibility
 
     selectSupport :=
-    proc(x: dom, f: Type::Function) : dom
+    proc(x: dom, f: Type::Morphism()) : dom
 	local options;
     begin
 	options := args(3..args(0));
@@ -847,7 +847,7 @@
     // furthermore be dom as well.
     moduleMorphismMatrix :=
     funcenv(
-    proc(endo: Type::Function) : dom::sparseMatricesDomain
+    proc(endo: Type::Morphism()) : dom::sparseMatricesDomain
 	local options, vectors, sparseVectorArgs;
     begin
 	options := prog::getOptions(dom::moduleMorphismMatrix, 1, Error);
@@ -886,7 +886,7 @@
 			   RowIndices    = Type::ListOf(Type::AnyType
 							//dom::basisIndices
 							),
-			   RowRank       = Type::Function
+			   RowRank       = Type::Morphism()
 			  ])
     );
 
@@ -1123,7 +1123,7 @@
 		    end_if;
 		end_for;
 	    end_if;
-
+	    // FIXME nothing is done with Extras!
 	  plus(myMultcoeffs(f(op(map(listOfTerms, op, 2))),
 			    _mult(op(map(listOfTerms, op, 1))))
 		 $ listOfTerms in combinat::cartesianProduct(poly2list(args(i)) $ i = 1..args(0)));
@@ -1142,7 +1142,7 @@
     // caller explicitly states that the function is graded?
     matrixOperationOnModuleMorphismBasis :=
     proc(f: dom::typeFunction,
-	 matrixOperation : Type::Function,
+	 matrixOperation : Type::Morphism(),
 	 oldSource  : Cat::ModuleWithBasis(R),
 	 oldTarget  : Cat::ModuleWithBasis(R),
 	 newSource  : Cat::ModuleWithBasis(R),
@@ -1311,8 +1311,8 @@
 					   ImageSet = operators::imageSet(f)
 					  ),
 				     table(Order = Type::Union(DOM_NULL,
-							       Type::Function),
-					   InverseOnSupport = Type::Function,
+							       Type::Morphism()),
+					   InverseOnSupport = Type::Morphism(),
 					   ImageSet = Cat::ModuleWithBasis));
 
 	 // Triangularity condition on f: A->B :
@@ -1340,7 +1340,7 @@
 		 end_if;
 		 y2 := f(t2);
 		 c  := coeff(y,t) / coeff(y2,t);
-		 y  := y - c * y2;
+		 y  := normal(y - c * y2);
 		 x  := x + imageSet::monomial(c, t2):
 	     end_while;
 	     x;
@@ -1650,7 +1650,7 @@
     kernelOfModuleMorphism:=
     // Cat::PrincipalIdealDomain could be sufficient
     if testtype(dom::coeffRing, Cat::Field) then
-    proc(morphisms: Type::Union(Type::ListOf(Type::Function), Type::Function)) : DOM_LIST
+    proc(morphisms: Type::Union(Type::ListOf(Type::Morphism()), Type::Morphism())) : DOM_LIST
       local res, sys, f, lBas;
     begin
 	lBas := dom::getOptionsBasis(hold(``), args(2..args(0)));
@@ -1665,7 +1665,7 @@
     fiberOfModuleMorphism :=
     // Cat::PrincipalIdealDomain could be sufficient
     if testtype(dom::coeffRing, Cat::Field) then
-    proc(morphisms: Type::Union(Type::ListOf(Type::Function), Type::Function),
+    proc(morphisms: Type::Union(Type::ListOf(Type::Morphism()), Type::Morphism()),
 	 solutions: Type::Union(Type::ListOf(Type::ElementOfDomain(Cat::ModuleWithBasis)),
 				Type::ElementOfDomain(Cat::ModuleWithBasis)),
 	 lBas=null() : Type::Union(DOM_LIST, DOM_NULL)) :
@@ -1694,7 +1694,7 @@
     end_if;
 
     moduleClosure :=
-    proc(generators: Type::ListOf(dom), operations: Type::ListOf(Type::Function))
+    proc(generators: Type::ListOf(dom), operations: Type::ListOf(Type::Morphism()))
 	local basis, rank, todo, x;
     begin
 	generators := dom::echelonForm(generators, Reduced);


This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.