Changeset 9a080b in git
- Timestamp:
- Apr 29, 2010, 11:21:59 AM (14 years ago)
- Branches:
- (u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'b4f17ed1d25f93d46dbe29e4b499baecc2fd51bb')
- Children:
- bd6142c14705f6b8f27233e5ed1c2e662e4688a2
- Parents:
- 54336c481c620ff99efa404afce564b6a1c62203
- git-author:
- Hans Schoenemann <hannes@mathematik.uni-kl.de>2010-04-29 11:21:59+02:00
- git-committer:
- Mohamed Barakat <mohamed.barakat@rwth-aachen.de>2011-11-09 11:50:22+01:00
- Location:
- coeffs
- Files:
-
- 1 edited
- 2 moved
Legend:
- Unmodified
- Added
- Removed
-
coeffs/numbers.cc
r54336c r9a080b 80 80 81 81 number ndCopy(number a) { return a; } 82 number nd_Copy(number a,const coeffs r) { return r-> nCopy(a); }82 number nd_Copy(number a,const coeffs r) { return r->cfCopy(a,r); } 83 83 84 84 #ifdef HAVE_RINGS … … 254 254 if (nField_is_Extension(r)) 255 255 { 256 //n aInitChar(c,TRUE,r);257 n->cfDelete = n aDelete;258 n->nNormalize = n aNormalize;259 n->cfInit = n aInit;260 n->nPar = n aPar;261 n->nParDeg = n aParDeg;262 n->n_Int = n aInt;263 n->nAdd = n aAdd;264 n->nSub = n aSub;265 n->nMult = n aMult;266 n->nDiv = n aDiv;267 n->nExactDiv = n aDiv;268 n->nIntDiv = n aIntDiv;269 n->nNeg = n aNeg;270 n->nInvers = n aInvers;271 n->nCopy = naCopy;272 n->cfCopy = n a_Copy;273 n->nGreater = n aGreater;274 n->nEqual = n aEqual;275 n->nIsZero = n aIsZero;276 n->nIsOne = n aIsOne;277 n->nIsMOne = n aIsMOne;278 n->nGreaterZero = n aGreaterZero;279 n->cfWrite = n aWrite;280 n->nRead = n aRead;281 n->nPower = n aPower;282 n->nGcd = n aGcd;283 n->nLcm = n aLcm;284 n->cfSetMap = n aSetMap;285 n->nName = n aName;286 n->nSize = n aSize;256 //ntInitChar(c,TRUE,r); 257 n->cfDelete = ntDelete; 258 n->nNormalize = ntNormalize; 259 n->cfInit = ntInit; 260 n->nPar = ntPar; 261 n->nParDeg = ntParDeg; 262 n->n_Int = ntInt; 263 n->nAdd = ntAdd; 264 n->nSub = ntSub; 265 n->nMult = ntMult; 266 n->nDiv = ntDiv; 267 n->nExactDiv = ntDiv; 268 n->nIntDiv = ntIntDiv; 269 n->nNeg = ntNeg; 270 n->nInvers = ntInvers; 271 //n->nCopy = ntCopy; 272 n->cfCopy = nt_Copy; 273 n->nGreater = ntGreater; 274 n->nEqual = ntEqual; 275 n->nIsZero = ntIsZero; 276 n->nIsOne = ntIsOne; 277 n->nIsMOne = ntIsMOne; 278 n->nGreaterZero = ntGreaterZero; 279 n->cfWrite = ntWrite; 280 n->nRead = ntRead; 281 n->nPower = ntPower; 282 n->nGcd = ntGcd; 283 n->nLcm = ntLcm; 284 n->cfSetMap = ntSetMap; 285 n->nName = ntName; 286 n->nSize = ntSize; 287 287 n->cfGetDenom = napGetDenom; 288 288 n->cfGetNumerator = napGetNumerator; … … 297 297 nr2mInitExp(c,r); 298 298 n->cfInit = nr2mInit; 299 n->nCopy = nr2mCopy;299 //n->nCopy = nr2mCopy; 300 300 n->n_Int = nr2mInt; 301 301 n->nAdd = nr2mAdd; … … 338 338 n->cfInit = nrnInit; 339 339 n->cfDelete= nrnDelete; 340 n->nCopy = nrnCopy;341 340 n->cfCopy = cfrnCopy; 342 341 n->nSize = nrnSize; … … 379 378 n->cfInit = nrzInit; 380 379 n->cfDelete= nrzDelete; 381 n->nCopy = nrzCopy;382 380 n->cfCopy = cfrzCopy; 383 381 n->nSize = nrzSize; … … 432 430 n->nNeg = nlNeg; 433 431 n->nInvers= nlInvers; 434 n->nCopy = nlCopy;432 //n->nCopy = nlCopy; 435 433 n->nGreater = nlGreater; 436 434 n->nEqual = nlEqual; … … 465 463 n->nNeg = npNeg; 466 464 n->nInvers= npInvers; 467 n->nCopy = ndCopy;465 //n->nCopy = ndCopy; 468 466 n->nGreater = npGreater; 469 467 n->nEqual = npEqual; … … 508 506 n->nNeg = nfNeg; 509 507 n->nInvers= nfInvers; 510 n->nCopy = ndCopy;508 //n->nCopy = ndCopy; 511 509 n->nGreater = nfGreater; 512 510 n->nEqual = nfEqual; … … 538 536 n->nNeg = nrNeg; 539 537 n->nInvers= nrInvers; 540 n->nCopy = ndCopy;538 //n->nCopy = ndCopy; 541 539 n->nGreater = nrGreater; 542 540 n->nEqual = nrEqual; … … 568 566 n->nNeg = ngfNeg; 569 567 n->nInvers= ngfInvers; 570 n->nCopy = ngfCopy;568 //n->nCopy = ngfCopy; 571 569 n->nGreater = ngfGreater; 572 570 n->nEqual = ngfEqual; … … 599 597 n->nNeg = ngcNeg; 600 598 n->nInvers= ngcInvers; 601 n->nCopy = ngcCopy;599 //n->nCopy = ngcCopy; 602 600 n->nGreater = ngcGreater; 603 601 n->nEqual = ngcEqual; … … 625 623 #endif 626 624 #ifdef HAVE_RINGS 627 if (n->nGetUnit==(nMapFunc)NULL) n->nGetUnit=n-> nCopy;625 if (n->nGetUnit==(nMapFunc)NULL) n->nGetUnit=n->cfCopy; 628 626 #endif 629 627 if (!errorreported)
Note: See TracChangeset
for help on using the changeset viewer.