Changeset b0d3903 in git
- Timestamp:
- Sep 17, 2009, 12:27:37 PM (15 years ago)
- Branches:
- (u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'b4f17ed1d25f93d46dbe29e4b499baecc2fd51bb')
- Children:
- 781efb3cc0d623f637f1f685201321e33f76479b
- Parents:
- f27faea2f43b620270775371aaac8a515a32509d
- Location:
- Singular
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/Makefile.in
rf27faea rb0d3903 175 175 walk.cc walk_ip.cc \ 176 176 cntrlc.cc misc.cc \ 177 calcSVD.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 178 186 179 187 # stuff for MP -
Singular/claptmpl.cc
rf27faea rb0d3903 3 3 * Computer Algebra System SINGULAR * 4 4 ****************************************/ 5 // $Id: claptmpl.cc,v 1.4 5 2009-08-14 11:15:34 SingularExp $5 // $Id: claptmpl.cc,v 1.46 2009-09-17 10:27:36 seelisch Exp $ 6 6 /* 7 7 * ABSTRACT - instantiation of all templates … … 256 256 template void noro_step<tgb_uint32>(poly*p,int &pn,slimgb_alg* c); 257 257 //std::priority_queue<MonRedRes> 258 // 259 // begin of template declarations for minor code (Frank Seelisch) 260 #include <list> 261 #include "Minor.h" 262 #include "Cache.h" 263 template class std::list<int>; 264 template class std::list<MinorKey>; 265 template class std::list<LongMinorValue>; 266 template class std::list<PolyMinorValue>; 267 template class Cache<MinorKey, LongMinorValue>; 268 template class Cache<MinorKey, PolyMinorValue>; 269 // end of template declarations for minor code (Frank Seelisch) 258 270 #endif 259 271 //template int pos_helper(kStrategy strat, poly p, int len, intset setL, polyset set); -
Singular/extra.cc
rf27faea rb0d3903 2 2 * Computer Algebra System SINGULAR * 3 3 *****************************************/ 4 /* $Id: extra.cc,v 1.31 5 2009-08-30 15:45:43 edercExp $ */4 /* $Id: extra.cc,v 1.316 2009-09-17 10:27:37 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) 56 58 #include "ffields.h" // test GF only 57 59 … … 2094 2096 else 2095 2097 #endif 2098 /*==================== debug C++ wrappers (Frank Seelisch) ========================*/ 2099 if(strcmp(sys_cmd,"c++wrappers")==0) 2100 { 2101 testWrappers(); 2102 return FALSE; 2103 } 2104 else 2105 /*==================== debug minor code (Frank Seelisch) ========================*/ 2106 if(strcmp(sys_cmd,"minors")==0) 2107 { 2108 if (h == NULL) minorUsageInfo(); /* writes some info to the console 2109 on how to use this experimental code 2110 */ 2111 else if (h->Typ() == INT_CMD) 2112 { 2113 testIntMinors(0); /* effectively no arguments provided: 2114 this starts 5 default tests 2115 with a random matrix with 2116 integer entries; 2117 for that, no ring needs to be 2118 declared 2119 */ 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)h->next->Data(); 2132 const int cacheEntries = (const int)h->next->next->Data(); 2133 const int cacheWeight = (const int)h->next->next->next->Data(); 2134 const int strategies = (const int)h->next->next->next->next->Data(); 2135 const int dumpMinors = (const int)h->next->next->next->next->next->Data(); 2136 const int dumpResults = (const int)h->next->next->next->next->next->next->Data(); 2137 const int dumpComplete = (const int)h->next->next->next->next->next->next->next->Data(); 2138 const int dumpConsole = (const int)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 the 2141 provided matrix m (which is assumed to have polynomial 2142 entries) using a cache with a maximum number of 2143 '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 a 2146 cache ("0") and then afterwards with the caching strategies 2147 1 and 3 2148 */ 2149 } 2150 else if (h->Typ() == POLY_CMD) 2151 { // for quick tests 2152 const poly p = (const poly)h->Data(); 2153 testStuff(p); 2154 } 2155 return FALSE; 2156 } 2157 else 2096 2158 /*==================== generic debug ==================================*/ 2097 2159 //#ifdef PDEBUG … … 2680 2742 opt = 2; 2681 2743 } 2682 h = h->next; 2683 int termination; 2684 if(h != NULL) { 2685 termination = (int) (long) h->Data(); 2686 } 2687 else { 2688 termination = 0; 2689 }res->rtyp=IDEAL_CMD; 2690 res->data=(ideal) F5main(G,r,opt,termination); 2744 res->rtyp=IDEAL_CMD; 2745 res->data=(ideal) F5main(G,r,opt); 2691 2746 return FALSE; 2692 2747 } … … 3297 3352 #endif // HAVE_SINGULAR_PLUS_PLUS 3298 3353 3354 if (strcmp(sys_cmd,"FrankTest")==0) 3355 { 3356 PrintS("Hell Or Word!"); 3357 return FALSE; 3358 }; 3299 3359 3300 3360 #ifdef HAVE_GFAN
Note: See TracChangeset
for help on using the changeset viewer.