Changeset 140eba in git
- Timestamp:
- Oct 2, 2009, 6:13:30 PM (15 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 282c8deab35084fc64a96436958aa62840192abb
- Parents:
- 414d035b432a95898b803d8803f4ebc5eee0166e
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/extra.cc
r414d03 r140eba 2 2 * Computer Algebra System SINGULAR * 3 3 *****************************************/ 4 /* $Id: extra.cc,v 1.3 19 2009-10-02 13:51:19seelisch Exp $ */4 /* $Id: extra.cc,v 1.320 2009-10-02 16:13:30 seelisch Exp $ */ 5 5 /* 6 6 * ABSTRACT: general interface to internals of Singular ("system" command) … … 2109 2109 else if (h->Typ() == INT_CMD) 2110 2110 { 2111 const int detailedOutput = (const int) h->Data();2111 const int detailedOutput = (const int)(long)h->Data(); 2112 2112 testWrappers(detailedOutput == 0 ? FALSE : TRUE); 2113 2113 // wrapper tests, with or without detailed printout … … 2140 2140 { 2141 2141 const matrix m = (const matrix)h->Data(); 2142 const int k = (const int) h->next->Data();2143 const int strategy = (const int) h->next->next->Data();2144 const int cacheEntries = (const int) h->next->next->next->Data();2142 const int k = (const int)(long)h->next->Data(); 2143 const int strategy = (const int)(long)h->next->next->Data(); 2144 const int cacheEntries = (const int)(long)h->next->next->next->Data(); 2145 2145 const long cacheWeight = (const long)h->next->next->next->next->Data(); 2146 2146 ideal iii = testAllPolyMinorsAsIdeal(m, k, strategy, cacheEntries, cacheWeight); … … 2165 2165 { 2166 2166 const matrix m = (const matrix)h->Data(); 2167 const int k = (const int) h->next->Data();2168 const int strategies = (const int) h->next->next->Data();2169 const int cacheEntries = (const int) h->next->next->next->Data();2167 const int k = (const int)(long)h->next->Data(); 2168 const int strategies = (const int)(long)h->next->next->Data(); 2169 const int cacheEntries = (const int)(long)h->next->next->next->Data(); 2170 2170 const long cacheWeight = (const long)h->next->next->next->next->Data(); 2171 const int dumpMinors = (const int) h->next->next->next->next->next->Data();2172 const int dumpResults = (const int) h->next->next->next->next->next->next->Data();2173 const int dumpComplete = (const int) h->next->next->next->next->next->next->next->Data();2174 const int dumpConsole = (const int) h->next->next->next->next->next->next->next->next->Data();2171 const int dumpMinors = (const int)(long)h->next->next->next->next->next->Data(); 2172 const int dumpResults = (const int)(long)h->next->next->next->next->next->next->Data(); 2173 const int dumpComplete = (const int)(long)h->next->next->next->next->next->next->next->Data(); 2174 const int dumpConsole = (const int)(long)h->next->next->next->next->next->next->next->next->Data(); 2175 2175 testAllPolyMinors(m, k, strategies, cacheEntries, cacheWeight, dumpMinors, dumpResults, dumpComplete, dumpConsole); 2176 2176 // starts the computation of all k x k minors in the
Note: See TracChangeset
for help on using the changeset viewer.