Changeset d77a70 in git
- Timestamp:
- Nov 15, 2010, 12:52:43 PM (13 years ago)
- Branches:
- (u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')
- Children:
- c840d97af622b4e4da8761738b540e21144f716b
- Parents:
- 7993adcf5a444486c5b07eacda51e7dfc6d67afc
- Location:
- libfac
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
libfac/charset/charset.cc
r7993ad rd77a70 323 323 } 324 324 325 #ifdef EXPERIMENTAL326 static CFList327 getItemNr( int nr, const ListCFList & copy){328 int i =1;329 CFList elem;330 331 for ( ListCFListIterator j=copy; j.hasItem(); j++ )332 if ( i == nr ) { elem=j.getItem(); break; }333 else { i+= 1; }334 return elem;335 }336 337 static int338 choosefrom(){339 int choice;340 CERR << "choose from qhi! ->";341 CIN >> choice;342 return choice;343 }344 345 static ListCFList346 msort( const ListCFList & list_to_sort ){347 int nr, number = list_to_sort.length();348 ListCFList output;349 350 CERR << "Sort: list to sort is: " << list_to_sort << "\n";351 for (int i=1; i<= number; i++){352 CERR << " Next elem = "; CIN >> nr;353 output.append(getItemNr(nr,list_to_sort));354 }355 return output;356 }357 #endif358 359 325 #ifdef IRRCHARSERIESDEBUG 360 326 # define DEBUGOUTPUT … … 370 336 ListCFList pi,ppi,qqi,qsi,iss,qhi= ListCFList(PS); 371 337 int nr_of_iteration=0,ts2,highestlevel=0; 372 #ifdef EXPERIMENTAL373 int choice=1;;374 #endif375 338 376 339 // CERR << getCharacteristic() << "\n"; … … 386 349 qhi=sort(qhi); 387 350 DEBOUTLN(CERR, "qhi is: ", qhi); 388 #ifdef EXPERIMENTAL389 choice=choosefrom();390 CERR <<"/n Choose " << choice << "\n";391 qs= getItemNr(choice, qhi);392 #else393 351 qs=qhi.getFirst(); 394 #endif395 352 DEBOUTLN(CERR, "qs is: ", qs); 396 353 DEBOUTLN(CERR, "ppi is: ", ppi); -
libfac/factor/Factor.cc
r7993ad rd77a70 588 588 } 589 589 590 #ifdef EXPERIMENTAL591 static int592 find_evaluation(int maxtries, int sametries, int failtries, const CanonicalForm &f , const Variable & Extension, SFormList & BestEvaluationpoint, CFFList & BestFactorisation ){593 int success;594 595 success=evaluate( maxtries, sametries, failtries, f , Extension, BestEvaluationpoint, BestFactorisation );596 return success;597 }598 #endif599 600 590 /////////////////////////////////////////////////////////////// 601 591 // A factorization routine for a sqrfree polynomial. // … … 820 810 } 821 811 822 // for debuggig:823 812 int cmpCF( const CFFactor & f, const CFFactor & g ); 824 813
Note: See TracChangeset
for help on using the changeset viewer.