Changeset e99734 in git

Timestamp:

Mar 24, 2005, 11:54:30 AM (18 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', '828514cf6e480e4bafc26df99217bf2a1ed1ef45')

Children:

81a6f28ef505d3aed265bb5df75a2afd0eec4ed6

Parents:

60467b0cdcbd1fee1d59e683e7ee53b317a29d23

Message:

*hannes: reduce if a new minpoly is defined


git-svn-id: file:///usr/local/Singular/svn/trunk@7794 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• Singular/ipassign.cc (modified) (3 diffs)

Singular/ipassign.cc

@@ -2 +2 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: ipassign.cc,v 1.71 2004-04-13 15:38:26 Singular Exp $ */
+/* $Id: ipassign.cc,v 1.72 2005-03-24 10:54:19 Singular Exp $ */
 
 /*
@@ -115 +115 @@
   return FALSE;
 }
+static void jjMINPOLY_red(idhdl h)
+{
+  switch(IDTYP(h))
+  {
+    case NUMBER_CMD:
+    {
+      number n=(number)IDDATA(h);
+      number one = nInit(1);
+      number nn=nMult(n,one);
+      nDelete(&n);nDelete(&one);
+      IDDATA(h)=(char*)nn;
+      break;
+    }
+    case VECTOR_CMD:
+    case POLY_CMD:
+    {
+      poly p=(poly)IDDATA(h);
+      IDDATA(h)=(char*)pMinPolyNormalize(p);
+      break;
+    }
+    case IDEAL_CMD:
+    case MODUL_CMD:
+    case MAP_CMD:
+    case MATRIX_CMD:
+    {
+      int i;
+      ideal I=(ideal)IDDATA(h);
+      for(i=IDELEMS(I)-1;i>=0;i--) I->m[i]=pMinPolyNormalize(I->m[i]);
+      break;
+    }
+    case LIST_CMD:
+    {
+      lists L=(lists)IDDATA(h);
+      int i=L->nr;
+      for(;i>=0;i--)
+      {
+        jjMINPOLY_red((idhdl)&(L->m[i]));
+      }
+    }
+    default: 
+    //case RESOLUTION_CMD:
+       Werror("type %d too complex...set minpoly before",IDTYP(h)); break;
+  }
+}
 static BOOLEAN jjMINPOLY(leftv res, leftv a)
 {
@@ -139 +183 @@
     currRing->minpoly=p;
     naMinimalPoly=((lnumber)currRing->minpoly)->z;
+    // and now, normalize all already defined objects in this ring
+    idhdl h=currRing->idroot;
+    while(h!=NULL)
+    {
+      jjMINPOLY_red(h);
+      h=IDNEXT(h);
+    }
   }
   return FALSE;