Changeset 0771f61 in git
- Timestamp:
- Aug 29, 2013, 7:20:47 PM (10 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'f875bbaccd0831e36aaed09ff6adeb3eb45aeb94')
- Children:
- b7f0f6186eab1c696b147ac57fcbd516815f9824
- Parents:
- 9f8c05a875ee27eb1bad4fbba07a54f8b840bdee1bd66a991e79c78005896fceae480efead1db509
- Location:
- factory
- Files:
-
- 7 edited
Legend:
- Unmodified
- Added
- Removed
-
factory/cf_assert.h
r9f8c05 r0771f61 32 32 #ifdef HAVE_CSTDIO 33 33 #include <cstdio> 34 #include <cstdlib> 34 35 #else 35 36 extern "C" { -
factory/cf_gcd_smallp.cc
r9f8c05 r0771f61 2124 2124 if (F == G) return F/Lc(F); 2125 2125 2126 ASSERT (degree (A, 1) == 0, "expected degree (F, 1) == 0"); 2127 ASSERT (degree (B, 1) == 0, "expected degree (G, 1) == 0"); 2128 2126 2129 CFMap M,N; 2127 2130 int best_level= myCompress (A, B, M, N, false); … … 2134 2137 2135 2138 Variable x= Variable (1); 2136 ASSERT (degree (A, x) == 0, "expected degree (F, 1) == 0");2137 ASSERT (degree (B, x) == 0, "expected degree (G, 1) == 0");2138 2139 2139 2140 //univariate case … … 2291 2292 if (Monoms.size() == 0) 2292 2293 Monoms= getMonoms (skel); 2293 if (coeffMonoms == NULL) 2294 2294 2295 coeffMonoms= new CFArray [skelSize]; 2295 2296 j= 0; 2296 2297 for (CFIterator i= skel; i.hasTerms(); i++, j++) … … 2348 2349 delete[] pM; 2349 2350 delete[] pL; 2351 delete[] coeffMonoms; 2350 2352 2351 2353 if (alpha.level() != 1 && V_buf != alpha) … … 2360 2362 else 2361 2363 { 2362 delete[] coeffMonoms;2363 2364 fail= true; 2364 2365 return 0; … … 2382 2383 if (F == G) return F/Lc(F); 2383 2384 2385 ASSERT (degree (A, 1) == 0, "expected degree (F, 1) == 0"); 2386 ASSERT (degree (B, 1) == 0, "expected degree (G, 1) == 0"); 2387 2384 2388 CFMap M,N; 2385 2389 int best_level= myCompress (A, B, M, N, false); … … 2392 2396 2393 2397 Variable x= Variable (1); 2394 ASSERT (degree (A, x) == 0, "expected degree (F, 1) == 0");2395 ASSERT (degree (B, x) == 0, "expected degree (G, 1) == 0");2396 2398 2397 2399 //univariate case … … 2554 2556 Monoms= getMonoms (skel); 2555 2557 2556 if (coeffMonoms == NULL) 2557 coeffMonoms= new CFArray [skelSize]; 2558 coeffMonoms= new CFArray [skelSize]; 2558 2559 2559 2560 j= 0; … … 2866 2867 } 2867 2868 result= N(result); 2869 delete[] pEvalPoints; 2870 delete[] pMat; 2871 delete[] pL; 2872 delete[] coeffMonoms; 2873 delete[] pM; 2874 2875 if (bufpEvalPoints != NULL) 2876 delete [] bufpEvalPoints; 2868 2877 if (fdivides (result, F) && fdivides (result, G)) 2869 {2870 delete[] pEvalPoints;2871 delete[] pMat;2872 delete[] pL;2873 delete[] pM;2874 if (bufpEvalPoints != NULL)2875 delete [] bufpEvalPoints;2876 2878 return result; 2877 }2878 2879 else 2879 2880 { 2880 delete[] pEvalPoints;2881 delete[] pMat;2882 delete[] pL;2883 delete[] coeffMonoms;2884 delete[] pM;2885 if (bufpEvalPoints != NULL)2886 delete [] bufpEvalPoints;2887 2881 fail= true; 2888 2882 return 0; … … 2950 2944 delete[] pL; 2951 2945 delete[] pM; 2946 delete[] coeffMonoms; 2952 2947 2953 2948 if (alpha.level() != 1 && V_buf != alpha) … … 2962 2957 else 2963 2958 { 2964 delete[] coeffMonoms;2965 2959 fail= true; 2966 2960 return 0; … … 3192 3186 { 3193 3187 CFArray Monoms; 3194 CFArray *coeffMonoms = NULL;3188 CFArray *coeffMonoms; 3195 3189 do //second do 3196 3190 { … … 3627 3621 { 3628 3622 CFArray Monoms; 3629 CFArray* coeffMonoms = NULL;3623 CFArray* coeffMonoms; 3630 3624 3631 3625 do //second do -
factory/cf_gcd_smallp.h
r9f8c05 r0771f61 79 79 CanonicalForm sparseGCDFp (const CanonicalForm& A, const CanonicalForm& B) 80 80 { 81 ASSERT (CFFactory::gettype() == GaloisFieldDomain,82 " GFas base field expected");81 ASSERT (CFFactory::gettype() == FiniteFieldDomain, 82 "Fp as base field expected"); 83 83 CFList list; 84 84 bool topLevel= true; -
factory/cf_ops.cc
r9f8c05 r0771f61 511 511 { 512 512 if ( f.inCoeffDomain() ) 513 return 0; 513 { 514 if (degs != 0) 515 return degs; 516 else 517 return 0; 518 } 514 519 else 515 520 { -
factory/facFqFactorize.cc
r9f8c05 r0771f61 138 138 int n= F.level(); 139 139 int * degsf= new int [n + 1]; 140 int ** swap; 141 swap= new int* [n + 1]; 140 int ** swap= new int* [n + 1]; 142 141 for (int i= 0; i <= n; i++) 143 142 { … … 206 205 } 207 206 208 for (i= 0; i <= n; i++)207 for (i= 0; i <= F.level(); i++) 209 208 delete [] swap[i]; 210 209 delete [] swap; -
factory/libfac/factor/tmpl_inst.cc
r9f8c05 r0771f61 15 15 #include "cf_reval.h" 16 16 17 //#include "templates/ftmpl_array.cc"17 #include "templates/ftmpl_array.cc" 18 18 //#include "templates/ftmpl_factor.cc" 19 19 #include "templates/ftmpl_list.cc" … … 48 48 #endif 49 49 50 template class Array<int>;51 template class Array<Variable>;50 //template class Array<int>; 51 //template class Array<Variable>; 52 52 53 53 // for database -
factory/variable.cc
r9f8c05 r0771f61 52 52 Variable::Variable( int l ) : _level(l) 53 53 { 54 ASSERT( l > 0 && l != LEVELQUOT, "illegal level" );54 //ASSERT( l > 0 && l != LEVELQUOT, "illegal level" ); 55 55 } 56 56
Note: See TracChangeset
for help on using the changeset viewer.