- Timestamp:
- Nov 12, 2008, 5:06:50 PM (15 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 4378bb1d8689acd01ff886e652e17cc6f231274c
- Parents:
- 254a326422aa010fa57986f524945ceabe9f9b82
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/ideals.cc
r254a326 r6bd405 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ideals.cc,v 1.6 1 2008-11-12 12:41:03Singular Exp $ */4 /* $Id: ideals.cc,v 1.62 2008-11-12 16:06:50 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT - all basic methods to manipulate ideals … … 2442 2442 block1=(int*)omAlloc0(ordersize*sizeof(int)); 2443 2443 wv=(int**) omAlloc0(ordersize*sizeof(int**)); 2444 #if 0 2444 2445 if (rIsPluralRing(origR)) // we have too keep the odering: it may be needed 2445 2446 // for G-algebra … … 2469 2470 omFreeSize((ADDRESS)x, 2 * (pVariables + 1) * sizeof(int)); 2470 2471 2471 #if 0 2472 for (k=0;k<ordersize-1; k++) 2473 { 2474 if ( (origR->order[k]==ringorder_c) 2475 || (origR->order[k]==ringorder_C)) 2476 { 2477 ord[2]=origR->order[k]; 2478 break; 2479 } 2480 } 2472 ord[2]=ringorder_C; 2473 ord[3]=0; 2474 } 2481 2475 #else 2482 ord[2]=ringorder_C; 2476 for (k=0;k<ordersize-1; k++) 2477 { 2478 block0[k+1] = origR->block0[k]; 2479 block1[k+1] = origR->block1[k]; 2480 ord[k+1] = origR->order[k]; 2481 if (origR->wvhdl[k]!=NULL) wv[k+1] = (int*) omMemDup(origR->wvhdl[k]); 2482 } 2483 2483 #endif 2484 ord[3]=0;2485 }2486 2484 block0[0] = 1; 2487 2485 block1[0] = rVar(origR); … … 2493 2491 // ignore it 2494 2492 ord[0] = ringorder_aa; 2495 2496 2493 // fill in tmp ring to get back the data later on 2497 2494 tmpR = rCopy0(origR,FALSE,FALSE); // qring==NULL 2498 2495 //rUnComplete(tmpR); 2496 tmpR->p_Procs=NULL; 2499 2497 tmpR->order = ord; 2500 2498 tmpR->block0 = block0; 2501 2499 tmpR->block1 = block1; 2502 2500 tmpR->wvhdl = wv; 2503 tmpR->p_Procs=NULL;2504 2505 2501 rComplete(tmpR, 1); 2506 2502
Note: See TracChangeset
for help on using the changeset viewer.