Changeset 213d64 in git
- Timestamp:
- Sep 6, 2011, 7:41:41 PM (12 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'cdfcdb8287f66bc6070028082cbbc6eff10e609b')
- Children:
- 8971393da48956f59e22d5443b7384017185f219
- Parents:
- 08e15e7aa667fe0a2a40175b200adac4ea0592ca
- git-author:
- Oleksandr Motsak <motsak@mathematik.uni-kl.de>2011-09-06 19:41:41+02:00
- git-committer:
- Mohamed Barakat <mohamed.barakat@rwth-aachen.de>2011-11-09 16:12:32+01:00
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/ipshell.cc
r08e15e7 r213d64 57 57 #include <coeffs/mpr_complex.h> 58 58 #include <coeffs/longrat.h> 59 59 60 #include <numeric/mpr_base.h> 60 61 #include <numeric/mpr_numeric.h> … … 4516 4517 { 4517 4518 arranger->arrange(); 4518 listofroots= arranger->listOfRoots(gmp_output_digits );4519 listofroots= listOfRoots(arranger, gmp_output_digits ); 4519 4520 } 4520 4521 else … … 4545 4546 4546 4547 // from mpr_numeric.cc 4547 lists rootArranger::listOfRoots(const unsigned int oprec )4548 lists listOfRoots( rootArranger* self, const unsigned int oprec ) 4548 4549 { 4549 4550 int i,j,tr; 4550 int count= roots[0]->getAnzRoots(); // number of roots4551 int elem= roots[0]->getAnzElems(); // number of koordinates per root4551 int count= self->roots[0]->getAnzRoots(); // number of roots 4552 int elem= self->roots[0]->getAnzElems(); // number of koordinates per root 4552 4553 4553 4554 lists listofroots= (lists)omAlloc( sizeof(slists) ); // must be done this way! 4554 4555 4555 if ( found_roots )4556 if ( self->found_roots ) 4556 4557 { 4557 4558 listofroots->Init( count ); … … 4566 4567 { 4567 4568 onepoint->m[j].rtyp=STRING_CMD; 4568 onepoint->m[j].data=(void *)complexToStr((*roots[j])[i],oprec, 4569 currRing->cf); 4569 onepoint->m[j].data=(void *)complexToStr((*self->roots[j])[i],oprec, currRing->cf); 4570 4570 } 4571 4571 else 4572 4572 { 4573 4573 onepoint->m[j].rtyp=NUMBER_CMD; 4574 onepoint->m[j].data=(void *)n Copy((number)(roots[j]->getRoot(i)));4574 onepoint->m[j].data=(void *)n_Copy((number)(self->roots[j]->getRoot(i)), currRing->cf); 4575 4575 } 4576 4576 onepoint->m[j].next= NULL; -
numeric/mpr_numeric.h
r08e15e7 r213d64 145 145 //<- 146 146 147 class slists; typedef slists * lists; 148 147 149 //-> class rootArranger 148 150 class rootArranger 149 151 { 150 152 public: 153 friend lists listOfRoots( rootArranger*, const unsigned int oprec ); 154 151 155 rootArranger( rootContainer ** _roots, 152 156 rootContainer ** _mu, … … 156 160 void solve_all(); 157 161 void arrange(); 158 159 lists listOfRoots( const unsigned int oprec );160 162 161 163 const bool success() { return found_roots; }
Note: See TracChangeset
for help on using the changeset viewer.