Annotation of OpenXM/src/kan96xx/Kan/kanExport0.c, Revision 1.26
1.26 ! takayama 1: /* $OpenXM: OpenXM/src/kan96xx/Kan/kanExport0.c,v 1.25 2004/08/22 12:52:34 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.1 maekawa 1117: return(rob);
1118: }else if (strcmp(key,"integer")==0) {
1119: rob = KpoInteger(coeffToInt(obj.lc.universalNumber));
1120: return(rob);
1121: }else if (strcmp(key,"poly")==0) {
1122: rob = KpoPOLY(universalToPoly(obj.lc.universalNumber,CurrentRingp));
1123: return(rob);
1124: }else if (strcmp(key,"string")==0 || strcmp(key,"dollar")==0) {
1125: rob.tag = Sdollar;
1126: rob.lc.str = coeffToString(obj.lc.universalNumber);
1127: return(rob);
1128: }else if (strcmp(key,"null") == 0) {
1129: rob = NullObject;
1130: return(rob);
1131: }else if (strcmp(key,"double") == 0) {
1132: rob = KpoDouble( toDouble0(obj) );
1133: return(rob);
1.25 takayama 1134: }else if (strcmp(key,"denominator") == 0) {
1135: rob = KintToUniversalNumber(1);
1136: return(rob);
1.1 maekawa 1137: }else{
1138: warningKan("Sorry. This type of data conversion of universalNumber has not supported yet.\n");
1139: }
1140: break;
1141: case SrationalFunction:
1142: if (strcmp(key,"rationalFunction")==0) {
1143: return(rob);
1144: } if (strcmp(key,"numerator")==0) {
1145: rob = *(Knumerator(obj));
1146: return(rob);
1147: }else if (strcmp(key,"denominator")==0) {
1148: rob = *(Kdenominator(obj));
1149: return(rob);
1150: }else if (strcmp(key,"string")==0 || strcmp(key,"dollar")==0) {
1151: rob1 = KdataConversion(*(Knumerator(obj)),"string");
1152: rob2 = KdataConversion(*(Kdenominator(obj)),"string");
1153: s = sGC_malloc(sizeof(char)*( strlen(rob1.lc.str) + strlen(rob2.lc.str) + 10));
1154: if (s == (char *)NULL) errorKan1("%s\n","KdataConversion(): No memory");
1155: sprintf(s,"(%s)/(%s)",rob1.lc.str,rob2.lc.str);
1156: rob.tag = Sdollar;
1157: rob.lc.str = s;
1158: return(rob);
1159: }else if (strcmp(key,"cancel")==0) {
1160: warningKan("Sorry. Data conversion <<cancel>> of rationalFunction has not supported yet.\n");
1161: return(obj);
1162: }else if (strcmp(key,"null") == 0) {
1163: rob = NullObject;
1164: return(rob);
1165: }else if (strcmp(key,"double") == 0) {
1166: rob = KpoDouble( toDouble0(obj) );
1167: return(rob);
1168: }else{
1169: warningKan("Sorry. This type of data conversion of rationalFunction has not supported yet.\n");
1170: }
1171: break;
1172: case Sdouble:
1173: if (strcmp(key,"integer") == 0) {
1174: rob = KpoInteger( (int) KopDouble(obj));
1175: return(rob);
1176: } else if (strcmp(key,"universalNumber") == 0) {
1177: rob.tag = SuniversalNumber;
1178: rob.lc.universalNumber = intToCoeff((int) KopDouble(obj),&SmallRing);
1179: return(rob);
1180: }else if ((strcmp(key,"string") == 0) || (strcmp(key,"dollar") == 0)) {
1181: sprintf(tmps,"%f",KopDouble(obj));
1182: s = sGC_malloc(strlen(tmps)+2);
1183: if (s == (char *)NULL) errorKan1("%s\n","KdataConversion(): No memory");
1184: strcpy(s,tmps);
1185: rob.tag = Sdollar;
1186: rob.lc.str = s;
1187: return(rob);
1188: }else if (strcmp(key,"double")==0) {
1189: return(obj);
1190: }else if (strcmp(key,"null") == 0) {
1191: rob = NullObject;
1192: return(rob);
1193: }else {
1194: warningKan("Sorry. This type of data conversion of rationalFunction has not supported yet.\n");
1195: }
1196: break;
1197: case Sring:
1198: if (strcmp(key,"orderMatrix")==0) {
1199: rob = oGetOrderMatrix(KopRingp(obj));
1200: return(rob);
1.22 takayama 1201: }else if (strcmp(key,"oxRingStructure")==0) {
1202: rob = oRingToOXringStructure(KopRingp(obj));
1203: return(rob);
1.1 maekawa 1204: }else{
1205: warningKan("Sorryl This type of data conversion of ringp has not supported yet.\n");
1206: }
1207: break;
1208: default:
1209: warningKan("Sorry. This type of data conversion has not supported yet.\n");
1210: }
1211: return(NullObject);
1212: }
1213:
1214: /* conversion functions between primitive data and objects.
1215: If it's not time critical, it is recommended to use these functions */
1216: struct object KpoInteger(k)
1.7 takayama 1217: int k;
1.1 maekawa 1218: {
1219: struct object obj;
1220: obj.tag = Sinteger;
1221: obj.lc.ival = k; obj.rc.ival = 0;
1222: return(obj);
1223: }
1224: struct object KpoString(s)
1.7 takayama 1225: char *s;
1.1 maekawa 1226: {
1227: struct object obj;
1228: obj.tag = Sdollar;
1229: obj.lc.str = s; obj.rc.ival = 0;
1230: return(obj);
1231: }
1232: struct object KpoPOLY(f)
1.7 takayama 1233: POLY f;
1.1 maekawa 1234: {
1235: struct object obj;
1236: obj.tag = Spoly;
1237: obj.lc.poly = f; obj.rc.ival = 0;
1238: return(obj);
1239: }
1240: struct object KpoArrayOfPOLY(ap)
1.7 takayama 1241: struct arrayOfPOLY *ap ;
1.1 maekawa 1242: {
1243: struct object obj;
1244: obj.tag = SarrayOfPOLY;
1245: obj.lc.arrayp = ap; obj.rc.ival = 0;
1246: return(obj);
1247: }
1248:
1249: struct object KpoMatrixOfPOLY(mp)
1.7 takayama 1250: struct matrixOfPOLY *mp ;
1.1 maekawa 1251: {
1252: struct object obj;
1253: obj.tag = SmatrixOfPOLY;
1254: obj.lc.matrixp = mp; obj.rc.ival = 0;
1255: return(obj);
1256: }
1257:
1258: struct object KpoRingp(ringp)
1.7 takayama 1259: struct ring *ringp;
1.1 maekawa 1260: {
1261: struct object obj;
1262: obj.tag = Sring;
1263: obj.lc.ringp = ringp;
1264: return(obj);
1265: }
1266:
1.22 takayama 1267: struct object KpoUniversalNumber(u)
1268: struct coeff *u;
1269: {
1270: struct object obj;
1271: obj.tag = SuniversalNumber;
1272: obj.lc.universalNumber = u;
1273: return(obj);
1274: }
1.25 takayama 1275: struct object KintToUniversalNumber(n)
1276: int n;
1277: {
1278: struct object rob;
1279: extern struct ring SmallRing;
1280: rob.tag = SuniversalNumber;
1281: rob.lc.universalNumber = intToCoeff(n,&SmallRing);
1282: return(rob);
1283: }
1284:
1.1 maekawa 1285: /*** conversion 2. Data conversions on arrays and matrices. ****/
1286: struct object arrayOfPOLYToArray(aa)
1.7 takayama 1287: struct arrayOfPOLY *aa;
1.1 maekawa 1288: {
1289: POLY *a;
1290: int size;
1291: struct object r;
1292: int j;
1293: struct object tmp;
1294:
1295: size = aa->n; a = aa->array;
1296: r = newObjectArray(size);
1297: for (j=0; j<size; j++) {
1298: tmp.tag = Spoly;
1299: tmp.lc.poly= a[j];
1300: putoa(r,j,tmp);
1301: }
1302: return( r );
1303: }
1304:
1305: struct object matrixOfPOLYToArray(pmat)
1.7 takayama 1306: struct matrixOfPOLY *pmat;
1.1 maekawa 1307: {
1308: struct object r;
1309: struct object tmp;
1310: int i,j;
1311: int m,n;
1312: POLY *mat;
1313: struct arrayOfPOLY ap;
1314:
1315: m = pmat->m; n = pmat->n; mat = pmat->mat;
1316: r = newObjectArray(m);
1317: for (i=0; i<m; i++) {
1318: ap.n = n; ap.array = &(mat[ind(i,0)]);
1319: tmp = arrayOfPOLYToArray(&ap);
1320: /* ind() is the macro defined in matrix.h. */
1321: putoa(r,i,tmp);
1322: }
1323: return(r);
1324: }
1325:
1326: struct arrayOfPOLY *arrayToArrayOfPOLY(oa)
1.7 takayama 1327: struct object oa;
1.1 maekawa 1328: {
1329: POLY *a;
1330: int size;
1331: int i;
1332: struct object tmp;
1333: struct arrayOfPOLY *ap;
1334:
1335: if (oa.tag != Sarray) errorKan1("KarrayToArrayOfPOLY(): %s",
1.7 takayama 1336: "Argument is not array\n");
1.1 maekawa 1337: size = getoaSize(oa);
1338: a = (POLY *)sGC_malloc(sizeof(POLY)*size);
1339: for (i=0; i<size; i++) {
1340: tmp = getoa(oa,i);
1341: if (tmp.tag != Spoly) errorKan1("KarrayToArrayOfPOLY():%s ",
1.7 takayama 1342: "element must be polynomial.\n");
1.1 maekawa 1343: a[i] = tmp.lc.poly;
1344: }
1345: ap = (struct arrayOfPOLY *)sGC_malloc(sizeof(struct arrayOfPOLY));
1346: ap->n = size;
1347: ap->array = a;
1348: return(ap);
1349: }
1350:
1351: struct matrixOfPOLY *arrayToMatrixOfPOLY(oa)
1.7 takayama 1352: struct object oa;
1.1 maekawa 1353: {
1354: POLY *a;
1355: int m;
1356: int n;
1357: int i,j;
1358: struct matrixOfPOLY *ma;
1359:
1360: struct object tmp,tmp2;
1361: if (oa.tag != Sarray) errorKan1("KarrayToMatrixOfPOLY(): %s",
1.7 takayama 1362: "Argument is not array\n");
1.1 maekawa 1363: m = getoaSize(oa);
1364: tmp = getoa(oa,0);
1365: if (tmp.tag != Sarray) errorKan1("arrayToMatrixOfPOLY():%s ",
1.7 takayama 1366: "Argument is not array\n");
1.1 maekawa 1367: n = getoaSize(tmp);
1368: a = (POLY *)sGC_malloc(sizeof(POLY)*(m*n));
1369: for (i=0; i<m; i++) {
1370: tmp = getoa(oa,i);
1371: if (tmp.tag != Sarray) errorKan1("arrayToMatrixOfPOLY(): %s",
1.7 takayama 1372: "element must be array.\n");
1.1 maekawa 1373: for (j=0; j<n; j++) {
1374: tmp2 = getoa(tmp,j);
1375: if (tmp2.tag != Spoly) errorKan1("arrayToMatrixOfPOLY(): %s",
1.7 takayama 1376: "element must be a polynomial.\n");
1.1 maekawa 1377: a[ind(i,j)] = tmp2.lc.poly;
1378: /* we use the macro ind here. Be careful of using m and n. */
1379: }
1380: }
1381: ma = (struct matrixOfPOLY *)sGC_malloc(sizeof(struct matrixOfPOLY));
1382: ma->m = m; ma->n = n;
1383: ma->mat = a;
1384: return(ma);
1385: }
1386:
1387: /* :misc */
1388:
1389: /* :ring :kan */
1390: int objArrayToOrderMatrix(oA,order,n,oasize)
1.7 takayama 1391: struct object oA;
1392: int order[];
1393: int n;
1394: int oasize;
1.1 maekawa 1395: {
1396: int size;
1397: int k,j;
1398: struct object tmpOa;
1399: struct object obj;
1400: if (oA.tag != Sarray) {
1401: warningKan("The argument should be of the form [ [...] [...] ... [...]].");
1402: return(-1);
1403: }
1404: size = getoaSize(oA);
1405: if (size != oasize) {
1406: warningKan("The row size of the array is wrong.");
1407: return(-1);
1408: }
1409: for (k=0; k<size; k++) {
1410: tmpOa = getoa(oA,k);
1411: if (tmpOa.tag != Sarray) {
1412: warningKan("The argument should be of the form [ [...] [...] ... [...]].");
1413: return(-1);
1414: }
1415: if (getoaSize(tmpOa) != 2*n) {
1416: warningKan("The column size of the array is wrong.");
1417: return(-1);
1418: }
1419: for (j=0; j<2*n; j++) {
1420: obj = getoa(tmpOa,j);
1421: order[k*2*n+j] = obj.lc.ival;
1422: }
1423: }
1424: return(0);
1425: }
1426:
1427: int KsetOrderByObjArray(oA)
1.7 takayama 1428: struct object oA;
1.1 maekawa 1429: {
1430: int *order;
1431: int n,c,l, oasize;
1432: extern struct ring *CurrentRingp;
1433: extern int AvoidTheSameRing;
1434: /* n,c,l must be set in the CurrentRing */
1435: if (AvoidTheSameRing) {
1436: errorKan1("%s\n","KsetOrderByObjArray(): You cannot change the order matrix when AvoidTheSameRing == 1.");
1437: }
1438: n = CurrentRingp->n;
1439: c = CurrentRingp->c;
1440: l = CurrentRingp->l;
1441: if (oA.tag != Sarray) {
1442: warningKan("The argument should be of the form [ [...] [...] ... [...]].");
1443: return(-1);
1444: }
1445: oasize = getoaSize(oA);
1446: order = (int *)sGC_malloc(sizeof(int)*((2*n)*oasize+1));
1447: if (order == (int *)NULL) errorKan1("%s\n","KsetOrderByObjArray(): No memory.");
1448: if (objArrayToOrderMatrix(oA,order,n,oasize) == -1) {
1449: return(-1);
1450: }
1451: setOrderByMatrix(order,n,c,l,oasize); /* Set order to the current ring. */
1452: return(0);
1453: }
1454:
1455: static int checkRelations(c,l,m,n,cc,ll,mm,nn)
1.7 takayama 1456: int c,l,m,n,cc,ll,mm,nn;
1.1 maekawa 1457: {
1458: if (!(1<=c && c<=l && l<=m && m<=n)) return(1);
1459: if (!(cc<=ll && ll<=mm && mm<=nn && nn <= n)) return(1);
1460: if (!(cc<c || ll < l || mm < m || nn < n)) {
1461: if (WarningNoVectorVariable) {
1.4 takayama 1462: warningKanNoStrictMode("Ring definition: there is no variable to represent vectors.\n");
1.1 maekawa 1463: }
1464: }
1465: if (!(cc<=c && ll <= l && mm <= m && nn <= n)) return(1);
1466: return(0);
1467: }
1468:
1469: struct object KgetOrderMatrixOfCurrentRing()
1470: {
1471: extern struct ring *CurrentRingp;
1472: return(oGetOrderMatrix(CurrentRingp));
1473: }
1474:
1475:
1476: int KsetUpRing(ob1,ob2,ob3,ob4,ob5)
1.7 takayama 1477: struct object ob1,ob2,ob3,ob4,ob5;
1478: /* ob1 = [x(0), ..., x(n-1)];
1479: ob2 = [D(0), ..., D(n-1)];
1480: ob3 = [p,c,l,m,n,cc,ll,mm,nn,next];
1481: ob4 = Order matrix
1482: ob5 = [(keyword) value (keyword) value ....]
1483: */
1.1 maekawa 1484: #define RP_LIMIT 500
1485: {
1486: int i;
1487: struct object ob;
1488: int c,l,m,n;
1489: int cc,ll,mm,nn;
1490: int p;
1491: char **xvars;
1492: char **dvars;
1493: int *outputVars;
1494: int *order;
1495: static int rp = 0;
1496: static struct ring *rstack[RP_LIMIT];
1497:
1498: extern struct ring *CurrentRingp;
1499: struct ring *newRingp;
1500: int ob3Size;
1501: struct ring *nextRing;
1502: int oasize;
1503: static int ringSerial = 0;
1504: char *ringName = NULL;
1505: int aa;
1506: extern int AvoidTheSameRing;
1507: extern char *F_mpMult;
1508: char *fmp_mult_saved;
1509: char *mpMultName = NULL;
1510: struct object rob;
1511: struct ring *savedCurrentRingp;
1512:
1513: /* To get the ring structure. */
1514: if (ob1.tag == Snull) {
1515: rob = newObjectArray(rp);
1516: for (i=0; i<rp; i++) {
1517: putoa(rob,i,KpoRingp(rstack[i]));
1518: }
1519: KSpush(rob);
1520: return(0);
1521: }
1522:
1523: if (ob3.tag != Sarray) errorKan1("%s\n","Error in the 3rd argument. You need to give 4 arguments.");
1524: ob3Size = getoaSize(ob3);
1525: if (ob3Size != 9 && ob3Size != 10)
1526: errorKan1("%s\n","Error in the 3rd argument.");
1527: for (i=0; i<9; i++) {
1528: ob = getoa(ob3,i);
1529: if (ob.tag != Sinteger) errorKan1("%s\n","The 3rd argument should be a list of integers.");
1530: }
1531: if (ob3Size == 10) {
1532: ob = getoa(ob3,9);
1533: if (ob.tag != Sring)
1534: errorKan1("%s\n","The last arguments of the 3rd argument must be a pointer to a ring.");
1535: nextRing = KopRingp(ob);
1536: } else {
1537: nextRing = (struct ring *)NULL;
1538: }
1539:
1540: p = getoa(ob3,0).lc.ival;
1541: c = getoa(ob3,1).lc.ival; l = getoa(ob3,2).lc.ival;
1542: m = getoa(ob3,3).lc.ival; n = getoa(ob3,4).lc.ival;
1543: cc = getoa(ob3,5).lc.ival; ll = getoa(ob3,6).lc.ival;
1544: mm = getoa(ob3,7).lc.ival; nn = getoa(ob3,8).lc.ival;
1545: if (checkRelations(c,l,m,n,cc,ll,mm,nn,n)) {
1546: 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.");
1547: }
1548: if (getoaSize(ob2) != n || getoaSize(ob1) != n) {
1549: errorKan1("%s\n","Error in the 1st or 2nd arguments.");
1550: }
1551: for (i=0; i<n; i++) {
1552: if (getoa(ob1,i).tag != Sdollar || getoa(ob2,i).tag != Sdollar) {
1553: errorKan1("%s\n","Error in the 1st or 2nd arguments.");
1554: }
1555: }
1556: xvars = (char **) sGC_malloc(sizeof(char *)*n);
1557: dvars = (char **) sGC_malloc(sizeof(char *)*n);
1558: if (xvars == (char **)NULL || dvars == (char **)NULL) {
1559: fprintf(stderr,"No more memory.\n");
1560: exit(15);
1561: }
1562: for (i=0; i<n; i++) {
1563: xvars[i] = getoa(ob1,i).lc.str;
1564: dvars[i] = getoa(ob2,i).lc.str;
1565: }
1566: checkDuplicateName(xvars,dvars,n);
1567:
1568: outputVars = (int *)sGC_malloc(sizeof(int)*n*2);
1569: if (outputVars == NULL) {
1570: fprintf(stderr,"No more memory.\n");
1571: exit(15);
1572: }
1573: if (ReverseOutputOrder) {
1574: for (i=0; i<n; i++) outputVars[i] = n-i-1;
1575: for (i=0; i<n; i++) outputVars[n+i] = 2*n-i-1;
1576: }else{
1577: for (i=0; i<2*n; i++) {
1578: outputVars[i] = i;
1579: }
1580: }
1581:
1582: oasize = getoaSize(ob4);
1583: order = (int *)sGC_malloc(sizeof(int)*((2*n)*oasize+1));
1584: if (order == (int *)NULL) errorKan1("%s\n","No memory.");
1585: if (objArrayToOrderMatrix(ob4,order,n,oasize) == -1) {
1586: errorKan1("%s\n","Errors in the 4th matrix (order matrix).");
1587: }
1588: /* It's better to check the consistency of the order matrix here. */
1589: savedCurrentRingp = CurrentRingp;
1590:
1591: newRingp = (struct ring *)sGC_malloc(sizeof(struct ring));
1592: if (newRingp == NULL) errorKan1("%s\n","No more memory.");
1593: /* Generate the new ring before calling setOrder...(). */
1594: *newRingp = *CurrentRingp;
1595: CurrentRingp = newRingp; /* Push the current ring. */
1596: setOrderByMatrix(order,n,c,l,oasize); /* set order to the CurrentRing. */
1597: CurrentRingp = savedCurrentRingp; /* recover it. */
1598:
1599:
1600: /* Set the default name of the ring */
1601: ringName = (char *)sGC_malloc(16);
1602: sprintf(ringName,"ring%05d",ringSerial);
1603: ringSerial++;
1604:
1605: /* Set the current ring */
1606: newRingp->n = n; newRingp->m = m; newRingp->l = l; newRingp->c = c;
1607: newRingp->nn = nn; newRingp->mm = mm; newRingp->ll = ll;
1608: newRingp->cc = cc;
1609: newRingp->x = xvars;
1610: newRingp->D = dvars;
1611: /* You don't need to set order and orderMatrixSize here.
1612: It was set by setOrder(). */
1613: setFromTo(newRingp);
1614:
1615: newRingp->p = p;
1616: newRingp->next = nextRing;
1617: newRingp->multiplication = mpMult;
1618: /* These values should will be reset if the optional value is given. */
1619: newRingp->schreyer = 0;
1620: newRingp->gbListTower = NULL;
1621: newRingp->outputOrder = outputVars;
1.9 takayama 1622: newRingp->weightedHomogenization = 0;
1.11 takayama 1623: newRingp->degreeShiftSize = 0;
1.12 takayama 1624: newRingp->degreeShiftN = 0;
1625: newRingp->degreeShift = NULL;
1.1 maekawa 1626:
1627: if (ob5.tag != Sarray || (getoaSize(ob5) % 2) != 0) {
1628: errorKan1("%s\n","[(keyword) value (keyword) value ....] should be given.");
1629: }
1630: for (i=0; i < getoaSize(ob5); i += 2) {
1631: if (getoa(ob5,i).tag == Sdollar) {
1632: if (strcmp(KopString(getoa(ob5,i)),"mpMult") == 0) {
1.7 takayama 1633: if (getoa(ob5,i+1).tag != Sdollar) {
1634: errorKan1("%s\n","A keyword should be given. (mpMult)");
1635: }
1636: fmp_mult_saved = F_mpMult;
1637: mpMultName = KopString(getoa(ob5,i+1));
1638: switch_function("mpMult",mpMultName);
1639: /* Note that this cause a global effect. It will be done again. */
1640: newRingp->multiplication = mpMult;
1641: switch_function("mpMult",fmp_mult_saved);
1.1 maekawa 1642: } else if (strcmp(KopString(getoa(ob5,i)),"coefficient ring") == 0) {
1.7 takayama 1643: if (getoa(ob5,i+1).tag != Sring) {
1644: errorKan1("%s\n","The pointer to a ring should be given. (coefficient ring)");
1645: }
1646: nextRing = KopRingp(getoa(ob5,i+1));
1647: newRingp->next = nextRing;
1.1 maekawa 1648: } else if (strcmp(KopString(getoa(ob5,i)),"valuation") == 0) {
1.7 takayama 1649: errorKan1("%s\n","Not implemented. (valuation)");
1.1 maekawa 1650: } else if (strcmp(KopString(getoa(ob5,i)),"characteristic") == 0) {
1.7 takayama 1651: if (getoa(ob5,i+1).tag != Sinteger) {
1652: errorKan1("%s\n","A integer should be given. (characteristic)");
1653: }
1654: p = KopInteger(getoa(ob5,i+1));
1655: newRingp->p = p;
1.1 maekawa 1656: } else if (strcmp(KopString(getoa(ob5,i)),"schreyer") == 0) {
1.7 takayama 1657: if (getoa(ob5,i+1).tag != Sinteger) {
1658: errorKan1("%s\n","A integer should be given. (schreyer)");
1659: }
1660: newRingp->schreyer = KopInteger(getoa(ob5,i+1));
1.1 maekawa 1661: } else if (strcmp(KopString(getoa(ob5,i)),"gbListTower") == 0) {
1.7 takayama 1662: if (getoa(ob5,i+1).tag != Slist) {
1663: errorKan1("%s\n","A list should be given (gbListTower).");
1664: }
1665: newRingp->gbListTower = newObject();
1666: *((struct object *)(newRingp->gbListTower)) = getoa(ob5,i+1);
1.1 maekawa 1667: } else if (strcmp(KopString(getoa(ob5,i)),"ringName") == 0) {
1.7 takayama 1668: if (getoa(ob5,i+1).tag != Sdollar) {
1669: errorKan1("%s\n","A name should be given. (ringName)");
1670: }
1671: ringName = KopString(getoa(ob5,i+1));
1.9 takayama 1672: } else if (strcmp(KopString(getoa(ob5,i)),"weightedHomogenization") == 0) {
1673: if (getoa(ob5,i+1).tag != Sinteger) {
1674: errorKan1("%s\n","A integer should be given. (weightedHomogenization)");
1675: }
1.11 takayama 1676: newRingp->weightedHomogenization = KopInteger(getoa(ob5,i+1));
1677: } else if (strcmp(KopString(getoa(ob5,i)),"degreeShift") == 0) {
1678: if (getoa(ob5,i+1).tag != Sarray) {
1.12 takayama 1679: errorKan1("%s\n","An array of array should be given. (degreeShift)");
1.11 takayama 1680: }
1681: {
1682: struct object ods;
1.12 takayama 1683: struct object ods2;
1684: int dssize,k,j,nn;
1.11 takayama 1685: ods=getoa(ob5,i+1);
1.12 takayama 1686: if ((getoaSize(ods) < 1) || (getoa(ods,0).tag != Sarray)) {
1687: errorKan1("%s\n", "An array of array should be given. (degreeShift)");
1688: }
1689: nn = getoaSize(ods);
1690: dssize = getoaSize(getoa(ods,0));
1.11 takayama 1691: newRingp->degreeShiftSize = dssize;
1.12 takayama 1692: newRingp->degreeShiftN = nn;
1693: newRingp->degreeShift = (int *) sGC_malloc(sizeof(int)*(dssize*nn+1));
1.11 takayama 1694: if (newRingp->degreeShift == NULL) errorKan1("%s\n","No more memory.");
1.12 takayama 1695: for (j=0; j<nn; j++) {
1696: ods2 = getoa(ods,j);
1697: for (k=0; k<dssize; k++) {
1698: if (getoa(ods2,k).tag == SuniversalNumber) {
1699: (newRingp->degreeShift)[j*dssize+k] = coeffToInt(getoa(ods2,k).lc.universalNumber);
1700: }else{
1701: (newRingp->degreeShift)[j*dssize+k] = KopInteger(getoa(ods2,k));
1702: }
1.11 takayama 1703: }
1704: }
1705: }
1.22 takayama 1706: switch_function("grade","module1v");
1707: /* Warning: grading is changed to module1v!! */
1.1 maekawa 1708: } else {
1.7 takayama 1709: errorKan1("%s\n","Unknown keyword to set_up_ring@");
1.1 maekawa 1710: }
1711: }else{
1712: errorKan1("%s\n","A keyword enclosed by braces have to be given.");
1713: }
1714: }
1715:
1716: newRingp->name = ringName;
1717:
1718:
1719: if (AvoidTheSameRing) {
1720: aa = isTheSameRing(rstack,rp,newRingp);
1721: if (aa < 0) {
1722: /* This ring has never been defined. */
1723: CurrentRingp = newRingp;
1724: /* Install it to the RingStack */
1725: if (rp <RP_LIMIT) {
1.7 takayama 1726: rstack[rp] = CurrentRingp; rp++; /* Save the previous ringp */
1.1 maekawa 1727: }else{
1.7 takayama 1728: rp = 0;
1729: errorKan1("%s\n","You have defined too many rings. Check the value of RP_LIMIT.");
1.1 maekawa 1730: }
1731: }else{
1732: /* This ring has been defined. */
1733: /* Discard the newRingp */
1734: CurrentRingp = rstack[aa];
1735: ringSerial--;
1736: }
1737: }else{
1738: CurrentRingp = newRingp;
1739: /* Install it to the RingStack */
1740: if (rp <RP_LIMIT) {
1741: rstack[rp] = CurrentRingp; rp++; /* Save the previous ringp */
1742: }else{
1743: rp = 0;
1744: errorKan1("%s\n","You have defined too many rings. Check the value of RP_LIMIT.");
1745: }
1746: }
1747: if (mpMultName != NULL) {
1748: switch_function("mpMult",mpMultName);
1749: }
1750:
1751: initSyzRingp();
1752:
1753: return(0);
1754: }
1755:
1756:
1757: struct object KsetVariableNames(struct object ob,struct ring *rp)
1758: {
1759: int n,i;
1760: struct object ox;
1761: struct object otmp;
1762: char **xvars;
1763: char **dvars;
1764: if (ob.tag != Sarray) {
1765: errorKan1("%s\n","KsetVariableNames(): the argument must be of the form [(x) (y) (z) ...]");
1766: }
1767: n = rp->n;
1768: ox = ob;
1769: if (getoaSize(ox) != 2*n) {
1770: 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.");
1771: }
1772: xvars = (char **)sGC_malloc(sizeof(char *)*n);
1773: dvars = (char **)sGC_malloc(sizeof(char *)*n);
1774: if (xvars == NULL || dvars == NULL) {
1775: errorKan1("%s\n","KsetVariableNames(): no more memory.");
1776: }
1777: for (i=0; i<2*n; i++) {
1778: otmp = getoa(ox,i);
1779: if(otmp.tag != Sdollar) {
1780: errorKan1("%s\n","KsetVariableNames(): elements must be strings.");
1781: }
1782: if (i < n) {
1783: xvars[i] = KopString(otmp);
1784: }else{
1785: dvars[i-n] = KopString(otmp);
1786: }
1787: }
1788: checkDuplicateName(xvars,dvars,n);
1789: rp->x = xvars;
1790: rp->D = dvars;
1791: return(ob);
1792: }
1793:
1794:
1795:
1796: void KshowRing(ringp)
1.7 takayama 1797: struct ring *ringp;
1.1 maekawa 1798: {
1799: showRing(1,ringp);
1800: }
1801:
1802: struct object KswitchFunction(ob1,ob2)
1.7 takayama 1803: struct object ob1,ob2;
1.1 maekawa 1804: {
1805: char *ans ;
1806: struct object rob;
1807: int needWarningForAvoidTheSameRing = 0;
1808: extern int AvoidTheSameRing;
1809: if ((ob1.tag != Sdollar) || (ob2.tag != Sdollar)) {
1810: errorKan1("%s\n","$function$ $name$ switch_function\n");
1811: }
1812: if (AvoidTheSameRing && needWarningForAvoidTheSameRing) {
1813: if (strcmp(KopString(ob1),"mmLarger") == 0 ||
1814: strcmp(KopString(ob1),"mpMult") == 0 ||
1815: strcmp(KopString(ob1),"monomialAdd") == 0 ||
1816: strcmp(KopString(ob1),"isSameComponent") == 0) {
1817: fprintf(stderr,",switch_function ==> %s ",KopString(ob1));
1818: warningKan("switch_function might cause a trouble under AvoidTheSameRing == 1.\n");
1819: }
1820: }
1821: if (AvoidTheSameRing) {
1822: if (strcmp(KopString(ob1),"mmLarger") == 0 &&
1.7 takayama 1823: strcmp(KopString(ob2),"matrix") != 0) {
1.1 maekawa 1824: fprintf(stderr,"mmLarger = %s",KopString(ob2));
1825: errorKan1("%s\n","mmLarger can set only to matrix under AvoidTheSameRing == 1.");
1826: }
1827: }
1828:
1829: ans = switch_function(ob1.lc.str,ob2.lc.str);
1830: if (ans == NULL) {
1831: rob = NullObject;
1832: }else{
1833: rob = KpoString(ans);
1834: }
1835: return(rob);
1836:
1837: }
1838:
1839: void KprintSwitchStatus(void)
1840: {
1841: print_switch_status();
1842: }
1843:
1844: struct object KoReplace(of,rule)
1.7 takayama 1845: struct object of;
1846: struct object rule;
1.1 maekawa 1847: {
1848: struct object rob;
1849: POLY f;
1850: POLY lRule[N0*2];
1851: POLY rRule[N0*2];
1852: POLY r;
1853: int i;
1854: int n;
1855: struct object trule;
1856:
1857:
1858: if (rule.tag != Sarray) {
1859: errorKan1("%s\n"," KoReplace(): The second argument must be array.");
1860: }
1861: n = getoaSize(rule);
1862:
1.6 takayama 1863: if (of.tag == Spoly) {
1864: }else if (of.tag ==Sclass && ectag(of) == CLASSNAME_recursivePolynomial) {
1.7 takayama 1865: return(KreplaceRecursivePolynomial(of,rule));
1.6 takayama 1866: }else{
1.1 maekawa 1867: errorKan1("%s\n"," KoReplace(): The first argument must be a polynomial.");
1868: }
1869: f = KopPOLY(of);
1870:
1871: if (f ISZERO) {
1872: }else{
1873: if (n >= 2*(f->m->ringp->n)) {
1874: errorKan1("%s\n"," KoReplace(): too many rules for replacement. ");
1875: }
1876: }
1877:
1878: for (i=0; i<n; i++) {
1879: trule = getoa(rule,i);
1880: if (trule.tag != Sarray) {
1881: errorKan1("%s\n"," KoReplace(): The second argument must be of the form [[a b] [c d] ....].");
1882: }
1883: if (getoaSize(trule) != 2) {
1884: errorKan1("%s\n"," KoReplace(): The second argument must be of the form [[a b] [c d] ....].");
1885: }
1886:
1887: if (getoa(trule,0).tag != Spoly) {
1888: errorKan1("%s\n"," KoReplace(): The second argument must be of the form [[a b] [c d] ....] where a,b,c,d,... are polynomials.");
1889: }
1890: if (getoa(trule,1).tag != Spoly) {
1891: errorKan1("%s\n"," KoReplace(): The second argument must be of the form [[a b] [c d] ....] where a,b,c,d,... are polynomials.");
1892: }
1893:
1894: lRule[i] = KopPOLY(getoa(trule,0));
1895: rRule[i] = KopPOLY(getoa(trule,1));
1896: }
1897:
1898: r = replace(f,lRule,rRule,n);
1899: rob.tag = Spoly; rob.lc.poly = r;
1900:
1901: return(rob);
1902: }
1903:
1904:
1905: struct object Kparts(f,v)
1.7 takayama 1906: struct object f;
1907: struct object v;
1.1 maekawa 1908: {
1909: POLY ff;
1910: POLY vv;
1911: struct object obj;
1912: struct matrixOfPOLY *co;
1913: /* check the data type */
1914: if (f.tag != Spoly || v.tag != Spoly)
1915: errorKan1("%s\n","arguments of Kparts() must have polynomial as arguments.");
1916:
1917: co = parts(KopPOLY(f),KopPOLY(v));
1918: obj = matrixOfPOLYToArray(co);
1919: return(obj);
1920: }
1921:
1922: struct object Kparts2(f,v)
1.7 takayama 1923: struct object f;
1924: struct object v;
1.1 maekawa 1925: {
1926: POLY ff;
1927: POLY vv;
1928: struct object obj;
1929: struct matrixOfPOLY *co;
1930: /* check the data type */
1931: if (f.tag != Spoly || v.tag != Spoly)
1932: errorKan1("%s\n","arguments of Kparts2() must have polynomial as arguments.");
1933:
1934: obj = parts2(KopPOLY(f),KopPOLY(v));
1935: return(obj);
1936: }
1937:
1938:
1939: struct object Kdegree(ob1,ob2)
1.7 takayama 1940: struct object ob1,ob2;
1.1 maekawa 1941: {
1942: if (ob1.tag != Spoly || ob2.tag != Spoly)
1943: errorKan1("%s\n","The arguments must be polynomials.");
1944:
1945: return(KpoInteger(pDegreeWrtV(KopPOLY(ob1),KopPOLY(ob2))));
1946: }
1947:
1948: struct object KringMap(obj)
1.7 takayama 1949: struct object obj;
1.1 maekawa 1950: {
1951: extern struct ring *CurrentRingp;
1952: extern struct ring *SyzRingp;
1953: POLY f;
1954: POLY r;
1955: if (obj.tag != Spoly)
1956: errorKan1("%s\n","The argments must be polynomial.");
1957: f = KopPOLY(obj);
1958: if (f ISZERO) return(obj);
1959: if (f->m->ringp == CurrentRingp) return(obj);
1960: if (f->m->ringp == CurrentRingp->next) {
1961: r = newCell(newCoeff(),newMonomial(CurrentRingp));
1962: r->coeffp->tag = POLY_COEFF;
1963: r->coeffp->val.f = f;
1964: return(KpoPOLY(r));
1965: }else if (f->m->ringp == SyzRingp) {
1966: return(KpoPOLY(f->coeffp->val.f));
1967: }
1968: errorKan1("%s\n","The ring map is not defined in this case.");
1969: }
1970:
1971:
1972: struct object Ksp(ob1,ob2)
1.7 takayama 1973: struct object ob1,ob2;
1.1 maekawa 1974: {
1975: struct spValue sv;
1976: struct object rob,cob;
1977: POLY f;
1978: if (ob1.tag != Spoly || ob2.tag != Spoly)
1979: errorKan1("%s\n","Ksp(): The arguments must be polynomials.");
1980: sv = (*sp)(ob1.lc.poly,ob2.lc.poly);
1981: f = ppAddv(ppMult(sv.a,KopPOLY(ob1)),
1.7 takayama 1982: ppMult(sv.b,KopPOLY(ob2)));
1.1 maekawa 1983: rob = newObjectArray(2);
1984: cob = newObjectArray(2);
1985: putoa(rob,1,KpoPOLY(f));
1986: putoa(cob,0,KpoPOLY(sv.a));
1987: putoa(cob,1,KpoPOLY(sv.b));
1988: putoa(rob,0,cob);
1989: return(rob);
1990: }
1991:
1992: struct object Khead(ob)
1.7 takayama 1993: struct object ob;
1.1 maekawa 1994: {
1995: if (ob.tag != Spoly) errorKan1("%s\n","Khead(): The argument should be a polynomial.");
1996: return(KpoPOLY(head( KopPOLY(ob))));
1997: }
1998:
1999:
2000: /* :eval */
2001: struct object Keval(obj)
1.7 takayama 2002: struct object obj;
1.1 maekawa 2003: {
2004: char *key;
2005: int size;
2006: struct object rob;
2007: rob = NullObject;
2008:
2009: if (obj.tag != Sarray)
2010: errorKan1("%s\n","[$key$ arguments] eval");
2011: if (getoaSize(obj) < 1)
2012: errorKan1("%s\n","[$key$ arguments] eval");
2013: if (getoa(obj,0).tag != Sdollar)
2014: errorKan1("%s\n","[$key$ arguments] eval");
2015: key = getoa(obj,0).lc.str;
2016: size = getoaSize(obj);
2017:
2018:
2019: return(rob);
2020: }
2021:
2022: /* :Utilities */
2023: char *KremoveSpace(str)
1.7 takayama 2024: char str[];
1.1 maekawa 2025: {
2026: int size;
2027: int start;
2028: int end;
2029: char *s;
2030: int i;
2031:
2032: size = strlen(str);
2033: for (start = 0; start <= size; start++) {
2034: if (str[start] > ' ') break;
2035: }
2036: for (end = size-1; end >= 0; end--) {
2037: if (str[end] > ' ') break;
2038: }
2039: if (start > end) return((char *) NULL);
2040: s = (char *) sGC_malloc(sizeof(char)*(end-start+2));
2041: if (s == (char *)NULL) errorKan1("%s\n","removeSpace(): No more memory.");
2042: for (i=0; i< end-start+1; i++)
2043: s[i] = str[i+start];
2044: s[end-start+1] = '\0';
2045: return(s);
2046: }
2047:
2048: struct object KtoRecords(ob)
1.7 takayama 2049: struct object ob;
1.1 maekawa 2050: {
2051: struct object obj;
2052: struct object tmp;
2053: int i;
2054: int size;
2055: char **argv;
2056:
2057: obj = NullObject;
2058: switch(ob.tag) {
2059: case Sdollar: break;
2060: default:
2061: errorKan1("%s","Argument of KtoRecords() must be a string enclosed by dollars.\n");
2062: break;
2063: }
2064: size = strlen(ob.lc.str)+3;
2065: argv = (char **) sGC_malloc((size+1)*sizeof(char *));
2066: if (argv == (char **)NULL)
2067: errorKan1("%s","No more memory.\n");
2068: size = KtoArgvbyCurryBrace(ob.lc.str,argv,size);
2069: if (size < 0)
2070: errorKan1("%s"," KtoRecords(): You have an error in the argument.\n");
2071:
2072: obj = newObjectArray(size);
2073: for (i=0; i<size; i++) {
2074: tmp.tag = Sdollar;
2075: tmp.lc.str = argv[i];
2076: (obj.rc.op)[i] = tmp;
2077: }
2078: return(obj);
2079: }
2080:
2081: int KtoArgvbyCurryBrace(str,argv,limit)
1.7 takayama 2082: char *str;
2083: char *argv[];
2084: int limit;
2085: /* This function returns argc */
2086: /* decompose into tokens by the separators
1.1 maekawa 2087: { }, [ ], and characters of which code is less than SPACE.
2088: Example. { } ---> nothing (argc=0)
2089: {x}----> x (argc=1)
2090: {x,y} --> x y (argc=2)
1.7 takayama 2091: {ab, y, z } --> ab y z (argc=3)
1.1 maekawa 2092: [[ab],c,d] --> [ab] c d
2093: */
2094: {
2095: int argc;
2096: int n;
2097: int i;
2098: int k;
2099: char *a;
2100: char *ident;
2101: int level = 0;
2102: int comma;
2103:
2104: if (str == (char *)NULL) {
2105: fprintf(stderr,"You use NULL string to toArgvbyCurryBrace()\n");
2106: return(0);
2107: }
2108:
2109: n = strlen(str);
2110: a = (char *) sGC_malloc(sizeof(char)*(n+3));
2111: a[0]=' ';
2112: strcpy(&(a[1]),str);
2113: n = strlen(a); a[0] = '\0';
2114: comma = -1;
2115: for (i=1; i<n; i++) {
2116: if (a[i] == '{' || a[i] == '[') level++;
2117: if (level <= 1 && ( a[i] == ',')) {a[i] = '\0'; ++comma;}
2118: if (level <= 1 && (a[i]=='{' || a[i]=='}' || a[i]=='[' || a[i]==']'))
2119: a[i] = '\0';
2120: if (a[i] == '}' || a[i] == ']') level--;
2121: if ((level <= 1) && (comma == -1) && ( a[i] > ' ')) comma = 0;
2122: }
2123:
2124: if (comma == -1) return(0);
2125:
2126: argc=0;
2127: for (i=0; i<n; i++) {
2128: if ((a[i] == '\0') && (a[i+1] != '\0')) ++argc;
2129: }
2130: if (argc > limit) return(-argc);
2131:
2132: k = 0;
2133: for (i=0; i<n; i++) {
2134: if ((a[i] == '\0') && (a[i+1] != '\0')) {
2135: ident = (char *) sGC_malloc(sizeof(char)*( strlen(&(a[i+1])) + 3));
2136: strcpy(ident,&(a[i+1]));
2137: argv[k] = KremoveSpace(ident);
2138: if (argv[k] != (char *)NULL) k++;
2139: if (k >= limit) errorKan1("%s\n","KtoArgvbyCurryBraces(): k>=limit.");
2140: }
2141: }
2142: argc = k;
2143: /*for (i=0; i<argc; i++) fprintf(stderr,"%d %s\n",i,argv[i]);*/
2144: return(argc);
2145: }
2146:
1.14 takayama 2147: struct object KstringToArgv(struct object ob) {
2148: struct object rob;
2149: char *s;
2150: int n,wc,i,inblank;
2151: char **argv;
2152: if (ob.tag != Sdollar)
1.22 takayama 2153: errorKan1("%s\n","KstringToArgv(): the argument must be a string.");
1.14 takayama 2154: n = strlen(KopString(ob));
2155: s = (char *) sGC_malloc(sizeof(char)*(n+2));
2156: if (s == NULL) errorKan1("%s\n","KstringToArgv(): No memory.");
2157: strcpy(s,KopString(ob));
2158: inblank = 1; wc = 0;
2159: for (i=0; i<n; i++) {
1.22 takayama 2160: if (inblank && (s[i] > ' ')) {
2161: wc++; inblank = 0;
2162: }else if ((!inblank) && (s[i] <= ' ')) {
2163: inblank = 1;
2164: }
1.14 takayama 2165: }
2166: argv = (char **) sGC_malloc(sizeof(char *)*(wc+2));
2167: argv[0] = NULL;
2168: inblank = 1; wc = 0;
2169: for (i=0; i<n; i++) {
1.22 takayama 2170: if (inblank && (s[i] > ' ')) {
2171: argv[wc] = &(s[i]); argv[wc+1]=NULL;
2172: wc++; inblank = 0;
2173: }else if ((inblank == 0) && (s[i] <= ' ')) {
2174: inblank = 1; s[i] = 0;
2175: }else if (inblank && (s[i] <= ' ')) {
2176: s[i] = 0;
2177: }
1.14 takayama 2178: }
2179:
2180: rob = newObjectArray(wc);
2181: for (i=0; i<wc; i++) {
1.22 takayama 2182: putoa(rob,i,KpoString(argv[i]));
2183: /* printf("%s\n",argv[i]); */
1.14 takayama 2184: }
2185: return(rob);
2186: }
1.1 maekawa 2187:
2188: static void checkDuplicateName(xvars,dvars,n)
1.7 takayama 2189: char *xvars[];
2190: char *dvars[];
2191: int n;
1.1 maekawa 2192: {
2193: int i,j;
2194: char *names[N0*2];
2195: for (i=0; i<n; i++) {
2196: names[i] = xvars[i]; names[i+n] = dvars[i];
2197: }
2198: n = 2*n;
2199: for (i=0; i<n; i++) {
2200: for (j=i+1; j<n; j++) {
2201: if (strcmp(names[i],names[j]) == 0) {
1.7 takayama 2202: fprintf(stderr,"\n%d=%s, %d=%s\n",i,names[i],j,names[j]);
2203: errorKan1("%s\n","Duplicate definition of the name above in SetUpRing().");
1.1 maekawa 2204: }
2205: }
2206: }
2207: }
2208:
1.20 takayama 2209: struct object KooPower(struct object ob1,struct object ob2) {
2210: struct object rob;
2211: /* Bug. It has not yet been implemented. */
2212: if (QuoteMode) {
1.22 takayama 2213: rob = powerTree(ob1,ob2);
1.20 takayama 2214: }else{
1.22 takayama 2215: warningKan("KooDiv2() has not supported yet these objects.\n");
1.20 takayama 2216: }
2217: return(rob);
2218: }
1.1 maekawa 2219:
2220:
2221:
2222: struct object KooDiv2(ob1,ob2)
1.7 takayama 2223: struct object ob1,ob2;
1.1 maekawa 2224: {
2225: struct object rob = NullObject;
2226: POLY f;
2227: extern struct ring *CurrentRingp;
2228: int s,i;
2229: double d;
2230:
2231: switch (Lookup[ob1.tag][ob2.tag]) {
2232: case SpolySpoly:
2233: case SuniversalNumberSuniversalNumber:
2234: case SuniversalNumberSpoly:
2235: case SpolySuniversalNumber:
2236: rob = KnewRationalFunction0(copyObjectp(&ob1),copyObjectp(&ob2));
2237: KisInvalidRational(&rob);
2238: return(rob);
2239: break;
2240: case SarraySpoly:
2241: case SarraySuniversalNumber:
2242: case SarraySrationalFunction:
2243: s = getoaSize(ob1);
2244: rob = newObjectArray(s);
2245: for (i=0; i<s; i++) {
2246: putoa(rob,i,KooDiv2(getoa(ob1,i),ob2));
2247: }
2248: return(rob);
2249: break;
2250: case SpolySrationalFunction:
2251: case SrationalFunctionSpoly:
2252: case SrationalFunctionSrationalFunction:
2253: case SuniversalNumberSrationalFunction:
2254: case SrationalFunctionSuniversalNumber:
2255: rob = KoInverse(ob2);
2256: rob = KooMult(ob1,rob);
2257: return(rob);
2258: break;
2259:
2260: case SdoubleSdouble:
2261: d = KopDouble(ob2);
2262: if (d == 0.0) errorKan1("%s\n","KooDiv2, Division by zero.");
2263: return(KpoDouble( KopDouble(ob1) / d ));
2264: break;
2265: case SdoubleSinteger:
2266: case SdoubleSuniversalNumber:
2267: case SdoubleSrationalFunction:
2268: d = toDouble0(ob2);
2269: if (d == 0.0) errorKan1("%s\n","KooDiv2, Division by zero.");
2270: return(KpoDouble( KopDouble(ob1) / d) );
2271: break;
2272: case SintegerSdouble:
2273: case SuniversalNumberSdouble:
2274: case SrationalFunctionSdouble:
2275: d = KopDouble(ob2);
2276: if (d == 0.0) errorKan1("%s\n","KooDiv2, Division by zero.");
2277: return(KpoDouble( toDouble0(ob1) / d ) );
2278: break;
2279:
2280: default:
1.20 takayama 2281: if (QuoteMode) {
2282: rob = divideTree(ob1,ob2);
2283: }else{
2284: warningKan("KooDiv2() has not supported yet these objects.\n");
2285: }
1.1 maekawa 2286: break;
2287: }
2288: return(rob);
2289: }
2290: /* Template
2291: case SrationalFunctionSrationalFunction:
2292: warningKan("Koo() has not supported yet these objects.\n");
2293: return(rob);
2294: break;
2295: case SpolySrationalFunction:
2296: warningKan("Koo() has not supported yet these objects.\n");
2297: return(rob);
2298: break;
2299: case SrationalFunctionSpoly:
2300: warningKan("Koo() has not supported yet these objects.\n");
2301: return(rob);
2302: break;
2303: case SuniversalNumberSrationalFunction:
2304: warningKan("Koo() has not supported yet these objects.\n");
2305: return(rob);
2306: break;
2307: case SrationalFunctionSuniversalNumber:
2308: warningKan("Koo() has not supported yet these objects.\n");
2309: return(rob);
2310: break;
2311: */
2312:
2313: int KisInvalidRational(op)
1.7 takayama 2314: objectp op;
1.1 maekawa 2315: {
2316: extern struct coeff *UniversalZero;
2317: if (op->tag != SrationalFunction) return(0);
2318: if (KisZeroObject(Kdenominator(*op))) {
2319: errorKan1("%s\n","KisInvalidRational(): zero division. You have f/0.");
2320: }
2321: if (KisZeroObject(Knumerator(*op))) {
2322: op->tag = SuniversalNumber;
2323: op->lc.universalNumber = UniversalZero;
2324: }
2325: return(0);
2326: }
2327:
2328: struct object KgbExtension(struct object obj)
2329: {
2330: char *key;
2331: int size;
2332: struct object keyo;
2333: struct object rob = NullObject;
2334: struct object obj1,obj2,obj3;
2335: POLY f1;
2336: POLY f2;
2337: POLY f3;
2338: POLY f;
2339: int m,i;
2340: struct pairOfPOLY pf;
1.16 takayama 2341: struct coeff *cont;
1.1 maekawa 2342:
2343: if (obj.tag != Sarray) errorKan1("%s\n","KgbExtension(): The argument must be an array.");
2344: size = getoaSize(obj);
2345: if (size < 1) errorKan1("%s\n","KgbExtension(): Empty array.");
2346: keyo = getoa(obj,0);
2347: if (keyo.tag != Sdollar) errorKan1("%s\n","KgbExtension(): No key word.");
2348: key = KopString(keyo);
2349:
2350: /* branch by the key word. */
2351: if (strcmp(key,"isReducible")==0) {
2352: if (size != 3) errorKan1("%s\n","[(isReducible) poly1 poly2] gbext.");
2353: obj1 = getoa(obj,1);
2354: obj2 = getoa(obj,2);
2355: if (obj1.tag != Spoly || obj2.tag != Spoly)
2356: errorKan1("%s\n","[(isReducible) poly1 poly2] gb.");
2357: f1 = KopPOLY(obj1);
2358: f2 = KopPOLY(obj2);
2359: rob = KpoInteger((*isReducible)(f1,f2));
2360: }else if (strcmp(key,"lcm") == 0) {
2361: if (size != 3) errorKan1("%s\n","[(lcm) poly1 poly2] gb.");
2362: obj1 = getoa(obj,1);
2363: obj2 = getoa(obj,2);
2364: if (obj1.tag != Spoly || obj2.tag != Spoly)
2365: errorKan1("%s\n","[(lcm) poly1 poly2] gbext.");
2366: f1 = KopPOLY(obj1);
2367: f2 = KopPOLY(obj2);
2368: rob = KpoPOLY((*lcm)(f1,f2));
2369: }else if (strcmp(key,"grade")==0) {
2370: if (size != 2) errorKan1("%s\n","[(grade) poly1 ] gbext.");
2371: obj1 = getoa(obj,1);
2372: if (obj1.tag != Spoly)
2373: errorKan1("%s\n","[(grade) poly1 ] gbext.");
2374: f1 = KopPOLY(obj1);
2375: rob = KpoInteger((*grade)(f1));
2376: }else if (strcmp(key,"mod")==0) {
2377: if (size != 3) errorKan1("%s\n","[(mod) poly num] gbext");
2378: obj1 = getoa(obj,1);
2379: obj2 = getoa(obj,2);
2380: if (obj1.tag != Spoly || obj2.tag != SuniversalNumber) {
2381: errorKan1("%s\n","The datatype of the argument mismatch: [(mod) polynomial universalNumber] gbext");
2382: }
2383: rob = KpoPOLY( modulopZ(KopPOLY(obj1),KopUniversalNumber(obj2)) );
2384: }else if (strcmp(key,"tomodp")==0) {
2385: /* The ring must be a ring of characteristic p. */
2386: if (size != 3) errorKan1("%s\n","[(tomod) poly ring] gbext");
2387: obj1 = getoa(obj,1);
2388: obj2 = getoa(obj,2);
2389: if (obj1.tag != Spoly || obj2.tag != Sring) {
2390: errorKan1("%s\n","The datatype of the argument mismatch: [(tomod) polynomial ring] gbext");
2391: }
2392: rob = KpoPOLY( modulop(KopPOLY(obj1),KopRingp(obj2)) );
2393: }else if (strcmp(key,"tomod0")==0) {
2394: /* Ring must be a ring of characteristic 0. */
2395: if (size != 3) errorKan1("%s\n","[(tomod0) poly ring] gbext");
2396: obj1 = getoa(obj,1);
2397: obj2 = getoa(obj,2);
2398: if (obj1.tag != Spoly || obj2.tag != Sring) {
2399: errorKan1("%s\n","The datatype of the argument mismatch: [(tomod0) polynomial ring] gbext");
2400: }
2401: errorKan1("%s\n","It has not been implemented.");
2402: rob = KpoPOLY( POLYNULL );
2403: }else if (strcmp(key,"divByN")==0) {
2404: if (size != 3) errorKan1("%s\n","[(divByN) poly num] gbext");
2405: obj1 = getoa(obj,1);
2406: obj2 = getoa(obj,2);
2407: if (obj1.tag != Spoly || obj2.tag != SuniversalNumber) {
2408: errorKan1("%s\n","The datatype of the argument mismatch: [(divByN) polynomial universalNumber] gbext");
2409: }
2410: pf = quotientByNumber(KopPOLY(obj1),KopUniversalNumber(obj2));
2411: rob = newObjectArray(2);
2412: putoa(rob,0,KpoPOLY(pf.first));
2413: putoa(rob,1,KpoPOLY(pf.second));
2414: }else if (strcmp(key,"isConstant")==0) {
2415: if (size != 2) errorKan1("%s\n","[(isConstant) poly ] gbext bool");
2416: obj1 = getoa(obj,1);
2417: if (obj1.tag != Spoly) {
2418: errorKan1("%s\n","The datatype of the argument mismatch: [(isConstant) polynomial] gbext");
2419: }
2420: return(KpoInteger(isConstant(KopPOLY(obj1))));
1.18 takayama 2421: }else if (strcmp(key,"isConstantAll")==0) {
2422: if (size != 2) errorKan1("%s\n","[(isConstantAll) poly ] gbext bool");
2423: obj1 = getoa(obj,1);
2424: if (obj1.tag != Spoly) {
2425: errorKan1("%s\n","The datatype of the argument mismatch: [(isConstantAll) polynomial] gbext");
2426: }
2427: return(KpoInteger(isConstantAll(KopPOLY(obj1))));
1.1 maekawa 2428: }else if (strcmp(key,"schreyerSkelton") == 0) {
2429: if (size != 2) errorKan1("%s\n","[(schreyerSkelton) array_of_poly ] gbext array");
2430: obj1 = getoa(obj,1);
2431: return(KschreyerSkelton(obj1));
2432: }else if (strcmp(key,"lcoeff") == 0) {
2433: if (size != 2) errorKan1("%s\n","[(lcoeff) poly] gbext poly");
2434: obj1 = getoa(obj,1);
2435: if (obj1.tag != Spoly) errorKan1("%s\n","[(lcoeff) poly] gbext poly");
2436: f = KopPOLY(obj1);
2437: if (f == POLYNULL) return(KpoPOLY(f));
2438: return(KpoPOLY( newCell(coeffCopy(f->coeffp),newMonomial(f->m->ringp))));
2439: }else if (strcmp(key,"lmonom") == 0) {
2440: if (size != 2) errorKan1("%s\n","[(lmonom) poly] gbext poly");
2441: obj1 = getoa(obj,1);
2442: if (obj1.tag != Spoly) errorKan1("%s\n","[(lmonom) poly] gbext poly");
2443: f = KopPOLY(obj1);
2444: if (f == POLYNULL) return(KpoPOLY(f));
2445: return(KpoPOLY( newCell(intToCoeff(1,f->m->ringp),monomialCopy(f->m))));
2446: }else if (strcmp(key,"toes") == 0) {
2447: if (size != 2) errorKan1("%s\n","[(toes) array] gbext poly");
2448: obj1 = getoa(obj,1);
2449: if (obj1.tag != Sarray) errorKan1("%s\n","[(toes) array] gbext poly");
2450: return(KvectorToSchreyer_es(obj1));
1.3 takayama 2451: }else if (strcmp(key,"toe_") == 0) {
2452: if (size != 2) errorKan1("%s\n","[(toe_) array] gbext poly");
2453: obj1 = getoa(obj,1);
2454: if (obj1.tag == Spoly) return(obj1);
2455: if (obj1.tag != Sarray) errorKan1("%s\n","[(toe_) array] gbext poly");
2456: return(KpoPOLY(arrayToPOLY(obj1)));
1.1 maekawa 2457: }else if (strcmp(key,"isOrdered") == 0) {
2458: if (size != 2) errorKan1("%s\n","[(isOrdered) poly] gbext poly");
2459: obj1 = getoa(obj,1);
2460: if (obj1.tag != Spoly) errorKan1("%s\n","[(isOrdered) poly] gbext poly");
2461: return(KisOrdered(obj1));
1.16 takayama 2462: }else if (strcmp(key,"reduceContent")==0) {
2463: if (size != 2) errorKan1("%s\n","[(reduceContent) poly1 ] gbext.");
2464: obj1 = getoa(obj,1);
2465: if (obj1.tag != Spoly)
2466: errorKan1("%s\n","[(reduceContent) poly1 ] gbext.");
2467: f1 = KopPOLY(obj1);
1.22 takayama 2468: rob = newObjectArray(2);
2469: f1 = reduceContentOfPoly(f1,&cont);
2470: putoa(rob,0,KpoPOLY(f1));
2471: if (f1 == POLYNULL) {
2472: putoa(rob,1,KpoPOLY(f1));
2473: }else{
2474: putoa(rob,1,KpoPOLY(newCell(cont,newMonomial(f1->m->ringp))));
2475: }
1.17 takayama 2476: }else if (strcmp(key,"ord_ws_all")==0) {
2477: if (size != 3) errorKan1("%s\n","[(ord_ws_all) fv wv] gbext");
2478: obj1 = getoa(obj,1);
2479: obj2 = getoa(obj,2);
2480: rob = KordWsAll(obj1,obj2);
1.23 takayama 2481: }else if (strcmp(key,"exponents")==0) {
2482: if (size == 3) {
2483: obj1 = getoa(obj,1);
2484: obj2 = getoa(obj,2);
2485: rob = KgetExponents(obj1,obj2);
2486: }else if (size == 2) {
2487: obj1 = getoa(obj,1);
2488: obj2 = KpoInteger(2);
2489: rob = KgetExponents(obj1,obj2);
2490: }else{
2491: errorKan1("%s\n","[(exponents) f type] gbext");
2492: }
1.1 maekawa 2493: }else {
2494: errorKan1("%s\n","gbext : unknown tag.");
2495: }
2496: return(rob);
2497: }
2498:
2499: struct object KmpzExtension(struct object obj)
2500: {
2501: char *key;
2502: int size;
2503: struct object keyo;
2504: struct object rob = NullObject;
2505: struct object obj0,obj1,obj2,obj3;
2506: MP_INT *f;
2507: MP_INT *g;
2508: MP_INT *h;
2509: MP_INT *r0;
2510: MP_INT *r1;
2511: MP_INT *r2;
2512: int gi;
2513: extern struct ring *SmallRingp;
2514:
2515:
2516: if (obj.tag != Sarray) errorKan1("%s\n","KmpzExtension(): The argument must be an array.");
2517: size = getoaSize(obj);
2518: if (size < 1) errorKan1("%s\n","KmpzExtension(): Empty array.");
2519: keyo = getoa(obj,0);
2520: if (keyo.tag != Sdollar) errorKan1("%s\n","KmpzExtension(): No key word.");
2521: key = KopString(keyo);
2522:
2523: /* branch by the key word. */
2524: if (strcmp(key,"gcd")==0) {
2525: if (size != 3) errorKan1("%s\n","[(gcd) universalNumber universalNumber] mpzext.");
2526: obj1 = getoa(obj,1);
2527: obj2 = getoa(obj,2);
1.24 takayama 2528: if (obj1.tag != SuniversalNumber) {
2529: obj1 = KdataConversion(obj1,"universalNumber");
2530: }
2531: if (obj2.tag != SuniversalNumber) {
2532: obj2 = KdataConversion(obj2,"universalNumber");
2533: }
1.1 maekawa 2534: if (obj1.tag != SuniversalNumber || obj2.tag != SuniversalNumber)
2535: errorKan1("%s\n","[(gcd) universalNumber universalNumber] mpzext.");
2536: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
1.7 takayama 2537: ! is_this_coeff_MP_INT(obj2.lc.universalNumber)) {
1.1 maekawa 2538: errorKan1("%s\n","[(gcd) universalNumber universalNumber] mpzext.");
2539: }
2540: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2541: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2542: r1 = newMP_INT();
2543: mpz_gcd(r1,f,g);
2544: rob.tag = SuniversalNumber;
2545: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2546: }else if (strcmp(key,"tdiv_qr")==0) {
2547: if (size != 3) errorKan1("%s\n","[(tdiv_qr) universalNumber universalNumber] mpzext.");
2548: obj1 = getoa(obj,1);
2549: obj2 = getoa(obj,2);
1.24 takayama 2550: if (obj1.tag != SuniversalNumber) {
2551: obj1 = KdataConversion(obj1,"universalNumber");
2552: }
2553: if (obj2.tag != SuniversalNumber) {
2554: obj2 = KdataConversion(obj2,"universalNumber");
2555: }
1.1 maekawa 2556: if (obj1.tag != SuniversalNumber || obj2.tag != SuniversalNumber)
2557: errorKan1("%s\n","[(tdiv_qr) universalNumber universalNumber] mpzext.");
2558: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
1.7 takayama 2559: ! is_this_coeff_MP_INT(obj2.lc.universalNumber)) {
1.1 maekawa 2560: errorKan1("%s\n","[(tdiv_qr) universalNumber universalNumber] mpzext.");
2561: }
2562: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2563: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2564: r1 = newMP_INT();
2565: r2 = newMP_INT();
2566: mpz_tdiv_qr(r1,r2,f,g);
2567: obj1.tag = SuniversalNumber;
2568: obj1.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2569: obj2.tag = SuniversalNumber;
2570: obj2.lc.universalNumber = mpintToCoeff(r2,SmallRingp);
2571: rob = newObjectArray(2);
2572: putoa(rob,0,obj1); putoa(rob,1,obj2);
2573: } else if (strcmp(key,"cancel")==0) {
2574: if (size != 2) {
2575: errorKan1("%s\n","[(cancel) universalNumber/universalNumber] mpzext.");
2576: }
2577: obj0 = getoa(obj,1);
2578: if (obj0.tag == SuniversalNumber) return(obj0);
2579: if (obj0.tag != SrationalFunction) {
2580: errorKan1("%s\n","[(cancel) universalNumber/universalNumber] mpzext.");
2581: return(obj0);
2582: }
2583: obj1 = *(Knumerator(obj0));
2584: obj2 = *(Kdenominator(obj0));
2585: if (obj1.tag != SuniversalNumber || obj2.tag != SuniversalNumber) {
2586: errorKan1("%s\n","[(cancel) universalNumber/universalNumber] mpzext.");
2587: return(obj0);
2588: }
2589: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
1.7 takayama 2590: ! is_this_coeff_MP_INT(obj2.lc.universalNumber)) {
1.1 maekawa 2591: errorKan1("%s\n","[(cancel) universalNumber/universalNumber] mpzext.");
2592: }
2593: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2594: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2595:
2596: r0 = newMP_INT();
2597: r1 = newMP_INT();
2598: r2 = newMP_INT();
2599: mpz_gcd(r0,f,g);
2600: mpz_divexact(r1,f,r0);
2601: mpz_divexact(r2,g,r0);
2602: obj1.tag = SuniversalNumber;
2603: obj1.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2604: obj2.tag = SuniversalNumber;
2605: obj2.lc.universalNumber = mpintToCoeff(r2,SmallRingp);
2606:
2607: rob = KnewRationalFunction0(copyObjectp(&obj1),copyObjectp(&obj2));
2608: KisInvalidRational(&rob);
2609: }else if (strcmp(key,"sqrt")==0 ||
1.7 takayama 2610: strcmp(key,"com")==0) {
1.1 maekawa 2611: /* One arg functions */
2612: if (size != 2) errorKan1("%s\n","[key num] mpzext");
2613: obj1 = getoa(obj,1);
1.24 takayama 2614: if (obj1.tag != SuniversalNumber) {
2615: obj1 = KdataConversion(obj1,"universalNumber");
2616: }
1.1 maekawa 2617: if (obj1.tag != SuniversalNumber)
2618: errorKan1("%s\n","[key num] mpzext : num must be a universalNumber.");
2619: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber))
2620: errorKan1("%s\n","[key num] mpzext : num must be a universalNumber.");
2621: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2622: if (strcmp(key,"sqrt")==0) {
2623: r1 = newMP_INT();
2624: mpz_sqrt(r1,f);
2625: }else if (strcmp(key,"com")==0) {
2626: r1 = newMP_INT();
2627: mpz_com(r1,f);
2628: }
2629: rob.tag = SuniversalNumber;
2630: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2631: }else if (strcmp(key,"probab_prime_p")==0 ||
1.7 takayama 2632: strcmp(key,"and") == 0 ||
2633: strcmp(key,"ior")==0) {
1.1 maekawa 2634: /* Two args functions */
2635: if (size != 3) errorKan1("%s\n","[key num1 num2] mpzext.");
2636: obj1 = getoa(obj,1);
2637: obj2 = getoa(obj,2);
1.24 takayama 2638: if (obj1.tag != SuniversalNumber) {
2639: obj1 = KdataConversion(obj1,"universalNumber");
2640: }
2641: if (obj2.tag != SuniversalNumber) {
2642: obj2 = KdataConversion(obj2,"universalNumber");
2643: }
1.1 maekawa 2644: if (obj1.tag != SuniversalNumber || obj2.tag != SuniversalNumber)
2645: errorKan1("%s\n","[key num1 num2] mpzext.");
2646: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
1.7 takayama 2647: ! is_this_coeff_MP_INT(obj2.lc.universalNumber)) {
1.1 maekawa 2648: errorKan1("%s\n","[key num1 num2] mpzext.");
2649: }
2650: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2651: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2652: if (strcmp(key,"probab_prime_p")==0) {
2653: gi = (int) mpz_get_si(g);
2654: if (mpz_probab_prime_p(f,gi)) {
1.7 takayama 2655: rob = KpoInteger(1);
1.1 maekawa 2656: }else {
1.7 takayama 2657: rob = KpoInteger(0);
1.1 maekawa 2658: }
2659: }else if (strcmp(key,"and")==0) {
2660: r1 = newMP_INT();
2661: mpz_and(r1,f,g);
2662: rob.tag = SuniversalNumber;
2663: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2664: }else if (strcmp(key,"ior")==0) {
2665: r1 = newMP_INT();
2666: mpz_ior(r1,f,g);
2667: rob.tag = SuniversalNumber;
2668: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2669: }
2670:
2671: }else if (strcmp(key,"powm")==0) {
2672: /* three args */
2673: if (size != 4) errorKan1("%s\n","[key num1 num2 num3] mpzext");
2674: obj1 = getoa(obj,1); obj2 = getoa(obj,2); obj3 = getoa(obj,3);
1.24 takayama 2675: if (obj1.tag != SuniversalNumber) {
2676: obj1 = KdataConversion(obj1,"universalNumber");
2677: }
2678: if (obj2.tag != SuniversalNumber) {
2679: obj2 = KdataConversion(obj2,"universalNumber");
2680: }
2681: if (obj3.tag != SuniversalNumber) {
2682: obj3 = KdataConversion(obj3,"universalNumber");
2683: }
1.1 maekawa 2684: if (obj1.tag != SuniversalNumber ||
2685: obj2.tag != SuniversalNumber ||
2686: obj3.tag != SuniversalNumber ) {
2687: errorKan1("%s\n","[key num1 num2 num3] mpzext : num1, num2 and num3 must be universalNumbers.");
2688: }
2689: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
1.7 takayama 2690: ! is_this_coeff_MP_INT(obj2.lc.universalNumber) ||
2691: ! is_this_coeff_MP_INT(obj3.lc.universalNumber)) {
1.1 maekawa 2692: errorKan1("%s\n","[key num1 num2 num3] mpzext : num1, num2 and num3 must be universalNumbers.");
2693: }
2694: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2695: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2696: h = coeff_to_MP_INT(obj3.lc.universalNumber);
2697: if (mpz_sgn(g) < 0) errorKan1("%s\n","[(powm) base exp mod] mpzext : exp must not be negative.");
2698: r1 = newMP_INT();
2699: mpz_powm(r1,f,g,h);
2700: rob.tag = SuniversalNumber;
2701: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
1.24 takayama 2702: } else if (strcmp(key,"lcm")==0) {
2703: if (size != 3) errorKan1("%s\n","[(lcm) universalNumber universalNumber] mpzext.");
2704: obj1 = getoa(obj,1);
2705: obj2 = getoa(obj,2);
2706: if (obj1.tag != SuniversalNumber) {
2707: obj1 = KdataConversion(obj1,"universalNumber");
2708: }
2709: if (obj2.tag != SuniversalNumber) {
2710: obj2 = KdataConversion(obj2,"universalNumber");
2711: }
2712: if (obj1.tag != SuniversalNumber || obj2.tag != SuniversalNumber)
2713: errorKan1("%s\n","[lcm num1 num2] mpzext.");
2714: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
2715: ! is_this_coeff_MP_INT(obj2.lc.universalNumber)) {
2716: errorKan1("%s\n","[(lcm) universalNumber universalNumber] mpzext.");
2717: }
2718: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2719: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2720: r1 = newMP_INT();
2721: mpz_lcm(r1,f,g);
2722: rob.tag = SuniversalNumber;
2723: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
1.1 maekawa 2724: }else {
2725: errorKan1("%s\n","mpzExtension(): Unknown tag.");
2726: }
2727: return(rob);
2728: }
2729:
2730:
2731: /** : context */
2732: struct object KnewContext(struct object superObj,char *name) {
2733: struct context *cp;
2734: struct object ob;
2735: if (superObj.tag != Sclass) {
2736: errorKan1("%s\n","The argument of KnewContext must be a Class.Context");
2737: }
2738: if (superObj.lc.ival != CLASSNAME_CONTEXT) {
2739: errorKan1("%s\n","The argument of KnewContext must be a Class.Context");
2740: }
2741: cp = newContext0((struct context *)(superObj.rc.voidp),name);
2742: ob.tag = Sclass;
2743: ob.lc.ival = CLASSNAME_CONTEXT;
2744: ob.rc.voidp = cp;
2745: return(ob);
2746: }
2747:
2748: struct object KcreateClassIncetance(struct object ob1,
1.7 takayama 2749: struct object ob2,
2750: struct object ob3)
1.1 maekawa 2751: {
2752: /* [class-tag super-obj] size [class-tag] cclass */
2753: struct object ob4;
2754: int size,size2,i;
2755: struct object ob5;
2756: struct object rob;
2757:
2758: if (ob1.tag != Sarray)
2759: errorKan1("%s\n","cclass: The first argument must be an array.");
2760: if (getoaSize(ob1) < 1)
2761: errorKan1("%s\n","cclass: The first argument must be [class-tag ....].");
2762: ob4 = getoa(ob1,0);
2763: if (ectag(ob4) != CLASSNAME_CONTEXT)
2764: errorKan1("%s\n","cclass: The first argument must be [class-tag ....].");
2765:
2766: if (ob2.tag != Sinteger)
2767: errorKan1("%s\n","cclass: The second argument must be an integer.");
2768: size = KopInteger(ob2);
2769: if (size < 1)
2770: errorKan1("%s\n","cclass: The size must be > 0.");
2771:
2772: if (ob3.tag != Sarray)
2773: errorKan1("%s\n","cclass: The third argument must be an array.");
2774: if (getoaSize(ob3) < 1)
2775: errorKan1("%s\n","cclass: The third argument must be [class-tag].");
2776: ob5 = getoa(ob3,0);
2777: if (ectag(ob5) != CLASSNAME_CONTEXT)
2778: errorKan1("%s\n","cclass: The third argument must be [class-tag].");
1.7 takayama 2779:
1.1 maekawa 2780: rob = newObjectArray(size);
2781: putoa(rob,0,ob5);
2782: if (getoaSize(ob1) < size) size2 = getoaSize(ob1);
2783: else size2 = size;
2784: for (i=1; i<size2; i++) {
2785: putoa(rob,i,getoa(ob1,i));
2786: }
2787: for (i=size2; i<size; i++) {
2788: putoa(rob,i,NullObject);
2789: }
2790: return(rob);
2791: }
2792:
2793:
2794: struct object KpoDouble(double a) {
2795: struct object rob;
2796: rob.tag = Sdouble;
2797: /* rob.lc.dbl = (double *)sGC_malloc_atomic(sizeof(double)); */
2798: rob.lc.dbl = (double *)sGC_malloc(sizeof(double));
2799: if (rob.lc.dbl == (double *)NULL) {
2800: fprintf(stderr,"No memory.\n"); exit(10);
2801: }
2802: *(rob.lc.dbl) = a;
2803: return(rob);
2804: }
2805:
2806: double toDouble0(struct object ob) {
2807: double r;
2808: int r3;
2809: struct object ob2;
2810: struct object ob3;
2811: switch(ob.tag) {
2812: case Sinteger:
2813: return( (double) (KopInteger(ob)) );
2814: case SuniversalNumber:
2815: return((double) coeffToInt(ob.lc.universalNumber));
2816: case SrationalFunction:
2817: /* The argument is assumed to be a rational number. */
2818: ob2 = newObjectArray(2); ob3 = KpoString("cancel");
2819: putoa(ob2,0,ob3); putoa(ob2,1,ob);
2820: ob = KmpzExtension(ob2);
2821: ob2 = *Knumerator(ob); ob3 = *Kdenominator(ob);
2822: r3 = coeffToInt(ob3.lc.universalNumber);
2823: if (r3 == 0) {
2824: errorKan1("%s\n","toDouble0(): Division by zero.");
2825: break;
2826: }
2827: r = ((double) coeffToInt(ob2.lc.universalNumber)) / ((double)r3);
2828: return(r);
2829: case Sdouble:
2830: return( KopDouble(ob) );
2831: default:
2832: errorKan1("%s\n","toDouble0(): This type of conversion is not supported.");
2833: break;
2834: }
2835: return(0.0);
2836: }
2837:
2838: struct object KpoGradedPolySet(struct gradedPolySet *grD) {
2839: struct object rob;
2840: rob.tag = Sclass;
2841: rob.lc.ival = CLASSNAME_GradedPolySet;
2842: rob.rc.voidp = (void *) grD;
2843: return(rob);
2844: }
2845:
2846: static char *getspace0(int a) {
2847: char *s;
2848: a = (a > 0? a:-a);
2849: s = (char *) sGC_malloc(a+1);
2850: if (s == (char *)NULL) {
2851: errorKan1("%s\n","no more memory.");
2852: }
2853: return(s);
2854: }
2855: struct object KdefaultPolyRing(struct object ob) {
2856: struct object rob;
2857: int i,j,k,n;
2858: struct object ob1,ob2,ob3,ob4,ob5;
2859: struct object t1;
2860: char *s1;
2861: extern struct ring *CurrentRingp;
2862: static struct ring *a[N0];
2863:
2864: rob = NullObject;
2865: if (ob.tag != Sinteger) {
2866: errorKan1("%s\n","KdefaultPolyRing(): the argument must be integer.");
2867: }
2868: n = KopInteger(ob);
2869: if (n <= 0) {
2870: /* initializing */
2871: for (i=0; i<N0; i++) {
2872: a[i] = (struct ring*) NULL;
2873: }
2874: return(rob);
2875: }
2876:
2877: if ( a[n] != (struct ring*)NULL) return(KpoRingp(a[n]));
2878:
2879: /* Let's construct ring of polynomials of 2n variables */
2880: /* x variables */
2881: ob1 = newObjectArray(n);
2882: for (i=0; i<n; i++) {
2883: s1 = getspace0(1+ ((n-i)/10) + 1);
2884: sprintf(s1,"x%d",n-i);
2885: putoa(ob1,i,KpoString(s1));
2886: }
2887: ob2 = newObjectArray(n);
2888: s1 = getspace0(1);
2889: sprintf(s1,"h");
2890: putoa(ob2,0,KpoString(s1));
2891: for (i=1; i<n; i++) {
2892: s1 = getspace0(1+((n+n-i)/10)+1);
2893: sprintf(s1,"x%d",n+n-i);
2894: putoa(ob2,i,KpoString(s1));
2895: }
2896:
2897: ob3 = newObjectArray(9);
2898: putoa(ob3,0,KpoInteger(0));
2899: for (i=1; i<9; i++) {
2900: putoa(ob3,i,KpoInteger(n));
2901: }
2902:
2903: ob4 = newObjectArray(2*n);
2904: t1 = newObjectArray(2*n);
2905: for (i=0; i<2*n; i++) {
2906: putoa(t1,i,KpoInteger(1));
2907: }
2908: putoa(ob4,0,t1);
2909: for (i=1; i<2*n; i++) {
2910: t1 = newObjectArray(2*n);
2911: for (j=0; j<2*n; j++) {
2912: putoa(t1,j,KpoInteger(0));
2913: if (j == (2*n-i)) {
1.7 takayama 2914: putoa(t1,j,KpoInteger(-1));
1.1 maekawa 2915: }
2916: }
2917: putoa(ob4,i,t1);
2918: }
2919:
2920: ob5 = newObjectArray(2);
2921: putoa(ob5,0,KpoString("mpMult"));
2922: putoa(ob5,1,KpoString("poly"));
2923:
2924: KsetUpRing(ob1,ob2,ob3,ob4,ob5);
2925: a[n] = CurrentRingp;
2926: return(KpoRingp(a[n]));
2927: }
2928:
2929:
2930:
2931:
2932:
2933: /******************************************************************
2934: error handler
2935: ******************************************************************/
2936:
2937: errorKan1(str,message)
1.7 takayama 2938: char *str;
2939: char *message;
1.1 maekawa 2940: {
2941: extern char *GotoLabel;
2942: extern int GotoP;
2943: extern int ErrorMessageMode;
2944: char tmpc[1024];
1.10 takayama 2945: cancelAlarm();
1.1 maekawa 2946: if (ErrorMessageMode == 1 || ErrorMessageMode == 2) {
2947: sprintf(tmpc,"\nERROR(kanExport[0|1].c): ");
2948: if (strlen(message) < 900) {
2949: strcat(tmpc,message);
2950: }
2951: pushErrorStack(KnewErrorPacket(SerialCurrent,-1,tmpc));
2952: }
2953: if (ErrorMessageMode != 1) {
2954: fprintf(stderr,"\nERROR(kanExport[0|1].c): ");
2955: fprintf(stderr,str,message);
2956: }
2957: /* fprintf(stderr,"Hello "); */
2958: if (GotoP) {
2959: /* fprintf(stderr,"Hello. GOTO "); */
2960: fprintf(Fstack,"The interpreter was looking for the label <<%s>>. It is also aborted.\n",GotoLabel);
2961: GotoP = 0;
2962: }
2963: stdOperandStack(); contextControl(CCRESTORE);
2964: /* fprintf(stderr,"Now. Long jump!\n"); */
1.8 takayama 2965: #if defined(__CYGWIN__)
2966: siglongjmp(EnvOfStackMachine,1);
2967: #else
1.1 maekawa 2968: longjmp(EnvOfStackMachine,1);
1.8 takayama 2969: #endif
1.1 maekawa 2970: }
1.22 takayama 2971:
1.1 maekawa 2972:
2973: warningKan(str)
1.7 takayama 2974: char *str;
1.1 maekawa 2975: {
2976: extern int WarningMessageMode;
2977: extern int Strict;
2978: char tmpc[1024];
2979: if (WarningMessageMode == 1 || WarningMessageMode == 2) {
2980: sprintf(tmpc,"\nWARNING(kanExport[0|1].c): ");
2981: if (strlen(str) < 900) {
2982: strcat(tmpc,str);
2983: }
2984: pushErrorStack(KnewErrorPacket(SerialCurrent,-1,tmpc));
2985: }
2986: if (WarningMessageMode != 1) {
2987: fprintf(stderr,"\nWARNING(kanExport[0|1].c): ");
2988: fprintf(stderr,str);
2989: fprintf(stderr,"\n");
2990: }
2991: /* if (Strict) errorKan1("%s\n"," "); */
2992: if (Strict) errorKan1("%s\n",str);
1.4 takayama 2993: return(0);
2994: }
2995:
2996: warningKanNoStrictMode(str)
1.7 takayama 2997: char *str;
1.4 takayama 2998: {
2999: extern int Strict;
3000: int t;
3001: t = Strict;
3002: Strict = 0;
3003: warningKan(str);
3004: Strict = t;
1.1 maekawa 3005: return(0);
3006: }
3007:
3008:
3009:
3010:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to kanExport0.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM / src / kan96xx / Kan