Changeset 1673386 in git
- Timestamp:
- Apr 11, 2011, 4:00:33 PM (13 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 5f4463c81efc75ad1f905707628cb16a56f6c0d3
- Parents:
- 526e40d402c852186bd63157812aa8c82bb611f6
- Location:
- factory
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
factory/facFqBivar.cc
r526e40d r1673386 265 265 266 266 CanonicalForm g, LCBuf= LC (buf, Variable (1)); 267 int v[T.length()];267 int * v= new int [T.length()]; 268 268 for (int i= 0; i < T.length(); i++) 269 269 v[i]= 0; … … 283 283 if (T.length() == s) 284 284 { 285 delete [] v; 285 286 if (recombination) 286 287 { … … 354 355 bufDegs1.getLength() == 1) 355 356 { 357 delete [] v; 356 358 if (recombination) 357 359 { … … 378 380 if (T.length() < 2*s || T.length() == s) 379 381 { 382 delete [] v; 380 383 if (recombination) 381 384 { … … 389 392 } 390 393 } 391 int v [T.length()];392 394 for (int i= 0; i < T.length(); i++) 393 395 v[i]= 0; … … 397 399 appendMapDown (result, F (y - eval, y), info, source, dest); 398 400 401 delete [] v; 399 402 return result; 400 403 } … … 419 422 CanonicalForm LCBuf= LC (F, Variable (1)); 420 423 CanonicalForm g, buf= F; 421 int v[T.length()];424 int * v= new int [T.length()]; 422 425 for (int i= 0; i < T.length(); i++) 423 426 v[i]= 0; … … 435 438 if (T.length() == s) 436 439 { 440 delete [] v; 437 441 if (recombination) 438 442 { … … 478 482 bufDegs1.getLength() == 1) 479 483 { 484 delete [] v; 480 485 if (recombination) 481 486 { … … 496 501 if (T.length() < 2*s || T.length() == s) 497 502 { 503 delete [] v; 498 504 if (recombination) 499 505 { … … 504 510 return CFList (F); 505 511 } 506 int v [T.length()];507 512 for (int i= 0; i < T.length(); i++) 508 513 v[i]= 0; … … 512 517 result.append (F); 513 518 519 delete [] v; 514 520 return result; 515 521 } -
factory/facFqBivarUtil.cc
r526e40d r1673386 318 318 return; 319 319 } 320 int v[setSize];320 int * v= new int [setSize]; 321 321 for (int i= 0; i < setSize; i++) 322 322 v[i]= index[i]; … … 327 327 { 328 328 noSubset= true; 329 delete [] v; 329 330 return; 330 331 } … … 337 338 { 338 339 noSubset= true; 340 delete [] v; 339 341 return; 340 342 } … … 349 351 { 350 352 noSubset= true; 353 delete [] v; 351 354 return; 352 355 } … … 358 361 for (int i= 0; i < setSize; i++) 359 362 index[i]= v[i]; 360 return;363 delete [] v; 361 364 } 362 365 -
factory/facFqFactorize.cc
r526e40d r1673386 198 198 CanonicalForm LCBuf= LC (buf, Variable (1)); 199 199 CanonicalForm g, gg; 200 int v[T.length()];200 int * v= new int [T.length()]; 201 201 for (int i= 0; i < T.length(); i++) 202 202 v[i]= 0; … … 213 213 { 214 214 result.append (prodMod (T, M)); 215 delete [] v; 215 216 return result; 216 217 } … … 244 245 { 245 246 result.append (prodMod (T, M)); 247 delete [] v; 246 248 return result; 247 249 } … … 257 259 { 258 260 result.append (prodMod (T, M)); 261 delete [] v; 259 262 return result; 260 263 } 261 int v [T.length()];262 264 for (int i= 0; i < T.length(); i++) 263 265 v[i]= 0; … … 267 269 result.append (prodMod (T, M)); 268 270 271 delete [] v; 269 272 return result; 270 273 } … … 635 638 CanonicalForm g, LCBuf= LC (buf, Variable (1)); 636 639 CanonicalForm buf2; 637 int v[T.length()];640 int * v= new int [T.length()]; 638 641 for (int i= 0; i < T.length(); i++) 639 642 v[i]= 0; … … 650 653 if (T.length() == s) 651 654 { 655 delete [] v; 652 656 if (recombination) 653 657 { … … 666 670 return CFList (buf); 667 671 } 668 return result;669 672 } 670 673 … … 712 715 buf /= Lc (buf); 713 716 appendTestMapDown (result, buf, info, source, dest); 717 delete [] v; 714 718 return result; 715 719 } … … 726 730 buf= reverseShift (buf, evaluation); 727 731 appendTestMapDown (result, buf, info, source, dest); 732 delete [] v; 728 733 return result; 729 734 } 730 int v [T.length()];731 735 for (int i= 0; i < T.length(); i++) 732 736 v[i]= 0; … … 739 743 } 740 744 745 delete [] v; 741 746 return result; 742 747 } … … 759 764 CanonicalForm LCBuf= LC (F, Variable (1)); 760 765 CanonicalForm g, buf= F; 761 int v[T.length()];766 int * v= new int [T.length()]; 762 767 for (int i= 0; i < T.length(); i++) 763 768 v[i]= 0; … … 775 780 if (T.length() == s) 776 781 { 782 delete [] v; 777 783 if (recombination) 778 784 { … … 801 807 { 802 808 result.append (buf); 809 delete [] v; 803 810 return result; 804 811 } … … 812 819 { 813 820 result.append (buf); 821 delete [] v; 814 822 return result; 815 823 } 816 int v [T.length()];817 824 for (int i= 0; i < T.length(); i++) 818 825 v[i]= 0; … … 822 829 result.append (F); 823 830 831 delete [] v; 824 832 return result; 825 833 }
Note: See TracChangeset
for help on using the changeset viewer.