Changeset ebbb9c in git
- Timestamp:
- May 23, 2012, 2:31:59 PM (11 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
- Children:
- a28cb4f3357225d7f8bb8d68a4aa0b0be3ccdd41
- Parents:
- 243404529d5f96ca508e7b74fd54f12c826fdb45
- Files:
-
- 6 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/MinorInterface.cc
r243404 rebbb9c 101 101 102 102 /* the ideal to be returned: */ 103 ideal iii = idInit(1 , 0);103 ideal iii = idInit(1); 104 104 105 105 bool zeroOk = ((k < 0) ? true : false); /* for k = 0, all minors are requested, … … 122 122 in iii which come after the computed minors */ 123 123 ideal jjj; 124 if (collectedMinors == 0) jjj = idInit(1 , 0);124 if (collectedMinors == 0) jjj = idInit(1); 125 125 else jjj = idCopyFirstK(iii, collectedMinors); 126 126 idDelete(&iii); … … 155 155 156 156 /* the ideal to be returned: */ 157 ideal iii = idInit(1 , 0);157 ideal iii = idInit(1); 158 158 159 159 bool zeroOk = ((k < 0) ? true : false); /* for k = 0, all minors are … … 187 187 in iii which come after the computed minors */ 188 188 ideal jjj; 189 if (collectedMinors == 0) jjj = idInit(1 , 0);189 if (collectedMinors == 0) jjj = idInit(1); 190 190 else jjj = idCopyFirstK(iii, collectedMinors); 191 191 idDelete(&iii); … … 327 327 328 328 /* the ideal to be returned: */ 329 ideal iii = idInit(1 , 0);329 ideal iii = idInit(1); 330 330 331 331 bool zeroOk = ((k < 0) ? true : false); /* for k = 0, all minors are … … 348 348 in iii which come after the computed minors */ 349 349 ideal jjj; 350 if (collectedMinors == 0) jjj = idInit(1 , 0);350 if (collectedMinors == 0) jjj = idInit(1); 351 351 else jjj = idCopyFirstK(iii, collectedMinors); 352 352 idDelete(&iii); … … 384 384 385 385 /* the ideal to be returned: */ 386 ideal iii = idInit(1 , 0);386 ideal iii = idInit(1); 387 387 388 388 bool zeroOk = ((k < 0) ? true : false); /* for k = 0, all minors are … … 416 416 in iii which come after the computed minors */ 417 417 ideal jjj; 418 if (collectedMinors == 0) jjj = idInit(1 , 0);418 if (collectedMinors == 0) jjj = idInit(1); 419 419 else jjj = idCopyFirstK(iii, collectedMinors); 420 420 idDelete(&iii); … … 531 531 else if (currRingIsOverField() && (vars == 3) 532 532 && (currRing->cf->ch >= 2) && (currRing->cf->ch <= 32003)) 533 533 b = true; 534 534 } 535 535 if (!b) -
Singular/fglm.cc
r243404 rebbb9c 1 1 // emacs edit mode for this file is -*- C++ -*- 2 // $Id$3 2 4 3 /**************************************** … … 196 195 for ( k= IDELEMS( sring->qideal )-1; k >= 0; k-- ) 197 196 (sqind->m)[k]= p_PermPoly( (sring->qideal->m)[k], vperm, sring, 198 197 currRing, nMap); 199 198 ideal sqindred = kNF( dring->qideal, NULL, sqind ); 200 199 if ( ! idIs0( sqindred ) ) … … 215 214 for ( k= IDELEMS( dring->qideal )-1; k >= 0; k-- ) 216 215 (dqins->m)[k]=p_PermPoly( (dring->qideal->m)[k], dsvperm, sring, 217 216 currRing, nMap); 218 217 ideal dqinsred = kNF( sring->qideal, NULL, dqins ); 219 218 if ( ! idIs0( dqinsred ) ) … … 333 332 case FglmIncompatibleRings: 334 333 Werror( "ring %s and current ring are incompatible", first->Name() ); 335 destIdeal= idInit(0,0);334 destIdeal= NULL; 336 335 break; 337 336 case FglmNoIdeal: 338 337 Werror( "Can't find ideal %s in ring %s", second->Name(), first->Name() ); 339 destIdeal= idInit(0,0);338 destIdeal= NULL; 340 339 break; 341 340 case FglmNotZeroDim: 342 341 Werror( "The ideal %s has to be 0-dimensional", second->Name() ); 343 destIdeal= idInit(0,0);342 destIdeal= NULL; 344 343 break; 345 344 case FglmNotReduced: 346 345 Werror( "The ideal %s has to be given by a reduced SB", second->Name() ); 347 destIdeal= idInit(0,0);346 destIdeal= NULL; 348 347 break; 349 348 default: … … 395 394 case FglmNotZeroDim: 396 395 Werror( "The ideal %s has to be 0-dimensional", first->Name() ); 397 destIdeal= idInit(0,0);396 destIdeal= NULL; 398 397 break; 399 398 case FglmNotReduced: 400 399 Werror( "The poly %s has to be reduced", second->Name() ); 401 destIdeal= idInit(0,0);400 destIdeal= NULL; 402 401 break; 403 402 case FglmPolyIsOne: … … 480 479 case FglmNotZeroDim: 481 480 Werror( "The ideal %s has to be 0-dimensional", first->Name() ); 482 destIdeal= idInit(0,0);481 destIdeal= NULL; 483 482 break; 484 483 case FglmNotReduced: 485 484 Werror( "The ideal %s has to be reduced", first->Name() ); 486 destIdeal= idInit(0,0);485 destIdeal= NULL; 487 486 break; 488 487 default: -
Singular/iparith.cc
r243404 rebbb9c 3956 3956 { 3957 3957 L->Init(1); 3958 L->m[0].data=(char *)idInit( 0,1);3958 L->m[0].data=(char *)idInit(1); 3959 3959 L->m[0].rtyp=IDEAL_CMD; 3960 3960 } -
Singular/ipassign.cc
r243404 rebbb9c 1210 1210 leftv hh=r; 1211 1211 int i = 0; 1212 if (bim->length()==0) { WerrorS("bigintmat is 1x0"); delete bim; return TRUE; } 1212 1213 while (hh!=NULL) 1213 1214 { … … 1230 1231 { 1231 1232 bim->set(i++, (number)(hh->Data())); 1232 } 1233 } 1233 1234 /* 1234 1235 ((hh->Typ() == INTVEC_CMD) -
Singular/walk_ip.cc
r243404 rebbb9c 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id$ */5 4 /* 6 5 * ABSTRACT: frwalk: interpreter link … … 122 121 Werror("ring %s and current ring are incompatible\n", 123 122 first->Name() ); 124 destIdeal= idInit(0,0);123 destIdeal= NULL; 125 124 break; 126 125 127 126 case WalkIncompatibleDestRing: 128 127 Werror( "Order of basering not allowed,\n must be a combination of a,A,lp,dp,Dp,wp,Wp,M and C.\n"); 129 destIdeal= idInit(0,0);128 destIdeal= NULL; 130 129 break; 131 130 … … 133 132 Werror( "Order of %s not allowed,\n must be a combination of a,A,lp,dp,Dp,wp,Wp,M and C.\n",first->Name()); 134 133 rChangeCurrRing(destRing); 135 destIdeal= idInit(0,0);134 destIdeal= NULL; 136 135 break; 137 136 … … 139 138 Werror( "Can't find ideal %s in ring %s.\n", 140 139 second->Name(), first->Name() ); 141 destIdeal= idInit(0,0);140 destIdeal= NULL; 142 141 break; 143 142 144 143 case WalkOverFlowError: 145 144 Werror( "Overflow occured.\n"); 146 destIdeal= idInit(0,0);145 destIdeal= NULL; 147 146 break; 148 147 149 148 default: 150 destIdeal= idInit(1,1);149 destIdeal= NULL; 151 150 } 152 151 … … 234 233 first->Name() ); 235 234 rChangeCurrRing(destRing); 236 destIdeal= idInit(0,0);235 destIdeal= NULL; 237 236 return destIdeal; 238 237 break; … … 241 240 Werror( "Order of basering not allowed,\n must be a combination of lp,dp,Dp,wp,Wp and C or just M.\n"); 242 241 rChangeCurrRing(destRing); 243 destIdeal= idInit(0,0);242 destIdeal= NULL; 244 243 return destIdeal; 245 244 break; … … 249 248 first->Name()); 250 249 rChangeCurrRing(destRing); 251 destIdeal= idInit(0,0);250 destIdeal= NULL; 252 251 return destIdeal; 253 252 break; … … 257 256 second->Name(), first->Name() ); 258 257 rChangeCurrRing(destRing); 259 destIdeal= idInit(0,0);258 destIdeal= NULL; 260 259 return destIdeal; 261 260 break; … … 264 263 Werror( "Overflow occured in ring %s.\n", first->Name() ); 265 264 rChangeCurrRing(destRing); 266 destIdeal= idInit(0,0);265 destIdeal= NULL; 267 266 return destIdeal; 268 267 break; -
libpolys/coeffs/bigintmat.h
r243404 rebbb9c 99 99 void inpMult(number bintop, const coeffs C = NULL); 100 100 101 inline int length() { return col*row; } 101 102 inline int cols() const { return col; } 102 103 inline int rows() const { return row; }
Note: See TracChangeset
for help on using the changeset viewer.