[SCM] an open source computer algebra system branch, cleanedupstream, updated. 6125e540ca6d66c307958938a9d53b245507c323

[Bernhard R. Link]

The following commit has been merged in the cleanedupstream branch:
commit 9022091724e6f10def9e8acd06917cb806dd90eb
Author: Janko Boehm <janko at lubuntu>
Date:   Fri Feb 24 17:46:21 2012 +0100

    minor changes

diff --git a/Singular/LIB/divisors.lib b/Singular/LIB/divisors.lib
index 0f7f9f8..1557a0b 100755
--- a/Singular/LIB/divisors.lib
+++ b/Singular/LIB/divisors.lib
@@ -2,10 +2,15 @@
 version="$Id: modnormal.lib 14273 2011-06-10 10:44:10Z steidel $";
 category = "Commutative Algebra";
 info="
-LIBRARY:  modnormal.lib      Normalization of rings with modular techniques
+LIBRARY:  divisors.lib      Divisors and P-Divisors
 
 AUTHORS:  
 
+boehm at mathematik.uni-kl.de
+blorenz at math.uni-frankfurt.de
+hannes at mathematik.uni-kl.de
+kastner at math.fu-berlin.de
+ren at mathematik.uni-kl.de
 
 @*
 
@@ -64,12 +69,12 @@ LIB "primdec.lib";
 proc mod_init()
 {
 //if (!defined(Gfanlib::coneViaRays)) {
-  LIB("gfanlib.so");
-  export(Gfanlib);
+//  LIB("gfanlib.so");
+//  export(Gfanlib);
 //}
 //if (!defined(Polymake::minkowskiSum)) {
-  LIB("polymake.so");
-  export(Polymake);
+//  LIB("polymake.so");
+//  export(Polymake);
 //}
 newstruct("divisor","ideal den,ideal num");
 newstruct("formaldivisor","list summands");
@@ -346,7 +351,7 @@ proc pdivisorplus(pdivisor A, pdivisor B){
 pdivisor C;
 int i,p;
 int j=1;
-if (!(Gfanlib::isEqual(A.tailcone,B.tailcone))) {ERROR("tail cones should be equal");}
+if (!(A.tail==B.tail)) {ERROR("tail cones should be equal");}
 list L;
 list LA=A.summands;
 list LB=B.summands;

-- 
an open source computer algebra system