Annotation of OpenXM/src/kan96xx/Kan/kanExport0.c, Revision 1.28
1.28 ! takayama 1: /* $OpenXM: OpenXM/src/kan96xx/Kan/kanExport0.c,v 1.27 2004/08/28 07:28:54 takayama Exp $ */
1.1 maekawa 2: #include <stdio.h>
3: #include "datatype.h"
4: #include "stackm.h"
5: #include "extern.h"
6: #include "extern2.h"
7: #include "lookup.h"
8: #include "matrix.h"
9: #include "gradedset.h"
10: #include "kclass.h"
11:
12: #define universalToPoly(un,rp) (isZero(un)?ZERO:coeffToPoly(un,rp))
13:
14: static void checkDuplicateName(char *xvars[],char *dvars[],int n);
15:
16: static void yet() { fprintf(stderr,"Not implemented."); }
17:
18: int SerialCurrent = -1; /* Current Serial number of the recieved packet as server. */
19:
20: int ReverseOutputOrder = 1;
21: int WarningNoVectorVariable = 1;
1.19 takayama 22: extern int QuoteMode;
1.1 maekawa 23:
24: /** :arithmetic **/
25: struct object KooAdd(ob1,ob2)
1.7 takayama 26: struct object ob1,ob2;
1.1 maekawa 27: {
28: extern struct ring *CurrentRingp;
29: struct object rob = NullObject;
30: POLY r;
31: int s,i;
32: objectp f1,f2,g1,g2;
33: struct object nn,dd;
34:
35: switch (Lookup[ob1.tag][ob2.tag]) {
36: case SintegerSinteger:
37: return(KpoInteger(ob1.lc.ival + ob2.lc.ival));
38: break;
39: case SpolySpoly:
40: r = ppAdd(ob1.lc.poly,ob2.lc.poly);
41: rob.tag = Spoly; rob.lc.poly = r;
42: return(rob);
43: break;
44: case SarraySarray:
45: s = getoaSize(ob1);
46: if (s != getoaSize(ob2)) {
47: errorKan1("%s\n","Two arrays must have a same size.");
48: }
49: rob = newObjectArray(s);
50: for (i=0; i<s; i++) {
51: putoa(rob,i,KooAdd(getoa(ob1,i),getoa(ob2,i)));
52: }
53: return(rob);
54: break;
55: case SuniversalNumberSuniversalNumber:
56: rob.tag = SuniversalNumber;
57: rob.lc.universalNumber = newUniversalNumber(0);
58: Cadd(rob.lc.universalNumber,ob1.lc.universalNumber,ob2.lc.universalNumber);
59: return(rob);
60: break;
61: case SuniversalNumberSpoly:
62: rob.tag = Spoly;
63: r = ob2.lc.poly;
64: if (r ISZERO) {
65: /*warningKan("KooAdd(universalNumber,0 polynomial) cannot determine the ring for the result. Assume the current ring.");
66: rob.lc.poly = universalToPoly(ob1.lc.universalNumber,CurrentRingp);*/
67: rob = ob1;
68: return(rob); /* returns universal number. */
69: }
70: rob.lc.poly = ppAdd(universalToPoly(ob1.lc.universalNumber,r->m->ringp),r);
71: return(rob);
72: break;
73: case SpolySuniversalNumber:
74: return(KooAdd(ob2,ob1));
75: break;
76: case SuniversalNumberSinteger:
77: rob.tag = SuniversalNumber;
78: rob.lc.universalNumber = newUniversalNumber(0);
79: nn.tag = SuniversalNumber;
80: nn.lc.universalNumber = newUniversalNumber(KopInteger(ob2));
81: Cadd(rob.lc.universalNumber,ob1.lc.universalNumber,nn.lc.universalNumber);
82: return(rob);
83: break;
84: case SintegerSuniversalNumber:
85: rob.tag = SuniversalNumber;
86: rob.lc.universalNumber = newUniversalNumber(0);
87: nn.tag = SuniversalNumber;
88: nn.lc.universalNumber = newUniversalNumber(KopInteger(ob1));
89: Cadd(rob.lc.universalNumber,nn.lc.universalNumber,ob2.lc.universalNumber);
90: return(rob);
91: break;
92:
93: case SrationalFunctionSrationalFunction:
94: f1 = Knumerator(ob1);
95: f2 = Kdenominator(ob1);
96: g1 = Knumerator(ob2);
97: g2 = Kdenominator(ob2);
98: nn = KooAdd(KooMult(*g2,*f1),KooMult(*f2,*g1));
99: dd = KooMult(*f2,*g2);
100: rob = KnewRationalFunction0(copyObjectp(&nn),copyObjectp(&dd));
101: KisInvalidRational(&rob);
102: return(rob);
103: break;
104: case SpolySrationalFunction: /* f1 + g1/g2 = (g2 f1 + g1)/g2 */
105: case SuniversalNumberSrationalFunction:
106: g1 = Knumerator(ob2);
107: g2 = Kdenominator(ob2);
108: nn = KooAdd(KooMult(*g2,ob1),*g1);
109: rob = KnewRationalFunction0(copyObjectp(&nn),g2);
110: KisInvalidRational(&rob);
111: return(rob);
112: break;
113: case SrationalFunctionSpoly:
114: case SrationalFunctionSuniversalNumber:
115: return(KooAdd(ob2,ob1));
116: break;
117: case SdoubleSdouble:
118: return(KpoDouble( KopDouble(ob1) + KopDouble(ob2) ));
119: break;
120: case SdoubleSinteger:
121: case SdoubleSuniversalNumber:
122: case SdoubleSrationalFunction:
123: return(KpoDouble( KopDouble(ob1) + toDouble0(ob2) ) );
124: break;
125: case SintegerSdouble:
126: case SuniversalNumberSdouble:
127: case SrationalFunctionSdouble:
128: return(KpoDouble( toDouble0(ob1) + KopDouble(ob2) ) );
129: break;
130: case SclassSclass:
131: case SclassSinteger:
132: case SclassSpoly:
133: case SclassSuniversalNumber:
134: case SclassSrationalFunction:
135: case SclassSdouble:
136: case SpolySclass:
137: case SintegerSclass:
138: case SuniversalNumberSclass:
139: case SrationalFunctionSclass:
140: case SdoubleSclass:
141: return(Kclass_ooAdd(ob1,ob2));
142: break;
143:
144:
145: default:
1.19 takayama 146: if (QuoteMode) {
1.22 takayama 147: rob = addTree(ob1,ob2);
1.19 takayama 148: }else{
149: warningKan("KooAdd() has not supported yet these objects.\n");
150: }
1.1 maekawa 151: break;
152: }
153: return(rob);
154: }
155:
156: struct object KooSub(ob1,ob2)
1.7 takayama 157: struct object ob1,ob2;
1.1 maekawa 158: {
159: struct object rob = NullObject;
160: POLY r;
161: int s,i;
162: objectp f1,f2,g1,g2;
163: extern struct coeff *UniversalZero;
164: struct object nn,dd;
165:
166: switch (Lookup[ob1.tag][ob2.tag]) {
167: case SintegerSinteger:
168: return(KpoInteger(ob1.lc.ival - ob2.lc.ival));
169: break;
170: case SpolySpoly:
171: r = ppSub(ob1.lc.poly,ob2.lc.poly);
172: rob.tag = Spoly; rob.lc.poly = r;
173: return(rob);
174: break;
175: case SarraySarray:
176: s = getoaSize(ob1);
177: if (s != getoaSize(ob2)) {
178: errorKan1("%s\n","Two arrays must have a same size.");
179: }
180: rob = newObjectArray(s);
181: for (i=0; i<s; i++) {
182: putoa(rob,i,KooSub(getoa(ob1,i),getoa(ob2,i)));
183: }
184: return(rob);
185: break;
186: case SuniversalNumberSuniversalNumber:
187: rob.tag = SuniversalNumber;
188: rob.lc.universalNumber = newUniversalNumber(0);
189: Csub(rob.lc.universalNumber,ob1.lc.universalNumber,ob2.lc.universalNumber);
190: return(rob);
191: break;
192:
193: case SuniversalNumberSpoly:
194: rob.tag = Spoly;
195: r = ob2.lc.poly;
196: if (r ISZERO) {
197: rob = ob1;
198: return(rob); /* returns universal number. */
199: }
200: rob.lc.poly = ppSub(universalToPoly(ob1.lc.universalNumber,r->m->ringp),r);
201: return(rob);
202: break;
203: case SpolySuniversalNumber:
204: rob.tag = Spoly;
205: r = ob1.lc.poly;
206: if (r ISZERO) {
207: rob.tag = SuniversalNumber;
208: rob.lc.universalNumber = newUniversalNumber(0);
209: Csub(rob.lc.universalNumber,UniversalZero,ob2.lc.universalNumber);
210: return(rob); /* returns universal number. */
211: }
212: rob.lc.poly = ppSub(r,universalToPoly(ob2.lc.universalNumber,r->m->ringp));
213: return(rob);
214: break;
215:
216: case SuniversalNumberSinteger:
217: rob.tag = SuniversalNumber;
218: rob.lc.universalNumber = newUniversalNumber(0);
219: nn.tag = SuniversalNumber;
220: nn.lc.universalNumber = newUniversalNumber(KopInteger(ob2));
221: Csub(rob.lc.universalNumber,ob1.lc.universalNumber,nn.lc.universalNumber);
222: return(rob);
223: break;
224: case SintegerSuniversalNumber:
225: rob.tag = SuniversalNumber;
226: rob.lc.universalNumber = newUniversalNumber(0);
227: nn.tag = SuniversalNumber;
228: nn.lc.universalNumber = newUniversalNumber(KopInteger(ob1));
229: Csub(rob.lc.universalNumber,nn.lc.universalNumber,ob2.lc.universalNumber);
230: return(rob);
231: break;
232:
233: case SrationalFunctionSrationalFunction:
234: f1 = Knumerator(ob1);
235: f2 = Kdenominator(ob1);
236: g1 = Knumerator(ob2);
237: g2 = Kdenominator(ob2);
238: nn = KooSub(KooMult(*g2,*f1),KooMult(*f2,*g1));
239: dd = KooMult(*f2,*g2);
240: rob = KnewRationalFunction0(copyObjectp(&nn),copyObjectp(&dd));
241: KisInvalidRational(&rob);
242: return(rob);
243: break;
244: case SpolySrationalFunction: /* f1 - g1/g2 = (g2 f1 - g1)/g2 */
245: case SuniversalNumberSrationalFunction:
246: g1 = Knumerator(ob2);
247: g2 = Kdenominator(ob2);
248: nn = KooSub(KooMult(*g2,ob1),*g1);
249: rob = KnewRationalFunction0(copyObjectp(&nn),g2);
250: KisInvalidRational(&rob);
251: return(rob);
252: break;
253: case SrationalFunctionSpoly:
254: case SrationalFunctionSuniversalNumber: /* f1/f2 - ob2= (f1 - f2*ob2)/f2 */
255: f1 = Knumerator(ob1);
256: f2 = Kdenominator(ob1);
257: nn = KooSub(*f1,KooMult(*f2,ob2));
258: rob = KnewRationalFunction0(copyObjectp(&nn),f2);
259: KisInvalidRational(&rob);
260: return(rob);
261: break;
262:
263: case SdoubleSdouble:
264: return(KpoDouble( KopDouble(ob1) - KopDouble(ob2) ));
265: break;
266: case SdoubleSinteger:
267: case SdoubleSuniversalNumber:
268: case SdoubleSrationalFunction:
269: return(KpoDouble( KopDouble(ob1) - toDouble0(ob2) ) );
270: break;
271: case SintegerSdouble:
272: case SuniversalNumberSdouble:
273: case SrationalFunctionSdouble:
274: return(KpoDouble( toDouble0(ob1) - KopDouble(ob2) ) );
275: break;
276:
277: default:
1.20 takayama 278: if (QuoteMode) {
279: rob = minusTree(ob1,ob2);
280: }else{
281: warningKan("KooSub() has not supported yet these objects.\n");
282: }
1.1 maekawa 283: break;
284: }
285: return(rob);
286: }
287:
288: struct object KooMult(ob1,ob2)
1.7 takayama 289: struct object ob1,ob2;
1.1 maekawa 290: {
291: struct object rob = NullObject;
292: POLY r;
293: int i,s;
294: objectp f1,f2,g1,g2;
295: struct object dd,nn;
296:
297:
298: switch (Lookup[ob1.tag][ob2.tag]) {
299: case SintegerSinteger:
300: return(KpoInteger(ob1.lc.ival * ob2.lc.ival));
301: break;
302: case SpolySpoly:
303: r = ppMult(ob1.lc.poly,ob2.lc.poly);
304: rob.tag = Spoly; rob.lc.poly = r;
305: return(rob);
306: break;
307: case SarraySarray:
308: return(KaoMult(ob1,ob2));
309: break;
310: case SpolySarray:
311: case SuniversalNumberSarray:
312: case SrationalFunctionSarray:
313: case SintegerSarray:
314: s = getoaSize(ob2);
315: rob = newObjectArray(s);
316: for (i=0; i<s; i++) {
317: putoa(rob,i,KooMult(ob1,getoa(ob2,i)));
318: }
319: return(rob);
320: break;
321:
322: case SarraySpoly:
323: case SarraySuniversalNumber:
324: case SarraySrationalFunction:
325: case SarraySinteger:
326: s = getoaSize(ob1);
327: rob = newObjectArray(s);
328: for (i=0; i<s; i++) {
329: putoa(rob,i,KooMult(getoa(ob1,i),ob2));
330: }
331: return(rob);
332: break;
333:
334:
335: case SuniversalNumberSuniversalNumber:
336: rob.tag = SuniversalNumber;
337: rob.lc.universalNumber = newUniversalNumber(0);
338: Cmult(rob.lc.universalNumber,ob1.lc.universalNumber,ob2.lc.universalNumber);
339: return(rob);
340: break;
341:
342: case SuniversalNumberSpoly:
343: r = ob2.lc.poly;
344: if (r ISZERO) {
345: rob.tag = SuniversalNumber;
346: rob.lc.universalNumber = newUniversalNumber(0);
347: return(rob); /* returns universal number. */
348: }
349: if (isZero(ob1.lc.universalNumber)) {
350: rob.tag = Spoly;
351: rob.lc.poly = ZERO;
352: return(rob);
353: }
354: rob.tag = Spoly;
355: rob.lc.poly = ppMult(universalToPoly(ob1.lc.universalNumber,r->m->ringp),r);
356: return(rob);
357: break;
358: case SpolySuniversalNumber:
359: return(KooMult(ob2,ob1));
360: break;
361:
362: case SuniversalNumberSinteger:
363: rob.tag = SuniversalNumber;
364: rob.lc.universalNumber = newUniversalNumber(0);
365: nn.tag = SuniversalNumber;
366: nn.lc.universalNumber = newUniversalNumber(KopInteger(ob2));
367: Cmult(rob.lc.universalNumber,ob1.lc.universalNumber,nn.lc.universalNumber);
368: return(rob);
369: break;
370: case SintegerSuniversalNumber:
371: rob.tag = SuniversalNumber;
372: rob.lc.universalNumber = newUniversalNumber(0);
373: nn.tag = SuniversalNumber;
374: nn.lc.universalNumber = newUniversalNumber(KopInteger(ob1));
375: Cmult(rob.lc.universalNumber,nn.lc.universalNumber,ob2.lc.universalNumber);
376: return(rob);
377: break;
378:
379: case SrationalFunctionSrationalFunction:
380: f1 = Knumerator(ob1);
381: f2 = Kdenominator(ob1);
382: g1 = Knumerator(ob2);
383: g2 = Kdenominator(ob2);
384: nn = KooMult(*f1,*g1);
385: dd = KooMult(*f2,*g2);
386: rob = KnewRationalFunction0(copyObjectp(&nn),copyObjectp(&dd));
387: KisInvalidRational(&rob);
388: return(rob);
389: break;
390: case SpolySrationalFunction: /* ob1 g1/g2 */
391: case SuniversalNumberSrationalFunction:
392: g1 = Knumerator(ob2);
393: g2 = Kdenominator(ob2);
394: nn = KooMult(ob1,*g1);
395: rob = KnewRationalFunction0(copyObjectp(&nn),g2);
396: KisInvalidRational(&rob);
397: return(rob);
398: break;
399: case SrationalFunctionSpoly:
400: case SrationalFunctionSuniversalNumber: /* f1*ob2/f2 */
401: f1 = Knumerator(ob1);
402: f2 = Kdenominator(ob1);
403: nn = KooMult(*f1,ob2);
404: rob = KnewRationalFunction0(copyObjectp(&nn),f2);
405: KisInvalidRational(&rob);
406: return(rob);
407: break;
408:
409: case SdoubleSdouble:
410: return(KpoDouble( KopDouble(ob1) * KopDouble(ob2) ));
411: break;
412: case SdoubleSinteger:
413: case SdoubleSuniversalNumber:
414: case SdoubleSrationalFunction:
415: return(KpoDouble( KopDouble(ob1) * toDouble0(ob2) ) );
416: break;
417: case SintegerSdouble:
418: case SuniversalNumberSdouble:
419: case SrationalFunctionSdouble:
420: return(KpoDouble( toDouble0(ob1) * KopDouble(ob2) ) );
421: break;
422:
423: default:
1.20 takayama 424: if (QuoteMode) {
1.22 takayama 425: rob = timesTree(ob1,ob2);
1.20 takayama 426: }else{
427: warningKan("KooMult() has not supported yet these objects.\n");
428: }
1.1 maekawa 429: break;
430: }
431: return(rob);
432: }
433:
434:
435:
436: struct object KoNegate(obj)
1.7 takayama 437: struct object obj;
1.1 maekawa 438: {
439: struct object rob = NullObject;
440: extern struct ring SmallRing;
441: struct object tob;
442: switch(obj.tag) {
443: case Sinteger:
444: rob = obj;
445: rob.lc.ival = -rob.lc.ival;
446: break;
447: case Spoly:
448: rob.tag = Spoly;
449: rob.lc.poly = ppSub(ZERO,obj.lc.poly);
450: break;
451: case SuniversalNumber:
452: rob.tag = SuniversalNumber;
453: rob.lc.universalNumber = coeffNeg(obj.lc.universalNumber,&SmallRing);
454: break;
455: case SrationalFunction:
456: rob.tag = SrationalFunction;
457: tob = KoNegate(*(Knumerator(obj)));
458: Knumerator(rob) = copyObjectp( &tob);
459: Kdenominator(rob) = Kdenominator(obj);
460: break;
461:
462: case Sdouble:
463: rob = KpoDouble( - toDouble0(obj) );
464: break;
465:
466: default:
1.20 takayama 467: if (QuoteMode) {
468: rob = unaryminusTree(obj);
469: }else{
470: warningKan("KoNegate() has not supported yet these objects.\n");
471: }
1.1 maekawa 472: break;
473: }
474: return(rob);
475: }
476:
477: struct object KoInverse(obj)
1.7 takayama 478: struct object obj;
1.1 maekawa 479: {
480: struct object rob = NullObject;
481: extern struct coeff *UniversalOne;
482: objectp onep;
483: struct object tob;
484: switch(obj.tag) {
485: case Spoly:
486: tob.tag = SuniversalNumber;
487: tob.lc.universalNumber = UniversalOne;
488: onep = copyObjectp(& tob);
489: rob = KnewRationalFunction0(onep,copyObjectp(&obj));
490: KisInvalidRational(&rob);
491: break;
492: case SuniversalNumber:
493: tob.tag = SuniversalNumber;
494: tob.lc.universalNumber = UniversalOne;
495: onep = copyObjectp(& tob);
496: rob = KnewRationalFunction0(onep,copyObjectp(&obj));
497: KisInvalidRational(&rob);
498: break;
499: case SrationalFunction:
500: rob = obj;
501: Knumerator(rob) = Kdenominator(obj);
502: Kdenominator(rob) = Knumerator(obj);
503: KisInvalidRational(&rob);
504: break;
505: default:
506: warningKan("KoInverse() has not supported yet these objects.\n");
507: break;
508: }
509: return(rob);
510: }
511:
512:
513: static int isVector(ob)
1.7 takayama 514: struct object ob;
1.1 maekawa 515: {
516: int i,n;
517: n = getoaSize(ob);
518: for (i=0; i<n; i++) {
519: if (getoa(ob,i).tag == Sarray) return(0);
520: }
521: return(1);
522: }
523:
524: static int isMatrix(ob,m,n)
1.7 takayama 525: struct object ob;
526: int m,n;
1.1 maekawa 527: {
528: int i,j;
529: for (i=0; i<m; i++) {
530: if (getoa(ob,i).tag != Sarray) return(0);
531: if (getoaSize(getoa(ob,i)) != n) return(0);
532: for (j=0; j<n; j++) {
533: if (getoa(getoa(ob,i),j).tag != Spoly) return(-1);
534: }
535: }
536: return(1);
537: }
538:
539:
540: struct object KaoMult(aa,bb)
1.7 takayama 541: struct object aa,bb;
542: /* aa and bb is assumed to be array. */
1.1 maekawa 543: {
544: int m,n,m2,n2;
545: int i,j,k;
546: POLY tmp;
547: POLY fik;
548: POLY gkj;
549: struct object rob;
550: int r1,r2;
551: int rsize;
552: struct object tob;
553: struct object ob1;
554: extern struct ring SmallRing;
555:
556: m = getoaSize(aa); m2 = getoaSize(bb);
557: if (m == 0 || m2 == 0) errorKan1("%s\n","KaoMult(). Invalid matrix size.");
558:
559: /* new code for vector x vector,... etc */
560: r1 = isVector(aa); r2 = isVector(bb);
561: if (r1 && r2 ) { /* vector X vector ---> scalar.*/
562: rsize = getoaSize(aa);
563: if (rsize != getoaSize(bb)) {
564: errorKan1("%s\n","KaoMult(vector,vector). The size of the vectors must be the same.");
565: }
566: if (r1 != 0) {
567: ob1 = getoa(aa,0);
568: if (ob1.tag == Spoly) {
1.7 takayama 569: rob.tag = Spoly; rob.lc.poly = ZERO;
1.1 maekawa 570: }else if (ob1.tag == Sinteger) {
1.7 takayama 571: rob.tag = Sinteger; rob.lc.ival = 0;
1.1 maekawa 572: }else {
1.7 takayama 573: rob.tag = SuniversalNumber;
574: rob.lc.universalNumber = intToCoeff(0,&SmallRing);
1.1 maekawa 575: }
576: }else{
577: rob.tag = Spoly; rob.lc.poly = ZERO;
578: }
579: for (i=0; i<rsize; i++) {
580: rob = KooAdd(rob,KooMult(getoa(aa,i),getoa(bb,i)));
581: }
582: return(rob);
583: } else if (r1 == 0 && r2 ) { /* matrix X vector ---> vector */
1.7 takayama 584: /* (m n) (m2=n) */
1.1 maekawa 585: n = getoaSize(getoa(aa,0));
586: if (isMatrix(aa,m,n) == 0) {
587: errorKan1("%s\n","KaoMult(matrix,vector). The left object is not matrix.");
588: }else if (n != m2) {
589: errorKan1("%s\n","KaoMult(). Invalid matrix and vector sizes for mult.");
590: } else ;
591: rob = newObjectArray(m);
592: for (i=0; i<m; i++) {
593: getoa(rob,i) = KooMult(getoa(aa,i),bb);
594: }
595: return(rob);
596: }else if (r1 && r2 == 0) { /* vector X matrix ---> vector */
597: tob = newObjectArray(1);
598: getoa(tob,0) = aa; /* [aa] * bb and strip [ ] */
599: tob = KooMult(tob,bb);
600: return(getoa(tob,0));
601: } else ; /* continue: matrix X matrix case. */
602: /* end of new code */
603:
604: if (getoa(aa,0).tag != Sarray || getoa(bb,0).tag != Sarray) {
605: errorKan1("%s\n","KaoMult(). Matrix must be given.");
606: }
607: n = getoaSize(getoa(aa,0));
608: n2 = getoaSize(getoa(bb,0));
609: if (n != m2) errorKan1("%s\n","KaoMult(). Invalid matrix size for mult. ((p,q)X(q,r)");
610: r1 = isMatrix(aa,m,n); r2 = isMatrix(bb,m2,n2);
611: if (r1 == -1 || r2 == -1) {
612: /* Object multiplication. Elements are not polynomials. */
613: struct object ofik,ogkj,otmp;
614: rob = newObjectArray(m);
615: for (i=0; i<m; i++) {
616: getoa(rob,i) = newObjectArray(n2);
617: }
618: for (i=0; i<m; i++) {
619: for (j=0; j<n2; j++) {
1.7 takayama 620: ofik = getoa(getoa(aa,i),0);
621: ogkj = getoa(getoa(bb,0),j);
622: otmp = KooMult( ofik, ogkj);
623: for (k=1; k<n; k++) {
624: ofik = getoa(getoa(aa,i),k);
625: ogkj = getoa(getoa(bb,k),j);
626: otmp = KooAdd(otmp, KooMult( ofik, ogkj));
627: }
628: getoa(getoa(rob,i),j) = otmp;
1.1 maekawa 629: }
630: }
631: return(rob);
632: /*errorKan1("%s\n","KaoMult().Elements of the matrix must be polynomials.");*/
633: }
634: if (r1 == 0 || r2 == 0)
635: errorKan1("%s\n","KaoMult(). Invalid matrix form for mult.");
636:
637: rob = newObjectArray(m);
638: for (i=0; i<m; i++) {
639: getoa(rob,i) = newObjectArray(n2);
640: }
641: for (i=0; i<m; i++) {
642: for (j=0; j<n2; j++) {
643: tmp = ZERO;
644: for (k=0; k<n; k++) {
1.7 takayama 645: fik = KopPOLY(getoa(getoa(aa,i),k));
646: gkj = KopPOLY(getoa(getoa(bb,k),j));
647: tmp = ppAdd(tmp, ppMult( fik, gkj));
1.1 maekawa 648: }
649: getoa(getoa(rob,i),j) = KpoPOLY(tmp);
650: }
651: }
652: return(rob);
653: }
654:
655: struct object KooDiv(ob1,ob2)
1.7 takayama 656: struct object ob1,ob2;
1.1 maekawa 657: {
658: struct object rob = NullObject;
659: switch (Lookup[ob1.tag][ob2.tag]) {
660: case SintegerSinteger:
661: return(KpoInteger((ob1.lc.ival) / (ob2.lc.ival)));
662: break;
663: case SuniversalNumberSuniversalNumber:
664: rob.tag = SuniversalNumber;
665: rob.lc.universalNumber = newUniversalNumber(0);
666: universalNumberDiv(rob.lc.universalNumber,ob1.lc.universalNumber,
1.7 takayama 667: ob2.lc.universalNumber);
1.1 maekawa 668: return(rob);
669: break;
670:
671:
672: default:
1.20 takayama 673: if (QuoteMode) {
674: rob = divideTree(ob1,ob2);
675: }else{
676: warningKan("KooDiv() has not supported yet these objects.\n");
677: }
1.1 maekawa 678: break;
679: }
680: return(rob);
681: }
682:
683: /* :relation */
684: KooEqualQ(obj1,obj2)
1.7 takayama 685: struct object obj1;
686: struct object obj2;
1.1 maekawa 687: {
688: struct object ob;
689: int i;
690: if (obj1.tag != obj2.tag) {
691: warningKan("KooEqualQ(ob1,ob2): the datatypes of ob1 and ob2 are not same. Returns false (0).\n");
692: return(0);
693: }
694: switch(obj1.tag) {
1.7 takayama 695: case 0:
696: return(1); /* case of NullObject */
697: break;
698: case Sinteger:
699: if (obj1.lc.ival == obj2.lc.ival) return(1);
700: else return(0);
701: break;
702: case Sstring:
703: case Sdollar:
704: if (strcmp(obj1.lc.str, obj2.lc.str)==0) return(1);
705: else return(0);
706: break;
707: case Spoly:
708: ob = KooSub(obj1,obj2);
709: if (KopPOLY(ob) == ZERO) return(1);
710: else return(0);
711: case Sarray:
712: if (getoaSize(obj1) != getoaSize(obj2)) return(0);
713: for (i=0; i< getoaSize(obj1); i++) {
714: if (KooEqualQ(getoa(obj1,i),getoa(obj2,i))) { ; }
715: else { return(0); }
716: }
717: return(1);
718: case Slist:
719: if (KooEqualQ(*(obj1.lc.op),*(obj2.lc.op))) {
720: if (isNullList(obj1.rc.op)) {
721: if (isNullList(obj2.rc.op)) return(1);
722: else return(0);
1.1 maekawa 723: }else{
1.7 takayama 724: if (isNullList(obj2.rc.op)) return(0);
725: return(KooEqualQ(*(obj1.rc.op),*(obj2.rc.op)));
1.1 maekawa 726: }
1.7 takayama 727: }else{
728: return(0);
1.1 maekawa 729: }
1.7 takayama 730: break;
731: case SuniversalNumber:
732: return(coeffEqual(obj1.lc.universalNumber,obj2.lc.universalNumber));
733: break;
734: case Sring:
735: return(KopRingp(obj1) == KopRingp(obj2));
736: break;
737: case Sclass:
738: return(KclassEqualQ(obj1,obj2));
739: break;
740: case Sdouble:
741: return(KopDouble(obj1) == KopDouble(obj2));
742: break;
743: default:
744: errorKan1("%s\n","KooEqualQ() has not supported these objects yet.");
745: break;
746: }
1.1 maekawa 747: }
748:
749:
750: struct object KoIsPositive(ob1)
1.7 takayama 751: struct object ob1;
1.1 maekawa 752: {
753: struct object rob = NullObject;
754: switch (ob1.tag) {
755: case Sinteger:
756: return(KpoInteger(ob1.lc.ival > 0));
757: break;
758: default:
759: warningKan("KoIsPositive() has not supported yet these objects.\n");
760: break;
761: }
762: return(rob);
763: }
764:
765: struct object KooGreater(obj1,obj2)
1.7 takayama 766: struct object obj1;
767: struct object obj2;
1.1 maekawa 768: {
769: struct object ob;
770: int tt;
771: if (obj1.tag != obj2.tag) {
772: errorKan1("%s\n","You cannot compare different kinds of objects.");
773: }
774: switch(obj1.tag) {
1.7 takayama 775: case 0:
776: return(KpoInteger(1)); /* case of NullObject */
777: break;
778: case Sinteger:
779: if (obj1.lc.ival > obj2.lc.ival) return(KpoInteger(1));
780: else return(KpoInteger(0));
781: break;
782: case Sstring:
783: case Sdollar:
784: if (strcmp(obj1.lc.str, obj2.lc.str)>0) return(KpoInteger(1));
785: else return(KpoInteger(0));
786: break;
787: case Spoly:
788: if ((*mmLarger)(obj1.lc.poly,obj2.lc.poly) == 1) return(KpoInteger(1));
789: else return(KpoInteger(0));
790: break;
791: case SuniversalNumber:
792: tt = coeffGreater(obj1.lc.universalNumber,obj2.lc.universalNumber);
793: if (tt > 0) return(KpoInteger(1));
794: else return(KpoInteger(0));
795: break;
796: case Sdouble:
797: if ( KopDouble(obj1) > KopDouble(obj2) ) return(KpoInteger(1));
798: else return(KpoInteger(0));
799: break;
1.26 takayama 800: case Sarray:
801: {
802: int i,m1,m2;
803: struct object rr;
804: m1 = getoaSize(obj1); m2 = getoaSize(obj2);
805: for (i=0; i< (m1>m2?m2:m1); i++) {
806: rr=KooGreater(getoa(obj1,i),getoa(obj2,i));
807: if (KopInteger(rr) == 1) return rr;
808: rr=KooGreater(getoa(obj2,i),getoa(obj1,i));
809: if (KopInteger(rr) == 1) return KpoInteger(0);
810: }
811: if (m1 > m2) return KpoInteger(1);
812: else return KpoInteger(0);
813: }
814: break;
1.7 takayama 815: default:
816: errorKan1("%s\n","KooGreater() has not supported these objects yet.");
817: break;
818: }
1.1 maekawa 819: }
820:
821: struct object KooLess(obj1,obj2)
1.7 takayama 822: struct object obj1;
823: struct object obj2;
1.1 maekawa 824: {
825: struct object ob;
826: int tt;
827: if (obj1.tag != obj2.tag) {
828: errorKan1("%s\n","You cannot compare different kinds of objects.");
829: }
830: switch(obj1.tag) {
1.7 takayama 831: case 0:
832: return(KpoInteger(1)); /* case of NullObject */
833: break;
834: case Sinteger:
835: if (obj1.lc.ival < obj2.lc.ival) return(KpoInteger(1));
836: else return(KpoInteger(0));
837: break;
838: case Sstring:
839: case Sdollar:
840: if (strcmp(obj1.lc.str, obj2.lc.str)<0) return(KpoInteger(1));
841: else return(KpoInteger(0));
842: break;
843: case Spoly:
844: if ((*mmLarger)(obj2.lc.poly,obj1.lc.poly) == 1) return(KpoInteger(1));
845: else return(KpoInteger(0));
846: break;
847: case SuniversalNumber:
848: tt = coeffGreater(obj1.lc.universalNumber,obj2.lc.universalNumber);
849: if (tt < 0) return(KpoInteger(1));
850: else return(KpoInteger(0));
851: break;
852: case Sdouble:
853: if ( KopDouble(obj1) < KopDouble(obj2) ) return(KpoInteger(1));
854: else return(KpoInteger(0));
855: break;
1.26 takayama 856: case Sarray:
857: {
858: int i,m1,m2;
859: struct object rr;
860: m1 = getoaSize(obj1); m2 = getoaSize(obj2);
861: for (i=0; i< (m1>m2?m2:m1); i++) {
862: rr=KooLess(getoa(obj1,i),getoa(obj2,i));
863: if (KopInteger(rr) == 1) return rr;
864: rr=KooLess(getoa(obj2,i),getoa(obj1,i));
865: if (KopInteger(rr) == 1) return KpoInteger(0);
866: }
867: if (m1 < m2) return KpoInteger(1);
868: else return KpoInteger(0);
869: }
870: break;
1.7 takayama 871: default:
872: errorKan1("%s\n","KooLess() has not supported these objects yet.");
873: break;
874: }
1.1 maekawa 875: }
876:
877: /* :conversion */
878:
879: struct object KdataConversion(obj,key)
1.7 takayama 880: struct object obj;
881: char *key;
1.1 maekawa 882: {
883: char tmps[128]; /* Assume that double is not more than 128 digits */
884: char intstr[100]; /* Assume that int is not more than 100 digits */
885: struct object rob;
886: extern struct ring *CurrentRingp;
887: extern struct ring SmallRing;
888: int flag;
889: struct object rob1,rob2;
890: char *s;
891: int i;
1.2 takayama 892: double f;
893: double f2;
1.1 maekawa 894: /* reports the data type */
895: if (key[0] == 't' || key[0] =='e') {
896: if (strcmp(key,"type?")==0) {
897: rob = KpoInteger(obj.tag);
898: return(rob);
899: }else if (strcmp(key,"type??")==0) {
900: if (obj.tag != Sclass) {
1.7 takayama 901: rob = KpoInteger(obj.tag);
1.1 maekawa 902: }else {
1.7 takayama 903: rob = KpoInteger(ectag(obj));
1.1 maekawa 904: }
905: return(rob);
906: }else if (strcmp(key,"error")==0) {
907: rob = KnewErrorPacketObj(obj);
908: return(rob);
909: }
910: }
911: switch(obj.tag) {
912: case Snull:
913: if (strcmp(key,"integer") == 0) {
914: rob = KpoInteger(0);
915: return(rob);
916: }else if (strcmp(key,"universalNumber") == 0) {
917: rob.tag = SuniversalNumber;
918: rob.lc.universalNumber = intToCoeff(obj.lc.ival,&SmallRing);
919: return(rob);
920: }else if (strcmp(key,"poly") == 0) {
921: rob = KpoPOLY(ZERO);
922: }else{
923: warningKan("Sorry. The data conversion from null to this data type has not supported yet.\n");
924: }
925: break;
926: case Sinteger:
927: if (strcmp(key,"string") == 0) { /* ascii code */
928: rob.tag = Sdollar;
929: rob.lc.str = (char *)sGC_malloc(2);
930: if (rob.lc.str == (char *)NULL) errorKan1("%s","No more memory.\n");
931: (rob.lc.str)[0] = obj.lc.ival; (rob.lc.str)[1] = '\0';
932: return(rob);
933: }else if (strcmp(key,"integer")==0) {
934: return(obj);
935: }else if (strcmp(key,"poly") == 0) {
936: rob.tag = Spoly;
937: rob.lc.poly = cxx(obj.lc.ival,0,0,CurrentRingp);
938: return(rob);
939: }else if (strcmp(key,"dollar") == 0) {
940: rob.tag = Sdollar;
941: sprintf(intstr,"%d",obj.lc.ival);
942: rob.lc.str = (char *)sGC_malloc(strlen(intstr)+2);
943: if (rob.lc.str == (char *)NULL) errorKan1("%s","No more memory.\n");
944: strcpy(rob.lc.str,intstr);
945: return(rob);
946: }else if (strcmp(key,"universalNumber")==0) {
1.25 takayama 947: rob = KintToUniversalNumber(obj.lc.ival);
1.1 maekawa 948: return(rob);
949: }else if (strcmp(key,"double") == 0) {
950: rob = KpoDouble((double) (obj.lc.ival));
951: return(rob);
952: }else if (strcmp(key,"null") == 0) {
953: rob = NullObject;
954: return(rob);
955: }else{
956: warningKan("Sorry. This type of data conversion has not supported yet.\n");
957: }
958: break;
959: case Sdollar:
960: if (strcmp(key,"dollar") == 0 || strcmp(key,"string")==0) {
961: rob = obj;
962: return(rob);
963: }else if (strcmp(key,"literal") == 0) {
964: rob.tag = Sstring;
965: s = (char *) sGC_malloc(sizeof(char)*(strlen(obj.lc.str)+3));
966: if (s == (char *) NULL) {
1.7 takayama 967: errorKan1("%s\n","No memory.");
1.1 maekawa 968: }
969: s[0] = '/';
970: strcpy(&(s[1]),obj.lc.str);
971: rob.lc.str = &(s[1]);
972: /* set the hashing value. */
973: rob2 = lookupLiteralString(s);
974: rob.rc.op = rob2.lc.op;
975: return(rob);
976: }else if (strcmp(key,"poly")==0) {
977: rob.tag = Spoly;
978: rob.lc.poly = stringToPOLY(obj.lc.str,CurrentRingp);
979: return(rob);
980: }else if (strcmp(key,"array")==0) {
981: rob = newObjectArray(strlen(obj.lc.str));
982: for (i=0; i<strlen(obj.lc.str); i++) {
1.7 takayama 983: putoa(rob,i,KpoInteger((obj.lc.str)[i]));
1.1 maekawa 984: }
985: return(rob);
986: }else if (strcmp(key,"universalNumber") == 0) {
987: rob.tag = SuniversalNumber;
988: rob.lc.universalNumber = stringToUniversalNumber(obj.lc.str,&flag);
989: if (flag == -1) errorKan1("KdataConversion(): %s",
1.7 takayama 990: "It's not number.\n");
1.2 takayama 991: return(rob);
992: }else if (strcmp(key,"double") == 0) {
993: /* Check the format. 2.3432 e2 is not allowed. It should be 2.3232e2.*/
994: flag = 0;
995: for (i=0; (obj.lc.str)[i] != '\0'; i++) {
1.7 takayama 996: if ((obj.lc.str)[i] > ' ' && flag == 0) flag=1;
997: else if ((obj.lc.str)[i] <= ' ' && flag == 1) flag = 2;
998: else if ((obj.lc.str)[i] > ' ' && flag == 2) flag=3;
1.2 takayama 999: }
1000: if (flag == 3) errorKan1("KdataConversion(): %s","The data for the double contains blanck(s)");
1001: /* Read the double. */
1002: if (sscanf(obj.lc.str,"%lf",&f) <= 0) {
1.7 takayama 1003: errorKan1("KdataConversion(): %s","It cannot be translated to double.");
1.2 takayama 1004: }
1005: rob = KpoDouble(f);
1.1 maekawa 1006: return(rob);
1007: }else if (strcmp(key,"null") == 0) {
1008: rob = NullObject;
1009: return(rob);
1010: }else{
1011: warningKan("Sorry. This type of data conversion has not supported yet.\n");
1012: }
1013: break;
1014: case Sarray:
1015: if (strcmp(key,"array") == 0) {
1016: return(rob);
1017: }else if (strcmp(key,"list") == 0) {
1018: rob = *( arrayToList(obj) );
1019: return(rob);
1020: }else if (strcmp(key,"arrayOfPOLY")==0) {
1021: rob = KpoArrayOfPOLY(arrayToArrayOfPOLY(obj));
1022: return(rob);
1023: }else if (strcmp(key,"matrixOfPOLY")==0) {
1024: rob = KpoMatrixOfPOLY(arrayToMatrixOfPOLY(obj));
1025: return(rob);
1026: }else if (strcmp(key,"gradedPolySet")==0) {
1027: rob = KpoGradedPolySet(arrayToGradedPolySet(obj));
1028: return(rob);
1029: }else if (strcmp(key,"null") == 0) {
1030: rob = NullObject;
1031: return(rob);
1032: }else {
1.23 takayama 1033: { /* Automatically maps the elements. */
1034: int n,i;
1035: n = getoaSize(obj);
1036: rob = newObjectArray(n);
1037: for (i=0; i<n; i++) {
1038: putoa(rob,i,KdataConversion(getoa(obj,i),key));
1039: }
1040: return(rob);
1041: }
1.1 maekawa 1042: }
1043: break;
1044: case Spoly:
1.15 takayama 1045: if ((strcmp(key,"poly")==0) || (strcmp(key,"numerator")==0)) {
1.5 takayama 1046: rob = obj;
1.1 maekawa 1047: return(rob);
1048: }else if (strcmp(key,"integer")==0) {
1049: if (obj.lc.poly == ZERO) return(KpoInteger(0));
1050: else {
1.7 takayama 1051: return(KpoInteger(coeffToInt(obj.lc.poly->coeffp)));
1.1 maekawa 1052: }
1053: }else if (strcmp(key,"string")==0 || strcmp(key,"dollar")==0) {
1054: rob.tag = Sdollar;
1055: rob.lc.str = KPOLYToString(KopPOLY(obj));
1056: return(rob);
1057: }else if (strcmp(key,"array") == 0) {
1058: return( POLYToArray(KopPOLY(obj)));
1059: }else if (strcmp(key,"map")==0) {
1060: return(KringMap(obj));
1061: }else if (strcmp(key,"universalNumber")==0) {
1062: if (obj.lc.poly == ZERO) {
1.7 takayama 1063: rob.tag = SuniversalNumber;
1064: rob.lc.universalNumber = newUniversalNumber(0);
1.1 maekawa 1065: } else {
1.7 takayama 1066: if (obj.lc.poly->coeffp->tag == MP_INTEGER) {
1067: rob.tag = SuniversalNumber;
1068: rob.lc.universalNumber = newUniversalNumber2(obj.lc.poly->coeffp->val.bigp);
1069: }else {
1070: rob = NullObject;
1071: warningKan("Coefficient is not MP_INT.");
1072: }
1.1 maekawa 1073: }
1074: return(rob);
1075: }else if (strcmp(key,"ring")==0) {
1076: if (obj.lc.poly ISZERO) {
1.7 takayama 1077: warningKan("Zero polynomial does not have the ring structure field.\n");
1.1 maekawa 1078: }else{
1.7 takayama 1079: rob.tag = Sring;
1080: rob.lc.ringp = (obj.lc.poly)->m->ringp;
1081: return(rob);
1.1 maekawa 1082: }
1083: }else if (strcmp(key,"null") == 0) {
1084: rob = NullObject;
1085: return(rob);
1086: }else{
1087: warningKan("Sorry. This type of data conversion has not supported yet.\n");
1088: }
1089: break;
1090: case SarrayOfPOLY:
1091: if (strcmp(key,"array")==0) {
1092: rob = arrayOfPOLYToArray(KopArrayOfPOLYp(obj));
1093: return(rob);
1094: }else{
1095: warningKan("Sorry. This type of data conversion has not supported yet.\n");
1096: }
1097: break;
1098: case SmatrixOfPOLY:
1099: if (strcmp(key,"array")==0) {
1100: rob = matrixOfPOLYToArray(KopMatrixOfPOLYp(obj));
1101: return(rob);
1102: }else if (strcmp(key,"null") == 0) {
1103: rob = NullObject;
1104: return(rob);
1105: }else{
1106: warningKan("Sorry. This type of data conversion has not supported yet.\n");
1107: }
1108: break;
1109: case Slist:
1110: if (strcmp(key,"array") == 0) {
1111: rob = listToArray(&obj);
1112: return(rob);
1113: }
1114: break;
1115: case SuniversalNumber:
1.15 takayama 1116: if ((strcmp(key,"universalNumber")==0) || (strcmp(key,"numerator")==0)) {
1.27 takayama 1117: rob = obj;
1.1 maekawa 1118: return(rob);
1119: }else if (strcmp(key,"integer")==0) {
1120: rob = KpoInteger(coeffToInt(obj.lc.universalNumber));
1121: return(rob);
1122: }else if (strcmp(key,"poly")==0) {
1123: rob = KpoPOLY(universalToPoly(obj.lc.universalNumber,CurrentRingp));
1124: return(rob);
1125: }else if (strcmp(key,"string")==0 || strcmp(key,"dollar")==0) {
1126: rob.tag = Sdollar;
1127: rob.lc.str = coeffToString(obj.lc.universalNumber);
1128: return(rob);
1129: }else if (strcmp(key,"null") == 0) {
1130: rob = NullObject;
1131: return(rob);
1132: }else if (strcmp(key,"double") == 0) {
1133: rob = KpoDouble( toDouble0(obj) );
1134: return(rob);
1.25 takayama 1135: }else if (strcmp(key,"denominator") == 0) {
1136: rob = KintToUniversalNumber(1);
1137: return(rob);
1.1 maekawa 1138: }else{
1139: warningKan("Sorry. This type of data conversion of universalNumber has not supported yet.\n");
1140: }
1141: break;
1142: case SrationalFunction:
1143: if (strcmp(key,"rationalFunction")==0) {
1144: return(rob);
1145: } if (strcmp(key,"numerator")==0) {
1146: rob = *(Knumerator(obj));
1147: return(rob);
1148: }else if (strcmp(key,"denominator")==0) {
1149: rob = *(Kdenominator(obj));
1150: return(rob);
1151: }else if (strcmp(key,"string")==0 || strcmp(key,"dollar")==0) {
1152: rob1 = KdataConversion(*(Knumerator(obj)),"string");
1153: rob2 = KdataConversion(*(Kdenominator(obj)),"string");
1154: s = sGC_malloc(sizeof(char)*( strlen(rob1.lc.str) + strlen(rob2.lc.str) + 10));
1155: if (s == (char *)NULL) errorKan1("%s\n","KdataConversion(): No memory");
1156: sprintf(s,"(%s)/(%s)",rob1.lc.str,rob2.lc.str);
1157: rob.tag = Sdollar;
1158: rob.lc.str = s;
1159: return(rob);
1160: }else if (strcmp(key,"cancel")==0) {
1161: warningKan("Sorry. Data conversion <<cancel>> of rationalFunction has not supported yet.\n");
1162: return(obj);
1163: }else if (strcmp(key,"null") == 0) {
1164: rob = NullObject;
1165: return(rob);
1166: }else if (strcmp(key,"double") == 0) {
1167: rob = KpoDouble( toDouble0(obj) );
1168: return(rob);
1169: }else{
1170: warningKan("Sorry. This type of data conversion of rationalFunction has not supported yet.\n");
1171: }
1172: break;
1173: case Sdouble:
1174: if (strcmp(key,"integer") == 0) {
1175: rob = KpoInteger( (int) KopDouble(obj));
1176: return(rob);
1177: } else if (strcmp(key,"universalNumber") == 0) {
1178: rob.tag = SuniversalNumber;
1179: rob.lc.universalNumber = intToCoeff((int) KopDouble(obj),&SmallRing);
1180: return(rob);
1181: }else if ((strcmp(key,"string") == 0) || (strcmp(key,"dollar") == 0)) {
1182: sprintf(tmps,"%f",KopDouble(obj));
1183: s = sGC_malloc(strlen(tmps)+2);
1184: if (s == (char *)NULL) errorKan1("%s\n","KdataConversion(): No memory");
1185: strcpy(s,tmps);
1186: rob.tag = Sdollar;
1187: rob.lc.str = s;
1188: return(rob);
1189: }else if (strcmp(key,"double")==0) {
1190: return(obj);
1191: }else if (strcmp(key,"null") == 0) {
1192: rob = NullObject;
1193: return(rob);
1194: }else {
1195: warningKan("Sorry. This type of data conversion of rationalFunction has not supported yet.\n");
1196: }
1197: break;
1198: case Sring:
1199: if (strcmp(key,"orderMatrix")==0) {
1200: rob = oGetOrderMatrix(KopRingp(obj));
1201: return(rob);
1.22 takayama 1202: }else if (strcmp(key,"oxRingStructure")==0) {
1203: rob = oRingToOXringStructure(KopRingp(obj));
1204: return(rob);
1.1 maekawa 1205: }else{
1206: warningKan("Sorryl This type of data conversion of ringp has not supported yet.\n");
1207: }
1208: break;
1209: default:
1210: warningKan("Sorry. This type of data conversion has not supported yet.\n");
1211: }
1212: return(NullObject);
1213: }
1.28 ! takayama 1214:
! 1215: /* cf. macro to_int */
! 1216: struct object Kto_int(struct object ob) {
! 1217: int n,i;
! 1218: struct object otmp;
! 1219: struct object rob;
! 1220: if (ob.tag == SuniversalNumber) return KdataConversion(ob,"integer");
! 1221: if (ob.tag == Sarray) {
! 1222: n = getoaSize(ob);
! 1223: rob = newObjectArray(n);
! 1224: for (i=0; i<n; i++) {
! 1225: otmp = Kto_int(getoa(ob,i));
! 1226: putoa(rob,i,otmp);
! 1227: }
! 1228: return rob;
! 1229: }
! 1230: return ob;
! 1231: }
1.1 maekawa 1232: /* conversion functions between primitive data and objects.
1233: If it's not time critical, it is recommended to use these functions */
1234: struct object KpoInteger(k)
1.7 takayama 1235: int k;
1.1 maekawa 1236: {
1237: struct object obj;
1238: obj.tag = Sinteger;
1239: obj.lc.ival = k; obj.rc.ival = 0;
1240: return(obj);
1241: }
1242: struct object KpoString(s)
1.7 takayama 1243: char *s;
1.1 maekawa 1244: {
1245: struct object obj;
1246: obj.tag = Sdollar;
1247: obj.lc.str = s; obj.rc.ival = 0;
1248: return(obj);
1249: }
1250: struct object KpoPOLY(f)
1.7 takayama 1251: POLY f;
1.1 maekawa 1252: {
1253: struct object obj;
1254: obj.tag = Spoly;
1255: obj.lc.poly = f; obj.rc.ival = 0;
1256: return(obj);
1257: }
1258: struct object KpoArrayOfPOLY(ap)
1.7 takayama 1259: struct arrayOfPOLY *ap ;
1.1 maekawa 1260: {
1261: struct object obj;
1262: obj.tag = SarrayOfPOLY;
1263: obj.lc.arrayp = ap; obj.rc.ival = 0;
1264: return(obj);
1265: }
1266:
1267: struct object KpoMatrixOfPOLY(mp)
1.7 takayama 1268: struct matrixOfPOLY *mp ;
1.1 maekawa 1269: {
1270: struct object obj;
1271: obj.tag = SmatrixOfPOLY;
1272: obj.lc.matrixp = mp; obj.rc.ival = 0;
1273: return(obj);
1274: }
1275:
1276: struct object KpoRingp(ringp)
1.7 takayama 1277: struct ring *ringp;
1.1 maekawa 1278: {
1279: struct object obj;
1280: obj.tag = Sring;
1281: obj.lc.ringp = ringp;
1282: return(obj);
1283: }
1284:
1.22 takayama 1285: struct object KpoUniversalNumber(u)
1286: struct coeff *u;
1287: {
1288: struct object obj;
1289: obj.tag = SuniversalNumber;
1290: obj.lc.universalNumber = u;
1291: return(obj);
1292: }
1.25 takayama 1293: struct object KintToUniversalNumber(n)
1294: int n;
1295: {
1296: struct object rob;
1297: extern struct ring SmallRing;
1298: rob.tag = SuniversalNumber;
1299: rob.lc.universalNumber = intToCoeff(n,&SmallRing);
1300: return(rob);
1301: }
1302:
1.1 maekawa 1303: /*** conversion 2. Data conversions on arrays and matrices. ****/
1304: struct object arrayOfPOLYToArray(aa)
1.7 takayama 1305: struct arrayOfPOLY *aa;
1.1 maekawa 1306: {
1307: POLY *a;
1308: int size;
1309: struct object r;
1310: int j;
1311: struct object tmp;
1312:
1313: size = aa->n; a = aa->array;
1314: r = newObjectArray(size);
1315: for (j=0; j<size; j++) {
1316: tmp.tag = Spoly;
1317: tmp.lc.poly= a[j];
1318: putoa(r,j,tmp);
1319: }
1320: return( r );
1321: }
1322:
1323: struct object matrixOfPOLYToArray(pmat)
1.7 takayama 1324: struct matrixOfPOLY *pmat;
1.1 maekawa 1325: {
1326: struct object r;
1327: struct object tmp;
1328: int i,j;
1329: int m,n;
1330: POLY *mat;
1331: struct arrayOfPOLY ap;
1332:
1333: m = pmat->m; n = pmat->n; mat = pmat->mat;
1334: r = newObjectArray(m);
1335: for (i=0; i<m; i++) {
1336: ap.n = n; ap.array = &(mat[ind(i,0)]);
1337: tmp = arrayOfPOLYToArray(&ap);
1338: /* ind() is the macro defined in matrix.h. */
1339: putoa(r,i,tmp);
1340: }
1341: return(r);
1342: }
1343:
1344: struct arrayOfPOLY *arrayToArrayOfPOLY(oa)
1.7 takayama 1345: struct object oa;
1.1 maekawa 1346: {
1347: POLY *a;
1348: int size;
1349: int i;
1350: struct object tmp;
1351: struct arrayOfPOLY *ap;
1352:
1353: if (oa.tag != Sarray) errorKan1("KarrayToArrayOfPOLY(): %s",
1.7 takayama 1354: "Argument is not array\n");
1.1 maekawa 1355: size = getoaSize(oa);
1356: a = (POLY *)sGC_malloc(sizeof(POLY)*size);
1357: for (i=0; i<size; i++) {
1358: tmp = getoa(oa,i);
1359: if (tmp.tag != Spoly) errorKan1("KarrayToArrayOfPOLY():%s ",
1.7 takayama 1360: "element must be polynomial.\n");
1.1 maekawa 1361: a[i] = tmp.lc.poly;
1362: }
1363: ap = (struct arrayOfPOLY *)sGC_malloc(sizeof(struct arrayOfPOLY));
1364: ap->n = size;
1365: ap->array = a;
1366: return(ap);
1367: }
1368:
1369: struct matrixOfPOLY *arrayToMatrixOfPOLY(oa)
1.7 takayama 1370: struct object oa;
1.1 maekawa 1371: {
1372: POLY *a;
1373: int m;
1374: int n;
1375: int i,j;
1376: struct matrixOfPOLY *ma;
1377:
1378: struct object tmp,tmp2;
1379: if (oa.tag != Sarray) errorKan1("KarrayToMatrixOfPOLY(): %s",
1.7 takayama 1380: "Argument is not array\n");
1.1 maekawa 1381: m = getoaSize(oa);
1382: tmp = getoa(oa,0);
1383: if (tmp.tag != Sarray) errorKan1("arrayToMatrixOfPOLY():%s ",
1.7 takayama 1384: "Argument is not array\n");
1.1 maekawa 1385: n = getoaSize(tmp);
1386: a = (POLY *)sGC_malloc(sizeof(POLY)*(m*n));
1387: for (i=0; i<m; i++) {
1388: tmp = getoa(oa,i);
1389: if (tmp.tag != Sarray) errorKan1("arrayToMatrixOfPOLY(): %s",
1.7 takayama 1390: "element must be array.\n");
1.1 maekawa 1391: for (j=0; j<n; j++) {
1392: tmp2 = getoa(tmp,j);
1393: if (tmp2.tag != Spoly) errorKan1("arrayToMatrixOfPOLY(): %s",
1.7 takayama 1394: "element must be a polynomial.\n");
1.1 maekawa 1395: a[ind(i,j)] = tmp2.lc.poly;
1396: /* we use the macro ind here. Be careful of using m and n. */
1397: }
1398: }
1399: ma = (struct matrixOfPOLY *)sGC_malloc(sizeof(struct matrixOfPOLY));
1400: ma->m = m; ma->n = n;
1401: ma->mat = a;
1402: return(ma);
1403: }
1404:
1405: /* :misc */
1406:
1407: /* :ring :kan */
1408: int objArrayToOrderMatrix(oA,order,n,oasize)
1.7 takayama 1409: struct object oA;
1410: int order[];
1411: int n;
1412: int oasize;
1.1 maekawa 1413: {
1414: int size;
1415: int k,j;
1416: struct object tmpOa;
1417: struct object obj;
1418: if (oA.tag != Sarray) {
1419: warningKan("The argument should be of the form [ [...] [...] ... [...]].");
1420: return(-1);
1421: }
1422: size = getoaSize(oA);
1423: if (size != oasize) {
1424: warningKan("The row size of the array is wrong.");
1425: return(-1);
1426: }
1427: for (k=0; k<size; k++) {
1428: tmpOa = getoa(oA,k);
1429: if (tmpOa.tag != Sarray) {
1430: warningKan("The argument should be of the form [ [...] [...] ... [...]].");
1431: return(-1);
1432: }
1433: if (getoaSize(tmpOa) != 2*n) {
1434: warningKan("The column size of the array is wrong.");
1435: return(-1);
1436: }
1437: for (j=0; j<2*n; j++) {
1438: obj = getoa(tmpOa,j);
1439: order[k*2*n+j] = obj.lc.ival;
1440: }
1441: }
1442: return(0);
1443: }
1444:
1445: int KsetOrderByObjArray(oA)
1.7 takayama 1446: struct object oA;
1.1 maekawa 1447: {
1448: int *order;
1449: int n,c,l, oasize;
1450: extern struct ring *CurrentRingp;
1451: extern int AvoidTheSameRing;
1452: /* n,c,l must be set in the CurrentRing */
1453: if (AvoidTheSameRing) {
1454: errorKan1("%s\n","KsetOrderByObjArray(): You cannot change the order matrix when AvoidTheSameRing == 1.");
1455: }
1456: n = CurrentRingp->n;
1457: c = CurrentRingp->c;
1458: l = CurrentRingp->l;
1459: if (oA.tag != Sarray) {
1460: warningKan("The argument should be of the form [ [...] [...] ... [...]].");
1461: return(-1);
1462: }
1463: oasize = getoaSize(oA);
1464: order = (int *)sGC_malloc(sizeof(int)*((2*n)*oasize+1));
1465: if (order == (int *)NULL) errorKan1("%s\n","KsetOrderByObjArray(): No memory.");
1466: if (objArrayToOrderMatrix(oA,order,n,oasize) == -1) {
1467: return(-1);
1468: }
1469: setOrderByMatrix(order,n,c,l,oasize); /* Set order to the current ring. */
1470: return(0);
1471: }
1472:
1473: static int checkRelations(c,l,m,n,cc,ll,mm,nn)
1.7 takayama 1474: int c,l,m,n,cc,ll,mm,nn;
1.1 maekawa 1475: {
1476: if (!(1<=c && c<=l && l<=m && m<=n)) return(1);
1477: if (!(cc<=ll && ll<=mm && mm<=nn && nn <= n)) return(1);
1478: if (!(cc<c || ll < l || mm < m || nn < n)) {
1479: if (WarningNoVectorVariable) {
1.4 takayama 1480: warningKanNoStrictMode("Ring definition: there is no variable to represent vectors.\n");
1.1 maekawa 1481: }
1482: }
1483: if (!(cc<=c && ll <= l && mm <= m && nn <= n)) return(1);
1484: return(0);
1485: }
1486:
1487: struct object KgetOrderMatrixOfCurrentRing()
1488: {
1489: extern struct ring *CurrentRingp;
1490: return(oGetOrderMatrix(CurrentRingp));
1491: }
1492:
1493:
1494: int KsetUpRing(ob1,ob2,ob3,ob4,ob5)
1.7 takayama 1495: struct object ob1,ob2,ob3,ob4,ob5;
1496: /* ob1 = [x(0), ..., x(n-1)];
1497: ob2 = [D(0), ..., D(n-1)];
1498: ob3 = [p,c,l,m,n,cc,ll,mm,nn,next];
1499: ob4 = Order matrix
1500: ob5 = [(keyword) value (keyword) value ....]
1501: */
1.1 maekawa 1502: #define RP_LIMIT 500
1503: {
1504: int i;
1505: struct object ob;
1506: int c,l,m,n;
1507: int cc,ll,mm,nn;
1508: int p;
1509: char **xvars;
1510: char **dvars;
1511: int *outputVars;
1512: int *order;
1513: static int rp = 0;
1514: static struct ring *rstack[RP_LIMIT];
1515:
1516: extern struct ring *CurrentRingp;
1517: struct ring *newRingp;
1518: int ob3Size;
1519: struct ring *nextRing;
1520: int oasize;
1521: static int ringSerial = 0;
1522: char *ringName = NULL;
1523: int aa;
1524: extern int AvoidTheSameRing;
1525: extern char *F_mpMult;
1526: char *fmp_mult_saved;
1527: char *mpMultName = NULL;
1528: struct object rob;
1529: struct ring *savedCurrentRingp;
1530:
1531: /* To get the ring structure. */
1532: if (ob1.tag == Snull) {
1533: rob = newObjectArray(rp);
1534: for (i=0; i<rp; i++) {
1535: putoa(rob,i,KpoRingp(rstack[i]));
1536: }
1537: KSpush(rob);
1538: return(0);
1539: }
1540:
1541: if (ob3.tag != Sarray) errorKan1("%s\n","Error in the 3rd argument. You need to give 4 arguments.");
1542: ob3Size = getoaSize(ob3);
1543: if (ob3Size != 9 && ob3Size != 10)
1544: errorKan1("%s\n","Error in the 3rd argument.");
1545: for (i=0; i<9; i++) {
1546: ob = getoa(ob3,i);
1547: if (ob.tag != Sinteger) errorKan1("%s\n","The 3rd argument should be a list of integers.");
1548: }
1549: if (ob3Size == 10) {
1550: ob = getoa(ob3,9);
1551: if (ob.tag != Sring)
1552: errorKan1("%s\n","The last arguments of the 3rd argument must be a pointer to a ring.");
1553: nextRing = KopRingp(ob);
1554: } else {
1555: nextRing = (struct ring *)NULL;
1556: }
1557:
1558: p = getoa(ob3,0).lc.ival;
1559: c = getoa(ob3,1).lc.ival; l = getoa(ob3,2).lc.ival;
1560: m = getoa(ob3,3).lc.ival; n = getoa(ob3,4).lc.ival;
1561: cc = getoa(ob3,5).lc.ival; ll = getoa(ob3,6).lc.ival;
1562: mm = getoa(ob3,7).lc.ival; nn = getoa(ob3,8).lc.ival;
1563: if (checkRelations(c,l,m,n,cc,ll,mm,nn,n)) {
1564: errorKan1("%s\n","1<=c<=l<=m<=n and cc<=c<=ll<=l<=mm<=m<=nn<=n \nand (cc<c or ll < l or mm < m or nn < n) must be satisfied.");
1565: }
1566: if (getoaSize(ob2) != n || getoaSize(ob1) != n) {
1567: errorKan1("%s\n","Error in the 1st or 2nd arguments.");
1568: }
1569: for (i=0; i<n; i++) {
1570: if (getoa(ob1,i).tag != Sdollar || getoa(ob2,i).tag != Sdollar) {
1571: errorKan1("%s\n","Error in the 1st or 2nd arguments.");
1572: }
1573: }
1574: xvars = (char **) sGC_malloc(sizeof(char *)*n);
1575: dvars = (char **) sGC_malloc(sizeof(char *)*n);
1576: if (xvars == (char **)NULL || dvars == (char **)NULL) {
1577: fprintf(stderr,"No more memory.\n");
1578: exit(15);
1579: }
1580: for (i=0; i<n; i++) {
1581: xvars[i] = getoa(ob1,i).lc.str;
1582: dvars[i] = getoa(ob2,i).lc.str;
1583: }
1584: checkDuplicateName(xvars,dvars,n);
1585:
1586: outputVars = (int *)sGC_malloc(sizeof(int)*n*2);
1587: if (outputVars == NULL) {
1588: fprintf(stderr,"No more memory.\n");
1589: exit(15);
1590: }
1591: if (ReverseOutputOrder) {
1592: for (i=0; i<n; i++) outputVars[i] = n-i-1;
1593: for (i=0; i<n; i++) outputVars[n+i] = 2*n-i-1;
1594: }else{
1595: for (i=0; i<2*n; i++) {
1596: outputVars[i] = i;
1597: }
1598: }
1.28 ! takayama 1599:
! 1600: ob4 = Kto_int(ob4); /* order matrix */
1.1 maekawa 1601: oasize = getoaSize(ob4);
1602: order = (int *)sGC_malloc(sizeof(int)*((2*n)*oasize+1));
1603: if (order == (int *)NULL) errorKan1("%s\n","No memory.");
1604: if (objArrayToOrderMatrix(ob4,order,n,oasize) == -1) {
1605: errorKan1("%s\n","Errors in the 4th matrix (order matrix).");
1606: }
1607: /* It's better to check the consistency of the order matrix here. */
1608: savedCurrentRingp = CurrentRingp;
1609:
1610: newRingp = (struct ring *)sGC_malloc(sizeof(struct ring));
1611: if (newRingp == NULL) errorKan1("%s\n","No more memory.");
1612: /* Generate the new ring before calling setOrder...(). */
1613: *newRingp = *CurrentRingp;
1614: CurrentRingp = newRingp; /* Push the current ring. */
1615: setOrderByMatrix(order,n,c,l,oasize); /* set order to the CurrentRing. */
1616: CurrentRingp = savedCurrentRingp; /* recover it. */
1617:
1618:
1619: /* Set the default name of the ring */
1620: ringName = (char *)sGC_malloc(16);
1621: sprintf(ringName,"ring%05d",ringSerial);
1622: ringSerial++;
1623:
1624: /* Set the current ring */
1625: newRingp->n = n; newRingp->m = m; newRingp->l = l; newRingp->c = c;
1626: newRingp->nn = nn; newRingp->mm = mm; newRingp->ll = ll;
1627: newRingp->cc = cc;
1628: newRingp->x = xvars;
1629: newRingp->D = dvars;
1630: /* You don't need to set order and orderMatrixSize here.
1631: It was set by setOrder(). */
1632: setFromTo(newRingp);
1633:
1634: newRingp->p = p;
1635: newRingp->next = nextRing;
1636: newRingp->multiplication = mpMult;
1637: /* These values should will be reset if the optional value is given. */
1638: newRingp->schreyer = 0;
1639: newRingp->gbListTower = NULL;
1640: newRingp->outputOrder = outputVars;
1.9 takayama 1641: newRingp->weightedHomogenization = 0;
1.11 takayama 1642: newRingp->degreeShiftSize = 0;
1.12 takayama 1643: newRingp->degreeShiftN = 0;
1644: newRingp->degreeShift = NULL;
1.1 maekawa 1645:
1646: if (ob5.tag != Sarray || (getoaSize(ob5) % 2) != 0) {
1647: errorKan1("%s\n","[(keyword) value (keyword) value ....] should be given.");
1648: }
1649: for (i=0; i < getoaSize(ob5); i += 2) {
1650: if (getoa(ob5,i).tag == Sdollar) {
1651: if (strcmp(KopString(getoa(ob5,i)),"mpMult") == 0) {
1.7 takayama 1652: if (getoa(ob5,i+1).tag != Sdollar) {
1653: errorKan1("%s\n","A keyword should be given. (mpMult)");
1654: }
1655: fmp_mult_saved = F_mpMult;
1656: mpMultName = KopString(getoa(ob5,i+1));
1657: switch_function("mpMult",mpMultName);
1658: /* Note that this cause a global effect. It will be done again. */
1659: newRingp->multiplication = mpMult;
1660: switch_function("mpMult",fmp_mult_saved);
1.1 maekawa 1661: } else if (strcmp(KopString(getoa(ob5,i)),"coefficient ring") == 0) {
1.7 takayama 1662: if (getoa(ob5,i+1).tag != Sring) {
1663: errorKan1("%s\n","The pointer to a ring should be given. (coefficient ring)");
1664: }
1665: nextRing = KopRingp(getoa(ob5,i+1));
1666: newRingp->next = nextRing;
1.1 maekawa 1667: } else if (strcmp(KopString(getoa(ob5,i)),"valuation") == 0) {
1.7 takayama 1668: errorKan1("%s\n","Not implemented. (valuation)");
1.1 maekawa 1669: } else if (strcmp(KopString(getoa(ob5,i)),"characteristic") == 0) {
1.7 takayama 1670: if (getoa(ob5,i+1).tag != Sinteger) {
1671: errorKan1("%s\n","A integer should be given. (characteristic)");
1672: }
1673: p = KopInteger(getoa(ob5,i+1));
1674: newRingp->p = p;
1.1 maekawa 1675: } else if (strcmp(KopString(getoa(ob5,i)),"schreyer") == 0) {
1.7 takayama 1676: if (getoa(ob5,i+1).tag != Sinteger) {
1677: errorKan1("%s\n","A integer should be given. (schreyer)");
1678: }
1679: newRingp->schreyer = KopInteger(getoa(ob5,i+1));
1.1 maekawa 1680: } else if (strcmp(KopString(getoa(ob5,i)),"gbListTower") == 0) {
1.7 takayama 1681: if (getoa(ob5,i+1).tag != Slist) {
1682: errorKan1("%s\n","A list should be given (gbListTower).");
1683: }
1684: newRingp->gbListTower = newObject();
1685: *((struct object *)(newRingp->gbListTower)) = getoa(ob5,i+1);
1.1 maekawa 1686: } else if (strcmp(KopString(getoa(ob5,i)),"ringName") == 0) {
1.7 takayama 1687: if (getoa(ob5,i+1).tag != Sdollar) {
1688: errorKan1("%s\n","A name should be given. (ringName)");
1689: }
1690: ringName = KopString(getoa(ob5,i+1));
1.9 takayama 1691: } else if (strcmp(KopString(getoa(ob5,i)),"weightedHomogenization") == 0) {
1692: if (getoa(ob5,i+1).tag != Sinteger) {
1693: errorKan1("%s\n","A integer should be given. (weightedHomogenization)");
1694: }
1.11 takayama 1695: newRingp->weightedHomogenization = KopInteger(getoa(ob5,i+1));
1696: } else if (strcmp(KopString(getoa(ob5,i)),"degreeShift") == 0) {
1697: if (getoa(ob5,i+1).tag != Sarray) {
1.12 takayama 1698: errorKan1("%s\n","An array of array should be given. (degreeShift)");
1.11 takayama 1699: }
1700: {
1701: struct object ods;
1.12 takayama 1702: struct object ods2;
1703: int dssize,k,j,nn;
1.11 takayama 1704: ods=getoa(ob5,i+1);
1.12 takayama 1705: if ((getoaSize(ods) < 1) || (getoa(ods,0).tag != Sarray)) {
1706: errorKan1("%s\n", "An array of array should be given. (degreeShift)");
1707: }
1708: nn = getoaSize(ods);
1709: dssize = getoaSize(getoa(ods,0));
1.11 takayama 1710: newRingp->degreeShiftSize = dssize;
1.12 takayama 1711: newRingp->degreeShiftN = nn;
1712: newRingp->degreeShift = (int *) sGC_malloc(sizeof(int)*(dssize*nn+1));
1.11 takayama 1713: if (newRingp->degreeShift == NULL) errorKan1("%s\n","No more memory.");
1.12 takayama 1714: for (j=0; j<nn; j++) {
1715: ods2 = getoa(ods,j);
1716: for (k=0; k<dssize; k++) {
1717: if (getoa(ods2,k).tag == SuniversalNumber) {
1718: (newRingp->degreeShift)[j*dssize+k] = coeffToInt(getoa(ods2,k).lc.universalNumber);
1719: }else{
1720: (newRingp->degreeShift)[j*dssize+k] = KopInteger(getoa(ods2,k));
1721: }
1.11 takayama 1722: }
1723: }
1724: }
1.22 takayama 1725: switch_function("grade","module1v");
1726: /* Warning: grading is changed to module1v!! */
1.1 maekawa 1727: } else {
1.7 takayama 1728: errorKan1("%s\n","Unknown keyword to set_up_ring@");
1.1 maekawa 1729: }
1730: }else{
1731: errorKan1("%s\n","A keyword enclosed by braces have to be given.");
1732: }
1733: }
1734:
1735: newRingp->name = ringName;
1736:
1737:
1738: if (AvoidTheSameRing) {
1739: aa = isTheSameRing(rstack,rp,newRingp);
1740: if (aa < 0) {
1741: /* This ring has never been defined. */
1742: CurrentRingp = newRingp;
1743: /* Install it to the RingStack */
1744: if (rp <RP_LIMIT) {
1.7 takayama 1745: rstack[rp] = CurrentRingp; rp++; /* Save the previous ringp */
1.1 maekawa 1746: }else{
1.7 takayama 1747: rp = 0;
1748: errorKan1("%s\n","You have defined too many rings. Check the value of RP_LIMIT.");
1.1 maekawa 1749: }
1750: }else{
1751: /* This ring has been defined. */
1752: /* Discard the newRingp */
1753: CurrentRingp = rstack[aa];
1754: ringSerial--;
1755: }
1756: }else{
1757: CurrentRingp = newRingp;
1758: /* Install it to the RingStack */
1759: if (rp <RP_LIMIT) {
1760: rstack[rp] = CurrentRingp; rp++; /* Save the previous ringp */
1761: }else{
1762: rp = 0;
1763: errorKan1("%s\n","You have defined too many rings. Check the value of RP_LIMIT.");
1764: }
1765: }
1766: if (mpMultName != NULL) {
1767: switch_function("mpMult",mpMultName);
1768: }
1769:
1770: initSyzRingp();
1771:
1772: return(0);
1773: }
1774:
1775:
1776: struct object KsetVariableNames(struct object ob,struct ring *rp)
1777: {
1778: int n,i;
1779: struct object ox;
1780: struct object otmp;
1781: char **xvars;
1782: char **dvars;
1783: if (ob.tag != Sarray) {
1784: errorKan1("%s\n","KsetVariableNames(): the argument must be of the form [(x) (y) (z) ...]");
1785: }
1786: n = rp->n;
1787: ox = ob;
1788: if (getoaSize(ox) != 2*n) {
1789: errorKan1("%s\n","KsetVariableNames(): the argument must be of the form [(x) (y) (z) ...] and the length of [(x) (y) (z) ...] must be equal to the number of x and D variables.");
1790: }
1791: xvars = (char **)sGC_malloc(sizeof(char *)*n);
1792: dvars = (char **)sGC_malloc(sizeof(char *)*n);
1793: if (xvars == NULL || dvars == NULL) {
1794: errorKan1("%s\n","KsetVariableNames(): no more memory.");
1795: }
1796: for (i=0; i<2*n; i++) {
1797: otmp = getoa(ox,i);
1798: if(otmp.tag != Sdollar) {
1799: errorKan1("%s\n","KsetVariableNames(): elements must be strings.");
1800: }
1801: if (i < n) {
1802: xvars[i] = KopString(otmp);
1803: }else{
1804: dvars[i-n] = KopString(otmp);
1805: }
1806: }
1807: checkDuplicateName(xvars,dvars,n);
1808: rp->x = xvars;
1809: rp->D = dvars;
1810: return(ob);
1811: }
1812:
1813:
1814:
1815: void KshowRing(ringp)
1.7 takayama 1816: struct ring *ringp;
1.1 maekawa 1817: {
1818: showRing(1,ringp);
1819: }
1820:
1821: struct object KswitchFunction(ob1,ob2)
1.7 takayama 1822: struct object ob1,ob2;
1.1 maekawa 1823: {
1824: char *ans ;
1825: struct object rob;
1826: int needWarningForAvoidTheSameRing = 0;
1827: extern int AvoidTheSameRing;
1828: if ((ob1.tag != Sdollar) || (ob2.tag != Sdollar)) {
1829: errorKan1("%s\n","$function$ $name$ switch_function\n");
1830: }
1831: if (AvoidTheSameRing && needWarningForAvoidTheSameRing) {
1832: if (strcmp(KopString(ob1),"mmLarger") == 0 ||
1833: strcmp(KopString(ob1),"mpMult") == 0 ||
1834: strcmp(KopString(ob1),"monomialAdd") == 0 ||
1835: strcmp(KopString(ob1),"isSameComponent") == 0) {
1836: fprintf(stderr,",switch_function ==> %s ",KopString(ob1));
1837: warningKan("switch_function might cause a trouble under AvoidTheSameRing == 1.\n");
1838: }
1839: }
1840: if (AvoidTheSameRing) {
1841: if (strcmp(KopString(ob1),"mmLarger") == 0 &&
1.7 takayama 1842: strcmp(KopString(ob2),"matrix") != 0) {
1.1 maekawa 1843: fprintf(stderr,"mmLarger = %s",KopString(ob2));
1844: errorKan1("%s\n","mmLarger can set only to matrix under AvoidTheSameRing == 1.");
1845: }
1846: }
1847:
1848: ans = switch_function(ob1.lc.str,ob2.lc.str);
1849: if (ans == NULL) {
1850: rob = NullObject;
1851: }else{
1852: rob = KpoString(ans);
1853: }
1854: return(rob);
1855:
1856: }
1857:
1858: void KprintSwitchStatus(void)
1859: {
1860: print_switch_status();
1861: }
1862:
1863: struct object KoReplace(of,rule)
1.7 takayama 1864: struct object of;
1865: struct object rule;
1.1 maekawa 1866: {
1867: struct object rob;
1868: POLY f;
1869: POLY lRule[N0*2];
1870: POLY rRule[N0*2];
1871: POLY r;
1872: int i;
1873: int n;
1874: struct object trule;
1875:
1876:
1877: if (rule.tag != Sarray) {
1878: errorKan1("%s\n"," KoReplace(): The second argument must be array.");
1879: }
1880: n = getoaSize(rule);
1881:
1.6 takayama 1882: if (of.tag == Spoly) {
1883: }else if (of.tag ==Sclass && ectag(of) == CLASSNAME_recursivePolynomial) {
1.7 takayama 1884: return(KreplaceRecursivePolynomial(of,rule));
1.6 takayama 1885: }else{
1.1 maekawa 1886: errorKan1("%s\n"," KoReplace(): The first argument must be a polynomial.");
1887: }
1888: f = KopPOLY(of);
1889:
1890: if (f ISZERO) {
1891: }else{
1892: if (n >= 2*(f->m->ringp->n)) {
1893: errorKan1("%s\n"," KoReplace(): too many rules for replacement. ");
1894: }
1895: }
1896:
1897: for (i=0; i<n; i++) {
1898: trule = getoa(rule,i);
1899: if (trule.tag != Sarray) {
1900: errorKan1("%s\n"," KoReplace(): The second argument must be of the form [[a b] [c d] ....].");
1901: }
1902: if (getoaSize(trule) != 2) {
1903: errorKan1("%s\n"," KoReplace(): The second argument must be of the form [[a b] [c d] ....].");
1904: }
1905:
1906: if (getoa(trule,0).tag != Spoly) {
1907: errorKan1("%s\n"," KoReplace(): The second argument must be of the form [[a b] [c d] ....] where a,b,c,d,... are polynomials.");
1908: }
1909: if (getoa(trule,1).tag != Spoly) {
1910: errorKan1("%s\n"," KoReplace(): The second argument must be of the form [[a b] [c d] ....] where a,b,c,d,... are polynomials.");
1911: }
1912:
1913: lRule[i] = KopPOLY(getoa(trule,0));
1914: rRule[i] = KopPOLY(getoa(trule,1));
1915: }
1916:
1917: r = replace(f,lRule,rRule,n);
1918: rob.tag = Spoly; rob.lc.poly = r;
1919:
1920: return(rob);
1921: }
1922:
1923:
1924: struct object Kparts(f,v)
1.7 takayama 1925: struct object f;
1926: struct object v;
1.1 maekawa 1927: {
1928: POLY ff;
1929: POLY vv;
1930: struct object obj;
1931: struct matrixOfPOLY *co;
1932: /* check the data type */
1933: if (f.tag != Spoly || v.tag != Spoly)
1934: errorKan1("%s\n","arguments of Kparts() must have polynomial as arguments.");
1935:
1936: co = parts(KopPOLY(f),KopPOLY(v));
1937: obj = matrixOfPOLYToArray(co);
1938: return(obj);
1939: }
1940:
1941: struct object Kparts2(f,v)
1.7 takayama 1942: struct object f;
1943: struct object v;
1.1 maekawa 1944: {
1945: POLY ff;
1946: POLY vv;
1947: struct object obj;
1948: struct matrixOfPOLY *co;
1949: /* check the data type */
1950: if (f.tag != Spoly || v.tag != Spoly)
1951: errorKan1("%s\n","arguments of Kparts2() must have polynomial as arguments.");
1952:
1953: obj = parts2(KopPOLY(f),KopPOLY(v));
1954: return(obj);
1955: }
1956:
1957:
1958: struct object Kdegree(ob1,ob2)
1.7 takayama 1959: struct object ob1,ob2;
1.1 maekawa 1960: {
1961: if (ob1.tag != Spoly || ob2.tag != Spoly)
1962: errorKan1("%s\n","The arguments must be polynomials.");
1963:
1964: return(KpoInteger(pDegreeWrtV(KopPOLY(ob1),KopPOLY(ob2))));
1965: }
1966:
1967: struct object KringMap(obj)
1.7 takayama 1968: struct object obj;
1.1 maekawa 1969: {
1970: extern struct ring *CurrentRingp;
1971: extern struct ring *SyzRingp;
1972: POLY f;
1973: POLY r;
1974: if (obj.tag != Spoly)
1975: errorKan1("%s\n","The argments must be polynomial.");
1976: f = KopPOLY(obj);
1977: if (f ISZERO) return(obj);
1978: if (f->m->ringp == CurrentRingp) return(obj);
1979: if (f->m->ringp == CurrentRingp->next) {
1980: r = newCell(newCoeff(),newMonomial(CurrentRingp));
1981: r->coeffp->tag = POLY_COEFF;
1982: r->coeffp->val.f = f;
1983: return(KpoPOLY(r));
1984: }else if (f->m->ringp == SyzRingp) {
1985: return(KpoPOLY(f->coeffp->val.f));
1986: }
1987: errorKan1("%s\n","The ring map is not defined in this case.");
1988: }
1989:
1990:
1991: struct object Ksp(ob1,ob2)
1.7 takayama 1992: struct object ob1,ob2;
1.1 maekawa 1993: {
1994: struct spValue sv;
1995: struct object rob,cob;
1996: POLY f;
1997: if (ob1.tag != Spoly || ob2.tag != Spoly)
1998: errorKan1("%s\n","Ksp(): The arguments must be polynomials.");
1999: sv = (*sp)(ob1.lc.poly,ob2.lc.poly);
2000: f = ppAddv(ppMult(sv.a,KopPOLY(ob1)),
1.7 takayama 2001: ppMult(sv.b,KopPOLY(ob2)));
1.1 maekawa 2002: rob = newObjectArray(2);
2003: cob = newObjectArray(2);
2004: putoa(rob,1,KpoPOLY(f));
2005: putoa(cob,0,KpoPOLY(sv.a));
2006: putoa(cob,1,KpoPOLY(sv.b));
2007: putoa(rob,0,cob);
2008: return(rob);
2009: }
2010:
2011: struct object Khead(ob)
1.7 takayama 2012: struct object ob;
1.1 maekawa 2013: {
2014: if (ob.tag != Spoly) errorKan1("%s\n","Khead(): The argument should be a polynomial.");
2015: return(KpoPOLY(head( KopPOLY(ob))));
2016: }
2017:
2018:
2019: /* :eval */
2020: struct object Keval(obj)
1.7 takayama 2021: struct object obj;
1.1 maekawa 2022: {
2023: char *key;
2024: int size;
2025: struct object rob;
2026: rob = NullObject;
2027:
2028: if (obj.tag != Sarray)
2029: errorKan1("%s\n","[$key$ arguments] eval");
2030: if (getoaSize(obj) < 1)
2031: errorKan1("%s\n","[$key$ arguments] eval");
2032: if (getoa(obj,0).tag != Sdollar)
2033: errorKan1("%s\n","[$key$ arguments] eval");
2034: key = getoa(obj,0).lc.str;
2035: size = getoaSize(obj);
2036:
2037:
2038: return(rob);
2039: }
2040:
2041: /* :Utilities */
2042: char *KremoveSpace(str)
1.7 takayama 2043: char str[];
1.1 maekawa 2044: {
2045: int size;
2046: int start;
2047: int end;
2048: char *s;
2049: int i;
2050:
2051: size = strlen(str);
2052: for (start = 0; start <= size; start++) {
2053: if (str[start] > ' ') break;
2054: }
2055: for (end = size-1; end >= 0; end--) {
2056: if (str[end] > ' ') break;
2057: }
2058: if (start > end) return((char *) NULL);
2059: s = (char *) sGC_malloc(sizeof(char)*(end-start+2));
2060: if (s == (char *)NULL) errorKan1("%s\n","removeSpace(): No more memory.");
2061: for (i=0; i< end-start+1; i++)
2062: s[i] = str[i+start];
2063: s[end-start+1] = '\0';
2064: return(s);
2065: }
2066:
2067: struct object KtoRecords(ob)
1.7 takayama 2068: struct object ob;
1.1 maekawa 2069: {
2070: struct object obj;
2071: struct object tmp;
2072: int i;
2073: int size;
2074: char **argv;
2075:
2076: obj = NullObject;
2077: switch(ob.tag) {
2078: case Sdollar: break;
2079: default:
2080: errorKan1("%s","Argument of KtoRecords() must be a string enclosed by dollars.\n");
2081: break;
2082: }
2083: size = strlen(ob.lc.str)+3;
2084: argv = (char **) sGC_malloc((size+1)*sizeof(char *));
2085: if (argv == (char **)NULL)
2086: errorKan1("%s","No more memory.\n");
2087: size = KtoArgvbyCurryBrace(ob.lc.str,argv,size);
2088: if (size < 0)
2089: errorKan1("%s"," KtoRecords(): You have an error in the argument.\n");
2090:
2091: obj = newObjectArray(size);
2092: for (i=0; i<size; i++) {
2093: tmp.tag = Sdollar;
2094: tmp.lc.str = argv[i];
2095: (obj.rc.op)[i] = tmp;
2096: }
2097: return(obj);
2098: }
2099:
2100: int KtoArgvbyCurryBrace(str,argv,limit)
1.7 takayama 2101: char *str;
2102: char *argv[];
2103: int limit;
2104: /* This function returns argc */
2105: /* decompose into tokens by the separators
1.1 maekawa 2106: { }, [ ], and characters of which code is less than SPACE.
2107: Example. { } ---> nothing (argc=0)
2108: {x}----> x (argc=1)
2109: {x,y} --> x y (argc=2)
1.7 takayama 2110: {ab, y, z } --> ab y z (argc=3)
1.1 maekawa 2111: [[ab],c,d] --> [ab] c d
2112: */
2113: {
2114: int argc;
2115: int n;
2116: int i;
2117: int k;
2118: char *a;
2119: char *ident;
2120: int level = 0;
2121: int comma;
2122:
2123: if (str == (char *)NULL) {
2124: fprintf(stderr,"You use NULL string to toArgvbyCurryBrace()\n");
2125: return(0);
2126: }
2127:
2128: n = strlen(str);
2129: a = (char *) sGC_malloc(sizeof(char)*(n+3));
2130: a[0]=' ';
2131: strcpy(&(a[1]),str);
2132: n = strlen(a); a[0] = '\0';
2133: comma = -1;
2134: for (i=1; i<n; i++) {
2135: if (a[i] == '{' || a[i] == '[') level++;
2136: if (level <= 1 && ( a[i] == ',')) {a[i] = '\0'; ++comma;}
2137: if (level <= 1 && (a[i]=='{' || a[i]=='}' || a[i]=='[' || a[i]==']'))
2138: a[i] = '\0';
2139: if (a[i] == '}' || a[i] == ']') level--;
2140: if ((level <= 1) && (comma == -1) && ( a[i] > ' ')) comma = 0;
2141: }
2142:
2143: if (comma == -1) return(0);
2144:
2145: argc=0;
2146: for (i=0; i<n; i++) {
2147: if ((a[i] == '\0') && (a[i+1] != '\0')) ++argc;
2148: }
2149: if (argc > limit) return(-argc);
2150:
2151: k = 0;
2152: for (i=0; i<n; i++) {
2153: if ((a[i] == '\0') && (a[i+1] != '\0')) {
2154: ident = (char *) sGC_malloc(sizeof(char)*( strlen(&(a[i+1])) + 3));
2155: strcpy(ident,&(a[i+1]));
2156: argv[k] = KremoveSpace(ident);
2157: if (argv[k] != (char *)NULL) k++;
2158: if (k >= limit) errorKan1("%s\n","KtoArgvbyCurryBraces(): k>=limit.");
2159: }
2160: }
2161: argc = k;
2162: /*for (i=0; i<argc; i++) fprintf(stderr,"%d %s\n",i,argv[i]);*/
2163: return(argc);
2164: }
2165:
1.14 takayama 2166: struct object KstringToArgv(struct object ob) {
2167: struct object rob;
2168: char *s;
2169: int n,wc,i,inblank;
2170: char **argv;
2171: if (ob.tag != Sdollar)
1.22 takayama 2172: errorKan1("%s\n","KstringToArgv(): the argument must be a string.");
1.14 takayama 2173: n = strlen(KopString(ob));
2174: s = (char *) sGC_malloc(sizeof(char)*(n+2));
2175: if (s == NULL) errorKan1("%s\n","KstringToArgv(): No memory.");
2176: strcpy(s,KopString(ob));
2177: inblank = 1; wc = 0;
2178: for (i=0; i<n; i++) {
1.22 takayama 2179: if (inblank && (s[i] > ' ')) {
2180: wc++; inblank = 0;
2181: }else if ((!inblank) && (s[i] <= ' ')) {
2182: inblank = 1;
2183: }
1.14 takayama 2184: }
2185: argv = (char **) sGC_malloc(sizeof(char *)*(wc+2));
2186: argv[0] = NULL;
2187: inblank = 1; wc = 0;
2188: for (i=0; i<n; i++) {
1.22 takayama 2189: if (inblank && (s[i] > ' ')) {
2190: argv[wc] = &(s[i]); argv[wc+1]=NULL;
2191: wc++; inblank = 0;
2192: }else if ((inblank == 0) && (s[i] <= ' ')) {
2193: inblank = 1; s[i] = 0;
2194: }else if (inblank && (s[i] <= ' ')) {
2195: s[i] = 0;
2196: }
1.14 takayama 2197: }
2198:
2199: rob = newObjectArray(wc);
2200: for (i=0; i<wc; i++) {
1.22 takayama 2201: putoa(rob,i,KpoString(argv[i]));
2202: /* printf("%s\n",argv[i]); */
1.14 takayama 2203: }
2204: return(rob);
2205: }
1.1 maekawa 2206:
2207: static void checkDuplicateName(xvars,dvars,n)
1.7 takayama 2208: char *xvars[];
2209: char *dvars[];
2210: int n;
1.1 maekawa 2211: {
2212: int i,j;
2213: char *names[N0*2];
2214: for (i=0; i<n; i++) {
2215: names[i] = xvars[i]; names[i+n] = dvars[i];
2216: }
2217: n = 2*n;
2218: for (i=0; i<n; i++) {
2219: for (j=i+1; j<n; j++) {
2220: if (strcmp(names[i],names[j]) == 0) {
1.7 takayama 2221: fprintf(stderr,"\n%d=%s, %d=%s\n",i,names[i],j,names[j]);
2222: errorKan1("%s\n","Duplicate definition of the name above in SetUpRing().");
1.1 maekawa 2223: }
2224: }
2225: }
2226: }
2227:
1.20 takayama 2228: struct object KooPower(struct object ob1,struct object ob2) {
2229: struct object rob;
2230: /* Bug. It has not yet been implemented. */
2231: if (QuoteMode) {
1.22 takayama 2232: rob = powerTree(ob1,ob2);
1.20 takayama 2233: }else{
1.22 takayama 2234: warningKan("KooDiv2() has not supported yet these objects.\n");
1.20 takayama 2235: }
2236: return(rob);
2237: }
1.1 maekawa 2238:
2239:
2240:
2241: struct object KooDiv2(ob1,ob2)
1.7 takayama 2242: struct object ob1,ob2;
1.1 maekawa 2243: {
2244: struct object rob = NullObject;
2245: POLY f;
2246: extern struct ring *CurrentRingp;
2247: int s,i;
2248: double d;
2249:
2250: switch (Lookup[ob1.tag][ob2.tag]) {
2251: case SpolySpoly:
2252: case SuniversalNumberSuniversalNumber:
2253: case SuniversalNumberSpoly:
2254: case SpolySuniversalNumber:
2255: rob = KnewRationalFunction0(copyObjectp(&ob1),copyObjectp(&ob2));
2256: KisInvalidRational(&rob);
2257: return(rob);
2258: break;
2259: case SarraySpoly:
2260: case SarraySuniversalNumber:
2261: case SarraySrationalFunction:
2262: s = getoaSize(ob1);
2263: rob = newObjectArray(s);
2264: for (i=0; i<s; i++) {
2265: putoa(rob,i,KooDiv2(getoa(ob1,i),ob2));
2266: }
2267: return(rob);
2268: break;
2269: case SpolySrationalFunction:
2270: case SrationalFunctionSpoly:
2271: case SrationalFunctionSrationalFunction:
2272: case SuniversalNumberSrationalFunction:
2273: case SrationalFunctionSuniversalNumber:
2274: rob = KoInverse(ob2);
2275: rob = KooMult(ob1,rob);
2276: return(rob);
2277: break;
2278:
2279: case SdoubleSdouble:
2280: d = KopDouble(ob2);
2281: if (d == 0.0) errorKan1("%s\n","KooDiv2, Division by zero.");
2282: return(KpoDouble( KopDouble(ob1) / d ));
2283: break;
2284: case SdoubleSinteger:
2285: case SdoubleSuniversalNumber:
2286: case SdoubleSrationalFunction:
2287: d = toDouble0(ob2);
2288: if (d == 0.0) errorKan1("%s\n","KooDiv2, Division by zero.");
2289: return(KpoDouble( KopDouble(ob1) / d) );
2290: break;
2291: case SintegerSdouble:
2292: case SuniversalNumberSdouble:
2293: case SrationalFunctionSdouble:
2294: d = KopDouble(ob2);
2295: if (d == 0.0) errorKan1("%s\n","KooDiv2, Division by zero.");
2296: return(KpoDouble( toDouble0(ob1) / d ) );
2297: break;
2298:
2299: default:
1.20 takayama 2300: if (QuoteMode) {
2301: rob = divideTree(ob1,ob2);
2302: }else{
2303: warningKan("KooDiv2() has not supported yet these objects.\n");
2304: }
1.1 maekawa 2305: break;
2306: }
2307: return(rob);
2308: }
2309: /* Template
2310: case SrationalFunctionSrationalFunction:
2311: warningKan("Koo() has not supported yet these objects.\n");
2312: return(rob);
2313: break;
2314: case SpolySrationalFunction:
2315: warningKan("Koo() has not supported yet these objects.\n");
2316: return(rob);
2317: break;
2318: case SrationalFunctionSpoly:
2319: warningKan("Koo() has not supported yet these objects.\n");
2320: return(rob);
2321: break;
2322: case SuniversalNumberSrationalFunction:
2323: warningKan("Koo() has not supported yet these objects.\n");
2324: return(rob);
2325: break;
2326: case SrationalFunctionSuniversalNumber:
2327: warningKan("Koo() has not supported yet these objects.\n");
2328: return(rob);
2329: break;
2330: */
2331:
2332: int KisInvalidRational(op)
1.7 takayama 2333: objectp op;
1.1 maekawa 2334: {
2335: extern struct coeff *UniversalZero;
2336: if (op->tag != SrationalFunction) return(0);
2337: if (KisZeroObject(Kdenominator(*op))) {
2338: errorKan1("%s\n","KisInvalidRational(): zero division. You have f/0.");
2339: }
2340: if (KisZeroObject(Knumerator(*op))) {
2341: op->tag = SuniversalNumber;
2342: op->lc.universalNumber = UniversalZero;
2343: }
2344: return(0);
2345: }
2346:
2347: struct object KgbExtension(struct object obj)
2348: {
2349: char *key;
2350: int size;
2351: struct object keyo;
2352: struct object rob = NullObject;
2353: struct object obj1,obj2,obj3;
2354: POLY f1;
2355: POLY f2;
2356: POLY f3;
2357: POLY f;
2358: int m,i;
2359: struct pairOfPOLY pf;
1.16 takayama 2360: struct coeff *cont;
1.1 maekawa 2361:
2362: if (obj.tag != Sarray) errorKan1("%s\n","KgbExtension(): The argument must be an array.");
2363: size = getoaSize(obj);
2364: if (size < 1) errorKan1("%s\n","KgbExtension(): Empty array.");
2365: keyo = getoa(obj,0);
2366: if (keyo.tag != Sdollar) errorKan1("%s\n","KgbExtension(): No key word.");
2367: key = KopString(keyo);
2368:
2369: /* branch by the key word. */
2370: if (strcmp(key,"isReducible")==0) {
2371: if (size != 3) errorKan1("%s\n","[(isReducible) poly1 poly2] gbext.");
2372: obj1 = getoa(obj,1);
2373: obj2 = getoa(obj,2);
2374: if (obj1.tag != Spoly || obj2.tag != Spoly)
2375: errorKan1("%s\n","[(isReducible) poly1 poly2] gb.");
2376: f1 = KopPOLY(obj1);
2377: f2 = KopPOLY(obj2);
2378: rob = KpoInteger((*isReducible)(f1,f2));
2379: }else if (strcmp(key,"lcm") == 0) {
2380: if (size != 3) errorKan1("%s\n","[(lcm) poly1 poly2] gb.");
2381: obj1 = getoa(obj,1);
2382: obj2 = getoa(obj,2);
2383: if (obj1.tag != Spoly || obj2.tag != Spoly)
2384: errorKan1("%s\n","[(lcm) poly1 poly2] gbext.");
2385: f1 = KopPOLY(obj1);
2386: f2 = KopPOLY(obj2);
2387: rob = KpoPOLY((*lcm)(f1,f2));
2388: }else if (strcmp(key,"grade")==0) {
2389: if (size != 2) errorKan1("%s\n","[(grade) poly1 ] gbext.");
2390: obj1 = getoa(obj,1);
2391: if (obj1.tag != Spoly)
2392: errorKan1("%s\n","[(grade) poly1 ] gbext.");
2393: f1 = KopPOLY(obj1);
2394: rob = KpoInteger((*grade)(f1));
2395: }else if (strcmp(key,"mod")==0) {
2396: if (size != 3) errorKan1("%s\n","[(mod) poly num] gbext");
2397: obj1 = getoa(obj,1);
2398: obj2 = getoa(obj,2);
2399: if (obj1.tag != Spoly || obj2.tag != SuniversalNumber) {
2400: errorKan1("%s\n","The datatype of the argument mismatch: [(mod) polynomial universalNumber] gbext");
2401: }
2402: rob = KpoPOLY( modulopZ(KopPOLY(obj1),KopUniversalNumber(obj2)) );
2403: }else if (strcmp(key,"tomodp")==0) {
2404: /* The ring must be a ring of characteristic p. */
2405: if (size != 3) errorKan1("%s\n","[(tomod) poly ring] gbext");
2406: obj1 = getoa(obj,1);
2407: obj2 = getoa(obj,2);
2408: if (obj1.tag != Spoly || obj2.tag != Sring) {
2409: errorKan1("%s\n","The datatype of the argument mismatch: [(tomod) polynomial ring] gbext");
2410: }
2411: rob = KpoPOLY( modulop(KopPOLY(obj1),KopRingp(obj2)) );
2412: }else if (strcmp(key,"tomod0")==0) {
2413: /* Ring must be a ring of characteristic 0. */
2414: if (size != 3) errorKan1("%s\n","[(tomod0) poly ring] gbext");
2415: obj1 = getoa(obj,1);
2416: obj2 = getoa(obj,2);
2417: if (obj1.tag != Spoly || obj2.tag != Sring) {
2418: errorKan1("%s\n","The datatype of the argument mismatch: [(tomod0) polynomial ring] gbext");
2419: }
2420: errorKan1("%s\n","It has not been implemented.");
2421: rob = KpoPOLY( POLYNULL );
2422: }else if (strcmp(key,"divByN")==0) {
2423: if (size != 3) errorKan1("%s\n","[(divByN) poly num] gbext");
2424: obj1 = getoa(obj,1);
2425: obj2 = getoa(obj,2);
2426: if (obj1.tag != Spoly || obj2.tag != SuniversalNumber) {
2427: errorKan1("%s\n","The datatype of the argument mismatch: [(divByN) polynomial universalNumber] gbext");
2428: }
2429: pf = quotientByNumber(KopPOLY(obj1),KopUniversalNumber(obj2));
2430: rob = newObjectArray(2);
2431: putoa(rob,0,KpoPOLY(pf.first));
2432: putoa(rob,1,KpoPOLY(pf.second));
2433: }else if (strcmp(key,"isConstant")==0) {
2434: if (size != 2) errorKan1("%s\n","[(isConstant) poly ] gbext bool");
2435: obj1 = getoa(obj,1);
2436: if (obj1.tag != Spoly) {
2437: errorKan1("%s\n","The datatype of the argument mismatch: [(isConstant) polynomial] gbext");
2438: }
2439: return(KpoInteger(isConstant(KopPOLY(obj1))));
1.18 takayama 2440: }else if (strcmp(key,"isConstantAll")==0) {
2441: if (size != 2) errorKan1("%s\n","[(isConstantAll) poly ] gbext bool");
2442: obj1 = getoa(obj,1);
2443: if (obj1.tag != Spoly) {
2444: errorKan1("%s\n","The datatype of the argument mismatch: [(isConstantAll) polynomial] gbext");
2445: }
2446: return(KpoInteger(isConstantAll(KopPOLY(obj1))));
1.1 maekawa 2447: }else if (strcmp(key,"schreyerSkelton") == 0) {
2448: if (size != 2) errorKan1("%s\n","[(schreyerSkelton) array_of_poly ] gbext array");
2449: obj1 = getoa(obj,1);
2450: return(KschreyerSkelton(obj1));
2451: }else if (strcmp(key,"lcoeff") == 0) {
2452: if (size != 2) errorKan1("%s\n","[(lcoeff) poly] gbext poly");
2453: obj1 = getoa(obj,1);
2454: if (obj1.tag != Spoly) errorKan1("%s\n","[(lcoeff) poly] gbext poly");
2455: f = KopPOLY(obj1);
2456: if (f == POLYNULL) return(KpoPOLY(f));
2457: return(KpoPOLY( newCell(coeffCopy(f->coeffp),newMonomial(f->m->ringp))));
2458: }else if (strcmp(key,"lmonom") == 0) {
2459: if (size != 2) errorKan1("%s\n","[(lmonom) poly] gbext poly");
2460: obj1 = getoa(obj,1);
2461: if (obj1.tag != Spoly) errorKan1("%s\n","[(lmonom) poly] gbext poly");
2462: f = KopPOLY(obj1);
2463: if (f == POLYNULL) return(KpoPOLY(f));
2464: return(KpoPOLY( newCell(intToCoeff(1,f->m->ringp),monomialCopy(f->m))));
2465: }else if (strcmp(key,"toes") == 0) {
2466: if (size != 2) errorKan1("%s\n","[(toes) array] gbext poly");
2467: obj1 = getoa(obj,1);
2468: if (obj1.tag != Sarray) errorKan1("%s\n","[(toes) array] gbext poly");
2469: return(KvectorToSchreyer_es(obj1));
1.3 takayama 2470: }else if (strcmp(key,"toe_") == 0) {
2471: if (size != 2) errorKan1("%s\n","[(toe_) array] gbext poly");
2472: obj1 = getoa(obj,1);
2473: if (obj1.tag == Spoly) return(obj1);
2474: if (obj1.tag != Sarray) errorKan1("%s\n","[(toe_) array] gbext poly");
2475: return(KpoPOLY(arrayToPOLY(obj1)));
1.1 maekawa 2476: }else if (strcmp(key,"isOrdered") == 0) {
2477: if (size != 2) errorKan1("%s\n","[(isOrdered) poly] gbext poly");
2478: obj1 = getoa(obj,1);
2479: if (obj1.tag != Spoly) errorKan1("%s\n","[(isOrdered) poly] gbext poly");
2480: return(KisOrdered(obj1));
1.16 takayama 2481: }else if (strcmp(key,"reduceContent")==0) {
2482: if (size != 2) errorKan1("%s\n","[(reduceContent) poly1 ] gbext.");
2483: obj1 = getoa(obj,1);
2484: if (obj1.tag != Spoly)
2485: errorKan1("%s\n","[(reduceContent) poly1 ] gbext.");
2486: f1 = KopPOLY(obj1);
1.22 takayama 2487: rob = newObjectArray(2);
2488: f1 = reduceContentOfPoly(f1,&cont);
2489: putoa(rob,0,KpoPOLY(f1));
2490: if (f1 == POLYNULL) {
2491: putoa(rob,1,KpoPOLY(f1));
2492: }else{
2493: putoa(rob,1,KpoPOLY(newCell(cont,newMonomial(f1->m->ringp))));
2494: }
1.17 takayama 2495: }else if (strcmp(key,"ord_ws_all")==0) {
2496: if (size != 3) errorKan1("%s\n","[(ord_ws_all) fv wv] gbext");
2497: obj1 = getoa(obj,1);
2498: obj2 = getoa(obj,2);
2499: rob = KordWsAll(obj1,obj2);
1.23 takayama 2500: }else if (strcmp(key,"exponents")==0) {
2501: if (size == 3) {
2502: obj1 = getoa(obj,1);
2503: obj2 = getoa(obj,2);
2504: rob = KgetExponents(obj1,obj2);
2505: }else if (size == 2) {
2506: obj1 = getoa(obj,1);
2507: obj2 = KpoInteger(2);
2508: rob = KgetExponents(obj1,obj2);
2509: }else{
2510: errorKan1("%s\n","[(exponents) f type] gbext");
2511: }
1.1 maekawa 2512: }else {
2513: errorKan1("%s\n","gbext : unknown tag.");
2514: }
2515: return(rob);
2516: }
2517:
2518: struct object KmpzExtension(struct object obj)
2519: {
2520: char *key;
2521: int size;
2522: struct object keyo;
2523: struct object rob = NullObject;
2524: struct object obj0,obj1,obj2,obj3;
2525: MP_INT *f;
2526: MP_INT *g;
2527: MP_INT *h;
2528: MP_INT *r0;
2529: MP_INT *r1;
2530: MP_INT *r2;
2531: int gi;
2532: extern struct ring *SmallRingp;
2533:
2534:
2535: if (obj.tag != Sarray) errorKan1("%s\n","KmpzExtension(): The argument must be an array.");
2536: size = getoaSize(obj);
2537: if (size < 1) errorKan1("%s\n","KmpzExtension(): Empty array.");
2538: keyo = getoa(obj,0);
2539: if (keyo.tag != Sdollar) errorKan1("%s\n","KmpzExtension(): No key word.");
2540: key = KopString(keyo);
2541:
2542: /* branch by the key word. */
2543: if (strcmp(key,"gcd")==0) {
2544: if (size != 3) errorKan1("%s\n","[(gcd) universalNumber universalNumber] mpzext.");
2545: obj1 = getoa(obj,1);
2546: obj2 = getoa(obj,2);
1.24 takayama 2547: if (obj1.tag != SuniversalNumber) {
2548: obj1 = KdataConversion(obj1,"universalNumber");
2549: }
2550: if (obj2.tag != SuniversalNumber) {
2551: obj2 = KdataConversion(obj2,"universalNumber");
2552: }
1.1 maekawa 2553: if (obj1.tag != SuniversalNumber || obj2.tag != SuniversalNumber)
2554: errorKan1("%s\n","[(gcd) universalNumber universalNumber] mpzext.");
2555: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
1.7 takayama 2556: ! is_this_coeff_MP_INT(obj2.lc.universalNumber)) {
1.1 maekawa 2557: errorKan1("%s\n","[(gcd) universalNumber universalNumber] mpzext.");
2558: }
2559: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2560: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2561: r1 = newMP_INT();
2562: mpz_gcd(r1,f,g);
2563: rob.tag = SuniversalNumber;
2564: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2565: }else if (strcmp(key,"tdiv_qr")==0) {
2566: if (size != 3) errorKan1("%s\n","[(tdiv_qr) universalNumber universalNumber] mpzext.");
2567: obj1 = getoa(obj,1);
2568: obj2 = getoa(obj,2);
1.24 takayama 2569: if (obj1.tag != SuniversalNumber) {
2570: obj1 = KdataConversion(obj1,"universalNumber");
2571: }
2572: if (obj2.tag != SuniversalNumber) {
2573: obj2 = KdataConversion(obj2,"universalNumber");
2574: }
1.1 maekawa 2575: if (obj1.tag != SuniversalNumber || obj2.tag != SuniversalNumber)
2576: errorKan1("%s\n","[(tdiv_qr) universalNumber universalNumber] mpzext.");
2577: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
1.7 takayama 2578: ! is_this_coeff_MP_INT(obj2.lc.universalNumber)) {
1.1 maekawa 2579: errorKan1("%s\n","[(tdiv_qr) universalNumber universalNumber] mpzext.");
2580: }
2581: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2582: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2583: r1 = newMP_INT();
2584: r2 = newMP_INT();
2585: mpz_tdiv_qr(r1,r2,f,g);
2586: obj1.tag = SuniversalNumber;
2587: obj1.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2588: obj2.tag = SuniversalNumber;
2589: obj2.lc.universalNumber = mpintToCoeff(r2,SmallRingp);
2590: rob = newObjectArray(2);
2591: putoa(rob,0,obj1); putoa(rob,1,obj2);
2592: } else if (strcmp(key,"cancel")==0) {
2593: if (size != 2) {
2594: errorKan1("%s\n","[(cancel) universalNumber/universalNumber] mpzext.");
2595: }
2596: obj0 = getoa(obj,1);
2597: if (obj0.tag == SuniversalNumber) return(obj0);
2598: if (obj0.tag != SrationalFunction) {
2599: errorKan1("%s\n","[(cancel) universalNumber/universalNumber] mpzext.");
2600: return(obj0);
2601: }
2602: obj1 = *(Knumerator(obj0));
2603: obj2 = *(Kdenominator(obj0));
2604: if (obj1.tag != SuniversalNumber || obj2.tag != SuniversalNumber) {
2605: errorKan1("%s\n","[(cancel) universalNumber/universalNumber] mpzext.");
2606: return(obj0);
2607: }
2608: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
1.7 takayama 2609: ! is_this_coeff_MP_INT(obj2.lc.universalNumber)) {
1.1 maekawa 2610: errorKan1("%s\n","[(cancel) universalNumber/universalNumber] mpzext.");
2611: }
2612: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2613: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2614:
2615: r0 = newMP_INT();
2616: r1 = newMP_INT();
2617: r2 = newMP_INT();
2618: mpz_gcd(r0,f,g);
2619: mpz_divexact(r1,f,r0);
2620: mpz_divexact(r2,g,r0);
2621: obj1.tag = SuniversalNumber;
2622: obj1.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2623: obj2.tag = SuniversalNumber;
2624: obj2.lc.universalNumber = mpintToCoeff(r2,SmallRingp);
2625:
2626: rob = KnewRationalFunction0(copyObjectp(&obj1),copyObjectp(&obj2));
2627: KisInvalidRational(&rob);
2628: }else if (strcmp(key,"sqrt")==0 ||
1.7 takayama 2629: strcmp(key,"com")==0) {
1.1 maekawa 2630: /* One arg functions */
2631: if (size != 2) errorKan1("%s\n","[key num] mpzext");
2632: obj1 = getoa(obj,1);
1.24 takayama 2633: if (obj1.tag != SuniversalNumber) {
2634: obj1 = KdataConversion(obj1,"universalNumber");
2635: }
1.1 maekawa 2636: if (obj1.tag != SuniversalNumber)
2637: errorKan1("%s\n","[key num] mpzext : num must be a universalNumber.");
2638: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber))
2639: errorKan1("%s\n","[key num] mpzext : num must be a universalNumber.");
2640: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2641: if (strcmp(key,"sqrt")==0) {
2642: r1 = newMP_INT();
2643: mpz_sqrt(r1,f);
2644: }else if (strcmp(key,"com")==0) {
2645: r1 = newMP_INT();
2646: mpz_com(r1,f);
2647: }
2648: rob.tag = SuniversalNumber;
2649: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2650: }else if (strcmp(key,"probab_prime_p")==0 ||
1.7 takayama 2651: strcmp(key,"and") == 0 ||
2652: strcmp(key,"ior")==0) {
1.1 maekawa 2653: /* Two args functions */
2654: if (size != 3) errorKan1("%s\n","[key num1 num2] mpzext.");
2655: obj1 = getoa(obj,1);
2656: obj2 = getoa(obj,2);
1.24 takayama 2657: if (obj1.tag != SuniversalNumber) {
2658: obj1 = KdataConversion(obj1,"universalNumber");
2659: }
2660: if (obj2.tag != SuniversalNumber) {
2661: obj2 = KdataConversion(obj2,"universalNumber");
2662: }
1.1 maekawa 2663: if (obj1.tag != SuniversalNumber || obj2.tag != SuniversalNumber)
2664: errorKan1("%s\n","[key num1 num2] mpzext.");
2665: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
1.7 takayama 2666: ! is_this_coeff_MP_INT(obj2.lc.universalNumber)) {
1.1 maekawa 2667: errorKan1("%s\n","[key num1 num2] mpzext.");
2668: }
2669: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2670: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2671: if (strcmp(key,"probab_prime_p")==0) {
2672: gi = (int) mpz_get_si(g);
2673: if (mpz_probab_prime_p(f,gi)) {
1.7 takayama 2674: rob = KpoInteger(1);
1.1 maekawa 2675: }else {
1.7 takayama 2676: rob = KpoInteger(0);
1.1 maekawa 2677: }
2678: }else if (strcmp(key,"and")==0) {
2679: r1 = newMP_INT();
2680: mpz_and(r1,f,g);
2681: rob.tag = SuniversalNumber;
2682: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2683: }else if (strcmp(key,"ior")==0) {
2684: r1 = newMP_INT();
2685: mpz_ior(r1,f,g);
2686: rob.tag = SuniversalNumber;
2687: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2688: }
2689:
2690: }else if (strcmp(key,"powm")==0) {
2691: /* three args */
2692: if (size != 4) errorKan1("%s\n","[key num1 num2 num3] mpzext");
2693: obj1 = getoa(obj,1); obj2 = getoa(obj,2); obj3 = getoa(obj,3);
1.24 takayama 2694: if (obj1.tag != SuniversalNumber) {
2695: obj1 = KdataConversion(obj1,"universalNumber");
2696: }
2697: if (obj2.tag != SuniversalNumber) {
2698: obj2 = KdataConversion(obj2,"universalNumber");
2699: }
2700: if (obj3.tag != SuniversalNumber) {
2701: obj3 = KdataConversion(obj3,"universalNumber");
2702: }
1.1 maekawa 2703: if (obj1.tag != SuniversalNumber ||
2704: obj2.tag != SuniversalNumber ||
2705: obj3.tag != SuniversalNumber ) {
2706: errorKan1("%s\n","[key num1 num2 num3] mpzext : num1, num2 and num3 must be universalNumbers.");
2707: }
2708: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
1.7 takayama 2709: ! is_this_coeff_MP_INT(obj2.lc.universalNumber) ||
2710: ! is_this_coeff_MP_INT(obj3.lc.universalNumber)) {
1.1 maekawa 2711: errorKan1("%s\n","[key num1 num2 num3] mpzext : num1, num2 and num3 must be universalNumbers.");
2712: }
2713: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2714: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2715: h = coeff_to_MP_INT(obj3.lc.universalNumber);
2716: if (mpz_sgn(g) < 0) errorKan1("%s\n","[(powm) base exp mod] mpzext : exp must not be negative.");
2717: r1 = newMP_INT();
2718: mpz_powm(r1,f,g,h);
2719: rob.tag = SuniversalNumber;
2720: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
1.24 takayama 2721: } else if (strcmp(key,"lcm")==0) {
2722: if (size != 3) errorKan1("%s\n","[(lcm) universalNumber universalNumber] mpzext.");
2723: obj1 = getoa(obj,1);
2724: obj2 = getoa(obj,2);
2725: if (obj1.tag != SuniversalNumber) {
2726: obj1 = KdataConversion(obj1,"universalNumber");
2727: }
2728: if (obj2.tag != SuniversalNumber) {
2729: obj2 = KdataConversion(obj2,"universalNumber");
2730: }
2731: if (obj1.tag != SuniversalNumber || obj2.tag != SuniversalNumber)
2732: errorKan1("%s\n","[lcm num1 num2] mpzext.");
2733: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
2734: ! is_this_coeff_MP_INT(obj2.lc.universalNumber)) {
2735: errorKan1("%s\n","[(lcm) universalNumber universalNumber] mpzext.");
2736: }
2737: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2738: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2739: r1 = newMP_INT();
2740: mpz_lcm(r1,f,g);
2741: rob.tag = SuniversalNumber;
2742: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
1.1 maekawa 2743: }else {
2744: errorKan1("%s\n","mpzExtension(): Unknown tag.");
2745: }
2746: return(rob);
2747: }
2748:
2749:
2750: /** : context */
2751: struct object KnewContext(struct object superObj,char *name) {
2752: struct context *cp;
2753: struct object ob;
2754: if (superObj.tag != Sclass) {
2755: errorKan1("%s\n","The argument of KnewContext must be a Class.Context");
2756: }
2757: if (superObj.lc.ival != CLASSNAME_CONTEXT) {
2758: errorKan1("%s\n","The argument of KnewContext must be a Class.Context");
2759: }
2760: cp = newContext0((struct context *)(superObj.rc.voidp),name);
2761: ob.tag = Sclass;
2762: ob.lc.ival = CLASSNAME_CONTEXT;
2763: ob.rc.voidp = cp;
2764: return(ob);
2765: }
2766:
2767: struct object KcreateClassIncetance(struct object ob1,
1.7 takayama 2768: struct object ob2,
2769: struct object ob3)
1.1 maekawa 2770: {
2771: /* [class-tag super-obj] size [class-tag] cclass */
2772: struct object ob4;
2773: int size,size2,i;
2774: struct object ob5;
2775: struct object rob;
2776:
2777: if (ob1.tag != Sarray)
2778: errorKan1("%s\n","cclass: The first argument must be an array.");
2779: if (getoaSize(ob1) < 1)
2780: errorKan1("%s\n","cclass: The first argument must be [class-tag ....].");
2781: ob4 = getoa(ob1,0);
2782: if (ectag(ob4) != CLASSNAME_CONTEXT)
2783: errorKan1("%s\n","cclass: The first argument must be [class-tag ....].");
2784:
2785: if (ob2.tag != Sinteger)
2786: errorKan1("%s\n","cclass: The second argument must be an integer.");
2787: size = KopInteger(ob2);
2788: if (size < 1)
2789: errorKan1("%s\n","cclass: The size must be > 0.");
2790:
2791: if (ob3.tag != Sarray)
2792: errorKan1("%s\n","cclass: The third argument must be an array.");
2793: if (getoaSize(ob3) < 1)
2794: errorKan1("%s\n","cclass: The third argument must be [class-tag].");
2795: ob5 = getoa(ob3,0);
2796: if (ectag(ob5) != CLASSNAME_CONTEXT)
2797: errorKan1("%s\n","cclass: The third argument must be [class-tag].");
1.7 takayama 2798:
1.1 maekawa 2799: rob = newObjectArray(size);
2800: putoa(rob,0,ob5);
2801: if (getoaSize(ob1) < size) size2 = getoaSize(ob1);
2802: else size2 = size;
2803: for (i=1; i<size2; i++) {
2804: putoa(rob,i,getoa(ob1,i));
2805: }
2806: for (i=size2; i<size; i++) {
2807: putoa(rob,i,NullObject);
2808: }
2809: return(rob);
2810: }
2811:
2812:
2813: struct object KpoDouble(double a) {
2814: struct object rob;
2815: rob.tag = Sdouble;
2816: /* rob.lc.dbl = (double *)sGC_malloc_atomic(sizeof(double)); */
2817: rob.lc.dbl = (double *)sGC_malloc(sizeof(double));
2818: if (rob.lc.dbl == (double *)NULL) {
2819: fprintf(stderr,"No memory.\n"); exit(10);
2820: }
2821: *(rob.lc.dbl) = a;
2822: return(rob);
2823: }
2824:
2825: double toDouble0(struct object ob) {
2826: double r;
2827: int r3;
2828: struct object ob2;
2829: struct object ob3;
2830: switch(ob.tag) {
2831: case Sinteger:
2832: return( (double) (KopInteger(ob)) );
2833: case SuniversalNumber:
2834: return((double) coeffToInt(ob.lc.universalNumber));
2835: case SrationalFunction:
2836: /* The argument is assumed to be a rational number. */
2837: ob2 = newObjectArray(2); ob3 = KpoString("cancel");
2838: putoa(ob2,0,ob3); putoa(ob2,1,ob);
2839: ob = KmpzExtension(ob2);
2840: ob2 = *Knumerator(ob); ob3 = *Kdenominator(ob);
2841: r3 = coeffToInt(ob3.lc.universalNumber);
2842: if (r3 == 0) {
2843: errorKan1("%s\n","toDouble0(): Division by zero.");
2844: break;
2845: }
2846: r = ((double) coeffToInt(ob2.lc.universalNumber)) / ((double)r3);
2847: return(r);
2848: case Sdouble:
2849: return( KopDouble(ob) );
2850: default:
2851: errorKan1("%s\n","toDouble0(): This type of conversion is not supported.");
2852: break;
2853: }
2854: return(0.0);
2855: }
2856:
2857: struct object KpoGradedPolySet(struct gradedPolySet *grD) {
2858: struct object rob;
2859: rob.tag = Sclass;
2860: rob.lc.ival = CLASSNAME_GradedPolySet;
2861: rob.rc.voidp = (void *) grD;
2862: return(rob);
2863: }
2864:
2865: static char *getspace0(int a) {
2866: char *s;
2867: a = (a > 0? a:-a);
2868: s = (char *) sGC_malloc(a+1);
2869: if (s == (char *)NULL) {
2870: errorKan1("%s\n","no more memory.");
2871: }
2872: return(s);
2873: }
2874: struct object KdefaultPolyRing(struct object ob) {
2875: struct object rob;
2876: int i,j,k,n;
2877: struct object ob1,ob2,ob3,ob4,ob5;
2878: struct object t1;
2879: char *s1;
2880: extern struct ring *CurrentRingp;
2881: static struct ring *a[N0];
2882:
2883: rob = NullObject;
2884: if (ob.tag != Sinteger) {
2885: errorKan1("%s\n","KdefaultPolyRing(): the argument must be integer.");
2886: }
2887: n = KopInteger(ob);
2888: if (n <= 0) {
2889: /* initializing */
2890: for (i=0; i<N0; i++) {
2891: a[i] = (struct ring*) NULL;
2892: }
2893: return(rob);
2894: }
2895:
2896: if ( a[n] != (struct ring*)NULL) return(KpoRingp(a[n]));
2897:
2898: /* Let's construct ring of polynomials of 2n variables */
2899: /* x variables */
2900: ob1 = newObjectArray(n);
2901: for (i=0; i<n; i++) {
2902: s1 = getspace0(1+ ((n-i)/10) + 1);
2903: sprintf(s1,"x%d",n-i);
2904: putoa(ob1,i,KpoString(s1));
2905: }
2906: ob2 = newObjectArray(n);
2907: s1 = getspace0(1);
2908: sprintf(s1,"h");
2909: putoa(ob2,0,KpoString(s1));
2910: for (i=1; i<n; i++) {
2911: s1 = getspace0(1+((n+n-i)/10)+1);
2912: sprintf(s1,"x%d",n+n-i);
2913: putoa(ob2,i,KpoString(s1));
2914: }
2915:
2916: ob3 = newObjectArray(9);
2917: putoa(ob3,0,KpoInteger(0));
2918: for (i=1; i<9; i++) {
2919: putoa(ob3,i,KpoInteger(n));
2920: }
2921:
2922: ob4 = newObjectArray(2*n);
2923: t1 = newObjectArray(2*n);
2924: for (i=0; i<2*n; i++) {
2925: putoa(t1,i,KpoInteger(1));
2926: }
2927: putoa(ob4,0,t1);
2928: for (i=1; i<2*n; i++) {
2929: t1 = newObjectArray(2*n);
2930: for (j=0; j<2*n; j++) {
2931: putoa(t1,j,KpoInteger(0));
2932: if (j == (2*n-i)) {
1.7 takayama 2933: putoa(t1,j,KpoInteger(-1));
1.1 maekawa 2934: }
2935: }
2936: putoa(ob4,i,t1);
2937: }
2938:
2939: ob5 = newObjectArray(2);
2940: putoa(ob5,0,KpoString("mpMult"));
2941: putoa(ob5,1,KpoString("poly"));
2942:
2943: KsetUpRing(ob1,ob2,ob3,ob4,ob5);
2944: a[n] = CurrentRingp;
2945: return(KpoRingp(a[n]));
2946: }
2947:
2948:
2949:
2950:
2951:
2952: /******************************************************************
2953: error handler
2954: ******************************************************************/
2955:
2956: errorKan1(str,message)
1.7 takayama 2957: char *str;
2958: char *message;
1.1 maekawa 2959: {
2960: extern char *GotoLabel;
2961: extern int GotoP;
2962: extern int ErrorMessageMode;
2963: char tmpc[1024];
1.10 takayama 2964: cancelAlarm();
1.1 maekawa 2965: if (ErrorMessageMode == 1 || ErrorMessageMode == 2) {
2966: sprintf(tmpc,"\nERROR(kanExport[0|1].c): ");
2967: if (strlen(message) < 900) {
2968: strcat(tmpc,message);
2969: }
2970: pushErrorStack(KnewErrorPacket(SerialCurrent,-1,tmpc));
2971: }
2972: if (ErrorMessageMode != 1) {
2973: fprintf(stderr,"\nERROR(kanExport[0|1].c): ");
2974: fprintf(stderr,str,message);
2975: }
2976: /* fprintf(stderr,"Hello "); */
2977: if (GotoP) {
2978: /* fprintf(stderr,"Hello. GOTO "); */
2979: fprintf(Fstack,"The interpreter was looking for the label <<%s>>. It is also aborted.\n",GotoLabel);
2980: GotoP = 0;
2981: }
2982: stdOperandStack(); contextControl(CCRESTORE);
2983: /* fprintf(stderr,"Now. Long jump!\n"); */
1.8 takayama 2984: #if defined(__CYGWIN__)
2985: siglongjmp(EnvOfStackMachine,1);
2986: #else
1.1 maekawa 2987: longjmp(EnvOfStackMachine,1);
1.8 takayama 2988: #endif
1.1 maekawa 2989: }
1.22 takayama 2990:
1.1 maekawa 2991:
2992: warningKan(str)
1.7 takayama 2993: char *str;
1.1 maekawa 2994: {
2995: extern int WarningMessageMode;
2996: extern int Strict;
2997: char tmpc[1024];
2998: if (WarningMessageMode == 1 || WarningMessageMode == 2) {
2999: sprintf(tmpc,"\nWARNING(kanExport[0|1].c): ");
3000: if (strlen(str) < 900) {
3001: strcat(tmpc,str);
3002: }
3003: pushErrorStack(KnewErrorPacket(SerialCurrent,-1,tmpc));
3004: }
3005: if (WarningMessageMode != 1) {
3006: fprintf(stderr,"\nWARNING(kanExport[0|1].c): ");
3007: fprintf(stderr,str);
3008: fprintf(stderr,"\n");
3009: }
3010: /* if (Strict) errorKan1("%s\n"," "); */
3011: if (Strict) errorKan1("%s\n",str);
1.4 takayama 3012: return(0);
3013: }
3014:
3015: warningKanNoStrictMode(str)
1.7 takayama 3016: char *str;
1.4 takayama 3017: {
3018: extern int Strict;
3019: int t;
3020: t = Strict;
3021: Strict = 0;
3022: warningKan(str);
3023: Strict = t;
1.1 maekawa 3024: return(0);
3025: }
3026:
3027:
3028:
3029:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>