===================================================================
RCS file: /home/cvs/OpenXM_contrib2/asir2000/engine/Q.c,v
retrieving revision 1.1.1.1
retrieving revision 1.6
diff -u -p -r1.1.1.1 -r1.6
--- OpenXM_contrib2/asir2000/engine/Q.c	1999/12/03 07:39:08	1.1.1.1
+++ OpenXM_contrib2/asir2000/engine/Q.c	2000/12/08 06:43:10	1.6
@@ -1,4 +1,52 @@
-/* $OpenXM: OpenXM/src/asir99/engine/Q.c,v 1.1.1.1 1999/11/10 08:12:26 noro Exp $ */
+/*
+ * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED 
+ * All rights reserved.
+ * 
+ * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
+ * non-exclusive and royalty-free license to use, copy, modify and
+ * redistribute, solely for non-commercial and non-profit purposes, the
+ * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
+ * conditions of this Agreement. For the avoidance of doubt, you acquire
+ * only a limited right to use the SOFTWARE hereunder, and FLL or any
+ * third party developer retains all rights, including but not limited to
+ * copyrights, in and to the SOFTWARE.
+ * 
+ * (1) FLL does not grant you a license in any way for commercial
+ * purposes. You may use the SOFTWARE only for non-commercial and
+ * non-profit purposes only, such as academic, research and internal
+ * business use.
+ * (2) The SOFTWARE is protected by the Copyright Law of Japan and
+ * international copyright treaties. If you make copies of the SOFTWARE,
+ * with or without modification, as permitted hereunder, you shall affix
+ * to all such copies of the SOFTWARE the above copyright notice.
+ * (3) An explicit reference to this SOFTWARE and its copyright owner
+ * shall be made on your publication or presentation in any form of the
+ * results obtained by use of the SOFTWARE.
+ * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
+ * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
+ * for such modification or the source code of the modified part of the
+ * SOFTWARE.
+ * 
+ * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
+ * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
+ * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
+ * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
+ * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
+ * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
+ * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
+ * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
+ * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
+ * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
+ * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
+ * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
+ * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
+ * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
+ * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
+ * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
+ * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
+ *
+ * $OpenXM: OpenXM_contrib2/asir2000/engine/Q.c,v 1.5 2000/08/22 05:04:04 noro Exp $ 
+*/
 #include "ca.h"
 #include "base.h"
 #include "inline.h"
@@ -172,6 +220,28 @@ Q n1,n2,*nq;
 	}
 }
 
+void divsq(n1,n2,nq)
+Q n1,n2,*nq;
+{
+	Q m;
+	int sgn;
+	N tn;
+
+	if ( !n2 ) {
+		error("division by 0");
+		*nq = 0;
+		return;
+	} else if ( !n1 ) 
+		*nq = 0;
+	else if ( n1 == n2 ) 
+		*nq = ONE;
+	else {
+		divsn(NM(n1),NM(n2),&tn);
+		sgn = SGN(n1)*SGN(n2);
+		NTOQ(tn,sgn,*nq);
+	}
+}
+
 void invq(n,nr)
 Q n,*nr;
 {
@@ -302,6 +372,8 @@ Q *nr;
 	}
 }
 
+/* t = [nC0 nC1 ... nCn] */
+
 void mkbc(n,t)
 int n;
 Q *t;
@@ -315,6 +387,50 @@ Q *t;
 	}
 	for ( ; i <= n; i++ )
 		t[i] = t[n-i];
+}
+
+/*
+ *  Dx^k*x^l = W(k,l,0)*x^l*Dx^k+W(k,l,1)*x^(l-1)*x^(k-1)*+...
+ *
+ *  t = [W(k,l,0) W(k,l,1) ... W(k,l,min(k,l)]
+ *  where W(k,l,i) = i! * kCi * lCi
+ */
+
+void mkwc(k,l,t)
+int k,l;
+Q *t;
+{
+	int i,n,up,low;
+	N nm,d,c;
+
+	n = MIN(k,l);
+	for ( t[0] = ONE, i = 1; i <= n; i++ ) {
+		DM(k-i+1,l-i+1,up,low);
+		if ( up ) {
+			nm = NALLOC(2); PL(nm) = 2; BD(nm)[0] = low; BD(nm)[1] = up;
+		} else {
+			nm = NALLOC(1); PL(nm) = 1; BD(nm)[0] = low;
+		}
+		kmuln(NM(t[i-1]),nm,&d); divin(d,i,&c); NTOQ(c,1,t[i]);
+	}
+}
+
+/* mod m table */
+/* XXX : should be optimized */
+
+void mkwcm(k,l,m,t)
+int k,l,m;
+int *t;
+{
+	int i,n;
+	Q *s;
+
+	n = MIN(k,l);
+	s = (Q *)ALLOCA((n+1)*sizeof(Q));
+	mkwc(k,l,s);
+	for ( i = 0; i <= n; i++ ) {
+		t[i] = rem(NM(s[i]),m);
+	}
 }
 
 void factorial(n,r)