Changeset a3f0fea in git for kernel/linear_algebra/MinorProcessor.cc

Timestamp:

Jan 24, 2019, 1:08:04 PM (5 years ago)

Author:

Reimer Behrends <behrends@…>

Branches:

(u'spielwiese', '4a9821a93ffdc22a6696668bd4f6b8c9de3e6c5f')

Children:

756676ef1fcf4cff300fb1607a6d21293b253245

Parents:

25fe907e3f7e0d124b25f97832c0b71e96c515e2

Message:

Modify variable declarions for pSingular.

File:

• kernel/linear_algebra/MinorProcessor.cc (modified) (1 diff)

kernel/linear_algebra/MinorProcessor.cc

@@ -17 +17 @@
 
 #ifdef COUNT_AND_PRINT_OPERATIONS
-long addsPoly        = 0;    /* for the number of additions of two polynomials */
-long multsPoly       = 0;    /* for the number of multiplications of two polynomials */
-long addsPolyForDiv  = 0;    /* for the number of additions of two polynomials for
+VAR long addsPoly        = 0;    /* for the number of additions of two polynomials */
+VAR long multsPoly       = 0;    /* for the number of multiplications of two polynomials */
+VAR long addsPolyForDiv  = 0;    /* for the number of additions of two polynomials for
                                 polynomial division part */
-long multsPolyForDiv = 0;    /* for the number of multiplications of two polynomials
+VAR long multsPolyForDiv = 0;    /* for the number of multiplications of two polynomials
                                 for polynomial division part */
-long multsMon        = 0;    /* for the number of multiplications of two monomials */
-long multsMonForDiv  = 0;    /* for the number of m-m-multiplications for polynomial
+VAR long multsMon        = 0;    /* for the number of multiplications of two monomials */
+VAR long multsMonForDiv  = 0;    /* for the number of m-m-multiplications for polynomial
                                 division part */
-long savedMultsMFD   = 0;    /* number of m-m-multiplications that could be saved
+VAR long savedMultsMFD   = 0;    /* number of m-m-multiplications that could be saved
                                 when polynomial division would be optimal
                                 (if p / t1 = t2 + ..., then t1 * t2 = LT(p), i.e.,
                                 this multiplication need not be performed which
                                 would save one m-m-multiplication) */
-long divsMon         = 0;    /* for the number of divisions of two monomials;
+VAR long divsMon         = 0;    /* for the number of divisions of two monomials;
                                 these are all guaranteed to work, i.e., m1/m2 only
                                 when exponentVector(m1) >= exponentVector(m2) */