Changeset f319f5 in git

Timestamp:

Feb 2, 2010, 10:00:56 AM (14 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

b2650f87c2fa5c0768b4c4f393c4c9c5549c7491

Parents:

7b9b0a23c18c84cceab0ff377feea82ae1e3429a

Message:

call by value for minor

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

Location:

Singular

Files:

• MinorInterface.cc (modified) (7 diffs)
• MinorInterface.h (modified) (1 diff)

Singular/MinorInterface.cc

@@ -88 +88 @@
 ideal getMinorIdeal_Int (const int* intMatrix, const int rowCount, const int columnCount,
                          const int minorSize, const int k, const char* algorithm,
-                         const ideal& i, const bool allDifferent)
+                         const ideal i, const bool allDifferent)
 {
   /* setting up a MinorProcessor for matrices with integer entries: */
@@ -136 +136 @@
 ideal getMinorIdeal_Poly (const poly* polyMatrix, const int rowCount, const int columnCount,
                           const int minorSize, const int k, const char* algorithm,
-                          const ideal& i, const bool allDifferent)
+                          const ideal i, const bool allDifferent)
 {
   /* setting up a MinorProcessor for matrices with polynomial entries: */
@@ -177 +177 @@
 
 ideal getMinorIdeal_toBeDone (const matrix& mat, const int minorSize, const int k,
-                              const char* algorithm, const ideal& i, const bool allDifferent)
+                              const char* algorithm, const ideal i, const bool allDifferent)
 {
   int rowCount = mat->nrows;
@@ -222 +222 @@
    E.g. Bareiss may be used over fields or over Z but not over
         Z/6 (which has non-zero zero divisors, namely 2 and 3). */
-ideal getMinorIdeal (const matrix& mat, const int minorSize, const int k,
-                     const char* algorithm, const ideal& iSB, const bool allDifferent)
+ideal getMinorIdeal (const matrix mat, const int minorSize, const int k,
+                     const char* algorithm, const ideal iSB, const bool allDifferent)
 {
   /* Note that this method should be replaced by getMinorIdeal_toBeDone,
@@ -370 +370 @@
 }
 
-ideal getMinorIdealCache_toBeDone (const matrix& mat, const int minorSize, const int k,
+ideal getMinorIdealCache_toBeDone (const matrix mat, const int minorSize, const int k,
                                    const ideal& iSB, const int cacheStrategy,
                                    const int cacheN, const int cacheW,
@@ -397 +397 @@
 }
 
-ideal getMinorIdealCache (const matrix& mat, const int minorSize, const int k,
-                          const ideal& iSB, const int cacheStrategy,
+ideal getMinorIdealCache (const matrix mat, const int minorSize, const int k,
+                          const ideal iSB, const int cacheStrategy,
                           const int cacheN, const int cacheW,
                           const bool allDifferent)
@@ -431 +431 @@
 }
 
-ideal getMinorIdealHeuristic (const matrix& mat, const int minorSize, const int k,
-                              const ideal& iSB, const bool allDifferent)
+ideal getMinorIdealHeuristic (const matrix mat, const int minorSize, const int k,
+                              const ideal iSB, const bool allDifferent)
 {
   int vars = 0; if (currRing != 0) vars = currRing->N;

Singular/MinorInterface.h

@@ -19 +19 @@
    "Laplace"; when a cache is used, the underlying algorithm
    is automatically Laplace */
-ideal getMinorIdeal          (const matrix& m, const int minorSize, const int k,
-                              const char* algorithm, const ideal& i,
+ideal getMinorIdeal          (const matrix m, const int minorSize, const int k,
+                              const char* algorithm, const ideal i,
                               const bool allDifferent);
-ideal getMinorIdealCache     (const matrix& m, const int minorSize, const int k,
-                              const ideal& i, const int cacheStrategy,
+ideal getMinorIdealCache     (const matrix m, const int minorSize, const int k,
+                              const ideal i, const int cacheStrategy,
                               const int cacheN, const int cacheW,
                               const bool allDifferent);
-ideal getMinorIdealHeuristic (const matrix& m, const int minorSize, const int k,
-                              const ideal& i, const bool allDifferent);
+ideal getMinorIdealHeuristic (const matrix m, const int minorSize, const int k,
+                              const ideal i, const bool allDifferent);
 
 #endif