Changeset 9d0c2b in git for kernel/summator.cc

Timestamp:

Jul 8, 2008, 10:18:27 AM (15 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')

Children:

77987005e6c432b32a83558af620b8a21ecaa8cc

Parents:

9d249b2bd6e53779def56a0139a8157d70ec75c1

Message:

*hannes: syntax


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

File:

• kernel/summator.cc (modified) (13 diffs)

kernel/summator.cc

@@ -6 +6 @@
  *  Purpose: simple Summator usecase implementation
  *  Author:  motsak
- *  Created: 
- *  Version: $Id: summator.cc,v 1.1 2008-07-04 14:19:38 motsak Exp $
+ *  Created:
+ *  Version: $Id: summator.cc,v 1.2 2008-07-08 08:18:27 Singular Exp $
  *******************************************************************/
 
@@ -20 +20 @@
 
 #include "mod2.h"
-
+#ifdef HAVE_PLURAL
 #include <summator.h> // for CPolynomialSummator class
 #include <ring.h>
@@ -41 +41 @@
     m_temp.m_bucket = sBucketCreate(rBaseRing);
   }
-};
+}
 
 /*
@@ -50 +50 @@
 #ifdef PDEBUG
   p_Test(pInitialSum, rBaseRing);
-#endif    
+#endif
 
   if(bUsePolynomial)
@@ -76 +76 @@
 #ifdef PDEBUG
       p_Test(m_temp.m_poly, m_basering);
-#endif    
-      
+#endif
       p_Delete(&m_temp.m_poly, m_basering);
 //      m_temp.m_poly = NULL;
@@ -87 +86 @@
 #ifdef PDEBUG
   p_Test(pSummand, m_basering);
-#endif    
-  
+#endif
+
   if(m_bUsePolynomial)
     m_temp.m_poly = p_Add_q(m_temp.m_poly, pSummand, m_basering);
@@ -99 +98 @@
 #ifdef PDEBUG
   p_Test(pSummand, m_basering);
-#endif    
+#endif
 
   if(m_bUsePolynomial)
@@ -110 +109 @@
 {
   poly out = NULL;
-  
+
   if(m_bUsePolynomial)
   {
     out = m_temp.m_poly;
     m_temp.m_poly = NULL;
-  } else
+  }
+  else
   {
     int pLength;
@@ -123 +123 @@
 #ifdef PDEBUG
   p_Test(out, m_basering);
-#endif    
-  
+#endif
+
   return out;
 }
@@ -132 +132 @@
 {
   poly out = NULL;
-  
+
   if(m_bUsePolynomial)
   {
@@ -138 +138 @@
     m_temp.m_poly = NULL;
     *piLength = pLength(out);
-  } else
+  }
+  else
   {
     *piLength = 0;
@@ -147 +148 @@
   p_Test(out, m_basering);
   assume(pLength(out) == *piLength);
-#endif    
-  
+#endif
+
   return out;
 }
@@ -157 +158 @@
 {
   AddAndDelete(p_Copy(pSummand, m_basering), iLength);
-};
+}
 
 void CPolynomialSummator::Add(poly pSummand)
 {
   AddAndDelete(p_Copy(pSummand, m_basering));
-};
+}
 
-
+#endif