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