| version 1.27, 2004/08/28 07:28:54 |
version 1.35, 2004/09/15 06:40:26 |
|
|
| /* $OpenXM: OpenXM/src/kan96xx/Kan/kanExport0.c,v 1.26 2004/08/23 08:33:55 takayama Exp $ */ |
/* $OpenXM: OpenXM/src/kan96xx/Kan/kanExport0.c,v 1.34 2004/09/13 11:24:11 takayama Exp $ */ |
| #include <stdio.h> |
#include <stdio.h> |
| #include "datatype.h" |
#include "datatype.h" |
| #include "stackm.h" |
#include "stackm.h" |
| Line 687 KooEqualQ(obj1,obj2) |
|
| Line 687 KooEqualQ(obj1,obj2) |
|
| { |
{ |
| struct object ob; |
struct object ob; |
| int i; |
int i; |
| |
extern int Verbose; |
| if (obj1.tag != obj2.tag) { |
if (obj1.tag != obj2.tag) { |
| warningKan("KooEqualQ(ob1,ob2): the datatypes of ob1 and ob2 are not same. Returns false (0).\n"); |
warningKan("KooEqualQ(ob1,ob2): the datatypes of ob1 and ob2 are not same. Returns false (0).\n"); |
| |
if (Verbose & 0x10) { |
| |
fprintf(stderr,"obj1="); |
| |
printObject(obj1,0,stderr); |
| |
fprintf(stderr,", obj2="); |
| |
printObject(obj2,0,stderr); |
| |
fprintf(stderr,"\n"); fflush(stderr); |
| |
} |
| return(0); |
return(0); |
| } |
} |
| switch(obj1.tag) { |
switch(obj1.tag) { |
| Line 919 struct object KdataConversion(obj,key) |
|
| Line 927 struct object KdataConversion(obj,key) |
|
| return(rob); |
return(rob); |
| }else if (strcmp(key,"poly") == 0) { |
}else if (strcmp(key,"poly") == 0) { |
| rob = KpoPOLY(ZERO); |
rob = KpoPOLY(ZERO); |
| |
return rob; |
| |
}else if (strcmp(key,"array") == 0) { |
| |
rob = newObjectArray(0); |
| |
return rob; |
| }else{ |
}else{ |
| warningKan("Sorry. The data conversion from null to this data type has not supported yet.\n"); |
warningKan("Sorry. The data conversion from null to this data type has not supported yet.\n"); |
| } |
} |
| Line 1015 struct object KdataConversion(obj,key) |
|
| Line 1027 struct object KdataConversion(obj,key) |
|
| if (strcmp(key,"array") == 0) { |
if (strcmp(key,"array") == 0) { |
| return(rob); |
return(rob); |
| }else if (strcmp(key,"list") == 0) { |
}else if (strcmp(key,"list") == 0) { |
| rob = *( arrayToList(obj) ); |
rob = KarrayToList(obj); |
| return(rob); |
return(rob); |
| }else if (strcmp(key,"arrayOfPOLY")==0) { |
}else if (strcmp(key,"arrayOfPOLY")==0) { |
| rob = KpoArrayOfPOLY(arrayToArrayOfPOLY(obj)); |
rob = KpoArrayOfPOLY(arrayToArrayOfPOLY(obj)); |
| Line 1108 struct object KdataConversion(obj,key) |
|
| Line 1120 struct object KdataConversion(obj,key) |
|
| break; |
break; |
| case Slist: |
case Slist: |
| if (strcmp(key,"array") == 0) { |
if (strcmp(key,"array") == 0) { |
| rob = listToArray(&obj); |
rob = KlistToArray(obj); |
| return(rob); |
return(rob); |
| } |
} |
| break; |
break; |
| Line 1211 struct object KdataConversion(obj,key) |
|
| Line 1223 struct object KdataConversion(obj,key) |
|
| } |
} |
| return(NullObject); |
return(NullObject); |
| } |
} |
| |
|
| |
/* cf. macro to_int32 */ |
| |
struct object Kto_int32(struct object ob) { |
| |
int n,i; |
| |
struct object otmp; |
| |
struct object rob; |
| |
if (ob.tag == SuniversalNumber) return KdataConversion(ob,"integer"); |
| |
if (ob.tag == Sarray) { |
| |
n = getoaSize(ob); |
| |
rob = newObjectArray(n); |
| |
for (i=0; i<n; i++) { |
| |
otmp = Kto_int32(getoa(ob,i)); |
| |
putoa(rob,i,otmp); |
| |
} |
| |
return rob; |
| |
} |
| |
return ob; |
| |
} |
| /* conversion functions between primitive data and objects. |
/* conversion functions between primitive data and objects. |
| If it's not time critical, it is recommended to use these functions */ |
If it's not time critical, it is recommended to use these functions */ |
| struct object KpoInteger(k) |
struct object KpoInteger(k) |
| Line 1579 int KsetUpRing(ob1,ob2,ob3,ob4,ob5) |
|
| Line 1608 int KsetUpRing(ob1,ob2,ob3,ob4,ob5) |
|
| outputVars[i] = i; |
outputVars[i] = i; |
| } |
} |
| } |
} |
| |
|
| |
ob4 = Kto_int32(ob4); /* order matrix */ |
| oasize = getoaSize(ob4); |
oasize = getoaSize(ob4); |
| order = (int *)sGC_malloc(sizeof(int)*((2*n)*oasize+1)); |
order = (int *)sGC_malloc(sizeof(int)*((2*n)*oasize+1)); |
| if (order == (int *)NULL) errorKan1("%s\n","No memory."); |
if (order == (int *)NULL) errorKan1("%s\n","No memory."); |
| Line 1624 int KsetUpRing(ob1,ob2,ob3,ob4,ob5) |
|
| Line 1654 int KsetUpRing(ob1,ob2,ob3,ob4,ob5) |
|
| newRingp->degreeShiftSize = 0; |
newRingp->degreeShiftSize = 0; |
| newRingp->degreeShiftN = 0; |
newRingp->degreeShiftN = 0; |
| newRingp->degreeShift = NULL; |
newRingp->degreeShift = NULL; |
| |
newRingp->partialEcart = 0; |
| |
newRingp->partialEcartGlobalVarX = NULL; |
| |
|
| if (ob5.tag != Sarray || (getoaSize(ob5) % 2) != 0) { |
if (ob5.tag != Sarray || (getoaSize(ob5) % 2) != 0) { |
| errorKan1("%s\n","[(keyword) value (keyword) value ....] should be given."); |
errorKan1("%s\n","[(keyword) value (keyword) value ....] should be given."); |
| Line 1704 int KsetUpRing(ob1,ob2,ob3,ob4,ob5) |
|
| Line 1736 int KsetUpRing(ob1,ob2,ob3,ob4,ob5) |
|
| } |
} |
| } |
} |
| } |
} |
| |
} else if (strcmp(KopString(getoa(ob5,i)),"partialEcartGlobalVarX") == 0) { |
| |
if (getoa(ob5,i+1).tag != Sarray) { |
| |
errorKan1("%s\n","An array of array should be given. (partialEcart)"); |
| |
} |
| |
{ |
| |
struct object odv; |
| |
struct object ovv; |
| |
int k,j,nn; |
| |
char *vname; |
| |
odv=getoa(ob5,i+1); |
| |
nn = getoaSize(odv); |
| |
newRingp->partialEcart = nn; |
| |
newRingp->partialEcartGlobalVarX = (int *) sGC_malloc(sizeof(int)*nn+1); |
| |
if (newRingp->partialEcartGlobalVarX == NULL) errorKan1("%s\n","No more memory."); |
| |
for (j=0; j<nn; j++) |
| |
(newRingp->partialEcartGlobalVarX)[j] = -1; |
| |
for (j=0; j<nn; j++) { |
| |
ovv = getoa(odv,j); |
| |
if (ovv.tag != Sdollar) errorKan1("%s\n","partialEcartGlobalVarX: string is expected."); |
| |
vname = KopString(ovv); |
| |
for (k=0; k<n; k++) { |
| |
if (strcmp(vname,xvars[k]) == 0) { |
| |
(newRingp->partialEcartGlobalVarX)[j] = k; break; |
| |
}else{ |
| |
if (k == n-1) errorKan1("%s\n","partialEcartGlobalVarX: no such variable."); |
| |
} |
| |
} |
| |
} |
| |
} |
| |
|
| switch_function("grade","module1v"); |
switch_function("grade","module1v"); |
| /* Warning: grading is changed to module1v!! */ |
/* Warning: grading is changed to module1v!! */ |
| } else { |
} else { |
| Line 2928 struct object KdefaultPolyRing(struct object ob) { |
|
| Line 2990 struct object KdefaultPolyRing(struct object ob) { |
|
| } |
} |
| |
|
| |
|
| |
struct object Krest(struct object ob) { |
| |
struct object rob; |
| |
struct object *op; |
| |
int n,i; |
| |
if (ob.tag == Sarray) { |
| |
n = getoaSize(ob); |
| |
if (n == 0) return ob; |
| |
rob = newObjectArray(n-1); |
| |
for (i=1; i<n; i++) { |
| |
putoa(rob,i-1,getoa(ob,i)); |
| |
} |
| |
return rob; |
| |
}else if ((ob.tag == Slist) || (ob.tag == Snull)) { |
| |
return Kcdr(ob); |
| |
}else{ |
| |
errorKan1("%s\n","Krest(ob): ob must be an array or a list."); |
| |
} |
| |
} |
| |
struct object Kjoin(struct object ob1, struct object ob2) { |
| |
struct object rob; |
| |
int n1,n2,i; |
| |
if ((ob1.tag == Sarray) && (ob2.tag == Sarray)) { |
| |
n1 = getoaSize(ob1); n2 = getoaSize(ob2); |
| |
rob = newObjectArray(n1+n2); |
| |
for (i=0; i<n1; i++) { |
| |
putoa(rob,i,getoa(ob1,i)); |
| |
} |
| |
for (i=n1; i<n1+n2; i++) { |
| |
putoa(rob,i,getoa(ob2,i-n1)); |
| |
} |
| |
return rob; |
| |
}else if ((ob1.tag == Slist) || (ob1.tag == Snull)) { |
| |
if ((ob2.tag == Slist) || (ob2.tag == Snull)) { |
| |
return KvJoin(ob1,ob2); |
| |
}else{ |
| |
errorKan1("%s\n","Kjoin: both argument must be a list."); |
| |
} |
| |
}else{ |
| |
errorKan1("%s\n","Kjoin: arguments must be arrays."); |
| |
} |
| |
} |
| |
|
| |
struct object Kget(struct object ob1, struct object ob2) { |
| |
struct object rob; |
| |
struct object tob; |
| |
int i,j,size,n; |
| |
if (ob2.tag == Sinteger) { |
| |
i =ob2.lc.ival; |
| |
}else if (ob2.tag == SuniversalNumber) { |
| |
i = KopInteger(KdataConversion(ob2,"integer")); |
| |
}else if (ob2.tag == Sarray) { |
| |
n = getoaSize(ob2); |
| |
if (n == 0) return ob1; |
| |
rob = ob1; |
| |
for (i=0; i<n; i++) { |
| |
rob=Kget(rob,getoa(ob2,i)); |
| |
} |
| |
return rob; |
| |
} |
| |
if (ob1.tag == Sarray) { |
| |
size = getoaSize(ob1); |
| |
if ((0 <= i) && (i<size)) { |
| |
return(getoa(ob1,i)); |
| |
}else{ |
| |
errorKan1("%s\n","Kget: Index is out of bound. (get)\n"); |
| |
} |
| |
}else if (ob1.tag == Slist) { |
| |
rob = NullObject; |
| |
if (i < 0) errorKan1("%s\n","Kget: Index is negative. (get)"); |
| |
for (j=0; j<i; j++) { |
| |
rob = Kcdr(ob1); |
| |
if ((ob1.tag == Snull) && (rob.tag == Snull)) { |
| |
errorKan1("%s\n","Kget: Index is out of bound. (get) cdr of null list.\n"); |
| |
} |
| |
ob1 = rob; |
| |
} |
| |
return Kcar(ob1); |
| |
}else errorKan1("%s\n","Kget: argument must be an array or a list."); |
| |
} |
| |
|
| /****************************************************************** |
/****************************************************************** |
| error handler |
error handler |
| Line 2954 errorKan1(str,message) |
|
| Line 3093 errorKan1(str,message) |
|
| if (ErrorMessageMode != 1) { |
if (ErrorMessageMode != 1) { |
| fprintf(stderr,"\nERROR(kanExport[0|1].c): "); |
fprintf(stderr,"\nERROR(kanExport[0|1].c): "); |
| fprintf(stderr,str,message); |
fprintf(stderr,str,message); |
| |
(void) traceShowStack(); traceClearStack(); |
| } |
} |
| /* fprintf(stderr,"Hello "); */ |
/* fprintf(stderr,"Hello "); */ |
| if (GotoP) { |
if (GotoP) { |