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