Changeset f319f5 in git
 Timestamp:
 Feb 2, 2010, 10:00:56 AM (13 years ago)
 Branches:
 (u'jengelhdatetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a657104b677b4c461d018cbf3204d72d34ad66a9')
 Children:
 b2650f87c2fa5c0768b4c4f393c4c9c5549c7491
 Parents:
 7b9b0a23c18c84cceab0ff377feea82ae1e3429a
 Location:
 Singular
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

Singular/MinorInterface.cc
r7b9b0a2 rf319f5 88 88 ideal getMinorIdeal_Int (const int* intMatrix, const int rowCount, const int columnCount, 89 89 const int minorSize, const int k, const char* algorithm, 90 const ideal &i, const bool allDifferent)90 const ideal i, const bool allDifferent) 91 91 { 92 92 /* setting up a MinorProcessor for matrices with integer entries: */ … … 136 136 ideal getMinorIdeal_Poly (const poly* polyMatrix, const int rowCount, const int columnCount, 137 137 const int minorSize, const int k, const char* algorithm, 138 const ideal &i, const bool allDifferent)138 const ideal i, const bool allDifferent) 139 139 { 140 140 /* setting up a MinorProcessor for matrices with polynomial entries: */ … … 177 177 178 178 ideal getMinorIdeal_toBeDone (const matrix& mat, const int minorSize, const int k, 179 const char* algorithm, const ideal &i, const bool allDifferent)179 const char* algorithm, const ideal i, const bool allDifferent) 180 180 { 181 181 int rowCount = mat>nrows; … … 222 222 E.g. Bareiss may be used over fields or over Z but not over 223 223 Z/6 (which has nonzero zero divisors, namely 2 and 3). */ 224 ideal getMinorIdeal (const matrix &mat, const int minorSize, const int k,225 const char* algorithm, const ideal &iSB, const bool allDifferent)224 ideal getMinorIdeal (const matrix mat, const int minorSize, const int k, 225 const char* algorithm, const ideal iSB, const bool allDifferent) 226 226 { 227 227 /* Note that this method should be replaced by getMinorIdeal_toBeDone, … … 370 370 } 371 371 372 ideal getMinorIdealCache_toBeDone (const matrix &mat, const int minorSize, const int k,372 ideal getMinorIdealCache_toBeDone (const matrix mat, const int minorSize, const int k, 373 373 const ideal& iSB, const int cacheStrategy, 374 374 const int cacheN, const int cacheW, … … 397 397 } 398 398 399 ideal getMinorIdealCache (const matrix &mat, const int minorSize, const int k,400 const ideal &iSB, const int cacheStrategy,399 ideal getMinorIdealCache (const matrix mat, const int minorSize, const int k, 400 const ideal iSB, const int cacheStrategy, 401 401 const int cacheN, const int cacheW, 402 402 const bool allDifferent) … … 431 431 } 432 432 433 ideal getMinorIdealHeuristic (const matrix &mat, const int minorSize, const int k,434 const ideal &iSB, const bool allDifferent)433 ideal getMinorIdealHeuristic (const matrix mat, const int minorSize, const int k, 434 const ideal iSB, const bool allDifferent) 435 435 { 436 436 int vars = 0; if (currRing != 0) vars = currRing>N; 
Singular/MinorInterface.h
r7b9b0a2 rf319f5 19 19 "Laplace"; when a cache is used, the underlying algorithm 20 20 is automatically Laplace */ 21 ideal getMinorIdeal (const matrix &m, const int minorSize, const int k,22 const char* algorithm, const ideal &i,21 ideal getMinorIdeal (const matrix m, const int minorSize, const int k, 22 const char* algorithm, const ideal i, 23 23 const bool allDifferent); 24 ideal getMinorIdealCache (const matrix &m, const int minorSize, const int k,25 const ideal &i, const int cacheStrategy,24 ideal getMinorIdealCache (const matrix m, const int minorSize, const int k, 25 const ideal i, const int cacheStrategy, 26 26 const int cacheN, const int cacheW, 27 27 const bool allDifferent); 28 ideal getMinorIdealHeuristic (const matrix &m, const int minorSize, const int k,29 const ideal &i, const bool allDifferent);28 ideal getMinorIdealHeuristic (const matrix m, const int minorSize, const int k, 29 const ideal i, const bool allDifferent); 30 30 31 31 #endif
Note: See TracChangeset
for help on using the changeset viewer.