===================================================================
RCS file: /home/cvs/OpenXM_contrib2/asir2000/builtin/var.c,v
retrieving revision 1.3
retrieving revision 1.9
diff -u -p -r1.3 -r1.9
--- OpenXM_contrib2/asir2000/builtin/var.c	2000/08/22 05:04:00	1.3
+++ OpenXM_contrib2/asir2000/builtin/var.c	2018/03/27 06:29:19	1.9
@@ -45,27 +45,61 @@
  * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
  * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
  *
- * $OpenXM: OpenXM_contrib2/asir2000/builtin/var.c,v 1.2 2000/08/21 08:31:21 noro Exp $ 
+ * $OpenXM: OpenXM_contrib2/asir2000/builtin/var.c,v 1.8 2015/12/02 13:12:31 noro Exp $ 
 */
 #include "ca.h"
 #include "parse.h"
 
-void Pvar(), Pvars(), Puc(), Pvars_recursive();
-void get_vars(Obj,VL *);
-void get_vars_recursive(Obj,VL *);
+void Pvar(), Pvars(), Puc(), Pvars_recursive(),Psimple_is_eq();
+void Pdelete_uc();
 
 struct ftab var_tab[] = {
 	{"var",Pvar,1},
 	{"vars",Pvars,1},
 	{"vars_recursive",Pvars_recursive,1},
 	{"uc",Puc,0},
+	{"delete_uc",Pdelete_uc,-1},
+	{"simple_is_eq",Psimple_is_eq,2},
 	{0,0,0},
 };
 
-void Pvar(arg,rp)
-NODE arg;
-Obj *rp;
+void Psimple_is_eq(NODE arg,Q *rp)
 {
+	int ret;
+
+	ret = is_eq(ARG0(arg),ARG1(arg));
+	STOQ(ret,*rp);
+}
+
+int is_eq(Obj a0,Obj a1)
+{
+	P p0,p1;
+	DCP dc0,dc1;
+
+	if ( !a0 ) return a1?0:1;
+	else if ( !a1 ) return 0;
+	else if ( OID(a0) != OID(a1) ) return 0;
+	else {
+		switch ( OID(a0) ) {
+			case O_P:
+				p0 = (P)a0; p1 = (P)a1;
+				if ( VR(p0) == VR(p1) ) {
+					for ( dc0 = DC(p0), dc1 = DC(p1); dc0 && dc1; dc0 = NEXT(dc0), dc1 = NEXT(dc1) ) {
+						if ( cmpq(DEG(dc0),DEG(dc1)) ) return 0;
+						if ( !is_eq((Obj)COEF(dc0),(Obj)COEF(dc1)) ) return 0;
+					}
+					return (dc0||dc1)?0:1;
+				} else return 0;
+				break;
+			default:
+				return !arf_comp(CO,a0,a1);
+				break;
+		}
+	}
+}
+
+void Pvar(NODE arg,Obj *rp)
+{
 	Obj t;
 	P p;
 	V vn,vd,v;
@@ -90,9 +124,7 @@ Obj *rp;
 		*rp = 0;
 }
 
-void Pvars(arg,rp)
-NODE arg;
-LIST *rp;
+void Pvars(NODE arg,LIST *rp)
 {
 	VL vl;
 	NODE n,n0;
@@ -107,9 +139,7 @@ LIST *rp;
 	MKLIST(*rp,n0);
 }
 
-void Pvars_recursive(arg,rp)
-NODE arg;
-LIST *rp;
+void Pvars_recursive(NODE arg,LIST *rp)
 {
 	VL vl;
 	NODE n,n0;
@@ -124,9 +154,7 @@ LIST *rp;
 	MKLIST(*rp,n0);
 }
 
-void get_vars_recursive(obj,vlp)
-Obj obj;
-VL *vlp;
+void get_vars_recursive(Obj obj,VL *vlp)
 {
 	VL vl,vl0,vl1,vl2,t;
 	PFINS ins;
@@ -148,9 +176,7 @@ VL *vlp;
 	mergev(CO,vl,vl0,vlp);
 }
 
-void get_vars(t,vlp)
-Obj t;
-VL *vlp;
+void get_vars(Obj t,VL *vlp)
 {
 	pointer *vb;
 	pointer **mb;
@@ -194,26 +220,63 @@ VL *vlp;
 					vl = vl2;
 				}
 				break;
+			case O_NBP:
+				n = BDY((NBP)t);
+				for ( vl = 0; n; n = NEXT(n) ) {
+					get_vars((Obj)(((NBM)BDY(n))->c),&vl1); 
+					mergev(CO,vl,vl1,&vl2);
+					vl = vl2;
+				}
+				break;
 			default:
 				vl = 0; break;
 		}
 	*vlp = vl;
 }
 
-void Puc(p)
-Obj *p;
+void Puc(Obj *p)
 {
 	VL vl;
 	V v;
 	P t;
 	char buf[BUFSIZ];
+	char *n,*nv;
 	static int UCN;
 
 	NEWV(v); v->attr = (pointer)V_UC;
 	sprintf(buf,"_%d",UCN++);
-	NAME(v) = (char *)CALLOC(strlen(buf)+1,sizeof(char));
+	nv = NAME(v) = (char *)CALLOC(strlen(buf)+1,sizeof(char));
 	strcpy(NAME(v),buf);
-	for ( vl = CO; NEXT(vl); vl = NEXT(vl) );
-	NEWVL(NEXT(vl)); VR(NEXT(vl)) = v; NEXT(NEXT(vl)) = 0;
+	for ( vl = CO; vl; vl = NEXT(vl) )
+		if ( (n=NAME(VR(vl))) && !strcmp(n,nv) ) break;
+		else if ( !NEXT(vl) ) {
+			NEWVL(NEXT(vl)); VR(NEXT(vl)) = v; NEXT(NEXT(vl)) = 0;
+			LASTCO = NEXT(vl);
+			break;
+		}
 	MKV(v,t); *p = (Obj)t;
+}
+
+void Pdelete_uc(NODE arg,Obj *p)
+{
+  VL vl,prev;
+  V v;
+
+  if ( argc(arg) == 1 ) {
+    asir_assert(ARG0(arg),O_P,"delete_uc");
+    v = VR((P)ARG0(arg));
+  } else
+    v = 0;
+
+  for ( prev = 0, vl = CO; vl; vl = NEXT(vl) ) {
+    if ( (!v || v == vl->v) && vl->v->attr == (pointer)V_UC ) {
+      if ( prev == 0 )
+        CO = NEXT(vl); 
+      else 
+        NEXT(prev) = NEXT(vl);
+    } else
+      prev = vl;
+  }
+  update_LASTCO();
+  *p = 0;
 }