Annotation of OpenXM/src/kan96xx/Kan/kanExport0.c, Revision 1.5
1.5 ! takayama 1: /* $OpenXM: OpenXM/src/kan96xx/Kan/kanExport0.c,v 1.4 2000/07/17 02:58:45 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)
25: struct object ob1,ob2;
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)
152: struct object ob1,ob2;
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)
280: struct object ob1,ob2;
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)
424: struct object obj;
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)
461: struct object obj;
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)
497: struct object ob;
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)
508: struct object ob;
509: int m,n;
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)
524: struct object aa,bb;
525: /* aa and bb is assumed to be array. */
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) {
552: rob.tag = Spoly; rob.lc.poly = ZERO;
553: }else if (ob1.tag == Sinteger) {
554: rob.tag = Sinteger; rob.lc.ival = 0;
555: }else {
556: rob.tag = SuniversalNumber;
557: rob.lc.universalNumber = intToCoeff(0,&SmallRing);
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 */
567: /* (m n) (m2=n) */
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++) {
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;
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++) {
628: fik = KopPOLY(getoa(getoa(aa,i),k));
629: gkj = KopPOLY(getoa(getoa(bb,k),j));
630: tmp = ppAdd(tmp, ppMult( fik, gkj));
631: }
632: getoa(getoa(rob,i),j) = KpoPOLY(tmp);
633: }
634: }
635: return(rob);
636: }
637:
638: struct object KooDiv(ob1,ob2)
639: struct object ob1,ob2;
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,
650: ob2.lc.universalNumber);
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)
664: struct object obj1;
665: struct object obj2;
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) {
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);
702: }else{
703: if (isNullList(obj2.rc.op)) return(0);
704: return(KooEqualQ(*(obj1.rc.op),*(obj2.rc.op)));
705: }
706: }else{
707: return(0);
708: }
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: }
726: }
727:
728:
729: struct object KoIsPositive(ob1)
730: struct object ob1;
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)
745: struct object obj1;
746: struct object obj2;
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) {
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: }
783: }
784:
785: struct object KooLess(obj1,obj2)
786: struct object obj1;
787: struct object obj2;
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) {
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: }
824: }
825:
826: /* :conversion */
827:
828: struct object KdataConversion(obj,key)
829: struct object obj;
830: char *key;
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) {
850: rob = KpoInteger(obj.tag);
851: }else {
852: rob = KpoInteger(ectag(obj));
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) {
917: errorKan1("%s\n","No memory.");
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++) {
933: putoa(rob,i,KpoInteger((obj.lc.str)[i]));
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",
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++) {
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;
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) {
953: errorKan1("KdataConversion(): %s","It cannot be translated to double.");
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 {
993: return(KpoInteger(coeffToInt(obj.lc.poly->coeffp)));
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) {
1005: rob.tag = SuniversalNumber;
1006: rob.lc.universalNumber = newUniversalNumber(0);
1007: } else {
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: }
1015: }
1016: return(rob);
1017: }else if (strcmp(key,"ring")==0) {
1018: if (obj.lc.poly ISZERO) {
1019: warningKan("Zero polynomial does not have the ring structure field.\n");
1020: }else{
1021: rob.tag = Sring;
1022: rob.lc.ringp = (obj.lc.poly)->m->ringp;
1023: return(rob);
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)
1153: int k;
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)
1161: char *s;
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)
1169: POLY f;
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)
1177: struct arrayOfPOLY *ap ;
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)
1186: struct matrixOfPOLY *mp ;
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)
1195: struct ring *ringp;
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)
1205: struct arrayOfPOLY *aa;
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)
1224: struct matrixOfPOLY *pmat;
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)
1245: struct object oa;
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",
1254: "Argument is not array\n");
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 ",
1260: "element must be polynomial.\n");
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)
1270: struct object oa;
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",
1280: "Argument is not array\n");
1281: m = getoaSize(oa);
1282: tmp = getoa(oa,0);
1283: if (tmp.tag != Sarray) errorKan1("arrayToMatrixOfPOLY():%s ",
1284: "Argument is not array\n");
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",
1290: "element must be array.\n");
1291: for (j=0; j<n; j++) {
1292: tmp2 = getoa(tmp,j);
1293: if (tmp2.tag != Spoly) errorKan1("arrayToMatrixOfPOLY(): %s",
1294: "element must be a polynomial.\n");
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)
1309: struct object oA;
1310: int order[];
1311: int n;
1312: int oasize;
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)
1346: struct object oA;
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)
1374: int c,l,m,n,cc,ll,mm,nn;
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)
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: */
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;
1540:
1541: if (ob5.tag != Sarray || (getoaSize(ob5) % 2) != 0) {
1542: errorKan1("%s\n","[(keyword) value (keyword) value ....] should be given.");
1543: }
1544: for (i=0; i < getoaSize(ob5); i += 2) {
1545: if (getoa(ob5,i).tag == Sdollar) {
1546: if (strcmp(KopString(getoa(ob5,i)),"mpMult") == 0) {
1547: if (getoa(ob5,i+1).tag != Sdollar) {
1548: errorKan1("%s\n","A keyword should be given. (mpMult)");
1549: }
1550: fmp_mult_saved = F_mpMult;
1551: mpMultName = KopString(getoa(ob5,i+1));
1552: switch_function("mpMult",mpMultName);
1553: /* Note that this cause a global effect. It will be done again. */
1554: newRingp->multiplication = mpMult;
1555: switch_function("mpMult",fmp_mult_saved);
1556: } else if (strcmp(KopString(getoa(ob5,i)),"coefficient ring") == 0) {
1557: if (getoa(ob5,i+1).tag != Sring) {
1558: errorKan1("%s\n","The pointer to a ring should be given. (coefficient ring)");
1559: }
1560: nextRing = KopRingp(getoa(ob5,i+1));
1561: newRingp->next = nextRing;
1562: } else if (strcmp(KopString(getoa(ob5,i)),"valuation") == 0) {
1563: errorKan1("%s\n","Not implemented. (valuation)");
1564: } else if (strcmp(KopString(getoa(ob5,i)),"characteristic") == 0) {
1565: if (getoa(ob5,i+1).tag != Sinteger) {
1566: errorKan1("%s\n","A integer should be given. (characteristic)");
1567: }
1568: p = KopInteger(getoa(ob5,i+1));
1569: newRingp->p = p;
1570: } else if (strcmp(KopString(getoa(ob5,i)),"schreyer") == 0) {
1571: if (getoa(ob5,i+1).tag != Sinteger) {
1572: errorKan1("%s\n","A integer should be given. (schreyer)");
1573: }
1574: newRingp->schreyer = KopInteger(getoa(ob5,i+1));
1575: } else if (strcmp(KopString(getoa(ob5,i)),"gbListTower") == 0) {
1576: if (getoa(ob5,i+1).tag != Slist) {
1577: errorKan1("%s\n","A list should be given (gbListTower).");
1578: }
1579: newRingp->gbListTower = newObject();
1580: *((struct object *)(newRingp->gbListTower)) = getoa(ob5,i+1);
1581: } else if (strcmp(KopString(getoa(ob5,i)),"ringName") == 0) {
1582: if (getoa(ob5,i+1).tag != Sdollar) {
1583: errorKan1("%s\n","A name should be given. (ringName)");
1584: }
1585: ringName = KopString(getoa(ob5,i+1));
1586: } else {
1587: errorKan1("%s\n","Unknown keyword to set_up_ring@");
1588: }
1589: }else{
1590: errorKan1("%s\n","A keyword enclosed by braces have to be given.");
1591: }
1592: }
1593:
1594: newRingp->name = ringName;
1595:
1596:
1597: if (AvoidTheSameRing) {
1598: aa = isTheSameRing(rstack,rp,newRingp);
1599: if (aa < 0) {
1600: /* This ring has never been defined. */
1601: CurrentRingp = newRingp;
1602: /* Install it to the RingStack */
1603: if (rp <RP_LIMIT) {
1604: rstack[rp] = CurrentRingp; rp++; /* Save the previous ringp */
1605: }else{
1606: rp = 0;
1607: errorKan1("%s\n","You have defined too many rings. Check the value of RP_LIMIT.");
1608: }
1609: }else{
1610: /* This ring has been defined. */
1611: /* Discard the newRingp */
1612: CurrentRingp = rstack[aa];
1613: ringSerial--;
1614: }
1615: }else{
1616: CurrentRingp = newRingp;
1617: /* Install it to the RingStack */
1618: if (rp <RP_LIMIT) {
1619: rstack[rp] = CurrentRingp; rp++; /* Save the previous ringp */
1620: }else{
1621: rp = 0;
1622: errorKan1("%s\n","You have defined too many rings. Check the value of RP_LIMIT.");
1623: }
1624: }
1625: if (mpMultName != NULL) {
1626: switch_function("mpMult",mpMultName);
1627: }
1628:
1629: initSyzRingp();
1630:
1631: return(0);
1632: }
1633:
1634:
1635: struct object KsetVariableNames(struct object ob,struct ring *rp)
1636: {
1637: int n,i;
1638: struct object ox;
1639: struct object otmp;
1640: char **xvars;
1641: char **dvars;
1642: if (ob.tag != Sarray) {
1643: errorKan1("%s\n","KsetVariableNames(): the argument must be of the form [(x) (y) (z) ...]");
1644: }
1645: n = rp->n;
1646: ox = ob;
1647: if (getoaSize(ox) != 2*n) {
1648: 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.");
1649: }
1650: xvars = (char **)sGC_malloc(sizeof(char *)*n);
1651: dvars = (char **)sGC_malloc(sizeof(char *)*n);
1652: if (xvars == NULL || dvars == NULL) {
1653: errorKan1("%s\n","KsetVariableNames(): no more memory.");
1654: }
1655: for (i=0; i<2*n; i++) {
1656: otmp = getoa(ox,i);
1657: if(otmp.tag != Sdollar) {
1658: errorKan1("%s\n","KsetVariableNames(): elements must be strings.");
1659: }
1660: if (i < n) {
1661: xvars[i] = KopString(otmp);
1662: }else{
1663: dvars[i-n] = KopString(otmp);
1664: }
1665: }
1666: checkDuplicateName(xvars,dvars,n);
1667: rp->x = xvars;
1668: rp->D = dvars;
1669: return(ob);
1670: }
1671:
1672:
1673:
1674: void KshowRing(ringp)
1675: struct ring *ringp;
1676: {
1677: showRing(1,ringp);
1678: }
1679:
1680: struct object KswitchFunction(ob1,ob2)
1681: struct object ob1,ob2;
1682: {
1683: char *ans ;
1684: struct object rob;
1685: int needWarningForAvoidTheSameRing = 0;
1686: extern int AvoidTheSameRing;
1687: if ((ob1.tag != Sdollar) || (ob2.tag != Sdollar)) {
1688: errorKan1("%s\n","$function$ $name$ switch_function\n");
1689: }
1690: if (AvoidTheSameRing && needWarningForAvoidTheSameRing) {
1691: if (strcmp(KopString(ob1),"mmLarger") == 0 ||
1692: strcmp(KopString(ob1),"mpMult") == 0 ||
1693: strcmp(KopString(ob1),"monomialAdd") == 0 ||
1694: strcmp(KopString(ob1),"isSameComponent") == 0) {
1695: fprintf(stderr,",switch_function ==> %s ",KopString(ob1));
1696: warningKan("switch_function might cause a trouble under AvoidTheSameRing == 1.\n");
1697: }
1698: }
1699: if (AvoidTheSameRing) {
1700: if (strcmp(KopString(ob1),"mmLarger") == 0 &&
1701: strcmp(KopString(ob2),"matrix") != 0) {
1702: fprintf(stderr,"mmLarger = %s",KopString(ob2));
1703: errorKan1("%s\n","mmLarger can set only to matrix under AvoidTheSameRing == 1.");
1704: }
1705: }
1706:
1707: ans = switch_function(ob1.lc.str,ob2.lc.str);
1708: if (ans == NULL) {
1709: rob = NullObject;
1710: }else{
1711: rob = KpoString(ans);
1712: }
1713: return(rob);
1714:
1715: }
1716:
1717: void KprintSwitchStatus(void)
1718: {
1719: print_switch_status();
1720: }
1721:
1722: struct object KoReplace(of,rule)
1723: struct object of;
1724: struct object rule;
1725: {
1726: struct object rob;
1727: POLY f;
1728: POLY lRule[N0*2];
1729: POLY rRule[N0*2];
1730: POLY r;
1731: int i;
1732: int n;
1733: struct object trule;
1734:
1735:
1736: if (rule.tag != Sarray) {
1737: errorKan1("%s\n"," KoReplace(): The second argument must be array.");
1738: }
1739: n = getoaSize(rule);
1740:
1741: if (of.tag != Spoly) {
1742: errorKan1("%s\n"," KoReplace(): The first argument must be a polynomial.");
1743: }
1744: f = KopPOLY(of);
1745:
1746: if (f ISZERO) {
1747: }else{
1748: if (n >= 2*(f->m->ringp->n)) {
1749: errorKan1("%s\n"," KoReplace(): too many rules for replacement. ");
1750: }
1751: }
1752:
1753: for (i=0; i<n; i++) {
1754: trule = getoa(rule,i);
1755: if (trule.tag != Sarray) {
1756: errorKan1("%s\n"," KoReplace(): The second argument must be of the form [[a b] [c d] ....].");
1757: }
1758: if (getoaSize(trule) != 2) {
1759: errorKan1("%s\n"," KoReplace(): The second argument must be of the form [[a b] [c d] ....].");
1760: }
1761:
1762: if (getoa(trule,0).tag != Spoly) {
1763: errorKan1("%s\n"," KoReplace(): The second argument must be of the form [[a b] [c d] ....] where a,b,c,d,... are polynomials.");
1764: }
1765: if (getoa(trule,1).tag != Spoly) {
1766: errorKan1("%s\n"," KoReplace(): The second argument must be of the form [[a b] [c d] ....] where a,b,c,d,... are polynomials.");
1767: }
1768:
1769: lRule[i] = KopPOLY(getoa(trule,0));
1770: rRule[i] = KopPOLY(getoa(trule,1));
1771: }
1772:
1773: r = replace(f,lRule,rRule,n);
1774: rob.tag = Spoly; rob.lc.poly = r;
1775:
1776: return(rob);
1777: }
1778:
1779:
1780: struct object Kparts(f,v)
1781: struct object f;
1782: struct object v;
1783: {
1784: POLY ff;
1785: POLY vv;
1786: struct object obj;
1787: struct matrixOfPOLY *co;
1788: /* check the data type */
1789: if (f.tag != Spoly || v.tag != Spoly)
1790: errorKan1("%s\n","arguments of Kparts() must have polynomial as arguments.");
1791:
1792: co = parts(KopPOLY(f),KopPOLY(v));
1793: obj = matrixOfPOLYToArray(co);
1794: return(obj);
1795: }
1796:
1797: struct object Kparts2(f,v)
1798: struct object f;
1799: struct object v;
1800: {
1801: POLY ff;
1802: POLY vv;
1803: struct object obj;
1804: struct matrixOfPOLY *co;
1805: /* check the data type */
1806: if (f.tag != Spoly || v.tag != Spoly)
1807: errorKan1("%s\n","arguments of Kparts2() must have polynomial as arguments.");
1808:
1809: obj = parts2(KopPOLY(f),KopPOLY(v));
1810: return(obj);
1811: }
1812:
1813:
1814: struct object Kdegree(ob1,ob2)
1815: struct object ob1,ob2;
1816: {
1817: if (ob1.tag != Spoly || ob2.tag != Spoly)
1818: errorKan1("%s\n","The arguments must be polynomials.");
1819:
1820: return(KpoInteger(pDegreeWrtV(KopPOLY(ob1),KopPOLY(ob2))));
1821: }
1822:
1823: struct object KringMap(obj)
1824: struct object obj;
1825: {
1826: extern struct ring *CurrentRingp;
1827: extern struct ring *SyzRingp;
1828: POLY f;
1829: POLY r;
1830: if (obj.tag != Spoly)
1831: errorKan1("%s\n","The argments must be polynomial.");
1832: f = KopPOLY(obj);
1833: if (f ISZERO) return(obj);
1834: if (f->m->ringp == CurrentRingp) return(obj);
1835: if (f->m->ringp == CurrentRingp->next) {
1836: r = newCell(newCoeff(),newMonomial(CurrentRingp));
1837: r->coeffp->tag = POLY_COEFF;
1838: r->coeffp->val.f = f;
1839: return(KpoPOLY(r));
1840: }else if (f->m->ringp == SyzRingp) {
1841: return(KpoPOLY(f->coeffp->val.f));
1842: }
1843: errorKan1("%s\n","The ring map is not defined in this case.");
1844: }
1845:
1846:
1847: struct object Ksp(ob1,ob2)
1848: struct object ob1,ob2;
1849: {
1850: struct spValue sv;
1851: struct object rob,cob;
1852: POLY f;
1853: if (ob1.tag != Spoly || ob2.tag != Spoly)
1854: errorKan1("%s\n","Ksp(): The arguments must be polynomials.");
1855: sv = (*sp)(ob1.lc.poly,ob2.lc.poly);
1856: f = ppAddv(ppMult(sv.a,KopPOLY(ob1)),
1857: ppMult(sv.b,KopPOLY(ob2)));
1858: rob = newObjectArray(2);
1859: cob = newObjectArray(2);
1860: putoa(rob,1,KpoPOLY(f));
1861: putoa(cob,0,KpoPOLY(sv.a));
1862: putoa(cob,1,KpoPOLY(sv.b));
1863: putoa(rob,0,cob);
1864: return(rob);
1865: }
1866:
1867: struct object Khead(ob)
1868: struct object ob;
1869: {
1870: if (ob.tag != Spoly) errorKan1("%s\n","Khead(): The argument should be a polynomial.");
1871: return(KpoPOLY(head( KopPOLY(ob))));
1872: }
1873:
1874:
1875: /* :eval */
1876: struct object Keval(obj)
1877: struct object obj;
1878: {
1879: char *key;
1880: int size;
1881: struct object rob;
1882: rob = NullObject;
1883:
1884: if (obj.tag != Sarray)
1885: errorKan1("%s\n","[$key$ arguments] eval");
1886: if (getoaSize(obj) < 1)
1887: errorKan1("%s\n","[$key$ arguments] eval");
1888: if (getoa(obj,0).tag != Sdollar)
1889: errorKan1("%s\n","[$key$ arguments] eval");
1890: key = getoa(obj,0).lc.str;
1891: size = getoaSize(obj);
1892:
1893:
1894: return(rob);
1895: }
1896:
1897: /* :Utilities */
1898: char *KremoveSpace(str)
1899: char str[];
1900: {
1901: int size;
1902: int start;
1903: int end;
1904: char *s;
1905: int i;
1906:
1907: size = strlen(str);
1908: for (start = 0; start <= size; start++) {
1909: if (str[start] > ' ') break;
1910: }
1911: for (end = size-1; end >= 0; end--) {
1912: if (str[end] > ' ') break;
1913: }
1914: if (start > end) return((char *) NULL);
1915: s = (char *) sGC_malloc(sizeof(char)*(end-start+2));
1916: if (s == (char *)NULL) errorKan1("%s\n","removeSpace(): No more memory.");
1917: for (i=0; i< end-start+1; i++)
1918: s[i] = str[i+start];
1919: s[end-start+1] = '\0';
1920: return(s);
1921: }
1922:
1923: struct object KtoRecords(ob)
1924: struct object ob;
1925: {
1926: struct object obj;
1927: struct object tmp;
1928: int i;
1929: int size;
1930: char **argv;
1931:
1932: obj = NullObject;
1933: switch(ob.tag) {
1934: case Sdollar: break;
1935: default:
1936: errorKan1("%s","Argument of KtoRecords() must be a string enclosed by dollars.\n");
1937: break;
1938: }
1939: size = strlen(ob.lc.str)+3;
1940: argv = (char **) sGC_malloc((size+1)*sizeof(char *));
1941: if (argv == (char **)NULL)
1942: errorKan1("%s","No more memory.\n");
1943: size = KtoArgvbyCurryBrace(ob.lc.str,argv,size);
1944: if (size < 0)
1945: errorKan1("%s"," KtoRecords(): You have an error in the argument.\n");
1946:
1947: obj = newObjectArray(size);
1948: for (i=0; i<size; i++) {
1949: tmp.tag = Sdollar;
1950: tmp.lc.str = argv[i];
1951: (obj.rc.op)[i] = tmp;
1952: }
1953: return(obj);
1954: }
1955:
1956: int KtoArgvbyCurryBrace(str,argv,limit)
1957: char *str;
1958: char *argv[];
1959: int limit;
1960: /* This function returns argc */
1961: /* decompose into tokens by the separators
1962: { }, [ ], and characters of which code is less than SPACE.
1963: Example. { } ---> nothing (argc=0)
1964: {x}----> x (argc=1)
1965: {x,y} --> x y (argc=2)
1966: {ab, y, z } --> ab y z (argc=3)
1967: [[ab],c,d] --> [ab] c d
1968: */
1969: {
1970: int argc;
1971: int n;
1972: int i;
1973: int k;
1974: char *a;
1975: char *ident;
1976: int level = 0;
1977: int comma;
1978:
1979: if (str == (char *)NULL) {
1980: fprintf(stderr,"You use NULL string to toArgvbyCurryBrace()\n");
1981: return(0);
1982: }
1983:
1984: n = strlen(str);
1985: a = (char *) sGC_malloc(sizeof(char)*(n+3));
1986: a[0]=' ';
1987: strcpy(&(a[1]),str);
1988: n = strlen(a); a[0] = '\0';
1989: comma = -1;
1990: for (i=1; i<n; i++) {
1991: if (a[i] == '{' || a[i] == '[') level++;
1992: if (level <= 1 && ( a[i] == ',')) {a[i] = '\0'; ++comma;}
1993: if (level <= 1 && (a[i]=='{' || a[i]=='}' || a[i]=='[' || a[i]==']'))
1994: a[i] = '\0';
1995: if (a[i] == '}' || a[i] == ']') level--;
1996: if ((level <= 1) && (comma == -1) && ( a[i] > ' ')) comma = 0;
1997: }
1998:
1999: if (comma == -1) return(0);
2000:
2001: argc=0;
2002: for (i=0; i<n; i++) {
2003: if ((a[i] == '\0') && (a[i+1] != '\0')) ++argc;
2004: }
2005: if (argc > limit) return(-argc);
2006:
2007: k = 0;
2008: for (i=0; i<n; i++) {
2009: if ((a[i] == '\0') && (a[i+1] != '\0')) {
2010: ident = (char *) sGC_malloc(sizeof(char)*( strlen(&(a[i+1])) + 3));
2011: strcpy(ident,&(a[i+1]));
2012: argv[k] = KremoveSpace(ident);
2013: if (argv[k] != (char *)NULL) k++;
2014: if (k >= limit) errorKan1("%s\n","KtoArgvbyCurryBraces(): k>=limit.");
2015: }
2016: }
2017: argc = k;
2018: /*for (i=0; i<argc; i++) fprintf(stderr,"%d %s\n",i,argv[i]);*/
2019: return(argc);
2020: }
2021:
2022:
2023: static void checkDuplicateName(xvars,dvars,n)
2024: char *xvars[];
2025: char *dvars[];
2026: int n;
2027: {
2028: int i,j;
2029: char *names[N0*2];
2030: for (i=0; i<n; i++) {
2031: names[i] = xvars[i]; names[i+n] = dvars[i];
2032: }
2033: n = 2*n;
2034: for (i=0; i<n; i++) {
2035: for (j=i+1; j<n; j++) {
2036: if (strcmp(names[i],names[j]) == 0) {
2037: fprintf(stderr,"\n%d=%s, %d=%s\n",i,names[i],j,names[j]);
2038: errorKan1("%s\n","Duplicate definition of the name above in SetUpRing().");
2039: }
2040: }
2041: }
2042: }
2043:
2044:
2045:
2046:
2047: struct object KooDiv2(ob1,ob2)
2048: struct object ob1,ob2;
2049: {
2050: struct object rob = NullObject;
2051: POLY f;
2052: extern struct ring *CurrentRingp;
2053: int s,i;
2054: double d;
2055:
2056: switch (Lookup[ob1.tag][ob2.tag]) {
2057: case SpolySpoly:
2058: case SuniversalNumberSuniversalNumber:
2059: case SuniversalNumberSpoly:
2060: case SpolySuniversalNumber:
2061: rob = KnewRationalFunction0(copyObjectp(&ob1),copyObjectp(&ob2));
2062: KisInvalidRational(&rob);
2063: return(rob);
2064: break;
2065: case SarraySpoly:
2066: case SarraySuniversalNumber:
2067: case SarraySrationalFunction:
2068: s = getoaSize(ob1);
2069: rob = newObjectArray(s);
2070: for (i=0; i<s; i++) {
2071: putoa(rob,i,KooDiv2(getoa(ob1,i),ob2));
2072: }
2073: return(rob);
2074: break;
2075: case SpolySrationalFunction:
2076: case SrationalFunctionSpoly:
2077: case SrationalFunctionSrationalFunction:
2078: case SuniversalNumberSrationalFunction:
2079: case SrationalFunctionSuniversalNumber:
2080: rob = KoInverse(ob2);
2081: rob = KooMult(ob1,rob);
2082: return(rob);
2083: break;
2084:
2085: case SdoubleSdouble:
2086: d = KopDouble(ob2);
2087: if (d == 0.0) errorKan1("%s\n","KooDiv2, Division by zero.");
2088: return(KpoDouble( KopDouble(ob1) / d ));
2089: break;
2090: case SdoubleSinteger:
2091: case SdoubleSuniversalNumber:
2092: case SdoubleSrationalFunction:
2093: d = toDouble0(ob2);
2094: if (d == 0.0) errorKan1("%s\n","KooDiv2, Division by zero.");
2095: return(KpoDouble( KopDouble(ob1) / d) );
2096: break;
2097: case SintegerSdouble:
2098: case SuniversalNumberSdouble:
2099: case SrationalFunctionSdouble:
2100: d = KopDouble(ob2);
2101: if (d == 0.0) errorKan1("%s\n","KooDiv2, Division by zero.");
2102: return(KpoDouble( toDouble0(ob1) / d ) );
2103: break;
2104:
2105: default:
2106: warningKan("KooDiv2() has not supported yet these objects.\n");
2107: break;
2108: }
2109: return(rob);
2110: }
2111: /* Template
2112: case SrationalFunctionSrationalFunction:
2113: warningKan("Koo() has not supported yet these objects.\n");
2114: return(rob);
2115: break;
2116: case SpolySrationalFunction:
2117: warningKan("Koo() has not supported yet these objects.\n");
2118: return(rob);
2119: break;
2120: case SrationalFunctionSpoly:
2121: warningKan("Koo() has not supported yet these objects.\n");
2122: return(rob);
2123: break;
2124: case SuniversalNumberSrationalFunction:
2125: warningKan("Koo() has not supported yet these objects.\n");
2126: return(rob);
2127: break;
2128: case SrationalFunctionSuniversalNumber:
2129: warningKan("Koo() has not supported yet these objects.\n");
2130: return(rob);
2131: break;
2132: */
2133:
2134: int KisInvalidRational(op)
2135: objectp op;
2136: {
2137: extern struct coeff *UniversalZero;
2138: if (op->tag != SrationalFunction) return(0);
2139: if (KisZeroObject(Kdenominator(*op))) {
2140: errorKan1("%s\n","KisInvalidRational(): zero division. You have f/0.");
2141: }
2142: if (KisZeroObject(Knumerator(*op))) {
2143: op->tag = SuniversalNumber;
2144: op->lc.universalNumber = UniversalZero;
2145: }
2146: return(0);
2147: }
2148:
2149: struct object KgbExtension(struct object obj)
2150: {
2151: char *key;
2152: int size;
2153: struct object keyo;
2154: struct object rob = NullObject;
2155: struct object obj1,obj2,obj3;
2156: POLY f1;
2157: POLY f2;
2158: POLY f3;
2159: POLY f;
2160: int m,i;
2161: struct pairOfPOLY pf;
2162:
2163: if (obj.tag != Sarray) errorKan1("%s\n","KgbExtension(): The argument must be an array.");
2164: size = getoaSize(obj);
2165: if (size < 1) errorKan1("%s\n","KgbExtension(): Empty array.");
2166: keyo = getoa(obj,0);
2167: if (keyo.tag != Sdollar) errorKan1("%s\n","KgbExtension(): No key word.");
2168: key = KopString(keyo);
2169:
2170: /* branch by the key word. */
2171: if (strcmp(key,"isReducible")==0) {
2172: if (size != 3) errorKan1("%s\n","[(isReducible) poly1 poly2] gbext.");
2173: obj1 = getoa(obj,1);
2174: obj2 = getoa(obj,2);
2175: if (obj1.tag != Spoly || obj2.tag != Spoly)
2176: errorKan1("%s\n","[(isReducible) poly1 poly2] gb.");
2177: f1 = KopPOLY(obj1);
2178: f2 = KopPOLY(obj2);
2179: rob = KpoInteger((*isReducible)(f1,f2));
2180: }else if (strcmp(key,"lcm") == 0) {
2181: if (size != 3) errorKan1("%s\n","[(lcm) poly1 poly2] gb.");
2182: obj1 = getoa(obj,1);
2183: obj2 = getoa(obj,2);
2184: if (obj1.tag != Spoly || obj2.tag != Spoly)
2185: errorKan1("%s\n","[(lcm) poly1 poly2] gbext.");
2186: f1 = KopPOLY(obj1);
2187: f2 = KopPOLY(obj2);
2188: rob = KpoPOLY((*lcm)(f1,f2));
2189: }else if (strcmp(key,"grade")==0) {
2190: if (size != 2) errorKan1("%s\n","[(grade) poly1 ] gbext.");
2191: obj1 = getoa(obj,1);
2192: if (obj1.tag != Spoly)
2193: errorKan1("%s\n","[(grade) poly1 ] gbext.");
2194: f1 = KopPOLY(obj1);
2195: rob = KpoInteger((*grade)(f1));
2196: }else if (strcmp(key,"mod")==0) {
2197: if (size != 3) errorKan1("%s\n","[(mod) poly num] gbext");
2198: obj1 = getoa(obj,1);
2199: obj2 = getoa(obj,2);
2200: if (obj1.tag != Spoly || obj2.tag != SuniversalNumber) {
2201: errorKan1("%s\n","The datatype of the argument mismatch: [(mod) polynomial universalNumber] gbext");
2202: }
2203: rob = KpoPOLY( modulopZ(KopPOLY(obj1),KopUniversalNumber(obj2)) );
2204: }else if (strcmp(key,"tomodp")==0) {
2205: /* The ring must be a ring of characteristic p. */
2206: if (size != 3) errorKan1("%s\n","[(tomod) poly ring] gbext");
2207: obj1 = getoa(obj,1);
2208: obj2 = getoa(obj,2);
2209: if (obj1.tag != Spoly || obj2.tag != Sring) {
2210: errorKan1("%s\n","The datatype of the argument mismatch: [(tomod) polynomial ring] gbext");
2211: }
2212: rob = KpoPOLY( modulop(KopPOLY(obj1),KopRingp(obj2)) );
2213: }else if (strcmp(key,"tomod0")==0) {
2214: /* Ring must be a ring of characteristic 0. */
2215: if (size != 3) errorKan1("%s\n","[(tomod0) poly ring] gbext");
2216: obj1 = getoa(obj,1);
2217: obj2 = getoa(obj,2);
2218: if (obj1.tag != Spoly || obj2.tag != Sring) {
2219: errorKan1("%s\n","The datatype of the argument mismatch: [(tomod0) polynomial ring] gbext");
2220: }
2221: errorKan1("%s\n","It has not been implemented.");
2222: rob = KpoPOLY( POLYNULL );
2223: }else if (strcmp(key,"divByN")==0) {
2224: if (size != 3) errorKan1("%s\n","[(divByN) poly num] gbext");
2225: obj1 = getoa(obj,1);
2226: obj2 = getoa(obj,2);
2227: if (obj1.tag != Spoly || obj2.tag != SuniversalNumber) {
2228: errorKan1("%s\n","The datatype of the argument mismatch: [(divByN) polynomial universalNumber] gbext");
2229: }
2230: pf = quotientByNumber(KopPOLY(obj1),KopUniversalNumber(obj2));
2231: rob = newObjectArray(2);
2232: putoa(rob,0,KpoPOLY(pf.first));
2233: putoa(rob,1,KpoPOLY(pf.second));
2234: }else if (strcmp(key,"isConstant")==0) {
2235: if (size != 2) errorKan1("%s\n","[(isConstant) poly ] gbext bool");
2236: obj1 = getoa(obj,1);
2237: if (obj1.tag != Spoly) {
2238: errorKan1("%s\n","The datatype of the argument mismatch: [(isConstant) polynomial] gbext");
2239: }
2240: return(KpoInteger(isConstant(KopPOLY(obj1))));
2241: }else if (strcmp(key,"schreyerSkelton") == 0) {
2242: if (size != 2) errorKan1("%s\n","[(schreyerSkelton) array_of_poly ] gbext array");
2243: obj1 = getoa(obj,1);
2244: return(KschreyerSkelton(obj1));
2245: }else if (strcmp(key,"lcoeff") == 0) {
2246: if (size != 2) errorKan1("%s\n","[(lcoeff) poly] gbext poly");
2247: obj1 = getoa(obj,1);
2248: if (obj1.tag != Spoly) errorKan1("%s\n","[(lcoeff) poly] gbext poly");
2249: f = KopPOLY(obj1);
2250: if (f == POLYNULL) return(KpoPOLY(f));
2251: return(KpoPOLY( newCell(coeffCopy(f->coeffp),newMonomial(f->m->ringp))));
2252: }else if (strcmp(key,"lmonom") == 0) {
2253: if (size != 2) errorKan1("%s\n","[(lmonom) poly] gbext poly");
2254: obj1 = getoa(obj,1);
2255: if (obj1.tag != Spoly) errorKan1("%s\n","[(lmonom) poly] gbext poly");
2256: f = KopPOLY(obj1);
2257: if (f == POLYNULL) return(KpoPOLY(f));
2258: return(KpoPOLY( newCell(intToCoeff(1,f->m->ringp),monomialCopy(f->m))));
2259: }else if (strcmp(key,"toes") == 0) {
2260: if (size != 2) errorKan1("%s\n","[(toes) array] gbext poly");
2261: obj1 = getoa(obj,1);
2262: if (obj1.tag != Sarray) errorKan1("%s\n","[(toes) array] gbext poly");
2263: return(KvectorToSchreyer_es(obj1));
1.3 takayama 2264: }else if (strcmp(key,"toe_") == 0) {
2265: if (size != 2) errorKan1("%s\n","[(toe_) array] gbext poly");
2266: obj1 = getoa(obj,1);
2267: if (obj1.tag == Spoly) return(obj1);
2268: if (obj1.tag != Sarray) errorKan1("%s\n","[(toe_) array] gbext poly");
2269: return(KpoPOLY(arrayToPOLY(obj1)));
1.1 maekawa 2270: }else if (strcmp(key,"isOrdered") == 0) {
2271: if (size != 2) errorKan1("%s\n","[(isOrdered) poly] gbext poly");
2272: obj1 = getoa(obj,1);
2273: if (obj1.tag != Spoly) errorKan1("%s\n","[(isOrdered) poly] gbext poly");
2274: return(KisOrdered(obj1));
2275: }else {
2276: errorKan1("%s\n","gbext : unknown tag.");
2277: }
2278: return(rob);
2279: }
2280:
2281: struct object KmpzExtension(struct object obj)
2282: {
2283: char *key;
2284: int size;
2285: struct object keyo;
2286: struct object rob = NullObject;
2287: struct object obj0,obj1,obj2,obj3;
2288: MP_INT *f;
2289: MP_INT *g;
2290: MP_INT *h;
2291: MP_INT *r0;
2292: MP_INT *r1;
2293: MP_INT *r2;
2294: int gi;
2295: extern struct ring *SmallRingp;
2296:
2297:
2298: if (obj.tag != Sarray) errorKan1("%s\n","KmpzExtension(): The argument must be an array.");
2299: size = getoaSize(obj);
2300: if (size < 1) errorKan1("%s\n","KmpzExtension(): Empty array.");
2301: keyo = getoa(obj,0);
2302: if (keyo.tag != Sdollar) errorKan1("%s\n","KmpzExtension(): No key word.");
2303: key = KopString(keyo);
2304:
2305: /* branch by the key word. */
2306: if (strcmp(key,"gcd")==0) {
2307: if (size != 3) errorKan1("%s\n","[(gcd) universalNumber universalNumber] mpzext.");
2308: obj1 = getoa(obj,1);
2309: obj2 = getoa(obj,2);
2310: if (obj1.tag != SuniversalNumber || obj2.tag != SuniversalNumber)
2311: errorKan1("%s\n","[(gcd) universalNumber universalNumber] mpzext.");
2312: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
2313: ! is_this_coeff_MP_INT(obj2.lc.universalNumber)) {
2314: errorKan1("%s\n","[(gcd) universalNumber universalNumber] mpzext.");
2315: }
2316: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2317: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2318: r1 = newMP_INT();
2319: mpz_gcd(r1,f,g);
2320: rob.tag = SuniversalNumber;
2321: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2322: }else if (strcmp(key,"tdiv_qr")==0) {
2323: if (size != 3) errorKan1("%s\n","[(tdiv_qr) universalNumber universalNumber] mpzext.");
2324: obj1 = getoa(obj,1);
2325: obj2 = getoa(obj,2);
2326: if (obj1.tag != SuniversalNumber || obj2.tag != SuniversalNumber)
2327: errorKan1("%s\n","[(tdiv_qr) universalNumber universalNumber] mpzext.");
2328: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
2329: ! is_this_coeff_MP_INT(obj2.lc.universalNumber)) {
2330: errorKan1("%s\n","[(tdiv_qr) universalNumber universalNumber] mpzext.");
2331: }
2332: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2333: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2334: r1 = newMP_INT();
2335: r2 = newMP_INT();
2336: mpz_tdiv_qr(r1,r2,f,g);
2337: obj1.tag = SuniversalNumber;
2338: obj1.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2339: obj2.tag = SuniversalNumber;
2340: obj2.lc.universalNumber = mpintToCoeff(r2,SmallRingp);
2341: rob = newObjectArray(2);
2342: putoa(rob,0,obj1); putoa(rob,1,obj2);
2343: } else if (strcmp(key,"cancel")==0) {
2344: if (size != 2) {
2345: errorKan1("%s\n","[(cancel) universalNumber/universalNumber] mpzext.");
2346: }
2347: obj0 = getoa(obj,1);
2348: if (obj0.tag == SuniversalNumber) return(obj0);
2349: if (obj0.tag != SrationalFunction) {
2350: errorKan1("%s\n","[(cancel) universalNumber/universalNumber] mpzext.");
2351: return(obj0);
2352: }
2353: obj1 = *(Knumerator(obj0));
2354: obj2 = *(Kdenominator(obj0));
2355: if (obj1.tag != SuniversalNumber || obj2.tag != SuniversalNumber) {
2356: errorKan1("%s\n","[(cancel) universalNumber/universalNumber] mpzext.");
2357: return(obj0);
2358: }
2359: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
2360: ! is_this_coeff_MP_INT(obj2.lc.universalNumber)) {
2361: errorKan1("%s\n","[(cancel) universalNumber/universalNumber] mpzext.");
2362: }
2363: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2364: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2365:
2366: r0 = newMP_INT();
2367: r1 = newMP_INT();
2368: r2 = newMP_INT();
2369: mpz_gcd(r0,f,g);
2370: mpz_divexact(r1,f,r0);
2371: mpz_divexact(r2,g,r0);
2372: obj1.tag = SuniversalNumber;
2373: obj1.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2374: obj2.tag = SuniversalNumber;
2375: obj2.lc.universalNumber = mpintToCoeff(r2,SmallRingp);
2376:
2377: rob = KnewRationalFunction0(copyObjectp(&obj1),copyObjectp(&obj2));
2378: KisInvalidRational(&rob);
2379: }else if (strcmp(key,"sqrt")==0 ||
2380: strcmp(key,"com")==0) {
2381: /* One arg functions */
2382: if (size != 2) errorKan1("%s\n","[key num] mpzext");
2383: obj1 = getoa(obj,1);
2384: if (obj1.tag != SuniversalNumber)
2385: errorKan1("%s\n","[key num] mpzext : num must be a universalNumber.");
2386: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber))
2387: errorKan1("%s\n","[key num] mpzext : num must be a universalNumber.");
2388: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2389: if (strcmp(key,"sqrt")==0) {
2390: r1 = newMP_INT();
2391: mpz_sqrt(r1,f);
2392: }else if (strcmp(key,"com")==0) {
2393: r1 = newMP_INT();
2394: mpz_com(r1,f);
2395: }
2396: rob.tag = SuniversalNumber;
2397: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2398: }else if (strcmp(key,"probab_prime_p")==0 ||
2399: strcmp(key,"and") == 0 ||
2400: strcmp(key,"ior")==0) {
2401: /* Two args functions */
2402: if (size != 3) errorKan1("%s\n","[key num1 num2] mpzext.");
2403: obj1 = getoa(obj,1);
2404: obj2 = getoa(obj,2);
2405: if (obj1.tag != SuniversalNumber || obj2.tag != SuniversalNumber)
2406: errorKan1("%s\n","[key num1 num2] mpzext.");
2407: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
2408: ! is_this_coeff_MP_INT(obj2.lc.universalNumber)) {
2409: errorKan1("%s\n","[key num1 num2] mpzext.");
2410: }
2411: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2412: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2413: if (strcmp(key,"probab_prime_p")==0) {
2414: gi = (int) mpz_get_si(g);
2415: if (mpz_probab_prime_p(f,gi)) {
2416: rob = KpoInteger(1);
2417: }else {
2418: rob = KpoInteger(0);
2419: }
2420: }else if (strcmp(key,"and")==0) {
2421: r1 = newMP_INT();
2422: mpz_and(r1,f,g);
2423: rob.tag = SuniversalNumber;
2424: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2425: }else if (strcmp(key,"ior")==0) {
2426: r1 = newMP_INT();
2427: mpz_ior(r1,f,g);
2428: rob.tag = SuniversalNumber;
2429: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2430: }
2431:
2432: }else if (strcmp(key,"powm")==0) {
2433: /* three args */
2434: if (size != 4) errorKan1("%s\n","[key num1 num2 num3] mpzext");
2435: obj1 = getoa(obj,1); obj2 = getoa(obj,2); obj3 = getoa(obj,3);
2436: if (obj1.tag != SuniversalNumber ||
2437: obj2.tag != SuniversalNumber ||
2438: obj3.tag != SuniversalNumber ) {
2439: errorKan1("%s\n","[key num1 num2 num3] mpzext : num1, num2 and num3 must be universalNumbers.");
2440: }
2441: if (! is_this_coeff_MP_INT(obj1.lc.universalNumber) ||
2442: ! is_this_coeff_MP_INT(obj2.lc.universalNumber) ||
2443: ! is_this_coeff_MP_INT(obj3.lc.universalNumber)) {
2444: errorKan1("%s\n","[key num1 num2 num3] mpzext : num1, num2 and num3 must be universalNumbers.");
2445: }
2446: f = coeff_to_MP_INT(obj1.lc.universalNumber);
2447: g = coeff_to_MP_INT(obj2.lc.universalNumber);
2448: h = coeff_to_MP_INT(obj3.lc.universalNumber);
2449: if (mpz_sgn(g) < 0) errorKan1("%s\n","[(powm) base exp mod] mpzext : exp must not be negative.");
2450: r1 = newMP_INT();
2451: mpz_powm(r1,f,g,h);
2452: rob.tag = SuniversalNumber;
2453: rob.lc.universalNumber = mpintToCoeff(r1,SmallRingp);
2454: }else {
2455: errorKan1("%s\n","mpzExtension(): Unknown tag.");
2456: }
2457: return(rob);
2458: }
2459:
2460:
2461: /** : context */
2462: struct object KnewContext(struct object superObj,char *name) {
2463: struct context *cp;
2464: struct object ob;
2465: if (superObj.tag != Sclass) {
2466: errorKan1("%s\n","The argument of KnewContext must be a Class.Context");
2467: }
2468: if (superObj.lc.ival != CLASSNAME_CONTEXT) {
2469: errorKan1("%s\n","The argument of KnewContext must be a Class.Context");
2470: }
2471: cp = newContext0((struct context *)(superObj.rc.voidp),name);
2472: ob.tag = Sclass;
2473: ob.lc.ival = CLASSNAME_CONTEXT;
2474: ob.rc.voidp = cp;
2475: return(ob);
2476: }
2477:
2478: struct object KcreateClassIncetance(struct object ob1,
2479: struct object ob2,
2480: struct object ob3)
2481: {
2482: /* [class-tag super-obj] size [class-tag] cclass */
2483: struct object ob4;
2484: int size,size2,i;
2485: struct object ob5;
2486: struct object rob;
2487:
2488: if (ob1.tag != Sarray)
2489: errorKan1("%s\n","cclass: The first argument must be an array.");
2490: if (getoaSize(ob1) < 1)
2491: errorKan1("%s\n","cclass: The first argument must be [class-tag ....].");
2492: ob4 = getoa(ob1,0);
2493: if (ectag(ob4) != CLASSNAME_CONTEXT)
2494: errorKan1("%s\n","cclass: The first argument must be [class-tag ....].");
2495:
2496: if (ob2.tag != Sinteger)
2497: errorKan1("%s\n","cclass: The second argument must be an integer.");
2498: size = KopInteger(ob2);
2499: if (size < 1)
2500: errorKan1("%s\n","cclass: The size must be > 0.");
2501:
2502: if (ob3.tag != Sarray)
2503: errorKan1("%s\n","cclass: The third argument must be an array.");
2504: if (getoaSize(ob3) < 1)
2505: errorKan1("%s\n","cclass: The third argument must be [class-tag].");
2506: ob5 = getoa(ob3,0);
2507: if (ectag(ob5) != CLASSNAME_CONTEXT)
2508: errorKan1("%s\n","cclass: The third argument must be [class-tag].");
2509:
2510: rob = newObjectArray(size);
2511: putoa(rob,0,ob5);
2512: if (getoaSize(ob1) < size) size2 = getoaSize(ob1);
2513: else size2 = size;
2514: for (i=1; i<size2; i++) {
2515: putoa(rob,i,getoa(ob1,i));
2516: }
2517: for (i=size2; i<size; i++) {
2518: putoa(rob,i,NullObject);
2519: }
2520: return(rob);
2521: }
2522:
2523:
2524: struct object KpoDouble(double a) {
2525: struct object rob;
2526: rob.tag = Sdouble;
2527: /* rob.lc.dbl = (double *)sGC_malloc_atomic(sizeof(double)); */
2528: rob.lc.dbl = (double *)sGC_malloc(sizeof(double));
2529: if (rob.lc.dbl == (double *)NULL) {
2530: fprintf(stderr,"No memory.\n"); exit(10);
2531: }
2532: *(rob.lc.dbl) = a;
2533: return(rob);
2534: }
2535:
2536: double toDouble0(struct object ob) {
2537: double r;
2538: int r3;
2539: struct object ob2;
2540: struct object ob3;
2541: switch(ob.tag) {
2542: case Sinteger:
2543: return( (double) (KopInteger(ob)) );
2544: case SuniversalNumber:
2545: return((double) coeffToInt(ob.lc.universalNumber));
2546: case SrationalFunction:
2547: /* The argument is assumed to be a rational number. */
2548: ob2 = newObjectArray(2); ob3 = KpoString("cancel");
2549: putoa(ob2,0,ob3); putoa(ob2,1,ob);
2550: ob = KmpzExtension(ob2);
2551: ob2 = *Knumerator(ob); ob3 = *Kdenominator(ob);
2552: r3 = coeffToInt(ob3.lc.universalNumber);
2553: if (r3 == 0) {
2554: errorKan1("%s\n","toDouble0(): Division by zero.");
2555: break;
2556: }
2557: r = ((double) coeffToInt(ob2.lc.universalNumber)) / ((double)r3);
2558: return(r);
2559: case Sdouble:
2560: return( KopDouble(ob) );
2561: default:
2562: errorKan1("%s\n","toDouble0(): This type of conversion is not supported.");
2563: break;
2564: }
2565: return(0.0);
2566: }
2567:
2568: struct object KpoGradedPolySet(struct gradedPolySet *grD) {
2569: struct object rob;
2570: rob.tag = Sclass;
2571: rob.lc.ival = CLASSNAME_GradedPolySet;
2572: rob.rc.voidp = (void *) grD;
2573: return(rob);
2574: }
2575:
2576: static char *getspace0(int a) {
2577: char *s;
2578: a = (a > 0? a:-a);
2579: s = (char *) sGC_malloc(a+1);
2580: if (s == (char *)NULL) {
2581: errorKan1("%s\n","no more memory.");
2582: }
2583: return(s);
2584: }
2585: struct object KdefaultPolyRing(struct object ob) {
2586: struct object rob;
2587: int i,j,k,n;
2588: struct object ob1,ob2,ob3,ob4,ob5;
2589: struct object t1;
2590: char *s1;
2591: extern struct ring *CurrentRingp;
2592: static struct ring *a[N0];
2593:
2594: rob = NullObject;
2595: if (ob.tag != Sinteger) {
2596: errorKan1("%s\n","KdefaultPolyRing(): the argument must be integer.");
2597: }
2598: n = KopInteger(ob);
2599: if (n <= 0) {
2600: /* initializing */
2601: for (i=0; i<N0; i++) {
2602: a[i] = (struct ring*) NULL;
2603: }
2604: return(rob);
2605: }
2606:
2607: if ( a[n] != (struct ring*)NULL) return(KpoRingp(a[n]));
2608:
2609: /* Let's construct ring of polynomials of 2n variables */
2610: /* x variables */
2611: ob1 = newObjectArray(n);
2612: for (i=0; i<n; i++) {
2613: s1 = getspace0(1+ ((n-i)/10) + 1);
2614: sprintf(s1,"x%d",n-i);
2615: putoa(ob1,i,KpoString(s1));
2616: }
2617: ob2 = newObjectArray(n);
2618: s1 = getspace0(1);
2619: sprintf(s1,"h");
2620: putoa(ob2,0,KpoString(s1));
2621: for (i=1; i<n; i++) {
2622: s1 = getspace0(1+((n+n-i)/10)+1);
2623: sprintf(s1,"x%d",n+n-i);
2624: putoa(ob2,i,KpoString(s1));
2625: }
2626:
2627: ob3 = newObjectArray(9);
2628: putoa(ob3,0,KpoInteger(0));
2629: for (i=1; i<9; i++) {
2630: putoa(ob3,i,KpoInteger(n));
2631: }
2632:
2633: ob4 = newObjectArray(2*n);
2634: t1 = newObjectArray(2*n);
2635: for (i=0; i<2*n; i++) {
2636: putoa(t1,i,KpoInteger(1));
2637: }
2638: putoa(ob4,0,t1);
2639: for (i=1; i<2*n; i++) {
2640: t1 = newObjectArray(2*n);
2641: for (j=0; j<2*n; j++) {
2642: putoa(t1,j,KpoInteger(0));
2643: if (j == (2*n-i)) {
2644: putoa(t1,j,KpoInteger(-1));
2645: }
2646: }
2647: putoa(ob4,i,t1);
2648: }
2649:
2650: ob5 = newObjectArray(2);
2651: putoa(ob5,0,KpoString("mpMult"));
2652: putoa(ob5,1,KpoString("poly"));
2653:
2654: KsetUpRing(ob1,ob2,ob3,ob4,ob5);
2655: a[n] = CurrentRingp;
2656: return(KpoRingp(a[n]));
2657: }
2658:
2659:
2660:
2661:
2662:
2663: /******************************************************************
2664: error handler
2665: ******************************************************************/
2666:
2667: errorKan1(str,message)
2668: char *str;
2669: char *message;
2670: {
2671: extern char *GotoLabel;
2672: extern int GotoP;
2673: extern int ErrorMessageMode;
2674: char tmpc[1024];
2675: if (ErrorMessageMode == 1 || ErrorMessageMode == 2) {
2676: sprintf(tmpc,"\nERROR(kanExport[0|1].c): ");
2677: if (strlen(message) < 900) {
2678: strcat(tmpc,message);
2679: }
2680: pushErrorStack(KnewErrorPacket(SerialCurrent,-1,tmpc));
2681: }
2682: if (ErrorMessageMode != 1) {
2683: fprintf(stderr,"\nERROR(kanExport[0|1].c): ");
2684: fprintf(stderr,str,message);
2685: }
2686: /* fprintf(stderr,"Hello "); */
2687: if (GotoP) {
2688: /* fprintf(stderr,"Hello. GOTO "); */
2689: fprintf(Fstack,"The interpreter was looking for the label <<%s>>. It is also aborted.\n",GotoLabel);
2690: GotoP = 0;
2691: }
2692: stdOperandStack(); contextControl(CCRESTORE);
2693: /* fprintf(stderr,"Now. Long jump!\n"); */
2694: longjmp(EnvOfStackMachine,1);
2695: }
2696:
2697: warningKan(str)
2698: char *str;
2699: {
2700: extern int WarningMessageMode;
2701: extern int Strict;
2702: char tmpc[1024];
2703: if (WarningMessageMode == 1 || WarningMessageMode == 2) {
2704: sprintf(tmpc,"\nWARNING(kanExport[0|1].c): ");
2705: if (strlen(str) < 900) {
2706: strcat(tmpc,str);
2707: }
2708: pushErrorStack(KnewErrorPacket(SerialCurrent,-1,tmpc));
2709: }
2710: if (WarningMessageMode != 1) {
2711: fprintf(stderr,"\nWARNING(kanExport[0|1].c): ");
2712: fprintf(stderr,str);
2713: fprintf(stderr,"\n");
2714: }
2715: /* if (Strict) errorKan1("%s\n"," "); */
2716: if (Strict) errorKan1("%s\n",str);
1.4 takayama 2717: return(0);
2718: }
2719:
2720: warningKanNoStrictMode(str)
2721: char *str;
2722: {
2723: extern int Strict;
2724: int t;
2725: t = Strict;
2726: Strict = 0;
2727: warningKan(str);
2728: Strict = t;
1.1 maekawa 2729: return(0);
2730: }
2731:
2732:
2733:
2734:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>