Changeset ccf4f2e in git

Timestamp:

Feb 22, 2000, 7:06:57 PM (24 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', '2a584933abf2a2d3082034c7586d38bb6de1a30a')

Children:

0fcb82f2d0bbfd71fab747454cd54484b04055a9

Parents:

5faa8fd5b4fbd04e9f16fa480463c4920965da95

Message:

*hannes: more readability


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

File:

• Singular/hutil.cc (modified) (22 diffs)

Singular/hutil.cc

@@ -2 +2 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: hutil.cc,v 1.12 1999-11-15 17:20:05 obachman Exp $ */
+/* $Id: hutil.cc,v 1.13 2000-02-22 18:06:57 Singular Exp $ */
 /*
 * ABSTRACT: Utilities for staircase operations
@@ -67 +67 @@
   for (i = sl; i; i--)
   {
-    if (*ss)
+    if (*ss!=0)
       k++;
     ss++;
@@ -74 +74 @@
   for (i = ql; i; i--)
   {
-    if (*ss)
+    if (*ss!=0)
       k++;
     ss++;
@@ -95 +95 @@
   for (i = ql; i; i--)
   {
-    if (*qi)
+    if (*qi!=NULL)
     {
       *ek = (Exponent_t*) Alloc((pVariables+1)*sizeof(Exponent_t));
@@ -405 +405 @@
   j = 1;
   n = rad[j];
-  o = *rad;
+  o = rad[0];
   k = Nvar;
   loop
   {
-    if (o[k] && !n[k])
+    if ((o[k]!=0) && (n[k]==0))
     {
       loop
       {
         k--;
-        if (!k)
+        if (k==0)
         {
           rad[i] = NULL;
@@ -422 +422 @@
         else
         {
-          if (!o[k] && n[k])
+          if ((o[k]==0) && (n[k]!=0))
             break;
         }
@@ -497 +497 @@
   int  j = 1, i = 0;
   scmon n = stc[j];
-  scmon o = *stc;
+  scmon o = stc[0];
   int k = Nvar;
   loop
@@ -516 +516 @@
         {
           i = 0;
-          o = *stc;
+          o = stc[0];
           n = stc[j];
           k = Nvar;
@@ -534 +534 @@
       {
         i = 0;
-        o = *stc;
+        o = stc[0];
         n = stc[j];
         k = Nvar;
@@ -554 +554 @@
     return;
   n = rad[j];
-  o = *rad;
+  o = rad[0];
   k = Nvar;
   loop
@@ -573 +573 @@
         {
           i = 0;
-          o = *rad;
+          o = rad[0];
           n = rad[j];
           k = Nvar;
@@ -590 +590 @@
       {
         i = 0;
-        o = *rad;
+        o = rad[0];
         n = rad[j];
         k = Nvar;
@@ -646 +646 @@
   }
   *Npure = np;
-  if (nq)
+  if (nq!=0)
   {
     *Nstc -= nq;
@@ -663 +663 @@
   i = a2;
   o = stc[i];
-  n = *stc;
+  n = stc[0];
   k = Nvar;
   loop
@@ -674 +674 @@
       if (i < e2)
         o = stc[i];
-      else {
+      else
+      {
         j++;
         if (j < nc)
@@ -684 +685 @@
         else
         {
-          if (z)
+          if (z!=0)
           {
             *e1 -= z;
@@ -696 +697 @@
     {
       k--;
-      if (!k)
+      if (k==0)
       {
         stc[j] = NULL;
@@ -710 +711 @@
         else
         {
-          if (z)
+          if (z!=0)
           {
             *e1 -= z;
@@ -732 +733 @@
   i = a2;
   o = rad[i];
-  n = *rad;
+  n = rad[0];
   k = Nvar;
   loop
@@ -754 +755 @@
         else
         {
-          if (z)
+          if (z!=0)
           {
             *e1 -= z;
@@ -780 +781 @@
         else
         {
-          if (z)
+          if (z!=0)
           {
             *e1 -= z;
@@ -994 +995 @@
 {
   int  i;
-  for (i = Nvar; i; i--)
-  {
-    if (xmem[i]->mo)
+  for (i = Nvar; i!=0; i--)
+  {
+    if (xmem[i]->mo!=NULL)
       Free((ADDRESS)xmem[i]->mo, xmem[i]->a * sizeof(scmon));
     Free((ADDRESS)xmem[i], LEN_MON);