Changeset f9241bf in git

Timestamp:

Nov 20, 2006, 10:20:21 AM (17 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', '0604212ebb110535022efecad887940825b97c3f')

Children:

59b9615870d42298bc425c97176a54ee9c4e3b9d

Parents:

1731e390e73a68ff2ded83525e456e5bb72106ca

Message:

*hannes: optimize for sparse matrices


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

File:

• kernel/matpol.cc (modified) (3 diffs)

kernel/matpol.cc

@@ -2 +2 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: matpol.cc,v 1.10 2006-11-18 12:58:00 Singular Exp $ */
+/* $Id: matpol.cc,v 1.11 2006-11-20 09:20:21 Singular Exp $ */
 
 /*
@@ -92 +92 @@
   {
     t = a->m[i];
-    pNormalize(t);
-    b->m[i] = pCopy(t);
+    if (t!=NULL)
+    {
+      pNormalize(t);
+      b->m[i] = pCopy(t);
+    }
   }
   b->rank=a->rank;
@@ -147 +150 @@
   int k, n = a->nrows, m = a->ncols;
 
-  pNormalize(p);
-  for (k=m*n-1; k>0; k--)
-  {
-    if (a->m[k]!=NULL)
-      a->m[k] = pMult(a->m[k], pCopy(p));
-  }
-  a->m[0] = pMult(a->m[0], p);
+  if (p!=NULL)
+  {
+    pNormalize(p);
+    for (k=m*n-1; k>0; k--)
+    {
+      if (a->m[k]!=NULL)
+        a->m[k] = pMult(a->m[k], pCopy(p));
+    }
+    a->m[0] = pMult(a->m[0], p);
+  }
+  else
+  {
+    for (k=m*n-1; k>0; k--)
+        pDelete(&a->m[k]);
+  }
   return a;
 }