Changeset a51188 in git
- Timestamp:
- Sep 30, 2009, 7:05:07 PM (15 years ago)
- Branches:
- (u'spielwiese', '5b153614cbc72bfa198d75b1e9e33dab2645d9fe')
- Children:
- 4042c2b632b9f788b2327601ac2d0b4d0d60d508
- Parents:
- 5d0d17bdad32f8f9794a7c32b5b6d125c210ebeb
- Location:
- Singular
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/Makefile.in
r5d0d17 ra51188 175 175 walk.cc walk_ip.cc \ 176 176 cntrlc.cc misc.cc \ 177 calcSVD.cc \ 178 CanonicalPoly.cc \ 179 ObjectFactory.cc \ 180 Poly.cc \ 181 ReferenceCounter.cc \ 182 Wrappers.cc \ 183 TestMinors.cc \ 184 MinorProcessor.cc \ 185 Minor.cc 177 calcSVD.cc 186 178 187 179 # stuff for MP -
Singular/claptmpl.cc
r5d0d17 ra51188 3 3 * Computer Algebra System SINGULAR * 4 4 ****************************************/ 5 // $Id: claptmpl.cc,v 1.4 6 2009-09-17 10:27:36seelisch Exp $5 // $Id: claptmpl.cc,v 1.47 2009-09-30 17:05:07 seelisch Exp $ 6 6 /* 7 7 * ABSTRACT - instantiation of all templates … … 257 257 //std::priority_queue<MonRedRes> 258 258 // 259 /* 259 260 // begin of template declarations for minor code (Frank Seelisch) 260 261 #include <list> … … 268 269 template class Cache<MinorKey, PolyMinorValue>; 269 270 // end of template declarations for minor code (Frank Seelisch) 271 */ 270 272 #endif 271 273 //template int pos_helper(kStrategy strat, poly p, int len, intset setL, polyset set); -
Singular/extra.cc
r5d0d17 ra51188 2 2 * Computer Algebra System SINGULAR * 3 3 *****************************************/ 4 /* $Id: extra.cc,v 1.31 7 2009-09-18 09:01:34seelisch Exp $ */4 /* $Id: extra.cc,v 1.318 2009-09-30 17:05:07 seelisch Exp $ */ 5 5 /* 6 6 * ABSTRACT: general interface to internals of Singular ("system" command) … … 54 54 #include "prCopy.h" 55 55 #include "mpr_complex.h" 56 #include "Wrappers.h" // for testing C++ wrappers (Frank Seelisch)57 #include "TestMinors.h" // for testing minor code (Frank Seelisch)58 56 #include "ffields.h" // test GF only 59 57 … … 2096 2094 else 2097 2095 #endif 2098 /*==================== debug C++ wrappers (Frank Seelisch) ========================*/2099 if(strcmp(sys_cmd,"c++wrappers")==0)2100 {2101 testWrappers();2102 return FALSE;2103 }2104 else2105 /*==================== debug minor code (Frank Seelisch) ========================*/2106 if(strcmp(sys_cmd,"minors")==0)2107 {2108 if (h == NULL) minorUsageInfo(); /* writes some info to the console2109 on how to use this experimental code2110 */2111 else if (h->Typ() == INT_CMD)2112 {2113 testIntMinors(0); /* effectively no arguments provided:2114 this starts 5 default tests2115 with a random matrix with2116 integer entries;2117 for that, no ring needs to be2118 declared2119 */2120 }2121 else if ((h->Typ() == MATRIX_CMD) &&2122 (h->next->Typ() == INT_CMD) &&2123 (h->next->next->Typ() == INT_CMD) &&2124 (h->next->next->next->Typ() == INT_CMD) &&2125 (h->next->next->next->next->Typ() == INT_CMD) &&2126 (h->next->next->next->next->next->Typ() == INT_CMD) &&2127 (h->next->next->next->next->next->next->Typ() == INT_CMD) &&2128 (h->next->next->next->next->next->next->next->Typ() == INT_CMD))2129 {2130 const matrix m = (const matrix)h->Data();2131 const int k = (const int)(long)h->next->Data();2132 const int cacheEntries = (const int)(long)h->next->next->Data();2133 const int cacheWeight = (const int)(long)h->next->next->next->Data();2134 const int strategies = (const int)(long)h->next->next->next->next->Data();2135 const int dumpMinors = (const int)(long)h->next->next->next->next->next->Data();2136 const int dumpResults = (const int)(long)h->next->next->next->next->next->next->Data();2137 const int dumpComplete = (const int)(long)h->next->next->next->next->next->next->next->Data();2138 const int dumpConsole = (const int)(long)h->next->next->next->next->next->next->next->next->Data();2139 testAllPolyMinors(m, k, cacheEntries, cacheWeight, strategies, dumpMinors, dumpResults, dumpComplete, dumpConsole);2140 /* starts the computation of all k x k minors in the2141 provided matrix m (which is assumed to have polynomial2142 entries) using a cache with a maximum number of2143 'cacheEntries' entries and a maximum weight of 'cacheWeight';2144 when calling this method, a ring must be declared before;2145 strategy = "310" means that the code is run first without a2146 cache ("0") and then afterwards with the caching strategies2147 1 and 32148 */2149 }2150 else if (h->Typ() == POLY_CMD)2151 { // for quick tests2152 const poly p = (const poly)h->Data();2153 testStuff(p);2154 }2155 return FALSE;2156 }2157 else2158 2096 /*==================== generic debug ==================================*/ 2159 2097 //#ifdef PDEBUG
Note: See TracChangeset
for help on using the changeset viewer.