Context Navigation

source: git/Singular/iparith.cc @ cc486c

spielwiese

Last change on this file since cc486c was cc486c, checked in by Hans Schönemann <hannes@…>, 26 years ago
* hannes: fiexed bug: could not apply maps without a name (e.g. f(g)(p)) git-svn-id: file:///usr/local/Singular/svn/trunk@2003 2c84dea3-7e68-4137-9b89-c4e89433aadc
Property mode set to `100644`
File size: 153.9 KB

Line
1	/****************************************
2	* Computer Algebra System SINGULAR *
3	****************************************/
4	/*
5	* ABSTRACT: table driven kernel interface, used by interpreter
6	*/
7
8	#include <stdlib.h>
9	#include <string.h>
10	#include <ctype.h>
11
12	#include <stdio.h>
13	#include <time.h>
14
15	#include <unistd.h>
16
17	#include "mod2.h"
18	#include "tok.h"
19	#include "ipid.h"
20	#include "intvec.h"
21	#include "mmemory.h"
22	#include "febase.h"
23	#include "longalg.h"
24	#include "polys.h"
25	#include "ideals.h"
26	#include "matpol.h"
27	#include "kstd1.h"
28	#include "timer.h"
29	#include "ring.h"
30	#include "subexpr.h"
31	#include "lists.h"
32	#include "numbers.h"
33	#include "stairc.h"
34	#include "maps.h"
35	#include "syz.h"
36	#include "weight.h"
37	#include "ipconv.h"
38	#include "ipprint.h"
39	#include "sing_dld.h"
40	#include "attrib.h"
41	#include "silink.h"
42	#ifdef HAVE_FACTORY
43	#include "clapsing.h"
44	#include "kstdfac.h"
45	#endif
46	#ifdef HAVE_FGLM
47	#include "fglm.h"
48	#endif
49	#include "ipshell.h"
50
51	/=============== types =====================/
52	struct sValCmdTab
53	{
54	short cmd;
55	short start;
56	};
57
58	typedef sValCmdTab jjValCmdTab[];
59
60	/* ifdef GENTABLE: definitions are in ipshell.h */
61	#ifndef GENTABLE
62	typedef char * (Proc1)(char );
63	struct sValCmd1
64	{
65	proc1 p;
66	short cmd;
67	short res;
68	short arg;
69	};
70
71	typedef BOOLEAN (*proc2)(leftv,leftv,leftv);
72	struct sValCmd2
73	{
74	proc2 p;
75	short cmd;
76	short res;
77	short arg1;
78	short arg2;
79	};
80
81	typedef BOOLEAN (*proc3)(leftv,leftv,leftv,leftv);
82	struct sValCmd3
83	{
84	proc3 p;
85	short cmd;
86	short res;
87	short arg1;
88	short arg2;
89	short arg3;
90	};
91	struct sValCmdM
92	{
93	proc1 p;
94	short cmd;
95	short res;
96	short number_of_args; /* -1: any, -2: any >0, .. */
97	};
98	#endif
99
100
101	/============= proc =======================/
102	static int iiTabIndex(const jjValCmdTab dArithTab, const int len, const int op);
103	#ifdef MDEBUG
104	#define jjMakeSub(A) jjDBMakeSub(A,__FILE__,__LINE__)
105	static Subexpr jjDBMakeSub(leftv e,char *f, int l);
106	#else
107	static Subexpr jjMakeSub(leftv e);
108	#endif
109
110
111	/============= vars ======================/
112	extern int cmdtok;
113	extern BOOLEAN expected_parms;
114
115	int iiOp; /* the current operation*/
116
117	#ifdef GENTABLE
118	cmdnames cmds[] =
119	{ // name-string alias tokval toktype
120	{ "$INVALID$", 0, -1, 0},
121	{ "and", 0, '&' , '&'},
122	{ "attrib", 0, ATTRIB_CMD , CMD_123},
123	{ "bareiss", 0, BAREISS_CMD , CMD_1},
124	{ "betti", 0, BETTI_CMD , CMD_1},
125	{ "break", 0, BREAK_CMD , BREAK_CMD},
126	{ "char", 0, CHARACTERISTIC_CMD ,CMD_1},
127	{ "char_series", 0, CHAR_SERIES_CMD , CMD_1},
128	{ "charstr", 0, CHARSTR_CMD , CMD_1},
129	{ "cleardenom", 0, CONTENT_CMD , CMD_1},
130	{ "close", 0, CLOSE_CMD , CMD_1},
131	{ "coef", 0, COEF_CMD , CMD_M},
132	{ "coeffs", 0, COEFFS_CMD , CMD_23},
133	{ "continue", 0, CONTINUE_CMD , CONTINUE_CMD},
134	{ "contract", 0, CONTRACT_CMD , CMD_2},
135	{ "dbprint", 0, DBPRINT_CMD , CMD_M},
136	{ "def", 0, DEF_CMD , ROOT_DECL},
137	{ "defined", 0, DEFINED_CMD , CMD_1},
138	{ "deg", 0, DEG_CMD , CMD_12},
139	{ "degree", 0, DEGREE_CMD , CMD_1},
140	{ "delete", 0, DELETE_CMD , CMD_2},
141	{ "det", 0, DET_CMD , CMD_1},
142	{ "diff", 0, DIFF_CMD , CMD_2},
143	{ "dim", 0, DIM_CMD , CMD_1},
144	{ "div", 0, INTDIV , INTDIV},
145	//#ifdef DRING
146	{ "dring", 0, DRING_CMD , DRING_CMD},
147	//#endif
148	{ "dump", 0, DUMP_CMD, CMD_1},
149	{ "extgcd", 0, EXTGCD_CMD , CMD_2},
150	{ "EXTGCD", 2, EXTGCD_CMD , CMD_2},
151	{ "eliminate", 0, ELIMINATION_CMD, CMD_23},
152	{ "else", 0, ELSE_CMD , ELSE_CMD},
153	{ "eval", 0, EVAL , EVAL},
154	{ "example", 0, EXAMPLE_CMD , EXAMPLE_CMD},
155	{ "execute", 0, EXECUTE_CMD , EXECUTE_CMD},
156	{ "export", 0, EXPORT_CMD , EXPORT_CMD},
157	{ "factorize", 0, FAC_CMD , CMD_12},
158	{ "fetch", 0, FETCH_CMD , CMD_2},
159	{ "fglm", 0, FGLM_CMD , CMD_2},
160	{ "find", 0, FIND_CMD , CMD_23},
161	{ "finduni", 0, FINDUNI_CMD, CMD_1},
162	{ "forif", 0, IF_CMD , IF_CMD},
163	{ "freemodule", 0, FREEMODULE_CMD , CMD_1},
164	{ "facstd", 0, FACSTD_CMD , CMD_12},
165	{ "gen", 0, E_CMD , CMD_1},
166	{ "getdump", 0, GETDUMP_CMD, CMD_1},
167	{ "gcd", 0, GCD_CMD , CMD_2},
168	{ "GCD", 2, GCD_CMD , CMD_2},
169	{ "hilb", 0, HILBERT_CMD , CMD_12},
170	{ "homog", 0, HOMOG_CMD , CMD_12},
171	{ "ideal", 0, IDEAL_CMD , IDEAL_CMD},
172	{ "if", 0, IF_CMD , IF_CMD},
173	{ "imap", 0, IMAP_CMD , CMD_2},
174	{ "indepSet", 0, INDEPSET_CMD , CMD_12},
175	{ "insert", 0, INSERT_CMD , CMD_23},
176	{ "int", 0, INT_CMD , ROOT_DECL},
177	{ "interred", 0, INTERRED_CMD , CMD_1},
178	{ "intersect", 0, INTERSECT_CMD , CMD_M},
179	{ "intmat", 0, INTMAT_CMD , INTMAT_CMD},
180	{ "intvec", 0, INTVEC_CMD , ROOT_DECL_LIST},
181	{ "jacob", 0, JACOB_CMD , CMD_1},
182	{ "jet", 0, JET_CMD , CMD_23},
183	{ "kbase", 0, KBASE_CMD , CMD_12},
184	{ "keepring", 0, KEEPRING_CMD , KEEPRING_CMD},
185	{ "kill", 0, KILL_CMD , KILL_CMD},
186	{ "killattrib", 0, KILLATTR_CMD , CMD_12},
187	{ "koszul", 0, KOSZUL_CMD , CMD_23},
188	{ "lead", 0, LEAD_CMD , CMD_1},
189	{ "leadcoef", 0, LEADCOEF_CMD , CMD_1},
190	{ "leadexp", 0, LEADEXP_CMD , CMD_1},
191	{ "LIB", 0, LIB_CMD , SYSVAR},
192	{ "lift", 0, LIFT_CMD , CMD_2},
193	{ "liftstd", 0, LIFTSTD_CMD , CMD_2},
194	{ "link", 0, LINK_CMD , ROOT_DECL},
195	{ "listvar", 0, LISTVAR_CMD , LISTVAR_CMD},
196	{ "list", 0, LIST_CMD , ROOT_DECL_LIST},
197	{ "lres", 0, LRES_CMD , CMD_2},
198	{ "map", 0, MAP_CMD , RING_DECL},
199	{ "matrix", 0, MATRIX_CMD , MATRIX_CMD},
200	{ "maxideal", 0, MAXID_CMD , CMD_1},
201	{ "memory", 0, MEMORY_CMD , CMD_1},
202	{ "minbase", 0, MINBASE_CMD , CMD_1},
203	{ "minor", 0, MINOR_CMD , CMD_2},
204	{ "minres", 0, MINRES_CMD , CMD_1},
205	{ "mod", 0, '%', '%'},
206	{ "module", 0, MODUL_CMD , MODUL_CMD},
207	{ "modulo", 0, MODULO_CMD , CMD_2},
208	{ "monitor", 0, MONITOR_CMD , CMD_12},
209	{ "mult", 0, MULTIPLICITY_CMD , CMD_1},
210	#ifdef OLD_RES
211	{ "mres", 0, MRES_CMD , CMD_23},
212	#else
213	{ "mres", 0, MRES_CMD , CMD_2},
214	#endif
215	{ "mstd", 0, MSTD_CMD , CMD_1},
216	{ "nameof", 0, NAMEOF_CMD , CMD_1},
217	{ "names", 0, NAMES_CMD , CMD_M},
218	{ "ncols", 0, COLS_CMD , CMD_1},
219	{ "not", 0, NOT , NOT},
220	{ "npars", 0, NPARS_CMD , CMD_1},
221	{ "nrows", 0, ROWS_CMD , CMD_1},
222	{ "number", 0, NUMBER_CMD , RING_DECL},
223	{ "nvars", 0, NVARS_CMD , CMD_1},
224	{ "open", 0, OPEN_CMD , CMD_1},
225	{ "option", 0, OPTION_CMD , CMD_M},
226	{ "or", 0, '\|' , '\|'},
227	{ "ord", 0, ORD_CMD , CMD_1},
228	{ "ordstr", 0, ORDSTR_CMD , CMD_1},
229	{ "package", 0, PACKAGE_CMD , ROOT_DECL},
230	{ "par", 0, PAR_CMD , CMD_1},
231	{ "parameter", 0, PARAMETER , PARAMETER},
232	{ "pardeg", 0, PARDEG_CMD , CMD_1},
233	{ "parstr", 0, PARSTR_CMD , CMD_12},
234	{ "poly", 0, POLY_CMD , RING_DECL},
235	{ "preimage", 0, PREIMAGE_CMD , CMD_3},
236	{ "prime", 0, PRIME_CMD , CMD_1},
237	{ "print", 0, PRINT_CMD , CMD_12},
238	{ "prune", 0, PRUNE_CMD , CMD_1},
239	{ "proc", 0, PROC_CMD , PROC_CMD},
240	{ "qring", 0, QRING_CMD , ROOT_DECL},
241	{ "quotient", 0, QUOTIENT_CMD , CMD_2},
242	{ "quote", 0, QUOTE , QUOTE},
243	{ "qhweight", 0, QHWEIGHT_CMD , CMD_1},
244	{ "random", 0, RANDOM_CMD , CMD_23},
245	{ "read", 0, READ_CMD , CMD_12},
246	{ "reduce", 0, REDUCE_CMD , CMD_23},
247	{ "regularity", 0, REGULARITY_CMD , CMD_1},
248	#ifdef OLD_RES
249	{ "res", 0, RES_CMD , CMD_23},
250	#else
251	{ "res", 0, RES_CMD , CMD_2},
252	#endif
253	{ "reservedName",0, RESERVEDNAME_CMD , CMD_M},
254	{ "resolution", 0, RESOLUTION_CMD , RING_DECL},
255	{ "resultant", 0, RESULTANT_CMD, CMD_3},
256	{ "return", 0, RETURN , RETURN},
257	{ "RETURN", 0, END_GRAMMAR , RETURN},
258	{ "ring", 0, RING_CMD , RING_CMD},
259	{ "rvar", 0, IS_RINGVAR , CMD_1},
260	{ "setring", 0, SETRING_CMD , SETRING_CMD},
261	{ "simplify", 0, SIMPLIFY_CMD , CMD_2},
262	{ "size", 0, COUNT_CMD , CMD_1},
263	{ "sortvec", 0, SORTVEC_CMD , CMD_1},
264	#ifdef OLD_RES
265	{ "sres", 0, SRES_CMD , CMD_23},
266	#else
267	{ "sres", 0, SRES_CMD , CMD_2},
268	#endif
269	{ "status", 0, STATUS_CMD, CMD_M},
270	{ "std", 0, STD_CMD , CMD_12},
271	{ "string", 0, STRING_CMD , ROOT_DECL_LIST},
272	{ "subst", 0, SUBST_CMD , CMD_3},
273	{ "system", 0, SYSTEM_CMD, CMD_M},
274	{ "syz", 0, SYZYGY_CMD , CMD_1},
275	{ "test", 0, TEST_CMD , CMD_M},
276	{ "trace", 0, TRACE_CMD , CMD_1},
277	{ "transpose", 0, TRANSPOSE_CMD , CMD_1},
278	{ "type", 0, TYPE_CMD , TYPE_CMD},
279	{ "typeof", 0, TYPEOF_CMD , CMD_1},
280	{ "var", 0, VAR_CMD , CMD_1},
281	{ "varstr", 0, VARSTR_CMD , CMD_12},
282	{ "vdim", 0, VDIM_CMD , CMD_1},
283	{ "vector", 0, VECTOR_CMD , RING_DECL},
284	{ "wedge", 0, WEDGE_CMD , CMD_2},
285	{ "weight", 0, WEIGHT_CMD , CMD_1},
286	{ "whileif", 0, IF_CMD , IF_CMD},
287	{ "write", 0, WRITE_CMD , CMD_M},
288	/* delete for next version:*/
289	{ "IN", 1, LEAD_CMD , CMD_1},
290	{ "NF", 1, REDUCE_CMD , CMD_23},
291	{ "multiplicity",1, MULTIPLICITY_CMD , CMD_1},
292	{ "verbose", 2, OPTION_CMD , CMD_M},
293	// { "rank", 1, ROWS_CMD , CMD_1},
294
295	/* set sys vars*/
296	//#ifdef SRING
297	{ "alternating", 0, VALTVARS , SYSVAR},
298	//#endif
299	{ "degBound", 0, VMAXDEG , SYSVAR},
300	{ "echo", 0, VECHO , SYSVAR},
301	{ "minpoly", 0, VMINPOLY , SYSVAR},
302	{ "multBound", 0, VMAXMULT , SYSVAR},
303	{ "noether", 0, VNOETHER , SYSVAR},
304	{ "pagelength", 0, VPAGELENGTH , SYSVAR},
305	{ "pagewidth", 0, VCOLMAX , SYSVAR},
306	{ "printlevel", 0, VPRINTLEVEL , SYSVAR},
307	{ "short", 0, VSHORTOUT , SYSVAR},
308	{ "timer", 0, VTIMER , SYSVAR},
309	{ "rtimer", 0, VRTIMER, SYSVAR},
310	{ "TRACE", 0, TRACE , SYSVAR},
311	{ "voice", 0, VOICE , SYSVAR},
312
313
314	/* other reserved words:scanner.l */
315	{ "pause", 2, -1 , 0},
316	{ "while", 0, -1 , 0},
317	{ "for", 0, -1 , 0},
318	{ "help", 0, -1 , 0},
319	{ "newline", 0, -1 , 0},
320	{ "exit", 0, -1 , 0},
321	{ "quit", 0, -1 , 0},
322	/* end of list marker */
323	{ NULL, 0, 0, 0}
324	};
325	#endif
326
327	/=================== operations with 2 args.: static proc =================/
328	static BOOLEAN jjOP_IV_I(leftv res, leftv u, leftv v)
329	{
330	intvec* aa= (intvec *)u->CopyD(INTVEC_CMD);
331	int bb = (int)(v->Data());
332	if (errorreported) return TRUE;
333	switch (iiOp)
334	{
335	case '+': (*aa) += bb; break;
336	case '-': (*aa) -= bb; break;
337	case '': (aa) *= bb; break;
338	case '/':
339	case INTDIV: (*aa) /= bb; break;
340	case '%': (*aa) %= bb; break;
341	}
342	res->data=(char *)aa;
343	return FALSE;
344	}
345	static BOOLEAN jjOP_I_IV(leftv res, leftv u, leftv v)
346	{
347	return jjOP_IV_I(res,v,u);
348	}
349	static BOOLEAN jjOP_IM_I(leftv res, leftv u, leftv v)
350	{
351	intvec* aa= (intvec *)u->CopyD(INTVEC_CMD);
352	int bb = (int)(v->Data());
353	int i=min(aa->rows(),aa->cols());
354	switch (iiOp)
355	{
356	case '+': for (;i>0;i--) IMATELEM(*aa,i,i) += bb;
357	break;
358	case '-': for (;i>0;i--) IMATELEM(*aa,i,i) -= bb;
359	break;
360	}
361	res->data=(char *)aa;
362	return FALSE;
363	}
364	static BOOLEAN jjOP_I_IM(leftv res, leftv u, leftv v)
365	{
366	return jjOP_IM_I(res,v,u);
367	}
368	static BOOLEAN jjDOTDOT(leftv res, leftv u, leftv v)
369	{
370	res->data=(char *)new intvec((int)u->Data(),(int)v->Data());
371	return FALSE;
372	}
373	static void jjEQUAL_REST(leftv res,leftv u,leftv v)
374	{
375	if ((res->data) && (u->next!=NULL) && (v->next!=NULL))
376	{
377	int save_iiOp=iiOp;
378	if (iiOp==NOTEQUAL)
379	iiExprArith2(res,u->next,EQUAL_EQUAL,v->next);
380	else
381	iiExprArith2(res,u->next,iiOp,v->next);
382	iiOp=save_iiOp;
383	}
384	if (iiOp==NOTEQUAL) res->data=(char *)(!(int)res->data);
385	}
386	static BOOLEAN jjCOMPARE_IV(leftv res, leftv u, leftv v)
387	{
388	intvec* a = (intvec * )(u->Data());
389	intvec* b = (intvec * )(v->Data());
390	int r=a->compare(b);
391	switch (iiOp)
392	{
393	case '<':
394	res->data = (char *) (r<0);
395	break;
396	case '>':
397	res->data = (char *) (r>0);
398	break;
399	case LE:
400	res->data = (char *) (r<=0);
401	break;
402	case GE:
403	res->data = (char *) (r>=0);
404	break;
405	case EQUAL_EQUAL:
406	case NOTEQUAL: /* negation handled by jjEQUAL_REST */
407	res->data = (char *) (r==0);
408	break;
409	}
410	jjEQUAL_REST(res,u,v);
411	return r==-2;
412	}
413	static BOOLEAN jjCOMPARE_IV_I(leftv res, leftv u, leftv v)
414	{
415	intvec* a = (intvec * )(u->Data());
416	int b = (int ) (v->Data());
417	int r=a->compare(b);
418	switch (iiOp)
419	{
420	case '<':
421	res->data = (char *) (r<0);
422	break;
423	case '>':
424	res->data = (char *) (r>0);
425	break;
426	case LE:
427	res->data = (char *) (r<=0);
428	break;
429	case GE:
430	res->data = (char *) (r>=0);
431	break;
432	case EQUAL_EQUAL:
433	case NOTEQUAL: /* negation handled by jjEQUAL_REST */
434	res->data = (char *) (r==0);
435	break;
436	}
437	jjEQUAL_REST(res,u,v);
438	return FALSE;
439	}
440	static BOOLEAN jjCOMPARE_P(leftv res, leftv u, leftv v)
441	{
442	poly p=(poly)u->Data();
443	poly q=(poly)v->Data();
444	int r=pComp(p,q);
445	if (r==0)
446	{
447	/* compare lead coeffs */
448	number h=nSub(pGetCoeff(p),pGetCoeff(q));
449	r = -1+nIsZero(h)+2nGreaterZero(h); / -1: <, 0:==, 1: > */
450	nDelete(&h);
451	}
452	else if (p==NULL)
453	{
454	if (q==NULL)
455	{
456	/* compare 0, 0 */
457	r=0;
458	}
459	else if(pIsConstant(q))
460	{
461	/* compare 0, const */
462	r = 1-2nGreaterZero(pGetCoeff(q)); / -1: <, 1: > */
463	}
464	}
465	else if (q==NULL)
466	{
467	if (pIsConstant(p))
468	{
469	/* compare const, 0 */
470	r = -1+2nGreaterZero(pGetCoeff(p)); / -1: <, 1: > */
471	}
472	}
473	switch (iiOp)
474	{
475	case '<':
476	res->data = (char *) (r < 0);
477	break;
478	case '>':
479	res->data = (char *) (r > 0);
480	break;
481	case LE:
482	res->data = (char *) (r <= 0);
483	break;
484	case GE:
485	res->data = (char *) (r >= 0);
486	break;
487	//case EQUAL_EQUAL:
488	//case NOTEQUAL: /* negation handled by jjEQUAL_REST */
489	// res->data = (char *) (r == 0);
490	// break;
491	}
492	jjEQUAL_REST(res,u,v);
493	return FALSE;
494	}
495	static BOOLEAN jjCOMPARE_S(leftv res, leftv u, leftv v)
496	{
497	char* a = (char * )(u->Data());
498	char* b = (char * )(v->Data());
499	int result = strcmp(a,b);
500	switch (iiOp)
501	{
502	case '<':
503	res->data = (char *) (result < 0);
504	break;
505	case '>':
506	res->data = (char *) (result > 0);
507	break;
508	case LE:
509	res->data = (char *) (result <= 0);
510	break;
511	case GE:
512	res->data = (char *) (result >= 0);
513	break;
514	case EQUAL_EQUAL:
515	case NOTEQUAL: /* negation handled by jjEQUAL_REST */
516	res->data = (char *) (result == 0);
517	break;
518	}
519	jjEQUAL_REST(res,u,v);
520	return FALSE;
521	}
522	static BOOLEAN jjPOWER_I(leftv res, leftv u, leftv v)
523	{
524	int b=(int)u->Data();
525	int e=(int)v->Data();
526	int rc = 1;
527	BOOLEAN overflow=FALSE;
528	if ((e >= 0)&&(b!=0))
529	{
530	int oldrc;
531	while ((e--)!=0)
532	{
533	oldrc=rc;
534	rc *= b;
535	if (!overflow)
536	{
537	if(rc/b!=oldrc) overflow=TRUE;
538	}
539	}
540	if (overflow)
541	Warn("int overflow(^), result may be wrong");
542	res->data = (char *)rc;
543	return FALSE;
544	}
545	else
546	{
547	WerrorS("exponent must be non-negative");
548	return TRUE;
549	}
550	}
551	static BOOLEAN jjPOWER_N(leftv res, leftv u, leftv v)
552	{
553	int e=(int)v->Data();
554	number n=(number)u->CopyD();
555	if (e<0)
556	{
557	number m=nInvers(n);
558	nDelete(&n);
559	n=m;
560	e=-e;
561	}
562	nPower(n,e,(number*)&res->data);
563	nDelete(&n);
564	return FALSE;
565	}
566	static BOOLEAN jjPOWER_P(leftv res, leftv u, leftv v)
567	{
568	res->data = (char *)pPower((poly)u->CopyD(POLY_CMD),(int)v->Data());
569	return FALSE;
570	}
571	static BOOLEAN jjPOWER_ID(leftv res, leftv u, leftv v)
572	{
573	res->data = (char *)idPower((ideal)(u->Data()),(int)(v->Data()));
574	return FALSE;
575	}
576	static BOOLEAN jjPLUSMINUS_Gen(leftv res, leftv u, leftv v)
577	{
578	u=u->next;
579	v=v->next;
580	if (u==NULL)
581	{
582	if (v==NULL) return FALSE; /* u==NULL, v==NULL */
583	if (iiOp=='-') /* u==NULL, v<>NULL, iiOp=='-'*/
584	return iiExprArith1(res->next,v,'-');
585	loop /* u==NULL, v<>NULL, iiOp=='+' */
586	{
587	res->next = (leftv)Alloc0(sizeof(sleftv));
588	res=res->next;
589	res->data = v->CopyD();
590	res->rtyp = v->Typ();
591	v=v->next;
592	if (v==NULL) return FALSE;
593	}
594	}
595	if (v!=NULL) /* u<>NULL, v<>NULL */
596	{
597	res->next = (leftv)Alloc(sizeof(sleftv));
598	return iiExprArith2(res->next,u,iiOp,v);
599	}
600	loop /* u<>NULL, v==NULL */
601	{
602	res->next = (leftv)Alloc0(sizeof(sleftv));
603	res=res->next;
604	res->data = u->CopyD();
605	res->rtyp = u->Typ();
606	u=u->next;
607	if (u==NULL) return FALSE;
608	}
609	}
610	static BOOLEAN jjPLUS_I(leftv res, leftv u, leftv v)
611	{
612	unsigned int a=(unsigned int)u->Data();
613	unsigned int b=(unsigned int)v->Data();
614	unsigned int c=a+b;
615	res->data = (char *)c;
616	if (((Sy_bit(31)&a)==(Sy_bit(31)&b))&&((Sy_bit(31)&a)!=(Sy_bit(31)&c)))
617	{
618	Warn("int overflow(+), result may be wrong");
619	}
620	return jjPLUSMINUS_Gen(res,u,v);
621	}
622	static BOOLEAN jjPLUS_N(leftv res, leftv u, leftv v)
623	{
624	res->data = (char *)(nAdd((number)u->Data(), (number)v->Data()));
625	return jjPLUSMINUS_Gen(res,u,v);
626	}
627	static BOOLEAN jjPLUS_P(leftv res, leftv u, leftv v)
628	{
629	res->data = (char *)(pAdd((poly)u->CopyD(POLY_CMD) , (poly)v->CopyD(POLY_CMD)));
630	return jjPLUSMINUS_Gen(res,u,v);
631	}
632	static BOOLEAN jjPLUS_IV(leftv res, leftv u, leftv v)
633	{
634	res->data = (char )ivAdd((intvec)(u->Data()), (intvec*)(v->Data()));
635	if (res->data==NULL)
636	{
637	WerrorS("intmat size not compatible");
638	return TRUE;
639	}
640	return jjPLUSMINUS_Gen(res,u,v);
641	}
642	static BOOLEAN jjPLUS_MA(leftv res, leftv u, leftv v)
643	{
644	res->data = (char *)(mpAdd((matrix)u->Data() , (matrix)v->Data()));
645	if (res->data==NULL)
646	{
647	WerrorS("matrix size not compatible");
648	return TRUE;
649	}
650	return jjPLUSMINUS_Gen(res,u,v);
651	}
652	static BOOLEAN jjPLUS_MA_P(leftv res, leftv u, leftv v)
653	{
654	matrix m=(matrix)u->Data();
655	matrix p= mpInitP(m->nrows,m->ncols,(poly)(v->CopyD()));
656	if (iiOp=='+')
657	res->data = (char *)mpAdd(m , p);
658	else
659	res->data = (char *)mpSub(m , p);
660	idDelete((ideal *)&p);
661	return jjPLUSMINUS_Gen(res,u,v);
662	}
663	static BOOLEAN jjPLUS_P_MA(leftv res, leftv u, leftv v)
664	{
665	return jjPLUS_MA_P(res,v,u);
666	}
667	static BOOLEAN jjPLUS_S(leftv res, leftv u, leftv v)
668	{
669	char* a = (char * )(u->Data());
670	char* b = (char * )(v->Data());
671	char* r = (char * )AllocL(strlen(a) + strlen(b) + 1);
672	strcpy(r,a);
673	strcat(r,b);
674	res->data=r;
675	return jjPLUSMINUS_Gen(res,u,v);
676	}
677	static BOOLEAN jjPLUS_ID(leftv res, leftv u, leftv v)
678	{
679	res->data = (char *)idAdd((ideal)u->Data(),(ideal)v->Data());
680	return jjPLUSMINUS_Gen(res,u,v);
681	}
682	static BOOLEAN jjMINUS_I(leftv res, leftv u, leftv v)
683	{
684	unsigned int a=(unsigned int)u->Data();
685	unsigned int b=(unsigned int)v->Data();
686	unsigned int c=a-b;
687	if (((Sy_bit(31)&a)!=(Sy_bit(31)&b))&&((Sy_bit(31)&a)!=(Sy_bit(31)&c)))
688	{
689	Warn("int overflow(-), result may be wrong");
690	}
691	res->data = (char *)c;
692	return jjPLUSMINUS_Gen(res,u,v);
693	}
694	static BOOLEAN jjMINUS_N(leftv res, leftv u, leftv v)
695	{
696	res->data = (char *)(nSub((number)u->Data(), (number)v->Data()));
697	return jjPLUSMINUS_Gen(res,u,v);
698	}
699	static BOOLEAN jjMINUS_P(leftv res, leftv u, leftv v)
700	{
701	res->data = (char *)(pSub((poly)u->CopyD(POLY_CMD) , (poly)v->CopyD(POLY_CMD)));
702	return jjPLUSMINUS_Gen(res,u,v);
703	}
704	static BOOLEAN jjMINUS_IV(leftv res, leftv u, leftv v)
705	{
706	res->data = (char )ivSub((intvec)(u->Data()), (intvec*)(v->Data()));
707	if (res->data==NULL)
708	{
709	WerrorS("intmat size not compatible");
710	return TRUE;
711	}
712	return jjPLUSMINUS_Gen(res,u,v);
713	}
714	static BOOLEAN jjMINUS_MA(leftv res, leftv u, leftv v)
715	{
716	res->data = (char *)(mpSub((matrix)u->Data() , (matrix)v->Data()));
717	if (res->data==NULL)
718	{
719	WerrorS("matrix size not compatible");
720	return TRUE;
721	}
722	return jjPLUSMINUS_Gen(res,u,v);
723	}
724	static BOOLEAN jjTIMES_I(leftv res, leftv u, leftv v)
725	{
726	int a=(int)u->Data();
727	int b=(int)v->Data();
728	int c=a * b;
729	if ((b!=0) && (c/b !=a))
730	Warn("int overflow(*), result may be wrong");
731	res->data = (char *)c;
732	if (u->Next()!=NULL)
733	{
734	u=u->next;
735	res->next = (leftv)Alloc(sizeof(sleftv));
736	return iiExprArith2(res->next,u,iiOp,v);
737	}
738	else if (v->Next()!=NULL)
739	{
740	v=v->next;
741	res->next = (leftv)Alloc(sizeof(sleftv));
742	return iiExprArith2(res->next,u,iiOp,v);
743	}
744	return FALSE;
745	}
746	static BOOLEAN jjTIMES_N(leftv res, leftv u, leftv v)
747	{
748	number a;
749	number b;
750
751	if (v->next==NULL)
752	{
753	a=(number)u->Data();
754	if (u->next==NULL)
755	{
756	res->data = (char *)(nMult( a, (number)v->Data()));
757	return FALSE;
758	}
759	// u->next exists: copy v
760	b=(number)v->Data();
761	res->data = (char *)(nMult( a, b));
762	res->next = (leftv)Alloc(sizeof(sleftv));
763	res=res->next;
764	return iiExprArith2(res,u->next,iiOp,v);
765	}
766	// v->next exists: copy u
767	a=nCopy((number)u->Data());
768	b=(number)v->CopyD();
769	res->data = (char *)(nMult( a, b));
770	res->next = (leftv)Alloc(sizeof(sleftv));
771	return iiExprArith2(res->next,u,iiOp,v->next);
772	}
773	static BOOLEAN jjTIMES_P(leftv res, leftv u, leftv v)
774	{
775	poly a;
776	poly b;
777
778	if (v->next==NULL)
779	{
780	a=(poly)u->CopyD();
781	if (u->next==NULL)
782	{
783	b=(poly)v->CopyD();
784	res->data = (char *)(pMult( a, b));
785	return FALSE;
786	}
787	// u->next exists: copy v
788	b=pCopy((poly)v->Data());
789	res->data = (char *)(pMult( a, b));
790	res->next = (leftv)Alloc(sizeof(sleftv));
791	res=res->next;
792	return iiExprArith2(res,u->next,iiOp,v);
793	}
794	// v->next exists: copy u
795	a=pCopy((poly)u->Data());
796	b=(poly)v->CopyD();
797	res->data = (char *)(pMult( a, b));
798	res->next = (leftv)Alloc(sizeof(sleftv));
799	return iiExprArith2(res->next,u,iiOp,v->next);
800	}
801	static BOOLEAN jjTIMES_ID(leftv res, leftv u, leftv v)
802	{
803	res->data = (char *)idMult((ideal)u->Data(),(ideal)v->Data());
804	return FALSE;
805	}
806	static BOOLEAN jjTIMES_IV(leftv res, leftv u, leftv v)
807	{
808	res->data = (char )ivMult((intvec)(u->Data()), (intvec*)(v->Data()));
809	if (res->data==NULL)
810	{
811	WerrorS("intmat size not compatible");
812	return TRUE;
813	}
814	return FALSE;
815	}
816	static BOOLEAN jjTIMES_MA_P1(leftv res, leftv u, leftv v)
817	{
818	poly p=(poly)v->CopyD(POLY_CMD);
819	int r=pMaxComp(p);/* recompute the rank for the case idealvector/
820	ideal I= (ideal)mpMultP((matrix)u->CopyD(MATRIX_CMD),p);
821	if (r>0) I->rank=r;
822	res->data = (char *)I;
823	return FALSE;
824	}
825	static BOOLEAN jjTIMES_MA_P2(leftv res, leftv u, leftv v)
826	{
827	return jjTIMES_MA_P1(res,v,u);
828	}
829	static BOOLEAN jjTIMES_MA_N1(leftv res, leftv u, leftv v)
830	{
831	number n=(number)v->CopyD(NUMBER_CMD);
832	poly p=pOne();
833	pSetCoeff(p,n);
834	res->data = (char *)mpMultP((matrix)u->CopyD(MATRIX_CMD),p);
835	return FALSE;
836	}
837	static BOOLEAN jjTIMES_MA_N2(leftv res, leftv u, leftv v)
838	{
839	return jjTIMES_MA_N1(res,v,u);
840	}
841	static BOOLEAN jjTIMES_MA_I1(leftv res, leftv u, leftv v)
842	{
843	res->data = (char *)mpMultI((matrix)u->CopyD(MATRIX_CMD),(int)v->Data());
844	return FALSE;
845	}
846	static BOOLEAN jjTIMES_MA_I2(leftv res, leftv u, leftv v)
847	{
848	return jjTIMES_MA_I1(res,v,u);
849	}
850	static BOOLEAN jjTIMES_MA(leftv res, leftv u, leftv v)
851	{
852	res->data = (char *)mpMult((matrix)u->Data(),(matrix)v->Data());
853	if (res->data==NULL)
854	{
855	WerrorS("matrix size not compatible");
856	return TRUE;
857	}
858	return FALSE;
859	}
860	static BOOLEAN jjGE_I(leftv res, leftv u, leftv v)
861	{
862	res->data = (char *)((int)u->Data() >= (int)v->Data());
863	return FALSE;
864	}
865	static BOOLEAN jjGE_N(leftv res, leftv u, leftv v)
866	{
867	number h=nSub((number)u->Data(),(number)v->Data());
868	res->data = (char *) (nGreaterZero(h)\|\|(nIsZero(h)));
869	nDelete(&h);
870	return FALSE;
871	}
872	static BOOLEAN jjGT_I(leftv res, leftv u, leftv v)
873	{
874	res->data = (char *)((int)u->Data()>(int)v->Data());
875	return FALSE;
876	}
877	static BOOLEAN jjGT_N(leftv res, leftv u, leftv v)
878	{
879	number h=nSub((number)u->Data(),(number)v->Data());
880	res->data = (char *) (nGreaterZero(h)&&(!nIsZero(h)));
881	nDelete(&h);
882	return FALSE;
883	}
884	static BOOLEAN jjLE_I(leftv res, leftv u, leftv v)
885	{
886	res->data = (char *)((int)u->Data() <= (int)v->Data());
887	return FALSE;
888	}
889	static BOOLEAN jjLE_N(leftv res, leftv u, leftv v)
890	{
891	number h=nSub((number)v->Data(),(number)u->Data());
892	res->data = (char *) (nGreaterZero(h)\|\|nIsZero(h));
893	nDelete(&h);
894	return FALSE;
895	}
896	static BOOLEAN jjLT_I(leftv res, leftv u, leftv v)
897	{
898	res->data = (char *)((int)u->Data() < (int)v->Data());
899	return FALSE;
900	}
901	static BOOLEAN jjLT_N(leftv res, leftv u, leftv v)
902	{
903	number h=nSub((number)v->Data(),(number)u->Data());
904	res->data = (char *) (nGreaterZero(h)&&(!nIsZero(h)));
905	nDelete(&h);
906	return FALSE;
907	}
908	static BOOLEAN jjDIV_I(leftv res, leftv u, leftv v)
909	{
910	int a= (int) u->Data();
911	int b= (int) v->Data();
912	if (b==0)
913	{
914	WerrorS("div. by 0");
915	return TRUE;
916	}
917	//int c=a%ABS(b);
918	//if(c<0) c+=ABS(b);
919	//res->data = (char *)((a-c) / b);
920	res->data = (char *)(a / b);
921	return FALSE;
922	}
923	static BOOLEAN jjDIV_N(leftv res, leftv u, leftv v)
924	{
925	number q=(number)v->Data();
926	if (nIsZero(q))
927	{
928	WerrorS("div. by 0");
929	return TRUE;
930	}
931	q = nDiv((number)u->Data(),q);
932	nNormalize(q);
933	res->data = (char *)q;
934	return FALSE;
935	}
936	static BOOLEAN jjDIV_P(leftv res, leftv u, leftv v)
937	{
938	poly q=(poly)v->Data();
939	if (q==NULL)
940	{
941	WerrorS("div. by 0");
942	return TRUE;
943	}
944	if (pNext(q)!=NULL)
945	{
946	#ifdef HAVE_FACTORY
947	res->data=(void*)(singclap_pdivide((poly)(u->Data()),
948	(poly)(v->Data())));
949	#else
950	WerrorS("division only by a monomial");
951	return TRUE;
952	#endif
953	}
954	else
955	{
956	res->data = (char *)pDivideM((poly)u->CopyD(POLY_CMD),pHead(q));
957	}
958	return FALSE;
959	}
960	static BOOLEAN jjMOD_I(leftv res, leftv u, leftv v)
961	{
962	int a=(int)u->Data();
963	int b=ABS((int)v->Data());
964	if (errorreported) return TRUE;
965	if (b==0)
966	{
967	WerrorS("div. by 0");
968	return TRUE;
969	}
970	int c=a%b;
971	if(c<0) c+=b;
972	res->data = (char *)c;
973	return FALSE;
974	}
975	static BOOLEAN jjEQUAL_I(leftv res, leftv u, leftv v)
976	{
977	res->data = (char *)((int)u->Data() == (int)v->Data());
978	jjEQUAL_REST(res,u,v);
979	return FALSE;
980	}
981	static BOOLEAN jjEQUAL_Ma(leftv res, leftv u, leftv v)
982	{
983	res->data = (char *)mpEqual((matrix)u->Data(),(matrix)v->Data());
984	jjEQUAL_REST(res,u,v);
985	return FALSE;
986	}
987	static BOOLEAN jjEQUAL_N(leftv res, leftv u, leftv v)
988	{
989	res->data = (char *)nEqual((number)u->Data(),(number)v->Data());
990	jjEQUAL_REST(res,u,v);
991	return FALSE;
992	}
993	static BOOLEAN jjEQUAL_P(leftv res, leftv u, leftv v)
994	{
995	poly p=(poly)u->Data();
996	poly q=(poly)v->Data();
997	if (p==NULL)
998	{
999	res->data=(char *)(q==NULL);
1000	}
1001	else
1002	{
1003	if (q==NULL) res->data=(char *)FALSE;
1004	else
1005	{
1006	int r=pComp(p,q);
1007	if (r==0)
1008	{
1009	p=pSub(pCopy(p),pCopy(q));
1010	res->data = (char *) (p==NULL);
1011	pDelete(&p);
1012	}
1013	else
1014	res->data = (char *) FALSE;
1015	}
1016	}
1017	jjEQUAL_REST(res,u,v);
1018	return FALSE;
1019	}
1020	static BOOLEAN jjAND_I(leftv res, leftv u, leftv v)
1021	{
1022	res->data = (char *)((int)u->Data() && (int)v->Data());
1023	return FALSE;
1024	}
1025	static BOOLEAN jjOR_I(leftv res, leftv u, leftv v)
1026	{
1027	res->data = (char *)((int)u->Data() \|\| (int)v->Data());
1028	return FALSE;
1029	}
1030	static BOOLEAN jjINDEX_I(leftv res, leftv u, leftv v)
1031	{
1032	res->rtyp=u->rtyp; u->rtyp=0;
1033	res->data=u->data; u->data=NULL;
1034	res->name=u->name; u->name=NULL;
1035	res->e=u->e; u->e=NULL;
1036	if (res->e==NULL) res->e=jjMakeSub(v);
1037	else
1038	{
1039	Subexpr sh=res->e;
1040	while (sh->next != NULL) sh=sh->next;
1041	sh->next=jjMakeSub(v);
1042	}
1043	return FALSE;
1044	}
1045	static BOOLEAN jjINDEX_IV(leftv res, leftv u, leftv v)
1046	{
1047	if ((u->rtyp!=IDHDL)\|\|(u->e!=NULL))
1048	{
1049	WerrorS("indexed object must have a name");
1050	return TRUE;
1051	}
1052	intvec * iv=(intvec *)v->Data();
1053	leftv p=NULL;
1054	int i;
1055	sleftv t;
1056
1057	memset(&t,0,sizeof(t));
1058	t.rtyp=INT_CMD;
1059	for (i=0;i<iv->length(); i++)
1060	{
1061	t.data=(char )(iv)[i];
1062	if (p==NULL)
1063	{
1064	p=res;
1065	}
1066	else
1067	{
1068	p->next=(leftv)Alloc0(sizeof(sleftv));
1069	p=p->next;
1070	}
1071	p->rtyp=IDHDL;
1072	p->data=u->data;
1073	p->name=u->name;
1074	p->flag\|=u->flag;
1075	p->e=jjMakeSub(&t);
1076	}
1077	u->rtyp=0;
1078	u->data=NULL;
1079	u->name=NULL;
1080	return FALSE;
1081	}
1082	static BOOLEAN jjINDEX_P(leftv res, leftv u, leftv v)
1083	{
1084	poly p=(poly)u->Data();
1085	int i=(int)v->Data();
1086	int j=0;
1087	while (p!=NULL)
1088	{
1089	j++;
1090	if (j==i)
1091	{
1092	res->data=(char *)pHead(p);
1093	return FALSE;
1094	}
1095	pIter(p);
1096	}
1097	return FALSE;
1098	}
1099	static BOOLEAN jjINDEX_P_IV(leftv res, leftv u, leftv v)
1100	{
1101	poly p=(poly)u->Data();
1102	poly r=NULL;
1103	intvec iv=(intvec )v->CopyD();
1104	int i;
1105	int sum=0;
1106	for(i=iv->length()-1;i>=0;i--)
1107	sum+=(*iv)[i];
1108	int j=0;
1109	while ((p!=NULL) && (sum>0))
1110	{
1111	j++;
1112	for(i=iv->length()-1;i>=0;i--)
1113	{
1114	if (j==(*iv)[i])
1115	{
1116	r=pAdd(r,pHead(p));
1117	sum-=j;
1118	(*iv)[i]=0;
1119	break;
1120	}
1121	}
1122	pIter(p);
1123	}
1124	delete iv;
1125	res->data=(char *)r;
1126	return FALSE;
1127	}
1128	static BOOLEAN jjINDEX_V(leftv res, leftv u, leftv v)
1129	{
1130	poly p=(poly)u->CopyD();
1131	poly r=p; // pointer to the beginning of component i
1132	poly o=NULL;
1133	int i=(int)v->Data();
1134	while (p!=NULL)
1135	{
1136	if (pGetComp(p)!=i)
1137	{
1138	if (r==p) r=pNext(p);
1139	if (o!=NULL)
1140	{
1141	pDelete1(&pNext(o));
1142	p=pNext(o);
1143	}
1144	else
1145	pDelete1(&p);
1146	}
1147	else
1148	{
1149	pSetComp(p, 0);
1150	o=p;
1151	p=pNext(o);
1152	}
1153	}
1154	res->data=(char *)r;
1155	return FALSE;
1156	}
1157	static BOOLEAN jjINDEX_V_IV(leftv res, leftv u, leftv v)
1158	{
1159	poly p=(poly)u->CopyD();
1160	if (p!=NULL)
1161	{
1162	poly r=pOne();
1163	poly hp=r;
1164	intvec iv=(intvec )v->Data();
1165	int i;
1166	loop
1167	{
1168	for(i=0;i<iv->length();i++)
1169	{
1170	if (pGetComp(p)==(*iv)[i])
1171	{
1172	poly h;
1173	pSplit(p,&h);
1174	pNext(hp)=p;
1175	p=h;
1176	pIter(hp);
1177	break;
1178	}
1179	}
1180	if (p==NULL) break;
1181	if (i==iv->length())
1182	{
1183	pDelete1(&p);
1184	if (p==NULL) break;
1185	}
1186	}
1187	pDelete1(&r);
1188	res->data=(char *)r;
1189	}
1190	return FALSE;
1191	}
1192	static BOOLEAN jjKLAMMER(leftv res, leftv u, leftv v)
1193	{
1194	if(u->name==NULL) return TRUE;
1195	char * n = (char *)AllocL(strlen(u->name) + 6);
1196	sprintf(n,"%s(%d)",u->name,(int)v->Data());
1197	FreeL((ADDRESS)u->name);
1198	u->name=NULL;
1199	syMake(res,n);
1200	return FALSE;
1201	}
1202	static BOOLEAN jjKLAMMER_IV(leftv res, leftv u, leftv v)
1203	{
1204	intvec * iv=(intvec *)v->Data();
1205	leftv p=NULL;
1206	int i;
1207	char *n;
1208
1209	for (i=0;i<iv->length(); i++)
1210	{
1211	if (p==NULL)
1212	{
1213	p=res;
1214	}
1215	else
1216	{
1217	p->next=(leftv)Alloc0(sizeof(sleftv));
1218	p=p->next;
1219	}
1220	n = (char *)AllocL(strlen(u->name) + 6);
1221	sprintf(n,"%s(%d)",u->name,(*iv)[i]);
1222	syMake(p,n);
1223	}
1224	FreeL((ADDRESS)u->name);
1225	u->name=NULL;
1226	return FALSE;
1227	}
1228	static BOOLEAN jjPROC(leftv res, leftv u, leftv v)
1229	{
1230	leftv sl = iiMake_proc((idhdl)u->data,v);
1231	if (sl==NULL)
1232	{
1233	return TRUE;
1234	}
1235	else
1236	{
1237	memcpy(res,sl,sizeof(sleftv));
1238	}
1239	return FALSE;
1240	}
1241	static BOOLEAN jjMAP(leftv res, leftv u, leftv v)
1242	{
1243	//Print("try to map %s with %s\n",$3.Name(),$1.Name());
1244	leftv sl=NULL;
1245	if (v->e==NULL)
1246	{
1247	map m=(map)u->Data();
1248	sl=iiMap(m,v->name);
1249	}
1250	//else
1251	//{
1252	// WerrorS("map_id(<name>) expected");
1253	//}
1254	if (sl==NULL) return TRUE;
1255	memcpy(res,sl,sizeof(sleftv));
1256	Free((ADDRESS)sl,sizeof(*sl));
1257	return FALSE;
1258	}
1259	static BOOLEAN jjCALL2MANY(leftv res, leftv u, leftv v)
1260	{
1261	u->next=(leftv)Alloc(sizeof(sleftv));
1262	memcpy(u->next,v,sizeof(sleftv));
1263	BOOLEAN r=iiExprArithM(res,u,iiOp);
1264	v->rtyp=0; v->data=NULL; // iiExprArithM did the CleanUp
1265	return r;
1266	}
1267	static BOOLEAN jjCOEF(leftv res, leftv u, leftv v)
1268	{
1269	res->data=(char *)mpCoeffProc((poly)u->Data(),(poly)v->Data());
1270	return FALSE;
1271	}
1272	static BOOLEAN jjCOEFFS_Id(leftv res, leftv u, leftv v)
1273	{
1274	int i=pVar((poly)v->Data());
1275	if (i==0)
1276	{
1277	WerrorS("ringvar expected");
1278	return TRUE;
1279	}
1280	res->data=(char *)mpCoeffs((ideal)u->CopyD(),i);
1281	return FALSE;
1282	}
1283	static BOOLEAN jjCONTRACT(leftv res, leftv u, leftv v)
1284	{
1285	res->data=(char *)idDiffOp((ideal)u->Data(),(ideal)v->Data(),FALSE);
1286	return FALSE;
1287	}
1288	static BOOLEAN jjDEG_IV(leftv res, leftv u, leftv v)
1289	{
1290	short iv=iv2array((intvec )v->Data());
1291	res->data = (char *)pDegW((poly)u->Data(),iv);
1292	Free((ADDRESS)iv,(pVariables+1)*sizeof(short));
1293	return FALSE;
1294	}
1295	static BOOLEAN jjDIFF_P(leftv res, leftv u, leftv v)
1296	{
1297	int i=pVar((poly)v->Data());
1298	if (i==0)
1299	{
1300	WerrorS("ringvar expected");
1301	return TRUE;
1302	}
1303	res->data=(char *)pDiff((poly)(u->Data()),i);
1304	return FALSE;
1305	}
1306	static BOOLEAN jjDIFF_ID(leftv res, leftv u, leftv v)
1307	{
1308	int i=pVar((poly)v->Data());
1309	if (i==0)
1310	{
1311	WerrorS("ringvar expected");
1312	return TRUE;
1313	}
1314	res->data=(char *)idDiff((matrix)(u->Data()),i);
1315	return FALSE;
1316	}
1317	static BOOLEAN jjDIFF_ID_ID(leftv res, leftv u, leftv v)
1318	{
1319	res->data=(char *)idDiffOp((ideal)u->Data(),(ideal)v->Data());
1320	return FALSE;
1321	}
1322
1323	static BOOLEAN jjELIMIN(leftv res, leftv u, leftv v)
1324	{
1325	res->data=(char *)idElimination((ideal)u->Data(),(poly)v->Data());
1326	setFlag(res,FLAG_STD);
1327	return FALSE;
1328	}
1329	static BOOLEAN jjDIM2(leftv res, leftv v, leftv w)
1330	{
1331	assumeStdFlag(v);
1332	if(currQuotient==NULL)
1333	res->data = (char *)scDimInt((ideal)(v->Data()),(ideal)w->Data());
1334	else
1335	{
1336	ideal q=idSimpleAdd(currQuotient,(ideal)w->Data());
1337	res->data = (char *)scDimInt((ideal)(v->Data()),q);
1338	idDelete(&q);
1339	}
1340	return FALSE;
1341	}
1342	static BOOLEAN jjEXTGCD_I(leftv res, leftv u, leftv v)
1343	{
1344	int p0=ABS((int)u->Data()),p1=ABS((int)v->Data());
1345	int f0 = 1, f1 = 0, g0 = 0, g1 = 1, q, r;
1346
1347	while ( p1!=0 )
1348	{
1349	q=p0 / p1;
1350	r=p0 % p1;
1351	p0 = p1; p1 = r;
1352	r = g0 - g1 * q;
1353	g0 = g1; g1 = r;
1354	r = f0 - f1 * q;
1355	f0 = f1; f1 = r;
1356	}
1357	int a = f0;
1358	int b = g0;
1359	if ( (int)u->Data() < 0 ) a=-a;
1360	if ( (int)v->Data() < 0 ) b=-b;
1361	lists L=(lists)Alloc(sizeof(slists));
1362	L->Init(3);
1363	L->m[0].rtyp=INT_CMD;
1364	L->m[0].data=(void *)p0;
1365	L->m[1].rtyp=INT_CMD;
1366	L->m[1].data=(void *)a;
1367	L->m[2].rtyp=INT_CMD;
1368	L->m[2].data=(void *)b;
1369	res->rtyp=LIST_CMD;
1370	res->data=(char *)L;
1371	return FALSE;
1372	}
1373	#ifdef HAVE_FACTORY
1374	static BOOLEAN jjFACSTD2(leftv res, leftv v, leftv w)
1375	{
1376	res->data=(void *)kStdfac((ideal)v->Data(),NULL,testHomog,NULL,
1377	(ideal)w->Data());
1378	setFlag(res,FLAG_STD);
1379	return FALSE;
1380	}
1381	#endif
1382	static BOOLEAN jjFETCH(leftv res, leftv u, leftv v)
1383	{
1384	ring r=(ring)u->Data();
1385	idhdl w;
1386
1387	if ((iiOp!=IMAP_CMD)
1388	&& ((currRing->ch != r->ch)
1389	\|\| ((currRing->N != r->N)&& (iiOp==FETCH_CMD)))
1390	)
1391	goto err_fetch;
1392	if ((w=r->idroot->get(v->Name(),myynest))!=NULL)
1393	{
1394	int *perm=NULL;
1395	int *par_perm=NULL;
1396	int par_perm_size=0;
1397	BOOLEAN bo;
1398	if (iiOp==IMAP_CMD)
1399	{
1400	if (!nSetMap(r->ch,r->parameter,r->P,r->minpoly))
1401	{
1402	if (iiOp!=IMAP_CMD)
1403	goto err_fetch;
1404	par_perm_size=rPar(r);
1405	if (r->ch==1)
1406	{
1407	if ((currRing->ch!=0)
1408	&& (currRing->ch!=1))
1409	goto err_fetch;
1410	}
1411	else if(r->ch<(-1))
1412	{
1413	if ((currRing->ch==(-currRing->ch))
1414	&& (currRing->ch!=currRing->ch))
1415	goto err_fetch;
1416	}
1417	BITSET save_test=test;
1418	naSetChar(r->ch,TRUE,r->parameter,r->P);
1419	nSetChar(currRing->ch,TRUE,currRing->parameter,currRing->P);
1420	test=save_test;
1421	}
1422	perm=(int )Alloc0((r->N+1)sizeof(int));
1423	if (par_perm_size!=0)
1424	par_perm=(int )Alloc0(par_perm_sizesizeof(int));
1425	maFindPerm(r->names, r->N, r->parameter, r->P,
1426	currRing->names,currRing->N,currRing->parameter, currRing->P,
1427	perm,par_perm);
1428	}
1429	sleftv tmpW;
1430	memset(&tmpW,0,sizeof(sleftv));
1431	tmpW.rtyp=IDTYP(w);
1432	tmpW.data=IDDATA(w);
1433	if ((bo=maApplyFetch(iiOp,NULL,res,&tmpW, r, perm,par_perm,par_perm_size)))
1434	{
1435	Werror("cannot map %s of type %s(%d)",v->name, Tok2Cmdname(w->typ),w->typ);
1436	}
1437	if (perm!=NULL)
1438	Free((ADDRESS)perm,(r->N+1)*sizeof(int));
1439	if (par_perm!=NULL)
1440	Free((ADDRESS)par_perm,par_perm_size*sizeof(int));
1441	return bo;
1442	}
1443	else
1444	{
1445	Werror("%s undefined in %s",v->Name(),u->Name());
1446	}
1447	return TRUE;
1448	err_fetch:
1449	Werror("no identity map from %s",u->Name());
1450	return TRUE;
1451	}
1452	static BOOLEAN jjFIND2(leftv res, leftv u, leftv v)
1453	{
1454	/*4
1455	* look for the substring what in the string where
1456	* return the position of the first char of what in where
1457	* or 0
1458	*/
1459	char where=(char )u->Data();
1460	char what=(char )v->Data();
1461	char *found = strstr(where,what);
1462	if (found != NULL)
1463	{
1464	res->data=(char *)((found-where)+1);
1465	}
1466	/else res->data=NULL;/
1467	return FALSE;
1468	}
1469	static BOOLEAN jjGCD_I(leftv res, leftv u, leftv v)
1470	{
1471	int p0=ABS((int)u->Data()),p1=ABS((int)v->Data());
1472	int q, r;
1473
1474	while ( p1!=0 )
1475	{
1476	q=p0 / p1;
1477	r=p0 % p1;
1478	p0 = p1; p1 = r;
1479	}
1480	res->rtyp=INT_CMD;
1481	res->data=(char *)p0;
1482	return FALSE;
1483	}
1484	static BOOLEAN jjHILBERT2(leftv res, leftv u, leftv v)
1485	{
1486	assumeStdFlag(u);
1487	intvec module_w=(intvec)atGet(u,"isHomog");
1488	intvec *iv=hFirstSeries((ideal)u->Data(),module_w,currQuotient);
1489	switch((int)v->Data())
1490	{
1491	case 1:
1492	res->data=(void *)iv;
1493	return FALSE;
1494	case 2:
1495	res->data=(void *)hSecondSeries(iv);
1496	delete iv;
1497	return FALSE;
1498	}
1499	WerrorS(feNotImplemented);
1500	delete iv;
1501	return TRUE;
1502	}
1503	static BOOLEAN jjHOMOG_P(leftv res, leftv u, leftv v)
1504	{
1505	int i=pVar((poly)v->Data());
1506	if (i==0)
1507	{
1508	WerrorS("ringvar expected");
1509	return TRUE;
1510	}
1511	res->data = (char *)pHomogen((poly)u->Data(),i);
1512	return FALSE;
1513	}
1514	static BOOLEAN jjHOMOG_ID(leftv res, leftv u, leftv v)
1515	{
1516	int i=pVar((poly)v->Data());
1517	if (i==0)
1518	{
1519	WerrorS("ringvar expected");
1520	return TRUE;
1521	}
1522	res->data = (char *)idHomogen((ideal)u->Data(),i);
1523	return FALSE;
1524	}
1525	static BOOLEAN jjINDEPSET2(leftv res, leftv u, leftv v)
1526	{
1527	assumeStdFlag(u);
1528	res->data=(void *)scIndIndset((ideal)(u->Data()),(int)(v->Data()),
1529	currQuotient);
1530	return FALSE;
1531	}
1532	static BOOLEAN jjINTERSECT(leftv res, leftv u, leftv v)
1533	{
1534	res->data=(char *)idSect((ideal)u->Data(),(ideal)v->Data());
1535	setFlag(res,FLAG_STD);
1536	return FALSE;
1537	}
1538	static BOOLEAN jjJET_P(leftv res, leftv u, leftv v)
1539	{
1540	res->data = (char *)pJet((poly)u->Data(),(int)v->Data());
1541	return FALSE;
1542	}
1543	static BOOLEAN jjJET_ID(leftv res, leftv u, leftv v)
1544	{
1545	res->data = (char *)idJet((ideal)u->Data(),(int)v->Data());
1546	return FALSE;
1547	}
1548	static BOOLEAN jjKBASE2(leftv res, leftv u, leftv v)
1549	{
1550	assumeStdFlag(u);
1551	res->data = (char *)scKBase((int)v->Data(),
1552	(ideal)(u->Data()),currQuotient);
1553	return FALSE;
1554	}
1555	static BOOLEAN jjKoszul(leftv res, leftv u, leftv v)
1556	{
1557	return mpKoszul(res, u,v);
1558	}
1559	static BOOLEAN jjKoszul_Id(leftv res, leftv u, leftv v)
1560	{
1561	sleftv h;
1562	memset(&h,0,sizeof(sleftv));
1563	h.rtyp=INT_CMD;
1564	h.data=(void *)IDELEMS((ideal)v->Data());
1565	return mpKoszul(res, &h, u, v);
1566	}
1567	static BOOLEAN jjLIFT(leftv res, leftv u, leftv v)
1568	{
1569	ideal m;
1570	int ul= IDELEMS((ideal)u->Data());
1571	int vl= IDELEMS((ideal)v->Data());
1572	if (hasFlag(u,FLAG_STD))
1573	{
1574	m = idLift((ideal)u->Data(),(ideal)v->Data());
1575	res->data = (char *)idModule2formatedMatrix(m,ul,vl);
1576	}
1577	else
1578	{
1579	// matrix ma=mpNew(1,1);
1580	// ideal mo=idLiftStd((ideal)u->CopyD(),currQuotient,&ma,testHomog);
1581	// m = idLift(mo,(ideal)v->Data());
1582	// matrix r=idModule2formatedMatrix(m, IDELEMS(mo),vl);
1583	// idDelete(&mo);
1584	// // idDelete(&m); already done by idModule2formatedMatrix
1585	// res->data=(char *)mpMult(ma,r);
1586	// idDelete((ideal *)&ma);
1587	// idDelete((ideal *)&r);
1588	m = idLiftNonStB((ideal)u->Data(),(ideal)v->Data());
1589	res->data = (char *)idModule2formatedMatrix(m,ul,vl);
1590	}
1591	return FALSE;
1592	}
1593	static BOOLEAN jjLIFTSTD(leftv res, leftv u, leftv v)
1594	{
1595	if ((v->rtyp!=IDHDL)\|\|(v->e!=NULL)) return TRUE;
1596	idhdl h=(idhdl)v->data;
1597	res->data = (char *)idLiftStd((ideal)u->CopyD(), currQuotient,
1598	&(h->data.umatrix),testHomog);
1599	setFlag(res,FLAG_STD);
1600	return FALSE;
1601	}
1602	static BOOLEAN jjMINOR(leftv res, leftv u, leftv v)
1603	{
1604	res->data = (char *)idMinors((matrix)u->Data(),(int)v->Data());
1605	return FALSE;
1606	}
1607	static BOOLEAN jjMODULO(leftv res, leftv u, leftv v)
1608	{
1609	res->data = (char *)idModulo((ideal)u->Data(),(ideal)v->Data());
1610	return FALSE;
1611	}
1612	static BOOLEAN jjMONITOR2(leftv res, leftv u,leftv v)
1613	{
1614	char opt=(char )v->Data();
1615	int mode=0;
1616	while(*opt!='\0')
1617	{
1618	if (*opt=='i') mode \|= PROT_I;
1619	else if (*opt=='o') mode \|= PROT_O;
1620	opt++;
1621	}
1622	monitor((char *)(u->Data()),mode);
1623	return FALSE;
1624	}
1625	static BOOLEAN jjPARSTR2(leftv res, leftv u, leftv v)
1626	{
1627	idhdl h=(idhdl)u->data;
1628	int i=(int)v->Data();
1629	int p=0;
1630	if ((0<i)
1631	&& (IDRING(h)->parameter!=NULL)
1632	&& (i<=(p=rPar(IDRING(h)))))
1633	res->data=mstrdup(IDRING(h)->parameter[i-1]);
1634	else
1635	{
1636	Werror("par number %d out of range 1..%d",i,p);
1637	return TRUE;
1638	}
1639	return FALSE;
1640	}
1641	static BOOLEAN jjQUOT(leftv res, leftv u, leftv v)
1642	{
1643	res->data = (char *)idQuot((ideal)u->Data(),(ideal)v->Data(),
1644	hasFlag(u,FLAG_STD));
1645	idDelMultiples((ideal)(res->data));
1646	return FALSE;
1647	}
1648	static BOOLEAN jjRANDOM(leftv res, leftv u, leftv v)
1649	{
1650	int i=(int)u->Data();
1651	int j=(int)v->Data();
1652	#ifdef buildin_rand
1653	res->data =(char *)((i > j) ? i : (siRand() % (j-i+1)) + i);
1654	#else
1655	res->data =(char *)((i > j) ? i : (rand() % (j-i+1)) + i);
1656	#endif
1657	return FALSE;
1658	}
1659	static BOOLEAN jjREAD2(leftv res, leftv u, leftv v)
1660	{
1661	si_link l=(si_link)u->Data();
1662	leftv r=slRead(l,v);
1663	if (r==NULL)
1664	{
1665	const char *s;
1666	if ((l!=NULL)&&(l->name!=NULL)) s=l->name;
1667	else s=sNoName;
1668	Werror("cannot read from `%s`",s);
1669	return TRUE;
1670	}
1671	memcpy(res,r,sizeof(sleftv));
1672	Free((ADDRESS)r,sizeof(sleftv));
1673	return FALSE;
1674	}
1675	static BOOLEAN jjREDUCE_P(leftv res, leftv u, leftv v)
1676	{
1677	assumeStdFlag(v);
1678	res->data = (char *)kNF((ideal)v->Data(),currQuotient,(poly)u->Data());
1679	return FALSE;
1680	}
1681	static BOOLEAN jjREDUCE_ID(leftv res, leftv u, leftv v)
1682	{
1683	assumeStdFlag(v);
1684	res->data = (char *)kNF((ideal)v->Data(),currQuotient,(ideal)u->Data());
1685	return FALSE;
1686	}
1687	static BOOLEAN jjRES(leftv res, leftv u, leftv v)
1688	{
1689	int maxl=(int)v->Data();
1690	if (maxl<0)
1691	{
1692	WerrorS("length for res must not be negative");
1693	return TRUE;
1694	}
1695	int l=0;
1696	//resolvente r;
1697	syStrategy r;
1698	intvec **weights=NULL;
1699	int wmaxl=maxl;
1700	ideal u_id=(ideal)u->Data();
1701	maxl--;
1702	if ((maxl==-1) && (iiOp!=MRES_CMD))
1703	maxl = pVariables-1;
1704	if ((iiOp == RES_CMD) \|\| (iiOp == MRES_CMD))
1705	{
1706	//if (BTEST1(28))
1707	//{
1708	// r=syMinRes(u_id,maxl,&l, iiOp==MRES_CMD);
1709	//}
1710	//else
1711	{
1712	intvec * iv=(intvec*)atGet(u,"isHomog");
1713	//if (iv!=NULL)
1714	//{
1715	// weights = (intvec*)Alloc0(sizeof(intvec));
1716	// weights[0] = ivCopy(iv);
1717	// l=1;
1718	//}
1719	//r=syResolvente(u_id,maxl,&l, &weights, iiOp==MRES_CMD);
1720	r=syResolution(u_id,maxl, iv, iiOp==MRES_CMD);
1721	}
1722	}
1723	else if (iiOp==SRES_CMD)
1724	// r=sySchreyerResolvente(u_id,maxl+1,&l);
1725	r=sySchreyer(u_id,maxl+1);
1726	else /* LRES */
1727	{
1728	int dummy;
1729	if((currQuotient!=NULL)\|\|
1730	(!idHomIdeal (u_id,NULL)))
1731	{
1732	WerrorS
1733	("`lres` can not be called in q ring or with inhomogeneous input");
1734	return TRUE;
1735	}
1736	r=syLaScala3(u_id,&dummy);
1737	}
1738	if (r==NULL) return TRUE;
1739	//res->data=(void *)liMakeResolv(r,l,wmaxl,u->Typ(),weights);
1740	r->list_length=wmaxl;
1741	res->data=(void *)r;
1742	return FALSE;
1743	}
1744	static BOOLEAN jjRSUM(leftv res, leftv u, leftv v)
1745	{
1746	ring r;
1747	int i=rSum((ring)u->Data(),(ring)v->Data(),r);
1748	res->data = (char *)r;
1749	return (i==-1);
1750	}
1751	#define SIMPL_LMDIV 32
1752	#define SIMPL_LMEQ 16
1753	#define SIMPL_MULT 8
1754	#define SIMPL_EQU 4
1755	#define SIMPL_NULL 2
1756	#define SIMPL_NORM 1
1757	static BOOLEAN jjSIMPL_ID(leftv res, leftv u, leftv v)
1758	{
1759	int sw = (int)v->Data();
1760	ideal id = (ideal)u->CopyD();
1761	if (sw & SIMPL_LMDIV)
1762	{
1763	idDelDiv(id);
1764	}
1765	if (sw & SIMPL_LMEQ)
1766	{
1767	idDelLmEquals(id);
1768	}
1769	if (sw & SIMPL_NULL)
1770	{
1771	idSkipZeroes(id);
1772	}
1773	if (sw & SIMPL_NORM)
1774	{
1775	idNorm(id);
1776	}
1777	if (sw & SIMPL_MULT)
1778	{
1779	idDelMultiples(id);
1780	}
1781	else if(sw & SIMPL_EQU)
1782	{
1783	idDelEquals(id);
1784	}
1785	res->data = (char * )id;
1786	return FALSE;
1787	}
1788	static BOOLEAN jjSTATUS2(leftv res, leftv u, leftv v)
1789	{
1790	res->data = mstrdup(slStatus((si_link) u->Data(), (char *) v->Data()));
1791	return FALSE;
1792	}
1793	static BOOLEAN jjSIMPL_P(leftv res, leftv u, leftv v)
1794	{
1795	int sw = (int)v->Data();
1796	poly p = (poly)u->CopyD();
1797	if (sw & SIMPL_NORM)
1798	{
1799	pNorm(p);
1800	}
1801	res->data = (char * )p;
1802	return FALSE;
1803	}
1804	static BOOLEAN jjSTD_HILB(leftv res, leftv u, leftv v)
1805	{
1806	ideal result;
1807	intvec w=(intvec )atGet(u,"isHomog");
1808	tHomog hom=testHomog;
1809	if (w!=NULL)
1810	{
1811	w=ivCopy(w);
1812	hom=isHomog;
1813	}
1814	result=kStd((ideal)(u->Data()),currQuotient,hom,&w,(intvec *)v->Data());
1815	idSkipZeroes(result);
1816	res->data = (char *)result;
1817	setFlag(res,FLAG_STD);
1818	if (w!=NULL) atSet(res,mstrdup("isHomog"),w,INTVEC_CMD);
1819	return FALSE;
1820	}
1821	static BOOLEAN jjSTD_1(leftv res, leftv u, leftv v)
1822	{
1823	ideal result;
1824	intvec w=(intvec )atGet(u,"isHomog");
1825	tHomog hom=testHomog;
1826	if (w!=NULL)
1827	{
1828	w=ivCopy(w);
1829	hom=isHomog;
1830	}
1831	ideal i1=(ideal)u->Data();
1832	ideal i0=idInit(1,i1->rank);
1833	i0->m[0]=(poly)v->Data();
1834	i1=idSimpleAdd(i1,i0);
1835	i0->m[0]=NULL;
1836	idDelete(&i0);
1837	BITSET save_test=test;
1838	test\|=Sy_bit(OPT_SB_1);
1839	result=kStd(i1,currQuotient,hom,&w);
1840	test=save_test;
1841	idDelete(&i1);
1842	idSkipZeroes(result);
1843	res->data = (char *)result;
1844	setFlag(res,FLAG_STD);
1845	if (w!=NULL) atSet(res,mstrdup("isHomog"),w,INTVEC_CMD);
1846	return FALSE;
1847	}
1848	static BOOLEAN jjVARSTR2(leftv res, leftv u, leftv v)
1849	{
1850	idhdl h=(idhdl)u->data;
1851	int i=(int)v->Data();
1852	if ((0<i) && (i<=IDRING(h)->N))
1853	res->data=mstrdup(IDRING(h)->names[i-1]);
1854	else
1855	{
1856	Werror("var number %d out of range 1..%d",i,IDRING(h)->N);
1857	return TRUE;
1858	}
1859	return FALSE;
1860	}
1861	static BOOLEAN jjWEDGE(leftv res, leftv u, leftv v)
1862	{
1863	res->data = (char *)mpWedge((matrix)u->Data(),(int)v->Data());
1864	return FALSE;
1865	}
1866	#define jjWRONG2 (proc2)jjWRONG
1867	#define jjWRONG3 (proc3)jjWRONG
1868	static BOOLEAN jjWRONG(leftv res, leftv u)
1869	{
1870	return TRUE;
1871	}
1872	/=================== operations with 2 args.: table =================/
1873	struct sValCmd2 dArith2[]=
1874	{
1875	// operations:
1876	// proc cmd res arg1 arg2
1877	{jjPLUS_I, '+', INT_CMD, INT_CMD, INT_CMD PROFILER}
1878	,{jjPLUS_N, '+', NUMBER_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
1879	,{jjPLUS_P, '+', POLY_CMD, POLY_CMD, POLY_CMD PROFILER}
1880	,{jjPLUS_P, '+', VECTOR_CMD, VECTOR_CMD, VECTOR_CMD PROFILER}
1881	,{jjPLUS_ID, '+', IDEAL_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
1882	,{jjPLUS_ID, '+', MODUL_CMD, MODUL_CMD, MODUL_CMD PROFILER}
1883	,{jjPLUS_P_MA, '+', MATRIX_CMD, POLY_CMD, MATRIX_CMD PROFILER}
1884	,{jjPLUS_MA_P, '+', MATRIX_CMD, MATRIX_CMD, POLY_CMD PROFILER}
1885	,{jjPLUS_MA, '+', MATRIX_CMD, MATRIX_CMD, MATRIX_CMD PROFILER}
1886	,{jjPLUS_S, '+', STRING_CMD, STRING_CMD, STRING_CMD PROFILER}
1887	,{jjOP_IV_I, '+', INTVEC_CMD, INTVEC_CMD, INT_CMD PROFILER}
1888	,{jjOP_I_IV, '+', INTVEC_CMD, INT_CMD, INTVEC_CMD PROFILER}
1889	,{jjOP_IM_I, '+', INTMAT_CMD, INTMAT_CMD, INT_CMD PROFILER}
1890	,{jjOP_I_IM, '+', INTMAT_CMD, INT_CMD, INTMAT_CMD PROFILER}
1891	,{jjPLUS_IV, '+', INTVEC_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
1892	,{jjPLUS_IV, '+', INTMAT_CMD, INTMAT_CMD, INTMAT_CMD PROFILER}
1893	,{lAdd, '+', LIST_CMD, LIST_CMD, LIST_CMD PROFILER}
1894	,{jjRSUM, '+', RING_CMD, RING_CMD, RING_CMD PROFILER}
1895	,{jjMINUS_I, '-', INT_CMD, INT_CMD, INT_CMD PROFILER}
1896	,{jjMINUS_N, '-', NUMBER_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
1897	,{jjMINUS_P, '-', POLY_CMD, POLY_CMD, POLY_CMD PROFILER}
1898	,{jjMINUS_P, '-', VECTOR_CMD, VECTOR_CMD, VECTOR_CMD PROFILER}
1899	,{jjPLUS_MA_P, '-', MATRIX_CMD, MATRIX_CMD, POLY_CMD PROFILER}
1900	,{jjMINUS_MA, '-', MATRIX_CMD, MATRIX_CMD, MATRIX_CMD PROFILER}
1901	,{jjOP_IV_I, '-', INTVEC_CMD, INTVEC_CMD, INT_CMD PROFILER}
1902	,{jjOP_IM_I, '-', INTMAT_CMD, INTMAT_CMD, INT_CMD PROFILER}
1903	,{jjMINUS_IV, '-', INTVEC_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
1904	,{jjMINUS_IV, '-', INTMAT_CMD, INTMAT_CMD, INTMAT_CMD PROFILER}
1905	,{jjTIMES_I, '*', INT_CMD, INT_CMD, INT_CMD PROFILER}
1906	,{jjTIMES_N, '*', NUMBER_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
1907	,{jjTIMES_P, '*', POLY_CMD, POLY_CMD, POLY_CMD PROFILER}
1908	,{jjTIMES_P, '*', VECTOR_CMD, POLY_CMD, VECTOR_CMD PROFILER}
1909	,{jjTIMES_P, '*', VECTOR_CMD, VECTOR_CMD, POLY_CMD PROFILER}
1910	,{jjTIMES_MA_P1,'*', IDEAL_CMD, IDEAL_CMD, POLY_CMD PROFILER}
1911	,{jjTIMES_MA_P2,'*', IDEAL_CMD, POLY_CMD, IDEAL_CMD PROFILER}
1912	,{jjTIMES_ID, '*', IDEAL_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
1913	,{jjTIMES_MA_P1,'*', MODUL_CMD, IDEAL_CMD, VECTOR_CMD PROFILER}
1914	,{jjTIMES_MA_P2,'*', MODUL_CMD, VECTOR_CMD, IDEAL_CMD PROFILER}
1915	,{jjTIMES_ID, '*', MODUL_CMD, IDEAL_CMD, MODUL_CMD PROFILER}
1916	,{jjTIMES_ID, '*', MODUL_CMD, MODUL_CMD, IDEAL_CMD PROFILER}
1917	,{jjTIMES_MA_P1,'*', MATRIX_CMD, MATRIX_CMD, POLY_CMD PROFILER}
1918	,{jjTIMES_MA_P2,'*', MATRIX_CMD, POLY_CMD, MATRIX_CMD PROFILER}
1919	,{jjTIMES_MA_N1,'*', MATRIX_CMD, MATRIX_CMD, NUMBER_CMD PROFILER}
1920	,{jjTIMES_MA_N2,'*', MATRIX_CMD, NUMBER_CMD, MATRIX_CMD PROFILER}
1921	,{jjTIMES_MA_I1,'*', MATRIX_CMD, MATRIX_CMD, INT_CMD PROFILER}
1922	,{jjTIMES_MA_I2,'*', MATRIX_CMD, INT_CMD, MATRIX_CMD PROFILER}
1923	,{jjTIMES_MA, '*', MATRIX_CMD, MATRIX_CMD, MATRIX_CMD PROFILER}
1924	,{jjOP_IV_I, '*', INTVEC_CMD, INTVEC_CMD, INT_CMD PROFILER}
1925	,{jjOP_I_IV, '*', INTVEC_CMD, INT_CMD, INTVEC_CMD PROFILER}
1926	,{jjOP_IV_I, '*', INTMAT_CMD, INTMAT_CMD, INT_CMD PROFILER}
1927	,{jjOP_I_IV, '*', INTMAT_CMD, INT_CMD, INTMAT_CMD PROFILER}
1928	,{jjTIMES_IV, '*', INTVEC_CMD, INTMAT_CMD, INTVEC_CMD PROFILER}
1929	,{jjTIMES_IV, '*', INTMAT_CMD, INTMAT_CMD, INTMAT_CMD PROFILER}
1930	,{jjDIV_N, '/', NUMBER_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
1931	,{jjDIV_P, '/', POLY_CMD, POLY_CMD, POLY_CMD PROFILER}
1932	,{jjDIV_P, '/', VECTOR_CMD, VECTOR_CMD, POLY_CMD PROFILER}
1933	,{jjDIV_I, '/', INT_CMD, INT_CMD, INT_CMD PROFILER}
1934	,{jjOP_IV_I, '/', INTVEC_CMD, INTVEC_CMD, INT_CMD PROFILER}
1935	,{jjOP_IV_I, '/', INTMAT_CMD, INTMAT_CMD, INT_CMD PROFILER}
1936	,{jjDIV_I, INTDIV, INT_CMD, INT_CMD, INT_CMD PROFILER}
1937	,{jjOP_IV_I, INTDIV, INTVEC_CMD, INTVEC_CMD, INT_CMD PROFILER}
1938	,{jjOP_IV_I, INTDIV, INTMAT_CMD, INTMAT_CMD, INT_CMD PROFILER}
1939	,{jjMOD_I, '%', INT_CMD, INT_CMD, INT_CMD PROFILER}
1940	,{jjOP_IV_I, '%', INTVEC_CMD, INTVEC_CMD, INT_CMD PROFILER}
1941	,{jjOP_IV_I, '%', INTMAT_CMD, INTMAT_CMD, INT_CMD PROFILER}
1942	,{jjPOWER_I, '^', INT_CMD, INT_CMD, INT_CMD PROFILER}
1943	,{jjPOWER_N, '^', NUMBER_CMD, NUMBER_CMD, INT_CMD PROFILER}
1944	,{jjPOWER_P, '^', POLY_CMD, POLY_CMD, INT_CMD PROFILER}
1945	,{jjPOWER_ID, '^', IDEAL_CMD, IDEAL_CMD, INT_CMD PROFILER}
1946	,{jjLE_I, LE, INT_CMD, INT_CMD, INT_CMD PROFILER}
1947	,{jjLE_N, LE, INT_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
1948	,{jjCOMPARE_S, LE, INT_CMD, STRING_CMD, STRING_CMD PROFILER}
1949	,{jjCOMPARE_IV_I,LE, INT_CMD, INTVEC_CMD, INT_CMD PROFILER}
1950	,{jjCOMPARE_IV,LE, INT_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
1951	,{jjCOMPARE_P, LE, INT_CMD, POLY_CMD, POLY_CMD PROFILER}
1952	,{jjCOMPARE_P, LE, INT_CMD, VECTOR_CMD, VECTOR_CMD PROFILER}
1953	,{jjLT_I, '<', INT_CMD, INT_CMD, INT_CMD PROFILER}
1954	,{jjLT_N, '<', INT_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
1955	,{jjCOMPARE_IV_I,'<', INT_CMD, INTVEC_CMD, INT_CMD PROFILER}
1956	,{jjCOMPARE_IV,'<', INT_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
1957	,{jjCOMPARE_S, '<', INT_CMD, STRING_CMD, STRING_CMD PROFILER}
1958	,{jjCOMPARE_P, '<', INT_CMD, POLY_CMD, POLY_CMD PROFILER}
1959	,{jjCOMPARE_P, '<', INT_CMD, VECTOR_CMD, VECTOR_CMD PROFILER}
1960	,{jjGE_I, GE, INT_CMD, INT_CMD, INT_CMD PROFILER}
1961	,{jjGE_N, GE, INT_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
1962	,{jjCOMPARE_S, GE, INT_CMD, STRING_CMD, STRING_CMD PROFILER}
1963	,{jjCOMPARE_IV_I,GE, INT_CMD, INTVEC_CMD, INT_CMD PROFILER}
1964	,{jjCOMPARE_IV,GE, INT_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
1965	,{jjCOMPARE_P, GE, INT_CMD, POLY_CMD, POLY_CMD PROFILER}
1966	,{jjCOMPARE_P, GE, INT_CMD, VECTOR_CMD, VECTOR_CMD PROFILER}
1967	,{jjGT_I, '>', INT_CMD, INT_CMD, INT_CMD PROFILER}
1968	,{jjGT_N, '>', INT_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
1969	,{jjCOMPARE_S, '>', INT_CMD, STRING_CMD, STRING_CMD PROFILER}
1970	,{jjCOMPARE_IV_I,'>', INT_CMD, INTVEC_CMD, INT_CMD PROFILER}
1971	,{jjCOMPARE_IV,'>', INT_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
1972	,{jjCOMPARE_P, '>', INT_CMD, POLY_CMD, POLY_CMD PROFILER}
1973	,{jjCOMPARE_P, '>', INT_CMD, VECTOR_CMD, VECTOR_CMD PROFILER}
1974	,{jjAND_I, '&', INT_CMD, INT_CMD, INT_CMD PROFILER}
1975	,{jjOR_I, '\|', INT_CMD, INT_CMD, INT_CMD PROFILER}
1976	,{jjEQUAL_I, EQUAL_EQUAL, INT_CMD, INT_CMD, INT_CMD PROFILER}
1977	,{jjEQUAL_N, EQUAL_EQUAL, INT_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
1978	,{jjCOMPARE_S, EQUAL_EQUAL, INT_CMD, STRING_CMD, STRING_CMD PROFILER}
1979	,{jjEQUAL_P, EQUAL_EQUAL, INT_CMD, POLY_CMD, POLY_CMD PROFILER}
1980	,{jjEQUAL_P, EQUAL_EQUAL, INT_CMD, VECTOR_CMD, VECTOR_CMD PROFILER}
1981	,{jjCOMPARE_IV_I,EQUAL_EQUAL, INT_CMD, INTVEC_CMD, INT_CMD PROFILER}
1982	,{jjCOMPARE_IV,EQUAL_EQUAL, INT_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
1983	,{jjCOMPARE_IV,EQUAL_EQUAL, INT_CMD, INTMAT_CMD, INTMAT_CMD PROFILER}
1984	,{jjEQUAL_Ma, EQUAL_EQUAL, INT_CMD, MATRIX_CMD, MATRIX_CMD PROFILER}
1985	,{jjWRONG2, EQUAL_EQUAL, 0, IDEAL_CMD, IDEAL_CMD PROFILER}
1986	,{jjWRONG2, EQUAL_EQUAL, 0, MODUL_CMD, MODUL_CMD PROFILER}
1987	,{jjEQUAL_I, NOTEQUAL, INT_CMD, INT_CMD, INT_CMD PROFILER}
1988	,{jjEQUAL_N, NOTEQUAL, INT_CMD, NUMBER_CMD, NUMBER_CMD PROFILER}
1989	,{jjCOMPARE_S, NOTEQUAL, INT_CMD, STRING_CMD, STRING_CMD PROFILER}
1990	,{jjEQUAL_P, NOTEQUAL, INT_CMD, POLY_CMD, POLY_CMD PROFILER}
1991	,{jjEQUAL_P, NOTEQUAL, INT_CMD, VECTOR_CMD, VECTOR_CMD PROFILER}
1992	,{jjCOMPARE_IV,NOTEQUAL, INT_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
1993	,{jjCOMPARE_IV,NOTEQUAL, INT_CMD, INTMAT_CMD, INTMAT_CMD PROFILER}
1994	,{jjEQUAL_Ma, NOTEQUAL, INT_CMD, MATRIX_CMD, MATRIX_CMD PROFILER}
1995	,{jjWRONG2, NOTEQUAL, 0, IDEAL_CMD, IDEAL_CMD PROFILER}
1996	,{jjWRONG2, NOTEQUAL, 0, MODUL_CMD, MODUL_CMD PROFILER}
1997	,{jjDOTDOT, DOTDOT, INTVEC_CMD, INT_CMD, INT_CMD PROFILER}
1998	,{jjINDEX_I, '[', INT_CMD, INTVEC_CMD, INT_CMD PROFILER}
1999	,{jjINDEX_IV, '[', INT_CMD, INTVEC_CMD, INTVEC_CMD PROFILER}
2000	,{jjINDEX_I, '[', POLY_CMD, IDEAL_CMD, INT_CMD PROFILER}
2001	,{jjINDEX_I, '[', POLY_CMD, MAP_CMD, INT_CMD PROFILER}
2002	,{jjINDEX_IV, '[', POLY_CMD, IDEAL_CMD, INTVEC_CMD PROFILER}
2003	,{jjINDEX_I, '[', VECTOR_CMD, MODUL_CMD, INT_CMD PROFILER}
2004	,{jjINDEX_IV, '[', VECTOR_CMD, MODUL_CMD, INTVEC_CMD PROFILER}
2005	,{jjINDEX_I, '[', STRING_CMD, STRING_CMD, INT_CMD PROFILER}
2006	,{jjINDEX_IV, '[', STRING_CMD, STRING_CMD, INTVEC_CMD PROFILER}
2007	,{jjINDEX_I, '[', ANY_TYPE/set by p/,LIST_CMD, INT_CMD PROFILER}
2008	,{jjINDEX_IV, '[', ANY_TYPE/set by p/,LIST_CMD, INTVEC_CMD PROFILER}
2009	,{jjINDEX_P, '[', POLY_CMD, POLY_CMD, INT_CMD PROFILER}
2010	,{jjINDEX_P_IV,'[', POLY_CMD, POLY_CMD, INTVEC_CMD PROFILER}
2011	,{jjINDEX_V, '[', POLY_CMD, VECTOR_CMD, INT_CMD PROFILER}
2012	,{jjINDEX_V_IV,'[', VECTOR_CMD, VECTOR_CMD, INTVEC_CMD PROFILER}
2013	,{jjPROC, '(', ANY_TYPE/set by p/,PROC_CMD, DEF_CMD PROFILER}
2014	,{jjMAP, '(', ANY_TYPE/set by p/,MAP_CMD, DEF_CMD PROFILER}
2015	,{jjKLAMMER, '(', ANY_TYPE/set by p/,ANY_TYPE, INT_CMD PROFILER}
2016	,{jjKLAMMER_IV,'(', ANY_TYPE/set by p/,ANY_TYPE, INTVEC_CMD PROFILER}
2017	// and the procedures with 2 arguments:
2018	,{atATTRIB2, ATTRIB_CMD, NONE/set by p/,DEF_CMD, STRING_CMD PROFILER}
2019	,{jjCOEF, COEF_CMD, MATRIX_CMD, POLY_CMD, POLY_CMD PROFILER}
2020	,{jjCOEFFS_Id, COEFFS_CMD, MATRIX_CMD, IDEAL_CMD, POLY_CMD PROFILER}
2021	,{jjCOEFFS_Id, COEFFS_CMD, MATRIX_CMD, MODUL_CMD, POLY_CMD PROFILER}
2022	,{jjCONTRACT, CONTRACT_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2023	,{jjDEG_IV, DEG_CMD, INT_CMD, POLY_CMD, INTVEC_CMD PROFILER}
2024	,{lDelete, DELETE_CMD, LIST_CMD, LIST_CMD, INT_CMD PROFILER}
2025	,{jjDIFF_P, DIFF_CMD, POLY_CMD, POLY_CMD, POLY_CMD PROFILER}
2026	,{jjDIFF_P, DIFF_CMD, VECTOR_CMD, VECTOR_CMD, POLY_CMD PROFILER}
2027	,{jjDIFF_ID, DIFF_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD PROFILER}
2028	,{jjDIFF_ID_ID,DIFF_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2029	,{jjDIFF_ID, DIFF_CMD, MODUL_CMD, MODUL_CMD, POLY_CMD PROFILER}
2030	,{jjDIFF_ID, DIFF_CMD, MATRIX_CMD, MATRIX_CMD, POLY_CMD PROFILER}
2031	,{jjDIM2, DIM_CMD, INT_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2032	,{jjDIM2, DIM_CMD, INT_CMD, MODUL_CMD, IDEAL_CMD PROFILER}
2033	,{jjELIMIN, ELIMINATION_CMD,IDEAL_CMD, IDEAL_CMD, POLY_CMD PROFILER}
2034	,{jjELIMIN, ELIMINATION_CMD,MODUL_CMD, MODUL_CMD, POLY_CMD PROFILER}
2035	,{jjEXTGCD_I, EXTGCD_CMD, LIST_CMD, INT_CMD, INT_CMD PROFILER}
2036	#ifdef HAVE_FACTORY
2037	,{jjEXTGCD_P, EXTGCD_CMD, LIST_CMD, POLY_CMD, POLY_CMD PROFILER}
2038	,{jjSQR_FREE_DEC,FAC_CMD, IDEAL_CMD, POLY_CMD, INT_CMD PROFILER}
2039	,{jjFACSTD2, FACSTD_CMD, LIST_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2040	#else
2041	,{jjWRONG2, EXTGCD_CMD, LIST_CMD, POLY_CMD, POLY_CMD PROFILER}
2042	,{jjWRONG2, FAC_CMD, IDEAL_CMD, POLY_CMD, INT_CMD PROFILER}
2043	,{jjWRONG2, FACSTD_CMD, LIST_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2044	#endif
2045	,{jjFETCH, FETCH_CMD, ANY_TYPE/set by p/,RING_CMD, ANY_TYPE PROFILER}
2046	,{jjFETCH, FETCH_CMD, ANY_TYPE/set by p/,QRING_CMD, ANY_TYPE PROFILER}
2047	#ifdef HAVE_FGLM
2048	,{fglmProc, FGLM_CMD, IDEAL_CMD, RING_CMD, DEF_CMD PROFILER}
2049	,{fglmProc, FGLM_CMD, IDEAL_CMD, QRING_CMD, DEF_CMD PROFILER}
2050	#else
2051	,{jjWRONG2, FGLM_CMD, IDEAL_CMD, RING_CMD, DEF_CMD PROFILER}
2052	,{jjWRONG2, FGLM_CMD, IDEAL_CMD, QRING_CMD, DEF_CMD PROFILER}
2053	#endif
2054	,{jjFIND2, FIND_CMD, INT_CMD, STRING_CMD, STRING_CMD PROFILER}
2055	,{jjGCD_I, GCD_CMD, INT_CMD, INT_CMD, INT_CMD PROFILER}
2056	#ifdef HAVE_FACTORY
2057	,{jjGCD_P, GCD_CMD, POLY_CMD, POLY_CMD, POLY_CMD PROFILER}
2058	#else
2059	,{jjWRONG2, GCD_CMD, POLY_CMD, POLY_CMD, POLY_CMD PROFILER}
2060	#endif
2061	,{jjHILBERT2, HILBERT_CMD, INTVEC_CMD, IDEAL_CMD, INT_CMD PROFILER}
2062	,{jjHILBERT2, HILBERT_CMD, INTVEC_CMD, MODUL_CMD, INT_CMD PROFILER}
2063	,{jjHOMOG_P, HOMOG_CMD, POLY_CMD, POLY_CMD, POLY_CMD PROFILER}
2064	,{jjHOMOG_P, HOMOG_CMD, VECTOR_CMD, VECTOR_CMD, POLY_CMD PROFILER}
2065	,{jjHOMOG_ID, HOMOG_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD PROFILER}
2066	,{jjHOMOG_ID, HOMOG_CMD, MODUL_CMD, MODUL_CMD, POLY_CMD PROFILER}
2067	,{jjCALL2MANY, IDEAL_CMD, IDEAL_CMD, DEF_CMD, DEF_CMD PROFILER}
2068	,{jjFETCH, IMAP_CMD, ANY_TYPE/set by p/,RING_CMD, ANY_TYPE PROFILER}
2069	,{jjFETCH, IMAP_CMD, ANY_TYPE/set by p/,QRING_CMD, ANY_TYPE PROFILER}
2070	,{jjINDEPSET2, INDEPSET_CMD, LIST_CMD, IDEAL_CMD, INT_CMD PROFILER}
2071	,{lInsert, INSERT_CMD, LIST_CMD, LIST_CMD, DEF_CMD PROFILER}
2072	,{jjINTERSECT, INTERSECT_CMD, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2073	,{jjINTERSECT, INTERSECT_CMD, MODUL_CMD, MODUL_CMD, MODUL_CMD PROFILER}
2074	,{jjJET_P, JET_CMD, POLY_CMD, POLY_CMD, INT_CMD PROFILER}
2075	,{jjJET_ID, JET_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD PROFILER}
2076	,{jjJET_P, JET_CMD, VECTOR_CMD, VECTOR_CMD, INT_CMD PROFILER}
2077	,{jjJET_ID, JET_CMD, MODUL_CMD, MODUL_CMD, INT_CMD PROFILER}
2078	,{jjKBASE2, KBASE_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD PROFILER}
2079	,{jjKBASE2, KBASE_CMD, MODUL_CMD, MODUL_CMD, INT_CMD PROFILER}
2080	,{atKILLATTR2, KILLATTR_CMD, NONE, IDHDL, STRING_CMD PROFILER}
2081	,{jjKoszul, KOSZUL_CMD, MATRIX_CMD, INT_CMD, INT_CMD PROFILER}
2082	,{jjKoszul_Id, KOSZUL_CMD, MATRIX_CMD, INT_CMD, IDEAL_CMD PROFILER}
2083	,{jjLIFT, LIFT_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2084	,{jjLIFT, LIFT_CMD, MATRIX_CMD, MODUL_CMD, MODUL_CMD PROFILER}
2085	,{jjLIFTSTD, LIFTSTD_CMD, IDEAL_CMD, IDEAL_CMD, MATRIX_CMD PROFILER}
2086	,{jjLIFTSTD, LIFTSTD_CMD, MODUL_CMD, MODUL_CMD, MATRIX_CMD PROFILER}
2087	,{jjCALL2MANY, LIST_CMD, LIST_CMD, DEF_CMD, DEF_CMD PROFILER}
2088	,{jjRES, LRES_CMD, RESOLUTION_CMD, IDEAL_CMD, INT_CMD PROFILER}
2089	,{jjRES, LRES_CMD, RESOLUTION_CMD, MODUL_CMD, INT_CMD PROFILER}
2090	,{jjMINOR, MINOR_CMD, IDEAL_CMD, MATRIX_CMD, INT_CMD PROFILER}
2091	,{jjCALL2MANY, MODUL_CMD, MODUL_CMD, DEF_CMD, DEF_CMD PROFILER}
2092	,{jjMODULO, MODULO_CMD, MODUL_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2093	,{jjMODULO, MODULO_CMD, MODUL_CMD, MODUL_CMD, MODUL_CMD PROFILER}
2094	,{jjMONITOR2, MONITOR_CMD, NONE, STRING_CMD, STRING_CMD PROFILER}
2095	//,{jjRES, MRES_CMD, LIST_CMD, IDEAL_CMD, INT_CMD PROFILER}
2096	//,{jjRES, MRES_CMD, LIST_CMD, MODUL_CMD, INT_CMD PROFILER}
2097	,{jjRES, MRES_CMD, RESOLUTION_CMD, IDEAL_CMD, INT_CMD PROFILER}
2098	,{jjRES, MRES_CMD, RESOLUTION_CMD, MODUL_CMD, INT_CMD PROFILER}
2099	,{jjPARSTR2, PARSTR_CMD, STRING_CMD, RING_CMD, INT_CMD PROFILER}
2100	,{jjPARSTR2, PARSTR_CMD, STRING_CMD, QRING_CMD, INT_CMD PROFILER}
2101	,{jjPRINT_FORMAT, PRINT_CMD, NONE, DEF_CMD, STRING_CMD PROFILER}
2102	,{jjQUOT, QUOTIENT_CMD, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2103	,{jjQUOT, QUOTIENT_CMD, MODUL_CMD, MODUL_CMD, IDEAL_CMD PROFILER}
2104	,{jjQUOT, QUOTIENT_CMD, IDEAL_CMD, MODUL_CMD, MODUL_CMD PROFILER}
2105	,{jjRANDOM, RANDOM_CMD, INT_CMD, INT_CMD, INT_CMD PROFILER}
2106	,{jjREAD2, READ_CMD, STRING_CMD, LINK_CMD, STRING_CMD PROFILER}
2107	,{jjREDUCE_P, REDUCE_CMD, POLY_CMD, POLY_CMD, IDEAL_CMD PROFILER}
2108	,{jjREDUCE_P, REDUCE_CMD, VECTOR_CMD, VECTOR_CMD, IDEAL_CMD PROFILER}
2109	,{jjREDUCE_P, REDUCE_CMD, VECTOR_CMD, VECTOR_CMD, MODUL_CMD PROFILER}
2110	,{jjREDUCE_ID, REDUCE_CMD, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD PROFILER}
2111	,{jjREDUCE_ID, REDUCE_CMD, MODUL_CMD, MODUL_CMD, MODUL_CMD PROFILER}
2112	,{jjREDUCE_ID, REDUCE_CMD, MODUL_CMD, MODUL_CMD, IDEAL_CMD PROFILER}
2113	//,{jjRES, RES_CMD, LIST_CMD, IDEAL_CMD, INT_CMD PROFILER}
2114	//,{jjRES, RES_CMD, LIST_CMD, MODUL_CMD, INT_CMD PROFILER}
2115	,{jjRES, RES_CMD, RESOLUTION_CMD, IDEAL_CMD, INT_CMD PROFILER}
2116	,{jjRES, RES_CMD, RESOLUTION_CMD, MODUL_CMD, INT_CMD PROFILER}
2117	,{jjSTATUS2, STATUS_CMD, STRING_CMD, LINK_CMD, STRING_CMD PROFILER}
2118	,{jjSIMPL_P, SIMPLIFY_CMD, POLY_CMD, POLY_CMD, INT_CMD PROFILER}
2119	,{jjSIMPL_P, SIMPLIFY_CMD, VECTOR_CMD, VECTOR_CMD, INT_CMD PROFILER}
2120	,{jjSIMPL_ID, SIMPLIFY_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD PROFILER}
2121	,{jjSIMPL_ID, SIMPLIFY_CMD, MODUL_CMD, MODUL_CMD, INT_CMD PROFILER}
2122	//,{jjRES, SRES_CMD, LIST_CMD, IDEAL_CMD, INT_CMD PROFILER}
2123	//,{jjRES, SRES_CMD, LIST_CMD, MODUL_CMD, INT_CMD PROFILER}
2124	,{jjRES, SRES_CMD, RESOLUTION_CMD, IDEAL_CMD, INT_CMD PROFILER}
2125	,{jjRES, SRES_CMD, RESOLUTION_CMD, MODUL_CMD, INT_CMD PROFILER}
2126	,{jjCALL2MANY, SYSTEM_CMD, ANY_TYPE/set by p/,STRING_CMD, DEF_CMD PROFILER}
2127	,{jjSTD_1, STD_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD PROFILER}
2128	,{jjSTD_1, STD_CMD, MODUL_CMD, MODUL_CMD, VECTOR_CMD PROFILER}
2129	,{jjSTD_HILB, STD_CMD, IDEAL_CMD, IDEAL_CMD, INTVEC_CMD PROFILER}
2130	,{jjSTD_HILB, STD_CMD, MODUL_CMD, MODUL_CMD, INTVEC_CMD PROFILER}
2131	,{jjVARSTR2, VARSTR_CMD, STRING_CMD, RING_CMD, INT_CMD PROFILER}
2132	,{jjVARSTR2, VARSTR_CMD, STRING_CMD, QRING_CMD, INT_CMD PROFILER}
2133	,{jjWEDGE, WEDGE_CMD, MATRIX_CMD, MATRIX_CMD, INT_CMD PROFILER}
2134	,{NULL, 0, 0, 0, 0 PROFILER}
2135	};
2136	/=================== operations with 1 arg.: static proc =================/
2137	static BOOLEAN jjDUMMY(leftv res, leftv u)
2138	{
2139	res->data = (char *)u->CopyD();
2140	return FALSE;
2141	}
2142	static BOOLEAN jjNULL(leftv res, leftv u)
2143	{
2144	return FALSE;
2145	}
2146	//static BOOLEAN jjPLUSPLUS(leftv res, leftv u)
2147	//{
2148	// res->data = (char *)((int)u->Data()+1);
2149	// return FALSE;
2150	//}
2151	//static BOOLEAN jjMINUSMINUS(leftv res, leftv u)
2152	//{
2153	// res->data = (char *)((int)u->Data()-1);
2154	// return FALSE;
2155	//}
2156	static BOOLEAN jjPLUSPLUS(leftv res, leftv u)
2157	{
2158	if (IDTYP((idhdl)u->data)==INT_CMD)
2159	{
2160	if (iiOp==PLUSPLUS) IDINT((idhdl)u->data)++;
2161	else IDINT((idhdl)u->data)--;
2162	return FALSE;
2163	}
2164	return TRUE;
2165	}
2166	static BOOLEAN jjUMINUS_I(leftv res, leftv u)
2167	{
2168	res->data = (char *)(-(int)u->Data());
2169	return FALSE;
2170	}
2171	static BOOLEAN jjUMINUS_N(leftv res, leftv u)
2172	{
2173	number n=nNeg((number)u->CopyD());
2174	res->data = (char *)n;
2175	return FALSE;
2176	}
2177	static BOOLEAN jjUMINUS_P(leftv res, leftv u)
2178	{
2179	res->data = (char *)pNeg((poly)u->CopyD(POLY_CMD));
2180	return FALSE;
2181	}
2182	static BOOLEAN jjUMINUS_MA(leftv res, leftv u)
2183	{
2184	poly m1=pISet(-1);
2185	res->data = (char *)mpMultP((matrix)u->CopyD(MATRIX_CMD),m1);
2186	return FALSE;
2187	}
2188	static BOOLEAN jjUMINUS_IV(leftv res, leftv u)
2189	{
2190	intvec iv=(intvec )u->CopyD(INTVEC_CMD);
2191	(iv)=(-1);
2192	res->data = (char *)iv;
2193	return FALSE;
2194	}
2195	static BOOLEAN jjPROC1(leftv res, leftv u)
2196	{
2197	if ((u->rtyp!=IDHDL) \|\| (u->e!=NULL))
2198	return TRUE;
2199	leftv sl = iiMake_proc((idhdl) u->data,NULL);
2200	if (sl==NULL)
2201	{
2202	return TRUE;
2203	}
2204	else
2205	{
2206	memcpy(res,sl,sizeof(sleftv));
2207	}
2208	return FALSE;
2209	}
2210	static BOOLEAN jjBAREISS(leftv res, leftv v)
2211	{
2212	matrix m=(matrix)v->Data();
2213	lists l=mpBareiss(m,FALSE);
2214	res->data = (char *)l;
2215	return FALSE;
2216	}
2217	static BOOLEAN jjBAREISS_IM(leftv res, leftv v)
2218	{
2219	intvec m=(intvec )v->CopyD();
2220	ivTriangMat(m,1,1);
2221	res->data = (char *)m;
2222	return FALSE;
2223	}
2224	static BOOLEAN jjCALL1MANY(leftv res, leftv u)
2225	{
2226	return iiExprArithM(res,u,iiOp);
2227	}
2228	static BOOLEAN jjCHAR(leftv res, leftv v)
2229	{
2230	res->data = (char *)rChar((ring)v->Data());
2231	return FALSE;
2232	}
2233	static BOOLEAN jjCOLS(leftv res, leftv v)
2234	{
2235	res->data = (char *)MATCOLS((matrix)(v->Data()));
2236	return FALSE;
2237	}
2238	static BOOLEAN jjCOLS_IV(leftv res, leftv v)
2239	{
2240	res->data = (char )((intvec)(v->Data()))->cols();
2241	return FALSE;
2242	}
2243	static BOOLEAN jjCONTENT(leftv res, leftv v)
2244	{
2245	poly p=(poly)v->CopyD();
2246	if (p!=NULL) pCleardenom(p);
2247	res->data = (char *)p;
2248	return FALSE;
2249	}
2250	static BOOLEAN jjCOUNT_N(leftv res, leftv v)
2251	{
2252	res->data = (char *)nSize((number)v->Data());
2253	return FALSE;
2254	}
2255	static BOOLEAN jjCOUNT_L(leftv res, leftv v)
2256	{
2257	lists l=(lists)v->Data();
2258	res->data = (char *)(l->nr+1);
2259	return FALSE;
2260	}
2261	static BOOLEAN jjCOUNT_M(leftv res, leftv v)
2262	{
2263	matrix m=(matrix)v->Data();
2264	res->data = (char )(MATROWS(m)MATCOLS(m));
2265	return FALSE;
2266	}
2267	static BOOLEAN jjCOUNT_IV(leftv res, leftv v)
2268	{
2269	res->data = (char )((intvec)(v->Data()))->length();
2270	return FALSE;
2271	}
2272	static BOOLEAN jjDEG(leftv res, leftv v)
2273	{
2274	int dummy;
2275	poly p=(poly)v->Data();
2276	if (p!=NULL) res->data = (char *)pLDeg(p,&dummy);
2277	else res->data=(char *)-1;
2278	return FALSE;
2279	}
2280	static BOOLEAN jjDEGREE(leftv res, leftv v)
2281	{
2282	assumeStdFlag(v);
2283	scDegree((ideal)v->Data(),currQuotient);
2284	return FALSE;
2285	}
2286	static BOOLEAN jjDEFINED(leftv res, leftv v)
2287	{
2288	if ((v->rtyp==IDHDL)
2289	&& ((myynest==IDLEV((idhdl)v->data))\|\|(0==IDLEV((idhdl)v->data))))
2290	{
2291	res->data=(void *)(IDLEV((idhdl)v->data)+1);
2292	}
2293	else if (v->rtyp!=0) res->data=(void *)(-1);
2294	return FALSE;
2295	}
2296	#ifdef HAVE_FACTORY
2297	static BOOLEAN jjDET(leftv res, leftv v)
2298	{
2299	int i,j;
2300	matrix m=(matrix)v->Data();
2301	if (currRing->parameter==NULL)
2302	{
2303	for(i=m->rows();i>0;i--)
2304	{
2305	for(j=m->cols();j>0;j--)
2306	{
2307	if((MATELEM(m,i,j)!=NULL)
2308	&& (!pIsConstant(MATELEM(m,i,j))))
2309	{
2310	goto nonconst;
2311	}
2312	}
2313	}
2314	res->data = (char *)singclap_det(m);
2315	return FALSE;
2316	}
2317	nonconst:
2318	res->data = (char *)mpDet(m);
2319	return FALSE;
2320	}
2321	static BOOLEAN jjDET_I(leftv res, leftv v)
2322	{
2323	intvec * m=(intvec*)v->Data();
2324	int i,j;
2325	i=m->rows();j=m->cols();
2326	if(i==j)
2327	res->data = (char *)singclap_det_i(m);
2328	else
2329	{
2330	Werror("det of %d x %d intmat",i,j);
2331	return TRUE;
2332	}
2333	return FALSE;
2334	}
2335	#endif
2336	static BOOLEAN jjDIM(leftv res, leftv v)
2337	{
2338	assumeStdFlag(v);
2339	res->data = (char *)scDimInt((ideal)(v->Data()),currQuotient);
2340	return FALSE;
2341	}
2342	static BOOLEAN jjDUMP(leftv res, leftv v)
2343	{
2344	si_link l = (si_link)v->Data();
2345	if (slDump(l))
2346	{
2347	const char *s;
2348	if ((l!=NULL)&&(l->name!=NULL)) s=l->name;
2349	else s=sNoName;
2350	Werror("cannot dump to `%s`",s);
2351	return TRUE;
2352	}
2353	else
2354	return FALSE;
2355	}
2356	static BOOLEAN jjE(leftv res, leftv v)
2357	{
2358	res->data = (char *)pOne();
2359	pSetComp((poly)res->data,(int)v->Data());
2360	return FALSE;
2361	}
2362	static BOOLEAN jjGETDUMP(leftv res, leftv v)
2363	{
2364	si_link l = (si_link)v->Data();
2365	if (slGetDump(l))
2366	{
2367	const char *s;
2368	if ((l!=NULL)&&(l->name!=NULL)) s=l->name;
2369	else s=sNoName;
2370	Werror("cannot get dump from `%s`",s);
2371	return TRUE;
2372	}
2373	else
2374	return FALSE;
2375	}
2376	#ifdef HAVE_FACTORY
2377	static BOOLEAN jjFACSTD(leftv res, leftv v)
2378	{
2379	res->data=(void *)kStdfac((ideal)v->Data(),NULL,testHomog,NULL);
2380	setFlag(res,FLAG_STD);
2381	return FALSE;
2382	}
2383	#endif
2384	static BOOLEAN jjHILBERT(leftv res, leftv v)
2385	{
2386	assumeStdFlag(v);
2387	intvec module_w=(intvec)atGet(v,"isHomog");
2388	//scHilbertPoly((ideal)v->Data(),currQuotient);
2389	hLookSeries((ideal)v->Data(),module_w,currQuotient);
2390	return FALSE;
2391	}
2392	static BOOLEAN jjHILBERT_IV(leftv res, leftv v)
2393	{
2394	res->data=(void )hSecondSeries((intvec )v->Data());
2395	return FALSE;
2396	}
2397	static BOOLEAN jjHOMOG1(leftv res, leftv v)
2398	{
2399	intvec *w;
2400	res->data=(void *)idHomModule((ideal)v->Data(),currQuotient,&w);
2401	if ((v->rtyp==IDHDL)&&(w!=NULL))
2402	atSet((idhdl)v->data,mstrdup("isHomog"),w,INTVEC_CMD);
2403	return FALSE;
2404	}
2405	static BOOLEAN jjIDEAL_Ma(leftv res, leftv v)
2406	{
2407	matrix mat=(matrix)v->CopyD();
2408	IDELEMS((ideal)mat)=MATCOLS(mat)*MATROWS(mat);
2409	MATROWS(mat)=1;
2410	mat->rank=1;
2411	res->data=(char *)mat;
2412	return FALSE;
2413	}
2414	static BOOLEAN jjIDEAL_Map(leftv res, leftv v)
2415	{
2416	map m=(map)v->CopyD();
2417	FreeL((ADDRESS)m->preimage);
2418	m->preimage=NULL;
2419	ideal I=(ideal)m;
2420	I->rank=1;
2421	res->data=(char *)I;
2422	return FALSE;
2423	}
2424	static BOOLEAN jjIDEAL_R(leftv res, leftv v)
2425	{
2426	if (currRing!=NULL)
2427	{
2428	ring q=(ring)v->Data();
2429	if ((q->ch==currRing->ch)
2430	&& (q->N==currRing->N)) /* && varnames equ. */
2431	{
2432	if (q->qideal==NULL)
2433	res->data=(char *)idInit(1,1);
2434	else
2435	res->data=(char *)idCopy(q->qideal);
2436	return FALSE;
2437	}
2438	}
2439	return TRUE;
2440	}
2441	static BOOLEAN jjIm2Iv(leftv res, leftv v)
2442	{
2443	intvec iv = (intvec )v->CopyD();
2444	iv->makeVector();
2445	res->data = iv;
2446	return FALSE;
2447	}
2448	static BOOLEAN jjINDEPSET(leftv res, leftv v)
2449	{
2450	assumeStdFlag(v);
2451	res->data=(void *)scIndIntvec((ideal)(v->Data()),currQuotient);
2452	return FALSE;
2453	}
2454	static BOOLEAN jjINTERRED(leftv res, leftv v)
2455	{
2456	ideal result=kInterRed((ideal)(v->Data()),currQuotient);
2457	//if (result==NULL) return TRUE;
2458	idSkipZeroes(result);
2459	res->data = result;
2460	return FALSE;
2461	}
2462	static BOOLEAN jjIS_RINGVAR_P(leftv res, leftv v)
2463	{
2464	res->data = (char *)pVar((poly)v->Data());
2465	return FALSE;
2466	}
2467	static BOOLEAN jjIS_RINGVAR_S(leftv res, leftv v)
2468	{
2469	res->data = (char )(rIsRingVar((char )v->Data())+1);
2470	return FALSE;
2471	}
2472	static BOOLEAN jjIS_RINGVAR0(leftv res, leftv v)
2473	{
2474	res->data = (char *)0;
2475	return FALSE;
2476	}
2477	static BOOLEAN jjJACOB_P(leftv res, leftv v)
2478	{
2479	ideal i=idInit(pVariables,1);
2480	int k;
2481	for (k=pVariables;k>0;k--)
2482	{
2483	i->m[k-1]=pDiff(pCopy((poly)(v->Data())),k);
2484	}
2485	res->data = (char *)i;
2486	return FALSE;
2487	}
2488	static BOOLEAN jjKBASE(leftv res, leftv v)
2489	{
2490	assumeStdFlag(v);
2491	res->data = (char *)scKBase(-1,(ideal)(v->Data()),currQuotient);
2492	return FALSE;
2493	}
2494	static BOOLEAN jjKLAMMER_LIB(leftv res, leftv u)
2495	{
2496	char * s=(char *)u->Data();
2497	return iiLibCmd(s);
2498	}
2499	#ifdef MDEBUG
2500	static BOOLEAN jjpHead(leftv res, leftv v)
2501	{
2502	res->data=(char *)pHead((poly)v->Data());
2503	return FALSE;
2504	}
2505	#endif
2506	static BOOLEAN jjL2R(leftv res, leftv v)
2507	{
2508	res->data=(char *)syConvList((lists)v->Data());
2509	return FALSE;
2510	}
2511	static BOOLEAN jjLEADCOEF(leftv res, leftv v)
2512	{
2513	poly p=(poly)v->Data();
2514	if (p==NULL)
2515	{
2516	res->data=(char *)nInit(0);
2517	}
2518	else
2519	{
2520	res->data=(char *)nCopy(pGetCoeff(p));
2521	}
2522	return FALSE;
2523	}
2524	static BOOLEAN jjLEADEXP(leftv res, leftv v)
2525	{
2526	poly p=(poly)v->Data();
2527	intvec *iv=new intvec(pVariables);
2528	if (p!=NULL)
2529	{
2530	for(int i = pVariables;i;i--)
2531	{
2532	(*iv)[i-1]=pGetExp(p,i);
2533	}
2534	}
2535	res->data=(char *)iv;
2536	return FALSE;
2537	}
2538	static BOOLEAN jjMEMORY(leftv res, leftv v)
2539	{
2540	#ifdef MM_COUNT
2541	switch(((int)v->Data()))
2542	{
2543	case 0:
2544	res->data = (char *)mmMemUsed();
2545	break;
2546	case 1:
2547	res->data = (char *)mmMemReal();
2548	break;
2549	#ifdef HAVE_SBRK
2550	case 2:
2551	res->data = (char *)mmMemPhysical();
2552	break;
2553	#endif
2554	default:
2555	#ifdef MM_STAT
2556	mmStat((int)v->Data());
2557	#endif
2558	res->data = (char *)0;
2559	}
2560	return FALSE;
2561	#else
2562	res->data = (char *)0;
2563	return FALSE;
2564	#endif
2565	}
2566	static BOOLEAN jjMONITOR1(leftv res, leftv v)
2567	{
2568	monitor((char *)(v->Data()),PROT_I);
2569	return FALSE;
2570	}
2571	static BOOLEAN jjMSTD(leftv res, leftv v)
2572	{
2573	res->data=(void *)min_std((ideal)v->Data(),currQuotient,testHomog,NULL);
2574	return FALSE;
2575	}
2576	static BOOLEAN jjMULT(leftv res, leftv v)
2577	{
2578	assumeStdFlag(v);
2579	res->data = (char *)scMultInt((ideal)(v->Data()),currQuotient);
2580	return FALSE;
2581	}
2582	static BOOLEAN jjNAMEOF(leftv res, leftv v)
2583	{
2584	res->data = (char *)v->name;
2585	if (res->data==NULL) res->data=mstrdup("");
2586	v->name=NULL;
2587	return FALSE;
2588	}
2589	static BOOLEAN jjNAMES(leftv res, leftv v)
2590	{
2591	res->data=ipNameList(((ring)v->Data())->idroot);
2592	return FALSE;
2593	}
2594	static BOOLEAN jjNVARS(leftv res, leftv v)
2595	{
2596	res->data = (char *)(((ring)(v->Data()))->N);
2597	return FALSE;
2598	}
2599	static BOOLEAN jjOpenClose(leftv res, leftv v)
2600	{
2601	si_link l=(si_link)v->Data();
2602	if (iiOp==OPEN_CMD) return slOpen(l, SI_LINK_OPEN);
2603	else return slClose(l);
2604	}
2605	static BOOLEAN jjORD(leftv res, leftv v)
2606	{
2607	poly p=(poly)v->Data();
2608	res->data=(char *)( p==NULL ? -1 : pFDeg(p) );
2609	return FALSE;
2610	}
2611	static BOOLEAN jjPAR1(leftv res, leftv v)
2612	{
2613	int i=(int)v->Data();
2614	int p=0;
2615	p=rPar(currRing);
2616	if ((0<i) && (i<=p))
2617	{
2618	res->data=(char *)nPar(i);
2619	}
2620	else
2621	{
2622	Werror("par number %d out of range 1..%d",i,p);
2623	return TRUE;
2624	}
2625	return FALSE;
2626	}
2627	static BOOLEAN jjPARDEG(leftv res, leftv v)
2628	{
2629	res->data = (char *)nParDeg((number)v->Data());
2630	return FALSE;
2631	}
2632	static BOOLEAN jjPARSTR1(leftv res, leftv v)
2633	{
2634	if (currRing==NULL)
2635	{
2636	WerrorS("no ring active");
2637	return TRUE;
2638	}
2639	int i=(int)v->Data();
2640	int p=0;
2641	if ((0<i) && (currRing->parameter!=NULL) && (i<=(p=rPar(currRing))))
2642	res->data=mstrdup(currRing->parameter[i-1]);
2643	else
2644	{
2645	Werror("par number %d out of range 1..%d",i,p);
2646	return TRUE;
2647	}
2648	return FALSE;
2649	}
2650	static BOOLEAN jjP2I(leftv res, leftv v)
2651	{
2652	poly p=(poly)v->Data();
2653	if (p==NULL) { /res->data=(char )0;*/ return FALSE; }
2654	if ((pNext(p)!=NULL)\|\| (!pIsConstant(p)))
2655	{
2656	WerrorS("poly must be constant");
2657	return TRUE;
2658	}
2659	res->data = (char *)nInt(pGetCoeff(p));
2660	return FALSE;
2661	}
2662	static BOOLEAN jjPRIME(leftv res, leftv v)
2663	{
2664	int i = IsPrime((int)(v->Data()));
2665	res->data = (char *)(i > 1 ? i : 2);
2666	return FALSE;
2667	}
2668	static BOOLEAN jjP2N(leftv res, leftv v)
2669	{
2670	number n;
2671	poly p;
2672	if (((p=(poly)v->Data())!=NULL)
2673	&& (pIsConstant(p)))
2674	{
2675	n=nCopy(pGetCoeff(p));
2676	}
2677	else
2678	{
2679	n=nInit(0);
2680	}
2681	res->data = (char *)n;
2682	return FALSE;
2683	}
2684	static BOOLEAN jjRESERVEDNAME(leftv res, leftv v)
2685	{
2686	char s= (char )v->Data();
2687	int i = 1;
2688	int l = strlen(s);
2689	while (cmds[i].tokval!=0)
2690	{
2691	if (strcmp(s, cmds[i].name) == 0)
2692	{
2693	res->data = (char *)1;
2694	return FALSE;
2695	}
2696	i++;
2697	}
2698	//res->data = (char *)0;
2699	return FALSE;
2700	}
2701	static BOOLEAN jjREAD(leftv res, leftv v)
2702	{
2703	return jjREAD2(res,v,NULL);
2704	}
2705	static BOOLEAN jjREGULARITY(leftv res, leftv v)
2706	{
2707	res->data = (char *)iiRegularity((lists)v->Data());
2708	return FALSE;
2709	}
2710	static BOOLEAN jjROWS(leftv res, leftv v)
2711	{
2712	ideal i = (ideal)v->Data();
2713	res->data = (char *)i->rank;
2714	return FALSE;
2715	}
2716	static BOOLEAN jjROWS_IV(leftv res, leftv v)
2717	{
2718	res->data = (char )((intvec)(v->Data()))->rows();
2719	return FALSE;
2720	}
2721	static BOOLEAN jjRPAR(leftv res, leftv v)
2722	{
2723	res->data = (char *)((ring)v->Data())->P;
2724	return FALSE;
2725	}
2726	static BOOLEAN jjSTD(leftv res, leftv v)
2727	{
2728	ideal result;
2729	intvec w=(intvec )atGet(v,"isHomog");
2730	tHomog hom=testHomog;
2731	if (w!=NULL)
2732	{
2733	w=ivCopy(w);
2734	hom=isHomog;
2735	}
2736	//if (hasFlag(v,FLAG_STD))
2737	// result=stdred((ideal)v->Data(),currQuotient,hom,&w);
2738	//else
2739	result=kStd((ideal)(v->Data()),currQuotient,hom,&w);
2740	idSkipZeroes(result);
2741	res->data = (char *)result;
2742	setFlag(res,FLAG_STD);
2743	if (w!=NULL) atSet(res,mstrdup("isHomog"),w,INTVEC_CMD);
2744	return FALSE;
2745	}
2746	static BOOLEAN jjSTRING(leftv res, leftv v)
2747	{
2748	res->data = (char *)v->String();
2749	if (res->data==NULL)
2750	{
2751	Werror("cannot convert %s to string",Tok2Cmdname(v->Typ()));
2752	return TRUE;
2753	}
2754	return FALSE;
2755	}
2756	static BOOLEAN jjSort_Id(leftv res, leftv v)
2757	{
2758	res->data = (char *)idSort((ideal)v->Data());
2759	return FALSE;
2760	}
2761	static BOOLEAN jjSTRING_PROC(leftv res, leftv v)
2762	{
2763	procinfov pi = IDPROC((idhdl)v->data);
2764	if((pi->language == LANG_SINGULAR) && (pi->data.s.body!=NULL))
2765	//if(pi->language == LANG_SINGULAR)
2766	{
2767	//if(pi->data.s.body==NULL)
2768	// iiGetLibProcBuffer(IDPROC((idhdl)v->data));
2769	res->data=mstrdup(pi->data.s.body);
2770	}
2771	else
2772	res->data=mstrdup("");
2773	return FALSE;
2774	}
2775	static BOOLEAN jjSYZYGY(leftv res, leftv v)
2776	{
2777	intvec *w=NULL;
2778	res->data = (char *)idSyzygies((ideal)v->Data(),currQuotient,testHomog,&w);
2779	if (w!=NULL) delete w;
2780	return FALSE;
2781	}
2782	static BOOLEAN jjTRACE_IV(leftv res, leftv v)
2783	{
2784	res->data = (char )ivTrace((intvec)(v->Data()));
2785	return FALSE;
2786	}
2787	static BOOLEAN jjTRANSP_IV(leftv res, leftv v)
2788	{
2789	res->data = (char )ivTranp((intvec)(v->Data()));
2790	return FALSE;
2791	}
2792	static BOOLEAN jjTYPEOF(leftv res, leftv v)
2793	{
2794	switch ((int)v->data)
2795	{
2796	case INT_CMD: res->data=mstrdup("int"); break;
2797	case POLY_CMD: res->data=mstrdup("poly"); break;
2798	case VECTOR_CMD: res->data=mstrdup("vector"); break;
2799	case STRING_CMD: res->data=mstrdup("string"); break;
2800	case INTVEC_CMD: res->data=mstrdup("intvec"); break;
2801	case IDEAL_CMD: res->data=mstrdup("ideal"); break;
2802	case MATRIX_CMD: res->data=mstrdup("matrix"); break;
2803	case MODUL_CMD: res->data=mstrdup("module"); break;
2804	case MAP_CMD: res->data=mstrdup("map"); break;
2805	case PROC_CMD: res->data=mstrdup("proc"); break;
2806	case RING_CMD: res->data=mstrdup("ring"); break;
2807	case QRING_CMD: res->data=mstrdup("qring"); break;
2808	case INTMAT_CMD: res->data=mstrdup("intmat"); break;
2809	case NUMBER_CMD: res->data=mstrdup("number"); break;
2810	case LIST_CMD: res->data=mstrdup("list"); break;
2811	case PACKAGE_CMD: res->data=mstrdup("package"); break;
2812	case LINK_CMD: res->data=mstrdup("link"); break;
2813	case RESOLUTION_CMD:res->data=mstrdup("resolution");break;
2814	case DEF_CMD:
2815	case NONE: res->data=mstrdup("none"); break;
2816	default: res->data=mstrdup("?unknown type?");
2817	}
2818	return FALSE;
2819	}
2820	static BOOLEAN jjVAR1(leftv res, leftv v)
2821	{
2822	int i=(int)v->Data();
2823	if ((0<i) && (i<=currRing->N))
2824	{
2825	poly p=pOne();
2826	pSetExp(p,i,1);
2827	pSetm(p);
2828	res->data=(char *)p;
2829	}
2830	else
2831	{
2832	Werror("var number %d out of range 1..%d",i,currRing->N);
2833	return TRUE;
2834	}
2835	return FALSE;
2836	}
2837	static BOOLEAN jjVARSTR1(leftv res, leftv v)
2838	{
2839	if (currRing==NULL)
2840	{
2841	WerrorS("no ring active");
2842	return TRUE;
2843	}
2844	int i=(int)v->Data();
2845	if ((0<i) && (i<=currRing->N))
2846	res->data=mstrdup(currRing->names[i-1]);
2847	else
2848	{
2849	Werror("var number %d out of range 1..%d",i,currRing->N);
2850	return TRUE;
2851	}
2852	return FALSE;
2853	}
2854	static BOOLEAN jjVDIM(leftv res, leftv v)
2855	{
2856	assumeStdFlag(v);
2857	res->data = (char *)scMult0Int((ideal)v->Data(),currQuotient);
2858	return FALSE;
2859	}
2860	/=================== operations with 1 arg.: table =================/
2861
2862	#ifdef INIT_BUG
2863	#define XS(A) -((short)A)
2864	#define jjstrlen (proc1)1
2865	#define jjpLength (proc1)2
2866	#define jjidElem (proc1)3
2867	#define jjmpDet (proc1)4
2868	#define jjidFreeModule (proc1)5
2869	#define jjidVec2Ideal (proc1)6
2870	#define jjrCharStr (proc1)7
2871	#ifndef MDEBUG
2872	#define jjpHead (proc1)8
2873	#endif
2874	#define jjidHead (proc1)9
2875	#define jjidMaxIdeal (proc1)10
2876	#define jjidMinBase (proc1)11
2877	#define jjsyMinBase (proc1)12
2878	#define jjpMaxComp (proc1)13
2879	#define jjmpTrace (proc1)14
2880	#define jjmpTransp (proc1)15
2881	#define jjrOrdStr (proc1)16
2882	#define jjrVarStr (proc1)18
2883	#define jjrParStr (proc1)19
2884	#define jjidMinEmbedding (proc1)20
2885	#define jjBETTI_R (proc1)21
2886	#define jjCOUNT_R (proc1)22
2887	#define jjDIM_R (proc1)23
2888	#define jjMINRES_R (proc1)24
2889
2890	extern struct sValCmd1 dArith1[];
2891	void jjInitTab1()
2892	{
2893	int i=0;
2894	for (;dArith1[i].cmd!=0;i++)
2895	{
2896	if (dArith1[i].res<0)
2897	{
2898	switch ((int)dArith1[i].p)
2899	{
2900	case (int)jjstrlen: dArith1[i].p=(proc1)strlen; break;
2901	case (int)jjpLength: dArith1[i].p=(proc1)pLength; break;
2902	case (int)jjidElem: dArith1[i].p=(proc1)idElem; break;
2903	case (int)jjidVec2Ideal: dArith1[i].p=(proc1)idVec2Ideal; break;
2904	#ifndef HAVE_FACTORY
2905	case (int)jjmpDet: dArith1[i].p=(proc1)mpDet; break;
2906	#endif
2907	case (int)jjidFreeModule: dArith1[i].p=(proc1)idFreeModule; break;
2908	case (int)jjrCharStr: dArith1[i].p=(proc1)rCharStr; break;
2909	#ifndef MDEBUG
2910	case (int)jjpHead: dArith1[i].p=(proc1)pHeadProc; break;
2911	#endif
2912	case (int)jjidHead: dArith1[i].p=(proc1)idHead; break;
2913	case (int)jjidMaxIdeal: dArith1[i].p=(proc1)idMaxIdeal; break;
2914	case (int)jjidMinBase: dArith1[i].p=(proc1)idMinBase; break;
2915	case (int)jjsyMinBase: dArith1[i].p=(proc1)syMinBase; break;
2916	case (int)jjpMaxComp: dArith1[i].p=(proc1)pMaxComp; break;
2917	case (int)jjmpTrace: dArith1[i].p=(proc1)mpTrace; break;
2918	case (int)jjmpTransp: dArith1[i].p=(proc1)mpTransp; break;
2919	case (int)jjrOrdStr: dArith1[i].p=(proc1)rOrdStr; break;
2920	case (int)jjrVarStr: dArith1[i].p=(proc1)rVarStr; break;
2921	case (int)jjrParStr: dArith1[i].p=(proc1)rParStr; break;
2922	case (int)jjidMinEmbedding: dArith1[i].p=(proc1)idMinEmbedding; break;
2923	case (int)jjBETTI_R: dArith1[i].p=(proc1)syBettiOfComputation; break;
2924	case (int)jjCOUNT_R: dArith1[i].p=(proc1)syLength; break;
2925	case (int)jjDIM_R: dArith1[i].p=(proc1)syDim; break;
2926	case (int)jjMINRES_R: dArith1[i].p=(proc1)syMinimize; break;
2927	#ifdef GENTABLE
2928	default: Werror("missing proc1-definition for %d",(int)dArith1[i].p);
2929	#endif
2930	}
2931	}
2932	}
2933	}
2934	#else
2935	#if defined(PROC_BUG)
2936	#define XS(A) A
2937	static BOOLEAN jjstrlen(leftv res, leftv v)
2938	{
2939	res->data = (char )strlen((char )v->Data());
2940	return FALSE;
2941	}
2942	static BOOLEAN jjpLength(leftv res, leftv v)
2943	{
2944	res->data = (char *)pLength((poly)v->Data());
2945	return FALSE;
2946	}
2947	static BOOLEAN jjidElem(leftv res, leftv v)
2948	{
2949	res->data = (char *)idElem((ideal)v->Data());
2950	return FALSE;
2951	}
2952	static BOOLEAN jjmpDet(leftv res, leftv v)
2953	{
2954	res->data = (char *)mpDet((matrix)v->Data());
2955	return FALSE;
2956	}
2957	static BOOLEAN jjidFreeModule(leftv res, leftv v)
2958	{
2959	res->data = (char *)idFreeModule((int)v->Data());
2960	return FALSE;
2961	}
2962	static BOOLEAN jjidVec2Ideal(leftv res, leftv v)
2963	{
2964	res->data = (char *)idVec2Ideal((poly)v->Data());
2965	return FALSE;
2966	}
2967	static BOOLEAN jjrCharStr(leftv res, leftv v)
2968	{
2969	res->data = rCharStr((ring)v->Data());
2970	return FALSE;
2971	}
2972	#ifndef MDEBUG
2973	static BOOLEAN jjpHead(leftv res, leftv v)
2974	{
2975	res->data = (char *)pHead((poly)v->Data());
2976	return FALSE;
2977	}
2978	#endif
2979	static BOOLEAN jjidHead(leftv res, leftv v)
2980	{
2981	res->data = (char *)idHead((ideal)v->Data());
2982	return FALSE;
2983	}
2984	static BOOLEAN jjidMaxIdeal(leftv res, leftv v)
2985	{
2986	res->data = (char *)idMaxIdeal((int)v->Data());
2987	return FALSE;
2988	}
2989	static BOOLEAN jjidMinBase(leftv res, leftv v)
2990	{
2991	res->data = (char *)idMinBase((ideal)v->Data());
2992	return FALSE;
2993	}
2994	static BOOLEAN jjsyMinBase(leftv res, leftv v)
2995	{
2996	res->data = (char *)syMinBase((ideal)v->Data());
2997	return FALSE;
2998	}
2999	static BOOLEAN jjpMaxComp(leftv res, leftv v)
3000	{
3001	res->data = (char *)pMaxComp((poly)v->Data());
3002	return FALSE;
3003	}
3004	static BOOLEAN jjmpTrace(leftv res, leftv v)
3005	{
3006	res->data = (char *)mpTrace((matrix)v->Data());
3007	return FALSE;
3008	}
3009	static BOOLEAN jjmpTransp(leftv res, leftv v)
3010	{
3011	res->data = (char *)mpTransp((matrix)v->Data());
3012	return FALSE;
3013	}
3014	static BOOLEAN jjrOrdStr(leftv res, leftv v)
3015	{
3016	res->data = rOrdStr((ring)v->Data());
3017	return FALSE;
3018	}
3019	static BOOLEAN jjrVarStr(leftv res, leftv v)
3020	{
3021	res->data = rVarStr((ring)v->Data());
3022	return FALSE;
3023	}
3024	static BOOLEAN jjrParStr(leftv res, leftv v)
3025	{
3026	res->data = rParStr((ring)v->Data());
3027	return FALSE;
3028	}
3029	static BOOLEAN jjidMinEmbedding(leftv res, leftv v)
3030	{
3031	res->data = (char *)idMinEmbedding((ideal)v->Data());
3032	return FALSE;
3033	}
3034	static BOOLEAN jjBETTI_R(leftv res, leftv v)
3035	{
3036	res->data=(char *)syBettiOfComputation((syStrategy)v->Data());
3037	return FALSE;
3038	}
3039	static BOOLEAN jjCOUNT_R(leftv res, leftv v)
3040	{
3041	res->data=(char *)syLength((syStrategy)v->Data());
3042	return FALSE;
3043	}
3044	static BOOLEAN jjDIM_R(leftv res, leftv v)
3045	{
3046	res->data = (char *)syDim((syStrategy)v->Data());
3047	return FALSE;
3048	}
3049	static BOOLEAN jjMINRES_R(leftv res, leftv v)
3050	{
3051	res->data=(char *)syMinimize((syStrategy)v->Data());
3052	return FALSE;
3053	}
3054	#else
3055	#define XS(A) -((short)A)
3056	#define jjstrlen (proc1)strlen
3057	#define jjpLength (proc1)pLength
3058	#define jjidElem (proc1)idElem
3059	#define jjmpDet (proc1)mpDet
3060	#define jjidFreeModule (proc1)idFreeModule
3061	#define jjidVec2Ideal (proc1)idVec2Ideal
3062	#define jjrCharStr (proc1)rCharStr
3063	#ifndef MDEBUG
3064	#define jjpHead (proc1)pHead
3065	#endif
3066	#define jjidHead (proc1)idHead
3067	#define jjidMaxIdeal (proc1)idMaxIdeal
3068	#define jjidMinBase (proc1)idMinBase
3069	#define jjsyMinBase (proc1)syMinBase
3070	#define jjpMaxComp (proc1)pMaxComp
3071	#define jjmpTrace (proc1)mpTrace
3072	#define jjmpTransp (proc1)mpTransp
3073	#define jjrOrdStr (proc1)rOrdStr
3074	#define jjrVarStr (proc1)rVarStr
3075	#define jjrParStr (proc1)rParStr
3076	#define jjidMinEmbedding (proc1)idMinEmbedding
3077	#define jjBETTI_R (proc1)syBettiOfComputation
3078	#define jjCOUNT_R (proc1)syLength
3079	#define jjDIM_R (proc1)syDim
3080	#define jjMINRES_R (proc1)syMinimize
3081	#endif
3082	#endif
3083	BOOLEAN jjnInt(leftv res, leftv u)
3084	{
3085	number n=(number)u->CopyD();
3086	res->data=(char *)nInt(n);
3087	nDelete(&n);
3088	return FALSE;
3089	}
3090	#define s short
3091	struct sValCmd1 dArith1[]=
3092	{
3093	// operations:
3094	// proc cmd res arg
3095	// {jjPLUSPLUS, PLUSPLUS, INT_CMD, INT_CMD }
3096	//,{jjMINUSMINUS, MINUSMINUS, INT_CMD, INT_CMD }
3097	{jjPLUSPLUS, PLUSPLUS, NONE, IDHDL }
3098	,{jjPLUSPLUS, MINUSMINUS, NONE, IDHDL }
3099	,{jjUMINUS_I, '-', INT_CMD, INT_CMD }
3100	,{jjUMINUS_N, '-', NUMBER_CMD, NUMBER_CMD }
3101	,{jjUMINUS_P, '-', POLY_CMD, POLY_CMD }
3102	,{jjUMINUS_P, '-', VECTOR_CMD, VECTOR_CMD }
3103	,{jjUMINUS_MA, '-', MATRIX_CMD, MATRIX_CMD }
3104	,{jjUMINUS_IV, '-', INTVEC_CMD, INTVEC_CMD }
3105	,{jjUMINUS_IV, '-', INTMAT_CMD, INTMAT_CMD }
3106	,{jjPROC1, '(', ANY_TYPE/set by p/,PROC_CMD }
3107	,{jjKLAMMER_LIB,'(', NONE, STRING_CMD }
3108	// and the procedures with 1 argument:
3109	,{atATTRIB1, ATTRIB_CMD, NONE, DEF_CMD }
3110	,{jjBAREISS_IM, BAREISS_CMD, INTMAT_CMD, INTMAT_CMD }
3111	,{jjBAREISS, BAREISS_CMD, LIST_CMD, MATRIX_CMD }
3112	,{jjBETTI, BETTI_CMD, INTMAT_CMD, LIST_CMD }
3113	,{jjBETTI_R, BETTI_CMD, XS(INTMAT_CMD), RESOLUTION_CMD }
3114	,{jjCHAR, CHARACTERISTIC_CMD, INT_CMD, RING_CMD }
3115	,{jjCHAR, CHARACTERISTIC_CMD, INT_CMD, QRING_CMD }
3116	#ifdef HAVE_FACTORY
3117	,{jjCHARSERIES, CHAR_SERIES_CMD, MATRIX_CMD, IDEAL_CMD }
3118	#else
3119	,{jjWRONG, CHAR_SERIES_CMD, MATRIX_CMD, IDEAL_CMD }
3120	#endif
3121	,{jjrCharStr, CHARSTR_CMD, XS(STRING_CMD), RING_CMD }
3122	,{jjrCharStr, CHARSTR_CMD, XS(STRING_CMD), QRING_CMD }
3123	,{jjOpenClose, CLOSE_CMD, NONE, LINK_CMD }
3124	,{jjWRONG, COLS_CMD, 0, VECTOR_CMD }
3125	,{jjCOLS, COLS_CMD, INT_CMD, MATRIX_CMD }
3126	,{jjCOLS, COLS_CMD, INT_CMD, IDEAL_CMD }
3127	,{jjCOLS, COLS_CMD, INT_CMD, MODUL_CMD }
3128	,{jjCOLS_IV, COLS_CMD, INT_CMD, INTMAT_CMD }
3129	,{jjWRONG, COLS_CMD, 0, INTVEC_CMD }
3130	,{jjCONTENT, CONTENT_CMD, POLY_CMD, POLY_CMD }
3131	,{jjCONTENT, CONTENT_CMD, VECTOR_CMD, VECTOR_CMD }
3132	,{jjCOUNT_N, COUNT_CMD, INT_CMD, NUMBER_CMD }
3133	,{jjCOUNT_R, COUNT_CMD, XS(INT_CMD), RESOLUTION_CMD }
3134	,{jjstrlen, COUNT_CMD, XS(INT_CMD), STRING_CMD }
3135	,{jjpLength, COUNT_CMD, XS(INT_CMD), POLY_CMD }
3136	,{jjpLength, COUNT_CMD, XS(INT_CMD), VECTOR_CMD }
3137	,{jjidElem, COUNT_CMD, XS(INT_CMD), IDEAL_CMD }
3138	,{jjidElem, COUNT_CMD, XS(INT_CMD), MODUL_CMD }
3139	,{jjCOUNT_M, COUNT_CMD, INT_CMD, MATRIX_CMD }
3140	,{jjCOUNT_IV, COUNT_CMD, INT_CMD, INTVEC_CMD }
3141	,{jjCOUNT_IV, COUNT_CMD, INT_CMD, INTMAT_CMD }
3142	,{jjCOUNT_L, COUNT_CMD, INT_CMD, LIST_CMD }
3143	,{jjNULL, DEF_CMD, DEF_CMD, INT_CMD }
3144	,{jjWRONG, DEF_CMD, 0, ANY_TYPE }
3145	,{jjDEG, DEG_CMD, INT_CMD, POLY_CMD }
3146	,{jjDEG, DEG_CMD, INT_CMD, VECTOR_CMD }
3147	,{jjDEGREE, DEGREE_CMD, NONE, IDEAL_CMD }
3148	,{jjDEGREE, DEGREE_CMD, NONE, MODUL_CMD }
3149	,{jjDEFINED, DEFINED_CMD, INT_CMD, DEF_CMD }
3150	#ifdef HAVE_FACTORY
3151	,{jjDET_I, DET_CMD, INT_CMD, INTMAT_CMD }
3152	,{jjDET, DET_CMD, POLY_CMD, MATRIX_CMD }
3153	#else
3154	,{jjWRONG, DET_CMD, INT_CMD, INTMAT_CMD }
3155	,{jjmpDet, DET_CMD, XS(POLY_CMD), MATRIX_CMD }
3156	#endif
3157	,{jjDIM, DIM_CMD, INT_CMD, IDEAL_CMD }
3158	,{jjDIM, DIM_CMD, INT_CMD, MODUL_CMD }
3159	,{jjDIM_R, DIM_CMD, XS(INT_CMD), RESOLUTION_CMD }
3160	,{jjDUMP, DUMP_CMD, NONE, LINK_CMD }
3161	,{jjE, E_CMD, VECTOR_CMD, INT_CMD }
3162	#ifdef HAVE_FACTORY
3163	,{jjFAC_P, FAC_CMD, LIST_CMD, POLY_CMD }
3164	#else
3165	,{jjWRONG, FAC_CMD, LIST_CMD, POLY_CMD }
3166	#endif
3167	#ifdef HAVE_FGLM
3168	,{findUniProc, FINDUNI_CMD, IDEAL_CMD, IDEAL_CMD}
3169	#else
3170	,{jjWRONG, FINDUNI_CMD, IDEAL_CMD, IDEAL_CMD}
3171	#endif
3172	,{jjidFreeModule,FREEMODULE_CMD, XS(MODUL_CMD), INT_CMD }
3173	#ifdef HAVE_FACTORY
3174	,{jjFACSTD, FACSTD_CMD, LIST_CMD, IDEAL_CMD }
3175	#else
3176	,{jjWRONG, FACSTD_CMD, LIST_CMD, IDEAL_CMD }
3177	#endif
3178	,{jjGETDUMP, GETDUMP_CMD, NONE, LINK_CMD }
3179	,{jjHILBERT, HILBERT_CMD, NONE, IDEAL_CMD }
3180	,{jjHILBERT, HILBERT_CMD, NONE, MODUL_CMD }
3181	,{jjHILBERT_IV, HILBERT_CMD, INTVEC_CMD, INTVEC_CMD }
3182	,{jjHOMOG1, HOMOG_CMD, INT_CMD, IDEAL_CMD }
3183	,{jjHOMOG1, HOMOG_CMD, INT_CMD, MODUL_CMD }
3184	,{jjidVec2Ideal,IDEAL_CMD, XS(IDEAL_CMD), VECTOR_CMD }
3185	,{jjIDEAL_Ma, IDEAL_CMD, IDEAL_CMD, MATRIX_CMD }
3186	,{jjIDEAL_R, IDEAL_CMD, IDEAL_CMD, QRING_CMD }
3187	,{jjIDEAL_R, IDEAL_CMD, IDEAL_CMD, RING_CMD }
3188	,{jjIDEAL_Map, IDEAL_CMD, IDEAL_CMD, MAP_CMD }
3189	,{jjDUMMY, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD }
3190	,{jjINDEPSET, INDEPSET_CMD, INTVEC_CMD, IDEAL_CMD }
3191	,{jjDUMMY, INT_CMD, INT_CMD, INT_CMD }
3192	,{jjnInt, INT_CMD, INT_CMD, NUMBER_CMD }
3193	,{jjP2I, INT_CMD, INT_CMD, POLY_CMD }
3194	,{jjINTERRED, INTERRED_CMD, IDEAL_CMD, IDEAL_CMD }
3195	,{jjINTERRED, INTERRED_CMD, MODUL_CMD, MODUL_CMD }
3196	,{jjDUMMY, INTMAT_CMD, INTMAT_CMD, INTMAT_CMD }
3197	,{jjIm2Iv, INTVEC_CMD, INTVEC_CMD, INTMAT_CMD }
3198	,{jjDUMMY, INTVEC_CMD, INTVEC_CMD, INTVEC_CMD }
3199	,{jjIS_RINGVAR_P, IS_RINGVAR, INT_CMD, POLY_CMD }
3200	,{jjIS_RINGVAR_S, IS_RINGVAR, INT_CMD, STRING_CMD }
3201	,{jjIS_RINGVAR0,IS_RINGVAR, INT_CMD, ANY_TYPE }
3202	,{jjJACOB_P, JACOB_CMD, IDEAL_CMD, POLY_CMD }
3203	,{mpJacobi, JACOB_CMD, MATRIX_CMD, IDEAL_CMD }
3204	,{jjKBASE, KBASE_CMD, IDEAL_CMD, IDEAL_CMD }
3205	,{jjKBASE, KBASE_CMD, MODUL_CMD, MODUL_CMD }
3206	,{atKILLATTR1, KILLATTR_CMD, NONE, IDHDL }
3207	#ifdef MDEBUG
3208	,{jjpHead, LEAD_CMD, POLY_CMD, POLY_CMD }
3209	#else
3210	,{jjpHead, LEAD_CMD, XS(POLY_CMD), POLY_CMD }
3211	#endif
3212	,{jjidHead, LEAD_CMD, XS(IDEAL_CMD), IDEAL_CMD }
3213	#ifdef MDEBUG
3214	,{jjpHead, LEAD_CMD, VECTOR_CMD, VECTOR_CMD }
3215	#else
3216	,{jjpHead, LEAD_CMD, XS(VECTOR_CMD), VECTOR_CMD }
3217	#endif
3218	,{jjidHead, LEAD_CMD, XS(MODUL_CMD), MODUL_CMD }
3219	,{jjLEADCOEF, LEADCOEF_CMD, NUMBER_CMD, POLY_CMD }
3220	,{jjLEADCOEF, LEADCOEF_CMD, NUMBER_CMD, VECTOR_CMD }
3221	,{jjLEADEXP, LEADEXP_CMD, INTVEC_CMD, POLY_CMD }
3222	,{jjLEADEXP, LEADEXP_CMD, INTVEC_CMD, VECTOR_CMD }
3223	,{jjCALL1MANY, LIST_CMD, LIST_CMD, DEF_CMD }
3224	,{jjWRONG, MAP_CMD, 0, ANY_TYPE}
3225	,{jjDUMMY, MATRIX_CMD, MATRIX_CMD, MATRIX_CMD }
3226	,{jjidMaxIdeal, MAXID_CMD, XS(IDEAL_CMD), INT_CMD }
3227	,{jjMEMORY, MEMORY_CMD, INT_CMD, INT_CMD }
3228	,{jjidMinBase, MINBASE_CMD, XS(IDEAL_CMD), IDEAL_CMD }
3229	,{jjidMinBase, MINBASE_CMD, XS(MODUL_CMD), MODUL_CMD }
3230	,{jjMINRES, MINRES_CMD, LIST_CMD, LIST_CMD }
3231	,{jjMINRES_R, MINRES_CMD, XS(RESOLUTION_CMD), RESOLUTION_CMD }
3232	,{jjDUMMY, MODUL_CMD, MODUL_CMD, MODUL_CMD }
3233	,{jjMONITOR1, MONITOR_CMD, NONE, STRING_CMD }
3234	,{jjMULT, MULTIPLICITY_CMD, INT_CMD, IDEAL_CMD }
3235	,{jjMULT, MULTIPLICITY_CMD, INT_CMD, MODUL_CMD }
3236	,{jjMSTD, MSTD_CMD, LIST_CMD, IDEAL_CMD }
3237	,{jjNAMEOF, NAMEOF_CMD, STRING_CMD, ANY_TYPE }
3238	,{jjNAMES, NAMES_CMD, LIST_CMD, RING_CMD }
3239	,{jjNAMES, NAMES_CMD, LIST_CMD, QRING_CMD }
3240	,{jjDUMMY, NUMBER_CMD, NUMBER_CMD, NUMBER_CMD }
3241	,{jjP2N, NUMBER_CMD, NUMBER_CMD, POLY_CMD }
3242	,{jjRPAR, NPARS_CMD, INT_CMD, RING_CMD }
3243	,{jjRPAR, NPARS_CMD, INT_CMD, QRING_CMD }
3244	,{jjNVARS, NVARS_CMD, INT_CMD, RING_CMD }
3245	,{jjNVARS, NVARS_CMD, INT_CMD, QRING_CMD }
3246	,{jjOpenClose, OPEN_CMD, NONE, LINK_CMD }
3247	,{jjORD, ORD_CMD, INT_CMD, POLY_CMD }
3248	,{jjORD, ORD_CMD, INT_CMD, VECTOR_CMD }
3249	,{jjrOrdStr, ORDSTR_CMD, XS(STRING_CMD), RING_CMD }
3250	,{jjrOrdStr, ORDSTR_CMD, XS(STRING_CMD), QRING_CMD }
3251	,{jjPAR1, PAR_CMD, NUMBER_CMD, INT_CMD }
3252	,{jjPARDEG, PARDEG_CMD, INT_CMD, NUMBER_CMD }
3253	,{jjPARSTR1, PARSTR_CMD, STRING_CMD, INT_CMD }
3254	,{jjrParStr, PARSTR_CMD, XS(STRING_CMD), RING_CMD }
3255	,{jjrParStr, PARSTR_CMD, XS(STRING_CMD), QRING_CMD }
3256	,{jjDUMMY, POLY_CMD, POLY_CMD, POLY_CMD }
3257	,{jjPRIME, PRIME_CMD, INT_CMD, INT_CMD }
3258	,{jjPRINT_GEN, PRINT_CMD, NONE, INT_CMD }
3259	,{jjPRINT_INTVEC,PRINT_CMD, NONE, INTVEC_CMD }
3260	,{jjPRINT_INTMAT,PRINT_CMD, NONE, INTMAT_CMD }
3261	,{jjPRINT_GEN, PRINT_CMD, NONE, STRING_CMD }
3262	,{jjPRINT_GEN, PRINT_CMD, NONE, POLY_CMD }
3263	,{jjPRINT_V, PRINT_CMD, NONE, VECTOR_CMD }
3264	,{jjPRINT_GEN, PRINT_CMD, NONE, IDEAL_CMD }
3265	,{jjPRINT_MA, PRINT_CMD, NONE, MATRIX_CMD }
3266	,{jjPRINT_LIST, PRINT_CMD, NONE, LIST_CMD }
3267	,{jjPRINT_GEN, PRINT_CMD, NONE, RESOLUTION_CMD }
3268	,{jjidMinEmbedding, PRUNE_CMD, XS(MODUL_CMD), MODUL_CMD }
3269	,{kQHWeight, QHWEIGHT_CMD, INTVEC_CMD, IDEAL_CMD }
3270	,{kQHWeight, QHWEIGHT_CMD, INTVEC_CMD, MODUL_CMD }
3271	,{jjWRONG, QRING_CMD, 0, ANY_TYPE}
3272	,{jjREAD, READ_CMD, STRING_CMD, LINK_CMD }
3273	,{jjREGULARITY, REGULARITY_CMD, INT_CMD, LIST_CMD }
3274	,{jjRESERVEDNAME,RESERVEDNAME_CMD, INT_CMD, STRING_CMD }
3275	,{jjL2R, RESOLUTION_CMD, RESOLUTION_CMD, LIST_CMD }
3276	,{jjDUMMY, RESOLUTION_CMD, RESOLUTION_CMD, RESOLUTION_CMD }
3277	,{jjWRONG, ROWS_CMD, 0, POLY_CMD }
3278	,{jjpMaxComp, ROWS_CMD, XS(INT_CMD), VECTOR_CMD }
3279	,{jjROWS, ROWS_CMD, INT_CMD, MODUL_CMD }
3280	,{jjROWS, ROWS_CMD, INT_CMD, MATRIX_CMD }
3281	,{jjROWS_IV, ROWS_CMD, INT_CMD, INTMAT_CMD }
3282	,{jjCOUNT_IV, ROWS_CMD, INT_CMD, INTVEC_CMD }
3283	,{jjSort_Id, SORTVEC_CMD, INTVEC_CMD, IDEAL_CMD }
3284	,{jjSort_Id, SORTVEC_CMD, INTVEC_CMD, MODUL_CMD }
3285	,{jjSTD, STD_CMD, IDEAL_CMD, IDEAL_CMD }
3286	,{jjSTD, STD_CMD, MODUL_CMD, MODUL_CMD }
3287	,{jjDUMMY, STRING_CMD, STRING_CMD, STRING_CMD }
3288	,{jjSTRING, STRING_CMD, STRING_CMD, INT_CMD }
3289	,{jjSTRING, STRING_CMD, STRING_CMD, POLY_CMD }
3290	,{jjSTRING, STRING_CMD, STRING_CMD, VECTOR_CMD }
3291	,{jjSTRING, STRING_CMD, STRING_CMD, NUMBER_CMD }
3292	,{jjSTRING, STRING_CMD, STRING_CMD, MATRIX_CMD }
3293	,{jjSTRING, STRING_CMD, STRING_CMD, MODUL_CMD }
3294	,{jjSTRING, STRING_CMD, STRING_CMD, IDEAL_CMD }
3295	,{jjSTRING, STRING_CMD, STRING_CMD, MAP_CMD }
3296	,{jjSTRING, STRING_CMD, STRING_CMD, INTVEC_CMD }
3297	,{jjSTRING, STRING_CMD, STRING_CMD, INTMAT_CMD }
3298	,{jjSTRING_PROC,STRING_CMD, STRING_CMD, PROC_CMD }
3299	,{jjSTRING, STRING_CMD, STRING_CMD, RING_CMD }
3300	,{jjSTRING, STRING_CMD, STRING_CMD, QRING_CMD }
3301	,{jjSYSTEM, SYSTEM_CMD, NONE, STRING_CMD }
3302	,{jjSYZYGY, SYZYGY_CMD, MODUL_CMD, IDEAL_CMD }
3303	,{jjSYZYGY, SYZYGY_CMD, MODUL_CMD, MODUL_CMD }
3304	,{jjWRONG, TRACE_CMD, 0, INTVEC_CMD }
3305	,{jjWRONG, TRACE_CMD, 0, IDEAL_CMD }
3306	,{jjTRACE_IV, TRACE_CMD, INT_CMD, INTMAT_CMD }
3307	,{jjmpTrace, TRACE_CMD, XS(POLY_CMD), MATRIX_CMD }
3308	,{jjTRANSP_IV, TRANSPOSE_CMD, INTMAT_CMD, INTVEC_CMD }
3309	,{jjTRANSP_IV, TRANSPOSE_CMD, INTMAT_CMD, INTMAT_CMD }
3310	,{jjmpTransp, TRANSPOSE_CMD, XS(MATRIX_CMD), MATRIX_CMD }
3311	,{jjTYPEOF, TYPEOF_CMD, STRING_CMD, ANY_TYPE }
3312	,{jjDUMMY, VECTOR_CMD, VECTOR_CMD, VECTOR_CMD }
3313	,{jjVDIM, VDIM_CMD, INT_CMD, IDEAL_CMD }
3314	,{jjVDIM, VDIM_CMD, INT_CMD, MODUL_CMD }
3315	,{jjVAR1, VAR_CMD, POLY_CMD, INT_CMD }
3316	,{jjVARSTR1, VARSTR_CMD, STRING_CMD, INT_CMD }
3317	,{jjrVarStr, VARSTR_CMD, XS(STRING_CMD), RING_CMD }
3318	,{jjrVarStr, VARSTR_CMD, XS(STRING_CMD), QRING_CMD }
3319	,{kWeight, WEIGHT_CMD, INTVEC_CMD, IDEAL_CMD }
3320	,{kWeight, WEIGHT_CMD, INTVEC_CMD, MODUL_CMD }
3321	,{NULL, 0, 0, 0}
3322	};
3323	#undef s
3324	/=================== operations with 3 args.: static proc =================/
3325	static BOOLEAN jjBRACK_S(leftv res, leftv u, leftv v,leftv w)
3326	{
3327	char s= (char )u->Data();
3328	int r = (int)v->Data();
3329	int c = (int)w->Data();
3330	int l = strlen(s);
3331
3332	if ( (r<1) \|\| (r>l) \|\| (c<0) )
3333	{
3334	Werror("wrong range[%d,%d] in string %s",r,c,u->Name());
3335	return TRUE;
3336	}
3337	res->data = (char *)AllocL(c+1);
3338	sprintf((char )res->data,"%-.*s",c,c,s+r-1);
3339	return FALSE;
3340	}
3341	static BOOLEAN jjBRACK_Im(leftv res, leftv u, leftv v,leftv w)
3342	{
3343	intvec iv = (intvec )u->Data();
3344	int r = (int)v->Data();
3345	int c = (int)w->Data();
3346	if ((r<1)\|\|(r>iv->rows())\|\|(c<1)\|\|(c>iv->cols()))
3347	{
3348	Werror("wrong range[%d,%d] in intmat %s(%d x %d)",
3349	r,c,u->Name(),iv->rows(),iv->cols());
3350	return TRUE;
3351	}
3352	res->data=u->data;
3353	u->data=NULL;
3354	res->rtyp=u->rtyp;
3355	u->rtyp=0;
3356	res->name=u->name;
3357	u->name=NULL;
3358	Subexpr e=jjMakeSub(v);
3359	e->next=jjMakeSub(w);
3360	if (u->e==NULL) res->e=e;
3361	else
3362	{
3363	Subexpr h=u->e;
3364	while (h->next!=NULL) h=h->next;
3365	h->next=e;
3366	res->e=u->e;
3367	u->e=NULL;
3368	}
3369	return FALSE;
3370	}
3371	static BOOLEAN jjBRACK_Ma(leftv res, leftv u, leftv v,leftv w)
3372	{
3373	matrix m= (matrix)u->Data();
3374	int r = (int)v->Data();
3375	int c = (int)w->Data();
3376	//Print("gen. elem %d, %d\n",r,c);
3377	if ((r<1)\|\|(r>MATROWS(m))\|\|(c<1)\|\|(c>MATCOLS(m)))
3378	{
3379	Werror("wrong range[%d,%d] in matrix %s(%d x %d)",r,c,u->Name(),
3380	MATROWS(m),MATCOLS(m));
3381	return TRUE;
3382	}
3383	res->data=u->data;
3384	u->data=NULL;
3385	res->rtyp=u->rtyp;
3386	u->rtyp=0;
3387	res->name=u->name;
3388	u->name=NULL;
3389	Subexpr e=jjMakeSub(v);
3390	e->next=jjMakeSub(w);
3391	if (u->e==NULL)
3392	res->e=e;
3393	else
3394	{
3395	Subexpr h=u->e;
3396	while (h->next!=NULL) h=h->next;
3397	h->next=e;
3398	res->e=u->e;
3399	u->e=NULL;
3400	}
3401	return FALSE;
3402	}
3403	static BOOLEAN jjBRACK_Ma_I_IV(leftv res, leftv u, leftv v,leftv w)
3404	{
3405	sleftv t;
3406	sleftv ut;
3407	leftv p=NULL;
3408	intvec iv=(intvec )w->Data();
3409	int l;
3410	BOOLEAN nok;
3411
3412	if ((u->rtyp!=IDHDL)\|\|(u->e!=NULL))
3413	{
3414	WerrorS("cannot build expression lists from unnamed objects");
3415	return TRUE;
3416	}
3417	memcpy(&ut,u,sizeof(ut));
3418	memset(&t,0,sizeof(t));
3419	t.rtyp=INT_CMD;
3420	for (l=0;l< iv->length(); l++)
3421	{
3422	t.data=(char )(iv)[l];
3423	if (p==NULL)
3424	{
3425	p=res;
3426	}
3427	else
3428	{
3429	p->next=(leftv)Alloc0(sizeof(sleftv));
3430	p=p->next;
3431	}
3432	memcpy(u,&ut,sizeof(ut));
3433	if (u->Typ() == MATRIX_CMD)
3434	nok=jjBRACK_Ma(p,u,v,&t);
3435	else /* INTMAT_CMD */
3436	nok=jjBRACK_Im(p,u,v,&t);
3437	if (nok)
3438	{
3439	while (res->next!=NULL)
3440	{
3441	p=res->next->next;
3442	Free((ADDRESS)res->next,sizeof(sleftv));
3443	// res->e aufraeumen !!!!
3444	res->next=p;
3445	}
3446	return TRUE;
3447	}
3448	}
3449	return FALSE;
3450	}
3451	static BOOLEAN jjBRACK_Ma_IV_I(leftv res, leftv u, leftv v,leftv w)
3452	{
3453	sleftv t;
3454	sleftv ut;
3455	leftv p=NULL;
3456	intvec iv=(intvec )v->Data();
3457	int l;
3458	BOOLEAN nok;
3459
3460	if ((u->rtyp!=IDHDL)\|\|(u->e!=NULL))
3461	{
3462	WerrorS("cannot build expression lists from unnamed objects");
3463	return TRUE;
3464	}
3465	memcpy(&ut,u,sizeof(ut));
3466	memset(&t,0,sizeof(t));
3467	t.rtyp=INT_CMD;
3468	for (l=0;l< iv->length(); l++)
3469	{
3470	t.data=(char )((iv)[l]);
3471	if (p==NULL)
3472	{
3473	p=res;
3474	}
3475	else
3476	{
3477	p->next=(leftv)Alloc0(sizeof(sleftv));
3478	p=p->next;
3479	}
3480	memcpy(u,&ut,sizeof(ut));
3481	if (u->Typ() == MATRIX_CMD)
3482	nok=jjBRACK_Ma(p,u,&t,w);
3483	else /* INTMAT_CMD */
3484	nok=jjBRACK_Im(p,u,&t,w);
3485	if (nok)
3486	{
3487	while (res->next!=NULL)
3488	{
3489	p=res->next->next;
3490	Free((ADDRESS)res->next,sizeof(sleftv));
3491	// res->e aufraeumen !!
3492	res->next=p;
3493	}
3494	return TRUE;
3495	}
3496	}
3497	return FALSE;
3498	}
3499	static BOOLEAN jjBRACK_Ma_IV_IV(leftv res, leftv u, leftv v,leftv w)
3500	{
3501	sleftv t1,t2,ut;
3502	leftv p=NULL;
3503	intvec vv=(intvec )v->Data();
3504	intvec wv=(intvec )w->Data();
3505	int vl;
3506	int wl;
3507	BOOLEAN nok;
3508
3509	if ((u->rtyp!=IDHDL)\|\|(u->e!=NULL))
3510	{
3511	WerrorS("cannot build expression lists from unnamed objects");
3512	return TRUE;
3513	}
3514	memcpy(&ut,u,sizeof(ut));
3515	memset(&t1,0,sizeof(sleftv));
3516	memset(&t2,0,sizeof(sleftv));
3517	t1.rtyp=INT_CMD;
3518	t2.rtyp=INT_CMD;
3519	for (vl=0;vl< vv->length(); vl++)
3520	{
3521	t1.data=(char )((vv)[vl]);
3522	for (wl=0;wl< wv->length(); wl++)
3523	{
3524	t2.data=(char )((wv)[wl]);
3525	if (p==NULL)
3526	{
3527	p=res;
3528	}
3529	else
3530	{
3531	p->next=(leftv)Alloc0(sizeof(sleftv));
3532	p=p->next;
3533	}
3534	memcpy(u,&ut,sizeof(ut));
3535	if (u->Typ() == MATRIX_CMD)
3536	nok=jjBRACK_Ma(p,u,&t1,&t2);
3537	else /* INTMAT_CMD */
3538	nok=jjBRACK_Im(p,u,&t1,&t2);
3539	if (nok)
3540	{
3541	res->CleanUp();
3542	return TRUE;
3543	}
3544	}
3545	}
3546	return FALSE;
3547	}
3548	static BOOLEAN jjPROC3(leftv res, leftv u, leftv v, leftv w)
3549	{
3550	v->next=(leftv)Alloc(sizeof(sleftv));
3551	memcpy(v->next,w,sizeof(sleftv));
3552	BOOLEAN r=iiExprArith2(res,u,'(',v);
3553	v->rtyp=0; v->data=NULL;
3554	w->rtyp=0; w->data=NULL;
3555	return r;
3556	}
3557	static BOOLEAN jjCALL3MANY(leftv res, leftv u, leftv v, leftv w)
3558	{
3559	u->next=(leftv)Alloc(sizeof(sleftv));
3560	memcpy(u->next,v,sizeof(sleftv));
3561	u->next->next=(leftv)Alloc(sizeof(sleftv));
3562	memcpy(u->next->next,w,sizeof(sleftv));
3563	BOOLEAN r=iiExprArithM(res,u,iiOp);
3564	v->rtyp=0; v->data=NULL; // iiExprArithM did the CleanUp
3565	w->rtyp=0; w->data=NULL;
3566	return r;
3567	}
3568	static BOOLEAN jjCOEFFS3_Id(leftv res, leftv u, leftv v, leftv w)
3569	{
3570	if ((w->rtyp!=IDHDL)\|\|(w->e!=NULL))
3571	{
3572	WerrorS("3rd argument must be a name of a matrix");
3573	return TRUE;
3574	}
3575	ideal i=(ideal)u->Data();
3576	int rank=(int)i->rank;
3577	BOOLEAN r=jjCOEFFS_Id(res,u,v);
3578	if (r) return TRUE;
3579	mpMonomials((matrix)res->data, rank, pVar((poly)v->Data()),(matrix)w->Data());
3580	return FALSE;
3581	}
3582	static BOOLEAN jjCOEFFS3_KB(leftv res, leftv u, leftv v, leftv w)
3583	{
3584	res->data=(void*)idCoeffOfKBase((ideal)(u->Data()),
3585	(ideal)(v->Data()),(poly)(w->Data()));
3586	return FALSE;
3587	}
3588	static BOOLEAN jjCOEFFS3_P(leftv res, leftv u, leftv v, leftv w)
3589	{
3590	if ((w->rtyp!=IDHDL)\|\|(w->e!=NULL))
3591	{
3592	WerrorS("3rd argument must be a name of a matrix");
3593	return TRUE;
3594	}
3595	poly p=(poly)u->CopyD();
3596	ideal i=idInit(1,1);
3597	i->m[0]=p;
3598	sleftv t;
3599	memset(&t,0,sizeof(t));
3600	t.data=(char *)i;
3601	t.rtyp=IDEAL_CMD;
3602	int rank=1;
3603	if (u->Typ()==VECTOR_CMD)
3604	{
3605	i->rank=rank=pMaxComp(p);
3606	t.rtyp=MODUL_CMD;
3607	}
3608	BOOLEAN r=jjCOEFFS_Id(res,&t,v);
3609	t.CleanUp();
3610	if (r) return TRUE;
3611	mpMonomials((matrix)res->data, rank, pVar((poly)v->Data()),(matrix)w->Data());
3612	return FALSE;
3613	}
3614	static BOOLEAN jjELIMIN_HILB(leftv res, leftv u, leftv v, leftv w)
3615	{
3616	res->data=(char *)idElimination((ideal)u->Data(),(poly)v->Data(),
3617	(intvec *)w->Data());
3618	setFlag(res,FLAG_STD);
3619	return FALSE;
3620	}
3621	static BOOLEAN jjFIND3(leftv res, leftv u, leftv v, leftv w)
3622	{
3623	/*4
3624	* look for the substring what in the string where
3625	* starting at position n
3626	* return the position of the first char of what in where
3627	* or 0
3628	*/
3629	int n=(int)w->Data();
3630	char where=(char )u->Data();
3631	char what=(char )v->Data();
3632	char *found;
3633	if ((1>n)\|\|(n>(int)strlen(where)))
3634	{
3635	Werror("start position %d out of range",n);
3636	return TRUE;
3637	}
3638	found = strchr(where+n-1,*what);
3639	if (*(what+1)!='\0')
3640	{
3641	while((found !=NULL) && (strncmp(found+1,what+1,strlen(what+1))!=0))
3642	{
3643	found=strchr(found+1,*what);
3644	}
3645	}
3646	if (found != NULL)
3647	{
3648	res->data=(char *)((found-where)+1);
3649	}
3650	return FALSE;
3651	}
3652	static BOOLEAN jjJET_P_IV(leftv res, leftv u, leftv v, leftv w)
3653	{
3654	short iw=iv2array((intvec )w->Data());
3655	res->data = (char *)pJetW((poly)u->Data(),(int)v->Data(),iw);
3656	Free((ADDRESS)iw,(pVariables+1)*sizeof(short));
3657	return FALSE;
3658	}
3659	static BOOLEAN jjJET_ID_IV(leftv res, leftv u, leftv v, leftv w)
3660	{
3661	res->data = (char *)idJetW((ideal)u->Data(),(int)v->Data(),
3662	(intvec *)w->Data());
3663	return FALSE;
3664	}
3665	static BOOLEAN jjPREIMAGE(leftv res, leftv u, leftv v, leftv w)
3666	{
3667	idhdl h,rr;
3668	map mapping;
3669
3670	rr=(idhdl)u->data;
3671	if ((h=IDRING(rr)->idroot->get(v->name,myynest))!=NULL)
3672	{
3673	if (h->typ==MAP_CMD)
3674	{
3675	mapping=IDMAP(h);
3676	}
3677	else if (h->typ==IDEAL_CMD)
3678	{
3679	mapping=IDMAP(h);
3680	}
3681	else
3682	{
3683	Werror("`%s` is no map nor ideal",IDID(h));
3684	return TRUE;
3685	}
3686	}
3687	else
3688	{
3689	Werror("`%s` is not defined in `%s`",v->name,u->name);
3690	return TRUE;
3691	}
3692	if ((h=IDRING(rr)->idroot->get(w->name,myynest))!=NULL)
3693	{
3694	if (h->typ==IDEAL_CMD)
3695	{
3696	res->data=(char *)maGetPreimage(IDRING(rr),mapping,IDIDEAL(h));
3697	}
3698	else
3699	{
3700	Werror("`%s` is no ideal",IDID(h));
3701	return TRUE;
3702	}
3703	}
3704	else
3705	{
3706	Werror("`%s` is not defined in `%s`",w->name,u->name);
3707	return TRUE;
3708	}
3709	return FALSE;
3710	}
3711	static BOOLEAN jjRANDOM_Im(leftv res, leftv u, leftv v, leftv w)
3712	{
3713	int di, k;
3714	int i=(int)u->Data();
3715	int r=(int)v->Data();
3716	int c=(int)w->Data();
3717	intvec *iv = new intvec(r, c, 0);
3718	if (iv->rows()==0)
3719	{
3720	delete iv;
3721	return TRUE;
3722	}
3723	if (i!=0)
3724	{
3725	if (i<0) i = -i;
3726	di = 2 * i + 1;
3727	for (k=0; k<iv->length(); k++)
3728	{
3729	#ifdef buildin_rand
3730	(*iv)[k] = ((siRand() % di) - i);
3731	#else
3732	(*iv)[k] = ((rand() % di) - i);
3733	#endif
3734	}
3735	}
3736	res->data = (char *)iv;
3737	return FALSE;
3738	}
3739	static BOOLEAN jjSUBST_Test(leftv v,leftv w,
3740	int &ringvar, poly &monomexpr)
3741	{
3742	monomexpr=(poly)w->Data();
3743	if (pLength(monomexpr)>1)
3744	{
3745	Werror("`%s` substitutes a ringvar only by a term",
3746	Tok2Cmdname(SUBST_CMD));
3747	return TRUE;
3748	}
3749	if (!(ringvar=pVar((poly)v->Data())))
3750	{
3751	WerrorS("ringvar expected");
3752	return TRUE;
3753	}
3754	return FALSE;
3755	}
3756	static BOOLEAN jjSUBST_P(leftv res, leftv u, leftv v,leftv w)
3757	{
3758	int ringvar;
3759	poly monomexpr;
3760	BOOLEAN nok=jjSUBST_Test(v,w,ringvar,monomexpr);
3761	if (nok) return TRUE;
3762	res->data = pSubst((poly)u->CopyD(POLY_CMD),ringvar,monomexpr);
3763	return FALSE;
3764	}
3765	static BOOLEAN jjSUBST_Id(leftv res, leftv u, leftv v,leftv w)
3766	{
3767	int ringvar;
3768	poly monomexpr;
3769	BOOLEAN nok=jjSUBST_Test(v,w,ringvar,monomexpr);
3770	if (nok) return TRUE;
3771	res->data = idSubst((ideal)u->CopyD(IDEAL_CMD),ringvar,monomexpr);
3772	return FALSE;
3773	}
3774	static BOOLEAN jjMATRIX_Id(leftv res, leftv u, leftv v,leftv w)
3775	{
3776	matrix m=mpNew((int)v->Data(),(int)w->Data());
3777	ideal I=(ideal)u->CopyD(IDEAL_CMD);
3778	int i=min(IDELEMS(I),(int)v->Data()*(int)w->Data());
3779	//for(i=i-1;i>=0;i--)
3780	//{
3781	// m->m[i]=I->m[i];
3782	// I->m[i]=NULL;
3783	//}
3784	memcpy4(m->m,I->m,i*sizeof(poly));
3785	memset(I->m,0,i*sizeof(poly));
3786	idDelete(&I);
3787	res->data = (char *)m;
3788	return FALSE;
3789	}
3790	static BOOLEAN jjMATRIX_Mo(leftv res, leftv u, leftv v,leftv w)
3791	{
3792	res->data = (char *)idModule2formatedMatrix((ideal)u->CopyD(MODUL_CMD),
3793	(int)v->Data(),(int)w->Data());
3794	return FALSE;
3795	}
3796	static BOOLEAN jjMATRIX_Ma(leftv res, leftv u, leftv v,leftv w)
3797	{
3798	matrix m=mpNew((int)v->Data(),(int)w->Data());
3799	matrix I=(matrix)u->CopyD(MATRIX_CMD);
3800	int r=min(MATROWS(I),(int)v->Data());
3801	int c=min(MATCOLS(I),(int)w->Data());
3802	int i,j;
3803	for(i=r;i>0;i--)
3804	{
3805	for(j=c;j>0;j--)
3806	{
3807	MATELEM(m,i,j)=MATELEM(I,i,j);
3808	MATELEM(I,i,j)=NULL;
3809	}
3810	}
3811	idDelete((ideal *)&I);
3812	res->data = (char *)m;
3813	return FALSE;
3814	}
3815	static BOOLEAN jjREDUCE3_P(leftv res, leftv u, leftv v, leftv w)
3816	{
3817	assumeStdFlag(v);
3818	res->data = (char *)kNF((ideal)v->Data(),currQuotient,(poly)u->Data(),
3819	0,(int)w->Data());
3820	return FALSE;
3821	}
3822	static BOOLEAN jjREDUCE3_ID(leftv res, leftv u, leftv v, leftv w)
3823	{
3824	assumeStdFlag(v);
3825	res->data = (char *)kNF((ideal)v->Data(),currQuotient,(ideal)u->Data(),
3826	0,(int)w->Data());
3827	return FALSE;
3828	}
3829	#ifdef OLD_RES
3830	static BOOLEAN jjRES3(leftv res, leftv u, leftv v, leftv w)
3831	{
3832	int maxl=(int)v->Data();
3833	int l=0;
3834	resolvente r;
3835	intvec **weights=NULL;
3836	int wmaxl=maxl;
3837	maxl--;
3838	if ((maxl==-1) && (iiOp!=MRES_CMD))
3839	maxl = pVariables-1;
3840	if ((iiOp == RES_CMD) \|\| (iiOp == MRES_CMD))
3841	{
3842	if (BTEST1(28))
3843	{
3844	r=syMinRes((ideal)u->Data(),maxl,&l,iiOp==MRES_CMD);
3845	}
3846	else
3847	{
3848	intvec * iv=(intvec*)atGet(u,"isHomog");
3849	if (iv!=NULL)
3850	{
3851	weights = (intvec*)Alloc0(sizeof(intvec));
3852	weights[0] = ivCopy(iv);
3853	l=1;
3854	}
3855	r=syResolvente((ideal)u->Data(),maxl,&l, &weights, iiOp==MRES_CMD);
3856	}
3857	}
3858	else
3859	r=sySchreyerResolvente((ideal)u->Data(),maxl+1,&l);
3860	if (r==NULL) return TRUE;
3861	int t3=u->Typ();
3862	iiMakeResolv(r,l,wmaxl,w->name,t3,weights);
3863	return FALSE;
3864	return TRUE;
3865	}
3866	#endif
3867	static BOOLEAN jjSTATUS3(leftv res, leftv u, leftv v, leftv w)
3868	{
3869	int yes;
3870	jjSTATUS2(res, u, v);
3871	yes = (strcmp((char ) res->data, (char ) w->Data()) == 0);
3872	FreeL((ADDRESS) res->data);
3873	res->data = (void *) yes;
3874	return FALSE;
3875	}
3876
3877	/=================== operations with 3 args.: table =================/
3878	struct sValCmd3 dArith3[]=
3879	{
3880	// operations:
3881	// proc cmd res arg1 arg2 arg3
3882	{jjBRACK_S, '[', STRING_CMD, STRING_CMD, INT_CMD, INT_CMD }
3883	,{jjBRACK_Im, '[', INT_CMD, INTMAT_CMD, INT_CMD, INT_CMD }
3884	,{jjBRACK_Ma_I_IV, '[', INT_CMD, INTMAT_CMD, INT_CMD, INTVEC_CMD }
3885	,{jjBRACK_Ma_IV_I, '[', INT_CMD, INTMAT_CMD, INTVEC_CMD, INT_CMD }
3886	,{jjBRACK_Ma_IV_IV, '[', INT_CMD, INTMAT_CMD, INTVEC_CMD, INTVEC_CMD }
3887	,{jjBRACK_Ma, '[', POLY_CMD, MATRIX_CMD, INT_CMD, INT_CMD }
3888	,{jjBRACK_Ma_I_IV, '[', POLY_CMD, MATRIX_CMD, INT_CMD, INTVEC_CMD }
3889	,{jjBRACK_Ma_IV_I, '[', POLY_CMD, MATRIX_CMD, INTVEC_CMD, INT_CMD }
3890	,{jjBRACK_Ma_IV_IV, '[', POLY_CMD, MATRIX_CMD, INTVEC_CMD, INTVEC_CMD }
3891	,{jjPROC3, '(', ANY_TYPE, PROC_CMD, DEF_CMD, DEF_CMD }
3892	,{atATTRIB3, ATTRIB_CMD, NONE, IDHDL, STRING_CMD, DEF_CMD }
3893	,{jjCOEFFS3_P, COEFFS_CMD, MATRIX_CMD, POLY_CMD, POLY_CMD, MATRIX_CMD }
3894	,{jjCOEFFS3_P, COEFFS_CMD, MATRIX_CMD, VECTOR_CMD, POLY_CMD, MATRIX_CMD }
3895	,{jjCOEFFS3_Id, COEFFS_CMD, MATRIX_CMD, IDEAL_CMD, POLY_CMD, MATRIX_CMD }
3896	,{jjCOEFFS3_Id, COEFFS_CMD, MATRIX_CMD, MODUL_CMD, POLY_CMD, MATRIX_CMD }
3897	,{jjCOEFFS3_KB, COEFFS_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD }
3898	,{jjCOEFFS3_KB, COEFFS_CMD, MATRIX_CMD, MODUL_CMD, MODUL_CMD, POLY_CMD }
3899	,{jjELIMIN_HILB, ELIMINATION_CMD,IDEAL_CMD, IDEAL_CMD, POLY_CMD, INTVEC_CMD }
3900	,{jjFIND3, FIND_CMD, INT_CMD, STRING_CMD, STRING_CMD, INT_CMD }
3901	,{jjCALL3MANY, IDEAL_CMD, IDEAL_CMD, DEF_CMD, DEF_CMD, DEF_CMD }
3902	//,{jjCALL3MANY, INTERSECT_CMD, NONE, DEF_CMD, DEF_CMD, DEF_CMD }
3903	,{lInsert3, INSERT_CMD, LIST_CMD, LIST_CMD, DEF_CMD, INT_CMD }
3904	,{jjCALL3MANY, INTVEC_CMD, INTVEC_CMD, DEF_CMD, DEF_CMD, DEF_CMD }
3905	,{jjJET_P_IV, JET_CMD, POLY_CMD, POLY_CMD, INT_CMD, INTVEC_CMD }
3906	,{jjJET_ID_IV, JET_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD, INTVEC_CMD }
3907	,{jjJET_P_IV, JET_CMD, VECTOR_CMD, VECTOR_CMD, INT_CMD, INTVEC_CMD }
3908	,{jjJET_ID_IV, JET_CMD, MODUL_CMD, MODUL_CMD, INT_CMD, INTVEC_CMD }
3909	,{mpKoszul, KOSZUL_CMD, MATRIX_CMD, INT_CMD, INT_CMD, IDEAL_CMD }
3910	,{jjCALL3MANY, LIST_CMD, LIST_CMD, DEF_CMD, DEF_CMD, DEF_CMD }
3911	,{jjMATRIX_Id, MATRIX_CMD, MATRIX_CMD, IDEAL_CMD, INT_CMD, INT_CMD }
3912	,{jjMATRIX_Mo, MATRIX_CMD, MATRIX_CMD, MODUL_CMD, INT_CMD, INT_CMD }
3913	,{jjMATRIX_Ma, MATRIX_CMD, MATRIX_CMD, MATRIX_CMD, INT_CMD, INT_CMD }
3914	,{jjCALL3MANY, MODUL_CMD, MODUL_CMD, DEF_CMD, DEF_CMD, DEF_CMD }
3915	#ifdef OLD_RES
3916	,{jjRES3, MRES_CMD, NONE, IDEAL_CMD, INT_CMD, ANY_TYPE }
3917	,{jjRES3, MRES_CMD, NONE, MODUL_CMD, INT_CMD, ANY_TYPE }
3918	#endif
3919	,{jjPREIMAGE, PREIMAGE_CMD, IDEAL_CMD, RING_CMD, ANY_TYPE, ANY_TYPE }
3920	,{jjPREIMAGE, PREIMAGE_CMD, IDEAL_CMD, QRING_CMD, ANY_TYPE, ANY_TYPE }
3921	,{jjRANDOM_Im, RANDOM_CMD, INTMAT_CMD, INT_CMD, INT_CMD, INT_CMD }
3922	,{jjREDUCE3_P, REDUCE_CMD, POLY_CMD, POLY_CMD, IDEAL_CMD, INT_CMD }
3923	,{jjREDUCE3_P, REDUCE_CMD, VECTOR_CMD, VECTOR_CMD, IDEAL_CMD, INT_CMD }
3924	,{jjREDUCE3_P, REDUCE_CMD, VECTOR_CMD, VECTOR_CMD, MODUL_CMD, INT_CMD }
3925	,{jjREDUCE3_ID, REDUCE_CMD, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD }
3926	,{jjREDUCE3_ID, REDUCE_CMD, MODUL_CMD, MODUL_CMD, MODUL_CMD, INT_CMD }
3927	,{jjREDUCE3_ID, REDUCE_CMD, MODUL_CMD, MODUL_CMD, IDEAL_CMD, INT_CMD }
3928	#ifdef OLD_RES
3929	,{jjRES3, RES_CMD, NONE, IDEAL_CMD, INT_CMD, ANY_TYPE }
3930	,{jjRES3, RES_CMD, NONE, MODUL_CMD, INT_CMD, ANY_TYPE }
3931	#endif
3932	#ifdef HAVE_FACTORY
3933	,{jjRESULTANT, RESULTANT_CMD, POLY_CMD,POLY_CMD, POLY_CMD, POLY_CMD }
3934	#else
3935	,{jjWRONG3, RESULTANT_CMD, POLY_CMD,POLY_CMD, POLY_CMD, POLY_CMD }
3936	#endif
3937	#ifdef OLD_RES
3938	,{jjRES3, SRES_CMD, NONE, IDEAL_CMD, INT_CMD, ANY_TYPE }
3939	,{jjRES3, SRES_CMD, NONE, MODUL_CMD, INT_CMD, ANY_TYPE }
3940	#endif
3941	,{jjSTATUS3, STATUS_CMD, INT_CMD, LINK_CMD, STRING_CMD, STRING_CMD}
3942	,{jjSUBST_P, SUBST_CMD, POLY_CMD, POLY_CMD, POLY_CMD, POLY_CMD }
3943	,{jjSUBST_P, SUBST_CMD, VECTOR_CMD, VECTOR_CMD, POLY_CMD, POLY_CMD }
3944	,{jjSUBST_Id, SUBST_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD, POLY_CMD }
3945	,{jjSUBST_Id, SUBST_CMD, MODUL_CMD, MODUL_CMD, POLY_CMD, POLY_CMD }
3946	,{jjSUBST_Id, SUBST_CMD, MATRIX_CMD, MATRIX_CMD, POLY_CMD, POLY_CMD }
3947	,{jjCALL3MANY, SYSTEM_CMD, NONE, STRING_CMD, DEF_CMD, DEF_CMD }
3948	,{NULL, 0, 0, 0, 0, 0 }
3949	};
3950	/=================== operations with many arg.: static proc =================/
3951	static BOOLEAN jjCALL1ARG(leftv res, leftv v)
3952	{
3953	return iiExprArith1(res,v,iiOp);
3954	}
3955	static BOOLEAN jjCALL2ARG(leftv res, leftv u)
3956	{
3957	leftv v=u->next;
3958	u->next=NULL;
3959	BOOLEAN b=iiExprArith2(res,u,iiOp,v);
3960	u->next=v;
3961	return b;
3962	}
3963	static BOOLEAN jjCALL3ARG(leftv res, leftv u)
3964	{
3965	leftv v = u->next;
3966	leftv w = v->next;
3967	u->next = NULL;
3968	v->next = NULL;
3969	BOOLEAN b = iiExprArith3(res, iiOp, u, v, w);
3970	u->next = v;
3971	v->next = w;
3972	return b;
3973	}
3974
3975	static BOOLEAN jjCOEF_M(leftv res, leftv v)
3976	{
3977	if((v->Typ() != VECTOR_CMD)
3978	\|\| (v->next->Typ() != POLY_CMD)
3979	\|\| (v->next->next->Typ() != MATRIX_CMD)
3980	\|\| (v->next->next->next->Typ() != MATRIX_CMD))
3981	return TRUE;
3982	if (v->next->next->rtyp!=IDHDL) return TRUE;
3983	idhdl c=(idhdl)v->next->next->data;
3984	if (v->next->next->next->rtyp!=IDHDL) return TRUE;
3985	idhdl m=(idhdl)v->next->next->next->data;
3986	idDelete((ideal *)&(c->data.uideal));
3987	idDelete((ideal *)&(m->data.uideal));
3988	mpCoef2((poly)v->Data(),(poly)v->next->Data(),
3989	(matrix )&(c->data.umatrix),(matrix )&(m->data.umatrix));
3990	return FALSE;
3991	}
3992	static BOOLEAN jjIDEAL_PL(leftv res, leftv v)
3993	{
3994	int s=1;
3995	leftv h=v;
3996	if (h!=NULL) s=exprlist_length(h);
3997	ideal id=idInit(s,1);
3998	int rank=1;
3999	int i=0;
4000	poly p=NULL;
4001	while (h!=NULL)
4002	{
4003	switch(h->Typ())
4004	{
4005	case POLY_CMD:
4006	{
4007	p=(poly)h->CopyD();
4008	break;
4009	}
4010	case INT_CMD:
4011	{
4012	number n=nInit((int)h->Data());
4013	if (!nIsZero(n))
4014	{
4015	p=pOne();
4016	pSetCoeff(p,n);
4017	}
4018	else
4019	{
4020	//p=NULL;
4021	nDelete(&n);
4022	}
4023	break;
4024	}
4025	case NUMBER_CMD:
4026	{
4027	number n=(number)h->CopyD();
4028	if (!nIsZero(n))
4029	{
4030	p=pOne();
4031	pSetCoeff(p,n);
4032	}
4033	else
4034	{
4035	//p=NULL;
4036	nDelete(&n);
4037	}
4038	break;
4039	}
4040	case VECTOR_CMD:
4041	{
4042	p=(poly)h->CopyD();
4043	if (iiOp!=MODUL_CMD)
4044	{
4045	idDelete(&id);
4046	pDelete(&p);
4047	return TRUE;
4048	}
4049	rank=max(rank,pMaxComp(p));
4050	break;
4051	}
4052	default:
4053	{
4054	idDelete(&id);
4055	return TRUE;
4056	}
4057	}
4058	if ((iiOp==MODUL_CMD)&&(p!=NULL)&&(pGetComp(p)==0))
4059	{
4060	pSetCompP(p,1);
4061	}
4062	id->m[i]=p;
4063	i++;
4064	h=h->next;
4065	}
4066	id->rank=rank;
4067	res->data=(char *)id;
4068	return FALSE;
4069	}
4070	static BOOLEAN jjINTERSECT_PL(leftv res, leftv v)
4071	{
4072	leftv h=v;
4073	int l=v->listLength();
4074	resolvente r=(resolvente)Alloc0(l*sizeof(ideal));
4075	BOOLEAN copied=(BOOLEAN )Alloc0(l*sizeof(BOOLEAN));
4076	int t=0;
4077	// try to convert to IDEAL_CMD
4078	while (h!=NULL)
4079	{
4080	if (iiTestConvert(h->Typ(),IDEAL_CMD)!=0)
4081	{
4082	t=IDEAL_CMD;
4083	}
4084	else break;
4085	h=h->next;
4086	}
4087	// if failure, try MODUL_CMD
4088	if (t==0)
4089	{
4090	h=v;
4091	while (h!=NULL)
4092	{
4093	if (iiTestConvert(h->Typ(),MODUL_CMD)!=0)
4094	{
4095	t=MODUL_CMD;
4096	}
4097	else break;
4098	h=h->next;
4099	}
4100	}
4101	// check for success in converting
4102	if (t==0)
4103	{
4104	WerrorS("cannot convert to ideal or module");
4105	return TRUE;
4106	}
4107	// call idMultSect
4108	h=v;
4109	int i=0;
4110	sleftv tmp;
4111	while (h!=NULL)
4112	{
4113	if (h->Typ()==t)
4114	{
4115	r[i]=(ideal)h->Data(); /no copy/
4116	h=h->next;
4117	}
4118	else if(iiConvert(h->Typ(),t,iiTestConvert(h->Typ(),t),h,&tmp))
4119	{
4120	Free((ADDRESS)copied,l*sizeof(BOOLEAN));
4121	Free((ADDRESS)r,l*sizeof(ideal));
4122	Werror("cannot convert arg. %d to %s",i+1,Tok2Cmdname(t));
4123	return TRUE;
4124	}
4125	else
4126	{
4127	r[i]=(ideal)tmp.Data(); /now it's a copy/
4128	copied[i]=TRUE;
4129	h=tmp.next;
4130	}
4131	i++;
4132	}
4133	res->rtyp=t;
4134	res->data=(char *)idMultSect(r,i);
4135	while(i>0)
4136	{
4137	i--;
4138	if (copied[i]) idDelete(&(r[i]));
4139	}
4140	Free((ADDRESS)copied,l*sizeof(BOOLEAN));
4141	Free((ADDRESS)r,l*sizeof(ideal));
4142	return FALSE;
4143	}
4144	static BOOLEAN jjINTVEC_PL(leftv res, leftv v)
4145	{
4146	int i=0;
4147	leftv h=v;
4148	if (h!=NULL) i=exprlist_length(h);
4149	intvec *iv=new intvec(i);
4150	i=0;
4151	while (h!=NULL)
4152	{
4153	if(h->Typ()==INT_CMD)
4154	{
4155	(*iv)[i]=(int)h->Data();
4156	}
4157	else
4158	{
4159	delete iv;
4160	return TRUE;
4161	}
4162	i++;
4163	h=h->next;
4164	}
4165	res->data=(char *)iv;
4166	return FALSE;
4167	}
4168	static BOOLEAN jjKLAMMER_PL(leftv res, leftv u)
4169	{
4170	leftv v=u->next;
4171	BOOLEAN b;
4172	if(v==NULL)
4173	b=iiExprArith1(res,u,iiOp);
4174	else
4175	{
4176	u->next=NULL;
4177	b=iiExprArith2(res,u,iiOp,v);
4178	u->next=v;
4179	}
4180	return b;
4181	}
4182	static BOOLEAN jjLIST_PL(leftv res, leftv v)
4183	{
4184	int sl=0;
4185	if (v!=NULL) sl = v->listLength();
4186	lists L;
4187	if((sl==1)&&(v->Typ()==RESOLUTION_CMD))
4188	{
4189	L=syConvRes((syStrategy)v->Data());
4190	}
4191	else
4192	{
4193	L=(lists)Alloc(sizeof(slists));
4194	leftv h=NULL;
4195	int i;
4196	int rt;
4197
4198	L->Init(sl);
4199	for (i=0;i<sl;i++)
4200	{
4201	if (h!=NULL) { /* e.g. not in the first step:
4202	* h is the pointer to the old sleftv,
4203	* v is the pointer to the next sleftv
4204	* (in this moment) */
4205	h->next=v;
4206	}
4207	h=v;
4208	v=v->next;
4209	h->next=NULL;
4210	rt=h->Typ();
4211	if (rt==0)
4212	{
4213	L->Clean();
4214	Werror("`%s` is undefined",h->Name());
4215	return TRUE;
4216	}
4217	if ((rt==RING_CMD)\|\|(rt==QRING_CMD))
4218	{
4219	L->m[i].rtyp=rt;
4220	L->m[i].data=h->Data();
4221	((ring)L->m[i].data)->ref++;
4222	}
4223	else
4224	L->m[i].Copy(h);
4225	}
4226	}
4227	res->data=(char *)L;
4228	return FALSE;
4229	}
4230	static BOOLEAN jjNAMES0(leftv res, leftv v)
4231	{
4232	res->data=(void *)ipNameList(idroot);
4233	return FALSE;
4234	}
4235	static BOOLEAN jjOPTION_PL(leftv res, leftv v)
4236	{
4237	if(v==NULL)
4238	{
4239	res->data=(char *)showOption();
4240	return FALSE;
4241	}
4242	res->rtyp=NONE;
4243	return setOption(res,v);
4244	}
4245	static BOOLEAN jjRESERVED0(leftv res, leftv v)
4246	{
4247	int i=1;
4248	loop
4249	{
4250	Print("%-20s",cmds[i].name);
4251	i++;
4252	if(cmds[i].name==NULL)
4253	break;
4254	if ((i%3)==1) PrintLn();
4255	}
4256	PrintLn();
4257	return FALSE;
4258	}
4259	static BOOLEAN jjSTRING_PL(leftv res, leftv v)
4260	{
4261	if ((v!=NULL)&&(v->next==NULL))
4262	return iiExprArith1(res,v,iiOp);
4263	int sl=0;
4264	leftv h=v,nachher;
4265	sleftv tmpR;
4266	BOOLEAN bo;
4267	char *sum=NULL;
4268	while(h!=NULL)
4269	{
4270	/* convert to string =================================*/
4271	nachher=h->next;
4272	h->next=NULL;
4273	bo=iiExprArith1(&tmpR,h,iiOp);
4274	if(bo)
4275	{
4276	h->next=nachher;
4277	FreeL(sum);
4278	return TRUE;
4279	}
4280	/* append to 'sum' =================================*/
4281	if(sum==NULL)
4282	{
4283	sum=(char *)tmpR.data;
4284	sl=strlen(sum);
4285	}
4286	else
4287	{
4288	int nl=strlen((char *)tmpR.data);
4289	char s=(char )AllocL(sl+nl+1);
4290	memcpy(s,sum,sl);
4291	memcpy(s+sl,(char *)tmpR.data,nl);
4292	s[sl+nl]='\0';
4293	sl+=nl;
4294	FreeL(sum);
4295	sum=s;
4296	}
4297	/* next sleftv =================================*/
4298	h->next=nachher;
4299	h=nachher;
4300	}
4301	if (sum==NULL) sum=mstrdup("");
4302	res->data=(char *)sum;
4303	return FALSE;
4304	}
4305	static BOOLEAN jjTEST(leftv res, leftv v)
4306	{
4307	do
4308	{
4309	if (v->Typ()!=INT_CMD)
4310	return TRUE;
4311	test_cmd((int)v->Data());
4312	v=v->next;
4313	}
4314	while (v!=NULL);
4315	return FALSE;
4316	}
4317
4318	static BOOLEAN jjSTATUS_M(leftv res, leftv v)
4319	{
4320	if ((v->Typ() != LINK_CMD) \|\|
4321	(v->next->Typ() != STRING_CMD) \|\|
4322	(v->next->next->Typ() != STRING_CMD) \|\|
4323	(v->next->next->next->Typ() != INT_CMD))
4324	return TRUE;
4325	jjSTATUS3(res, v, v->next, v->next->next);
4326	#if defined(HAVE_USLEEP)
4327	if (((int) res->data) == 0)
4328	{
4329	int i_s = (int) v->next->next->next->Data();
4330	if (i_s > 0)
4331	{
4332	usleep((int) v->next->next->next->Data());
4333	jjSTATUS3(res, v, v->next, v->next->next);
4334	}
4335	}
4336	#elif defined(HAVE_SLEEP)
4337	if (((int) res->data) == 0)
4338	{
4339	int i_s = (int) v->next->next->next->Data();
4340	if (i_s > 0)
4341	{
4342	sleep((is - 1)/1000000 + 1);
4343	jjSTATUS3(res, v, v->next, v->next->next);
4344	}
4345	}
4346	#endif
4347	return FALSE;
4348	}
4349
4350
4351	/=================== operations with many arg.: table =================/
4352	/* number_of_args: -1: any, -2: any >0, .. */
4353	struct sValCmdM dArithM[]=
4354	{
4355	// operations:
4356	// proc cmd res number_of_args
4357	{jjKLAMMER_PL, '(', ANY_TYPE, -2 }
4358	,{jjCALL2ARG, COEF_CMD, MATRIX_CMD, 2 }
4359	,{jjCOEF_M, COEF_CMD, NONE, 4 }
4360	,{jjDBPRINT, DBPRINT_CMD, NONE, -2 }
4361	,{jjCALL1ARG, IDEAL_CMD, IDEAL_CMD, 1 }
4362	,{jjIDEAL_PL, IDEAL_CMD, IDEAL_CMD, -1 }
4363	,{jjCALL2ARG, INTERSECT_CMD, IDEAL_CMD, 2 }
4364	,{jjINTERSECT_PL,INTERSECT_CMD, IDEAL_CMD, -2 }
4365	,{jjCALL1ARG, INTVEC_CMD, INTVEC_CMD, 1 }
4366	,{jjINTVEC_PL, INTVEC_CMD, INTVEC_CMD, -1 }
4367	,{jjLIST_PL, LIST_CMD, LIST_CMD, -1 }
4368	,{jjCALL1ARG, MODUL_CMD, MODUL_CMD, 1 }
4369	,{jjIDEAL_PL, MODUL_CMD, MODUL_CMD, -1 }
4370	,{jjCALL1ARG, NAMES_CMD, LIST_CMD, 1 }
4371	,{jjNAMES0, NAMES_CMD, LIST_CMD, 0 }
4372	,{jjOPTION_PL, OPTION_CMD, STRING_CMD/or set by p/,-1 }
4373	,{jjCALL1ARG, RESERVEDNAME_CMD, INT_CMD, 1 }
4374	,{jjRESERVED0, RESERVEDNAME_CMD, NONE, 0 }
4375	,{jjSTRING_PL, STRING_CMD, STRING_CMD, -1 }
4376	,{jjSYSTEM, SYSTEM_CMD, NONE/or set by p/,-2 }
4377	,{jjTEST, TEST_CMD, NONE, -2 }
4378	,{iiWRITE, WRITE_CMD, NONE, -2 }
4379	,{jjCALL2ARG, STATUS_CMD, STRING_CMD, 2 }
4380	,{jjCALL3ARG, STATUS_CMD, INT_CMD, 3 }
4381	,{jjSTATUS_M, STATUS_CMD, INT_CMD, 4 }
4382	,{NULL, 0, 0, 0 }
4383	};
4384	#ifdef MDEBUG
4385	static Subexpr jjDBMakeSub(leftv e,char *f, int l)
4386	#else
4387	static Subexpr jjMakeSub(leftv e)
4388	#endif
4389	{
4390	// assume: e->Typ()==INT_CMD
4391	#ifdef MDEBUG
4392	Subexpr r=(Subexpr)mmDBAllocBlock0(sizeof(*r),f,l);
4393	#else
4394	Subexpr r=(Subexpr)Alloc0(sizeof(*r));
4395	#endif
4396	r->start =(int)e->Data();
4397	return r;
4398	}
4399
4400	/================ generating tables ============================/
4401	#ifdef GENTABLE
4402	extern struct sValAssign dAssign[];
4403	struct sValCmdTab dArithTab1[]={ {0,0}};
4404	#define JJTAB1LEN 0
4405	struct sValCmdTab dArithTab2[]={ {0,0}};
4406	#define JJTAB2LEN 0
4407	void ttGen1()
4408	{
4409	FILE *outfile = myfopen("iparith.inc","w");
4410	int i,j,l1=0,l2=0;
4411	currRing=(ring)Alloc(sizeof(*currRing));
4412	fprintf(outfile,
4413	"/****************************************\n"
4414	"* Computer Algebra System SINGULAR *\n"
4415	"****************************************/\n\n");
4416	/-------------------------------------------------------------------/
4417	fprintf(outfile,"// syntax table for Singular\n//\n");
4418	fprintf(outfile,"// - search for an exact match of the argument types\n");
4419	fprintf(outfile,"// - otherwise search for the first possibility\n");
4420	fprintf(outfile,"// with converted types of the arguments\n");
4421	fprintf(outfile,"// - otherwise report an error\n//\n");
4422
4423	int op;
4424	i=0;
4425	while ((op=dArith1[i].cmd)!=0)
4426	{
4427	if (dArith1[i].p==jjWRONG)
4428	fprintf(outfile,"// DUMMY ");
4429	char *s = iiTwoOps(op);
4430	fprintf(outfile,"// operation: %s (%s) -> %s\n",
4431	s,
4432	Tok2Cmdname(dArith1[i].arg),
4433	Tok2Cmdname(ABS(dArith1[i].res)));
4434	i++;
4435	}
4436	fprintf(outfile,"/---------------------------------------------/\n");
4437	i=0;
4438	while ((op=dArith2[i].cmd)!=0)
4439	{
4440	if (dArith2[i].p==jjWRONG2)
4441	fprintf(outfile,"// DUMMY ");
4442	char *s = iiTwoOps(op);
4443	fprintf(outfile,"// operation: %s (%s, %s) -> %s\n",
4444	s,
4445	Tok2Cmdname(dArith2[i].arg1),
4446	Tok2Cmdname(dArith2[i].arg2),
4447	Tok2Cmdname(dArith2[i].res));
4448	i++;
4449	}
4450	fprintf(outfile,"/---------------------------------------------/\n");
4451	i=0;
4452	while ((op=dArith3[i].cmd)!=0)
4453	{
4454	char *s = iiTwoOps(op);
4455	if (dArith3[i].p==jjWRONG3)
4456	fprintf(outfile,"// DUMMY ");
4457	fprintf(outfile,"// operation: %s (%s, %s, %s) -> %s\n",
4458	s,
4459	Tok2Cmdname(dArith3[i].arg1),
4460	Tok2Cmdname(dArith3[i].arg2),
4461	Tok2Cmdname(dArith3[i].arg3),
4462	Tok2Cmdname(dArith3[i].res));
4463	i++;
4464	}
4465	fprintf(outfile,"/---------------------------------------------/\n");
4466	i=0;
4467	while ((op=dArithM[i].cmd)!=0)
4468	{
4469	char *s = iiTwoOps(op);
4470	fprintf(outfile,"// operation: %s (...) -> %s",
4471	s,
4472	Tok2Cmdname(dArithM[i].res));
4473	switch(dArithM[i].number_of_args)
4474	{
4475	case -2:
4476	fprintf(outfile," ( number of arguments >0 )\n");
4477	break;
4478	case -1:
4479	fprintf(outfile," ( any number of arguments )\n");
4480	break;
4481	default:
4482	fprintf(outfile," ( %d arguments )\n",dArithM[i].number_of_args);
4483	break;
4484	}
4485	i++;
4486	}
4487	fprintf(outfile,"/---------------------------------------------/\n");
4488	i=0;
4489	while ((op=dAssign[i].res)!=0)
4490	{
4491	fprintf(outfile,"// assign: %s = %s\n",
4492	Tok2Cmdname(op/dAssign[i].res/),
4493	Tok2Cmdname(dAssign[i].arg));
4494	i++;
4495	}
4496	/-------------------------------------------------------------------/
4497	fprintf(outfile,"/---------------------------------------------/\n");
4498	for (j=257;j<=MAX_TOK+1;j++)
4499	{
4500	for(i=257;i<=MAX_TOK+1;i++)
4501	{
4502	if ((i!=j) && (j!=IDHDL) && (j!=DEF_CMD) && (j!=ANY_TYPE)
4503	&& iiTestConvert(i,j))
4504	{
4505	fprintf(outfile,"// convert %s -> %s\n",
4506	Tok2Cmdname(i), Tok2Cmdname(j));
4507	if (j==ANY_TYPE) break;
4508	}
4509	}
4510	}
4511	fprintf(outfile,"/---------------------------------------------/\n");
4512	char ops[]="=><+*/[.^,%(;";
4513	for(i=0;ops[i]!='\0';i++)
4514	fprintf(outfile,"// token %d : %c\n", (int)ops[i], ops[i]);
4515	for (i=257;i<=MAX_TOK;i++)
4516	{
4517	char *s=iiTwoOps(i);
4518	if (s[0]!='$')
4519	{
4520	fprintf(outfile,"// token %d : %s\n", i, s);
4521	}
4522	}
4523	/-------------------------------------------------------------------/
4524	fprintf(outfile,"/--max. token: %d, gr: %d --/\n",MAX_TOK,UMINUS);
4525	/-------------------------------------------------------------------/
4526	fprintf(outfile,"/---------------------------------------------/\n");
4527	fprintf(outfile,
4528	"struct sValCmdTab dArithTab1[]=\n"
4529	"{\n");
4530	for (j=1;j<=MAX_TOK+1;j++)
4531	{
4532	for(i=0;dArith1[i].cmd!=0;i++)
4533	{
4534	if (dArith1[i].cmd==j)
4535	{
4536	fprintf(outfile," { %d,%d },\n",j,i);
4537	l1++;
4538	break;
4539	}
4540	}
4541	}
4542	fprintf(outfile," { 10000,0 }\n};\n");
4543	fprintf(outfile,"#define JJTAB1LEN %d\n",l1);
4544	/-------------------------------------------------------------------/
4545	fprintf(outfile,
4546	"struct sValCmdTab dArithTab2[]=\n"
4547	"{\n");
4548	for (j=1;j<=MAX_TOK+1;j++)
4549	{
4550	for(i=0;dArith2[i].cmd!=0;i++)
4551	{
4552	if (dArith2[i].cmd==j)
4553	{
4554	fprintf(outfile," { %d,%d },\n",j,i);
4555	l2++;
4556	break;
4557	}
4558	}
4559	}
4560	fprintf(outfile," { 10000,0 }\n};\n");
4561	fprintf(outfile,"#define JJTAB2LEN %d\n",l2);
4562	fclose(outfile);
4563	}
4564	/-------------------------------------------------------------------/
4565	void ttGen2()
4566	{
4567	FILE *outfile = myfopen("iparith.inc","a");
4568	fprintf(outfile,
4569	"/****************************************\n"
4570	"* Computer Algebra System SINGULAR *\n"
4571	"****************************************/\n\n");
4572	/-------------------------------------------------------------------/
4573	fprintf(outfile,"// identifier table for Singular\n//\n");
4574
4575	fprintf(outfile,
4576	"cmdnames cmds[] =\n"
4577	"{ // name-string alias tokval toktype\n"
4578	"{ \"$INVALID$\", 0, -1, 0},\n");
4579	int i=1;
4580	int m=-1;
4581	int id_nr=0;
4582	BOOLEAN f=FALSE;
4583	loop
4584	{
4585	while (cmds[i].tokval!=0)
4586	{
4587	if ((cmds[i].tokval!=-1)&&(cmds[i].name!=NULL))
4588	{
4589	if(m==-1)
4590	{
4591	m=i;
4592	f=TRUE;
4593	}
4594	else if(strcmp(cmds[m].name,cmds[i].name)>0)
4595	{
4596	m=i;
4597	f=TRUE;
4598	}
4599	}
4600	i++;
4601	}
4602	if(f)
4603	{
4604	id_nr++;
4605	if(cmds[m].tokval==VRTIMER) fprintf(outfile,"#ifdef HAVE_RTIMER\n");
4606	fprintf(outfile," {\"%s\", %*d, %3d, ",cmds[m].name,
4607	20-strlen(cmds[m].name),
4608	cmds[m].alias,
4609	cmds[m].tokval);
4610	switch(cmds[m].toktype)
4611	{
4612	case CMD_1: fprintf(outfile,"CMD_1 },\n"); break;
4613	case CMD_2: fprintf(outfile,"CMD_2 },\n"); break;
4614	case CMD_3: fprintf(outfile,"CMD_3 },\n"); break;
4615	case CMD_12: fprintf(outfile,"CMD_12 },\n"); break;
4616	case CMD_123 : fprintf(outfile,"CMD_123 },\n"); break;
4617	case CMD_23: fprintf(outfile,"CMD_23 },\n"); break;
4618	case CMD_M: fprintf(outfile,"CMD_M },\n"); break;
4619	case SYSVAR: fprintf(outfile,"SYSVAR },\n"); break;
4620	case ROOT_DECL: fprintf(outfile,"ROOT_DECL },\n"); break;
4621	case ROOT_DECL_LIST: fprintf(outfile,"ROOT_DECL_LIST },\n"); break;
4622	case RING_DECL: fprintf(outfile,"RING_DECL },\n"); break;
4623	case NONE: fprintf(outfile,"NONE },\n"); break;
4624	default: if((cmds[m].toktype>' ')
4625	&&(cmds[m].toktype<127))
4626	{
4627	fprintf(outfile,"'%c' },\n",cmds[m].toktype);
4628	}
4629	else
4630	{
4631	fprintf(outfile,"%d },\n",cmds[m].toktype);
4632	}
4633	break;
4634	}
4635	if(cmds[m].tokval==VRTIMER) fprintf(outfile,"#endif\n");
4636	cmds[m].name=NULL;
4637	m=-1;
4638	i=1;
4639	f=FALSE;
4640	}
4641	else break;
4642	}
4643	fprintf(outfile,
4644	"/* list of scanner identifiers/only for feread/reservedName */\n");
4645	f=FALSE;
4646	i=1;m=-1;
4647	loop
4648	{
4649	while (cmds[i].tokval!=0)
4650	{
4651	if (cmds[i].name!=NULL)
4652	{
4653	if(m==-1)
4654	{
4655	m=i;
4656	f=TRUE;
4657	}
4658	else if(strcmp(cmds[m].name,cmds[i].name)>0)
4659	{
4660	m=i;
4661	f=TRUE;
4662	}
4663	}
4664	i++;
4665	}
4666	if(f)
4667	{
4668	fprintf(outfile," {\"%s\", %*d, -1, 0 },\n",cmds[m].name,
4669	20-strlen(cmds[m].name),
4670	0/cmds[m].alias/
4671	/-1 cmds[m].tokval/
4672	/0 cmds[m].toktype/);
4673	cmds[m].name=NULL;
4674	m=-1;
4675	i=1;
4676	f=FALSE;
4677	}
4678	else break;
4679	}
4680	fprintf(outfile,
4681	"/* end of list marker */\n"
4682	" { NULL, 0, 0, 0}\n"
4683	"};\n"
4684	"#ifdef HAVE_RTIMER\n"
4685	"#define LAST_IDENTIFIER %d\n"
4686	"#else\n"
4687	"#define LAST_IDENTIFIER %d\n"
4688	"#endif\n",id_nr,id_nr-1);
4689	fclose(outfile);
4690	}
4691	/-------------------------------------------------------------------/
4692	#if 0
4693	void ttGen3()
4694	{
4695	FILE *outfile = myfopen("mpsr_tok.inc","w");
4696	fprintf(outfile,
4697	"/****************************************\n"
4698	"* Computer Algebra System SINGULAR *\n"
4699	"****************************************/\n\n");
4700	/-------------------------------------------------------------------/
4701	fprintf(outfile,"// token table for Singular\n//\n");
4702
4703	fprintf(outfile,
4704	"short vtok[] =\n"
4705	"{\n");
4706	// operations with 1 arg: ===========================================
4707	int i=0;
4708	while (dArith1[i].cmd!=0)
4709	{
4710	if ((dArith1[i].p!=jjWRONG)
4711	&&((i==0)\|\|(dArith1[i].cmd!=dArith1[i-1].cmd)))
4712	{
4713	fprintf(outfile," %d,\n",dArith1[i].cmd);
4714	}
4715	i++;
4716	}
4717	// operations with 2 args: ===========================================
4718	i=0;
4719	while (dArith2[i].cmd!=0)
4720	{
4721	if ((dArith2[i].p!=jjWRONG2)
4722	&&((i==0)\|\|(dArith2[i].cmd!=dArith2[i-1].cmd)))
4723	{
4724	fprintf(outfile," %d,\n",dArith2[i].cmd);
4725	}
4726	i++;
4727	}
4728	// operations with 3 args: ===========================================
4729	i=0;
4730	while (dArith3[i].cmd!=0)
4731	{
4732	if (
4733	((i==0)\|\|(dArith3[i].cmd!=dArith3[i-1].cmd)))
4734	{
4735	fprintf(outfile," %d,\n",dArith3[i].cmd);
4736	}
4737	i++;
4738	}
4739	// operations with many args: ===========================================
4740	i=0;
4741	while (dArithM[i].cmd!=0)
4742	{
4743	if (
4744	((i==0)\|\|(dArithM[i].cmd!=dArithM[i-1].cmd)))
4745	{
4746	fprintf(outfile," %d,\n",dArithM[i].cmd);
4747	}
4748	i++;
4749	}
4750	// ====================================================================
4751	fprintf(outfile,
4752	"/* end of list marker */\n"
4753	" %d };\n",MAX_TOK);
4754	fclose(outfile);
4755	}
4756	#endif
4757	/-------------------------------------------------------------------/
4758	#else
4759	#include "iparith.inc"
4760	#endif
4761
4762	/=================== operations with 2 args. ============================/
4763
4764	BOOLEAN iiExprArith2(leftv res, leftv a, int op, leftv b, BOOLEAN proccall)
4765	{
4766	#ifndef GENTABLE
4767
4768	memset(res,0,sizeof(sleftv));
4769
4770	if (!errorreported)
4771	{
4772	#ifdef SIQ
4773	if (siq>0)
4774	{
4775	//Print("siq:%d\n",siq);
4776	command d=(command)Alloc0(sizeof(ip_command));
4777	memcpy(&d->arg1,a,sizeof(sleftv));
4778	memcpy(&d->arg2,b,sizeof(sleftv));
4779	d->argc=2;
4780	d->op=op;
4781	res->data=(char *)d;
4782	res->rtyp=COMMAND;
4783	return FALSE;
4784	}
4785	#endif
4786	int at=a->Typ();
4787	int bt=b->Typ();
4788	int i=iiTabIndex(dArithTab2,JJTAB2LEN,op);
4789
4790	iiOp=op;
4791	while (dArith2[i].cmd==op)
4792	{
4793	if ((at==dArith2[i].arg1)
4794	&& (bt==dArith2[i].arg2))
4795	{
4796	res->rtyp=dArith2[i].res;
4797	if (dArith2[i].p(res,a,b))
4798	{
4799	break;// leave loop, goto error handling
4800	}
4801	a->CleanUp();
4802	b->CleanUp();
4803	//Print("op: %d,result typ:%d\n",op,res->rtyp);
4804	return FALSE;
4805	}
4806	i++;
4807	}
4808	// implicite type conversion ----------------------------------------------
4809	if (dArith2[i].cmd!=op)
4810	{
4811	int ai,bi;
4812	leftv an = (leftv)Alloc0(sizeof(sleftv));
4813	leftv bn = (leftv)Alloc0(sizeof(sleftv));
4814	BOOLEAN failed=FALSE;
4815	i=iiTabIndex(dArithTab2,JJTAB2LEN,op);
4816	//Print("op: %c, type: %s %s\n",op,Tok2Cmdname(at),Tok2Cmdname(bt));
4817	while (dArith2[i].cmd==op)
4818	{
4819	//Print("test %s %s\n",Tok2Cmdname(dArith2[i].arg1),Tok2Cmdname(dArith2[i].arg2));
4820	if ((ai=iiTestConvert(at,dArith2[i].arg1))!=0)
4821	{
4822	if ((bi=iiTestConvert(bt,dArith2[i].arg2))!=0)
4823	{
4824	res->rtyp=dArith2[i].res;
4825	failed= ((iiConvert(at,dArith2[i].arg1,ai,a,an))
4826	\|\| (iiConvert(bt,dArith2[i].arg2,bi,b,bn))
4827	\|\| (dArith2[i].p(res,an,bn)));
4828	// everything done, clean up temp. variables
4829	if (failed)
4830	{
4831	// leave loop, goto error handling
4832	break;
4833	}
4834	else
4835	{
4836	// everything ok, clean up and return
4837	an->CleanUp();
4838	bn->CleanUp();
4839	Free((ADDRESS)an,sizeof(sleftv));
4840	Free((ADDRESS)bn,sizeof(sleftv));
4841	a->CleanUp();
4842	b->CleanUp();
4843	return FALSE;
4844	}
4845	}
4846	}
4847	i++;
4848	}
4849	an->CleanUp();
4850	bn->CleanUp();
4851	Free((ADDRESS)an,sizeof(sleftv));
4852	Free((ADDRESS)bn,sizeof(sleftv));
4853	}
4854	// error handling ---------------------------------------------------
4855	const char *s=NULL;
4856	if (!errorreported)
4857	{
4858	if ((at==0) && (a->Name()!=sNoName))
4859	{
4860	s=a->Name();
4861	}
4862	else if ((bt==0) && (b->Name()!=sNoName))
4863	{
4864	s=b->Name();
4865	}
4866	if (s!=NULL)
4867	Werror("`%s` is not defined",s);
4868	else
4869	{
4870	i=iiTabIndex(dArithTab2,JJTAB2LEN,op);
4871	s = iiTwoOps(op);
4872	if (proccall)
4873	{
4874	Werror("%s(`%s`,`%s`) is not supported"
4875	,s,Tok2Cmdname(at),Tok2Cmdname(bt));
4876	}
4877	else
4878	{
4879	Werror("`%s` %s `%s` is not supported"
4880	,Tok2Cmdname(at),s,Tok2Cmdname(bt));
4881	}
4882	if (BVERBOSE(V_SHOW_USE))
4883	{
4884	while (dArith2[i].cmd==op)
4885	{
4886	if(((at==dArith2[i].arg1)\|\|(bt==dArith2[i].arg2))
4887	&& (dArith2[i].res!=0)
4888	&& (dArith2[i].p!=jjWRONG2))
4889	{
4890	if (proccall)
4891	Werror("expected %s(`%s`,`%s`)"
4892	,s,Tok2Cmdname(dArith2[i].arg1),Tok2Cmdname(dArith2[i].arg2));
4893	else
4894	Werror("expected `%s` %s `%s`"
4895	,Tok2Cmdname(dArith2[i].arg1),s,Tok2Cmdname(dArith2[i].arg2));
4896	}
4897	i++;
4898	}
4899	}
4900	}
4901	}
4902	res->rtyp = UNKNOWN;
4903	}
4904	a->CleanUp();
4905	b->CleanUp();
4906	#endif
4907	return TRUE;
4908	}
4909
4910	/==================== operations with 1 arg. ===============================/
4911
4912	BOOLEAN iiExprArith1(leftv res, leftv a, int op)
4913	{
4914	#ifndef GENTABLE
4915	memset(res,0,sizeof(sleftv));
4916
4917	if (!errorreported)
4918	{
4919	#ifdef SIQ
4920	if (siq>0)
4921	{
4922	//Print("siq:%d\n",siq);
4923	command d=(command)Alloc0(sizeof(ip_command));
4924	memcpy(&d->arg1,a,sizeof(sleftv));
4925	d->op=op;
4926	d->argc=1;
4927	res->data=(char *)d;
4928	res->rtyp=COMMAND;
4929	return FALSE;
4930	}
4931	#endif
4932	int at=a->Typ();
4933	BOOLEAN failed=FALSE;
4934
4935	iiOp=op;
4936	int i=iiTabIndex(dArithTab1,JJTAB1LEN,op);
4937	while (dArith1[i].cmd==op)
4938	{
4939	if (at==dArith1[i].arg)
4940	{
4941	res->rtyp=dArith1[i].res;
4942	if (dArith1[i].res<0)
4943	{
4944	res->rtyp=-res->rtyp;
4945	#ifdef PROC_BUG
4946	dArith1[i].p(res,a);
4947	#else
4948	res->data=(char )((Proc1)dArith1[i].p)((char )a->Data());
4949	#endif
4950	}
4951	else if (dArith1[i].p(res,a))
4952	{
4953	break;// leave loop, goto error handling
4954	}
4955	if (a->Next()!=NULL)
4956	{
4957	res->next=(leftv)Alloc(sizeof(sleftv));
4958	failed=iiExprArith1(res->next,a->next,op);
4959	}
4960	a->CleanUp();
4961	return failed;
4962	}
4963	i++;
4964	}
4965	// implicite type conversion --------------------------------------------
4966	if (dArith1[i].cmd!=op)
4967	{
4968	int ai;
4969	leftv an = (leftv)Alloc0(sizeof(sleftv));
4970	i=iiTabIndex(dArithTab1,JJTAB1LEN,op);
4971	//Print("fuer %c , typ: %s\n",op,Tok2Cmdname(at));
4972	while (dArith1[i].cmd==op)
4973	{
4974	//Print("test %s\n",Tok2Cmdname(dArith1[i].arg));
4975	if ((ai=iiTestConvert(at,dArith1[i].arg))!=0)
4976	{
4977	res->rtyp=dArith1[i].res;
4978	if (dArith1[i].res<0)
4979	{
4980	res->rtyp=-res->rtyp;
4981	failed= iiConvert(at,dArith1[i].arg,ai,a,an);
4982	if (!failed)
4983	{
4984	#ifdef PROC_BUG
4985	dArith1[i].p(res,a);
4986	#else
4987	res->data=(char )((Proc1)dArith1[i].p)((char )an->Data());
4988	#endif
4989	}
4990	}
4991	else
4992	{
4993	failed= ((iiConvert(at,dArith1[i].arg,ai,a,an))
4994	\|\| (dArith1[i].p(res,an)));
4995	}
4996	// everything done, clean up temp. variables
4997	if (failed)
4998	{
4999	// leave loop, goto error handling
5000	break;
5001	}
5002	else
5003	{
5004	// everything ok, clean up and return
5005	an->CleanUp();
5006	Free((ADDRESS)an,sizeof(sleftv));
5007	a->CleanUp();
5008	return FALSE;
5009	}
5010	}
5011	i++;
5012	}
5013	an->CleanUp();
5014	Free((ADDRESS)an,sizeof(sleftv));
5015	}
5016	// error handling
5017	if (!errorreported)
5018	{
5019	if ((at==0) && (a->Name()!=sNoName))
5020	{
5021	Werror("`%s` is not defined",a->Name());
5022	}
5023	else
5024	{
5025	i=iiTabIndex(dArithTab1,JJTAB1LEN,op);
5026	char *s = iiTwoOps(op);
5027	Werror("%s(`%s`) is not supported"
5028	,s,Tok2Cmdname(at));
5029	if (BVERBOSE(V_SHOW_USE))
5030	{
5031	while (dArith1[i].cmd==op)
5032	{
5033	if ((dArith1[i].res!=0)
5034	&& (dArith1[i].p!=jjWRONG))
5035	Werror("expected %s(`%s`)"
5036	,s,Tok2Cmdname(dArith1[i].arg));
5037	i++;
5038	}
5039	}
5040	}
5041	}
5042	res->rtyp = UNKNOWN;
5043	}
5044	a->CleanUp();
5045	#endif
5046	return TRUE;
5047	}
5048
5049	/=================== operations with 3 args. ============================/
5050
5051	BOOLEAN iiExprArith3(leftv res, int op, leftv a, leftv b, leftv c)
5052	{
5053	#ifndef GENTABLE
5054	memset(res,0,sizeof(sleftv));
5055
5056	if (!errorreported)
5057	{
5058	#ifdef SIQ
5059	if (siq>0)
5060	{
5061	//Print("siq:%d\n",siq);
5062	command d=(command)Alloc0(sizeof(ip_command));
5063	memcpy(&d->arg1,a,sizeof(sleftv));
5064	memcpy(&d->arg2,b,sizeof(sleftv));
5065	memcpy(&d->arg3,c,sizeof(sleftv));
5066	d->op=op;
5067	d->argc=3;
5068	res->data=(char *)d;
5069	res->rtyp=COMMAND;
5070	return FALSE;
5071	}
5072	#endif
5073	int at=a->Typ();
5074	int bt=b->Typ();
5075	int ct=c->Typ();
5076
5077	iiOp=op;
5078	int i=0;
5079	while ((dArith3[i].cmd!=op)&&(dArith3[i].cmd!=0)) i++;
5080	while (dArith3[i].cmd==op)
5081	{
5082	if ((at==dArith3[i].arg1)
5083	&& (bt==dArith3[i].arg2)
5084	&& (ct==dArith3[i].arg3))
5085	{
5086	res->rtyp=dArith3[i].res;
5087	if (dArith3[i].p(res,a,b,c))
5088	{
5089	break;// leave loop, goto error handling
5090	}
5091	a->CleanUp();
5092	b->CleanUp();
5093	c->CleanUp();
5094	return FALSE;
5095	}
5096	i++;
5097	}
5098	// implicite type conversion ----------------------------------------------
5099	if (dArith3[i].cmd!=op)
5100	{
5101	int ai,bi,ci;
5102	leftv an = (leftv)Alloc0(sizeof(sleftv));
5103	leftv bn = (leftv)Alloc0(sizeof(sleftv));
5104	leftv cn = (leftv)Alloc0(sizeof(sleftv));
5105	BOOLEAN failed=FALSE;
5106	i=0;
5107	while ((dArith3[i].cmd!=op)&&(dArith3[i].cmd!=0)) i++;
5108	while (dArith3[i].cmd==op)
5109	{
5110	if ((ai=iiTestConvert(at,dArith3[i].arg1))!=0)
5111	{
5112	if ((bi=iiTestConvert(bt,dArith3[i].arg2))!=0)
5113	{
5114	if ((ci=iiTestConvert(ct,dArith3[i].arg3))!=0)
5115	{
5116	res->rtyp=dArith3[i].res;
5117	failed= ((iiConvert(at,dArith3[i].arg1,ai,a,an))
5118	\|\| (iiConvert(bt,dArith3[i].arg2,bi,b,bn))
5119	\|\| (iiConvert(ct,dArith3[i].arg3,ci,c,cn))
5120	\|\| (dArith3[i].p(res,an,bn,cn)));
5121	// everything done, clean up temp. variables
5122	if (failed)
5123	{
5124	// leave loop, goto error handling
5125	break;
5126	}
5127	else
5128	{
5129	// everything ok, clean up and return
5130	an->CleanUp();
5131	bn->CleanUp();
5132	cn->CleanUp();
5133	Free((ADDRESS)an,sizeof(sleftv));
5134	Free((ADDRESS)bn,sizeof(sleftv));
5135	Free((ADDRESS)cn,sizeof(sleftv));
5136	a->CleanUp();
5137	b->CleanUp();
5138	c->CleanUp();
5139	//Print("op: %d,result typ:%d\n",op,res->rtyp);
5140	return FALSE;
5141	}
5142	}
5143	}
5144	}
5145	i++;
5146	}
5147	an->CleanUp();
5148	bn->CleanUp();
5149	cn->CleanUp();
5150	Free((ADDRESS)an,sizeof(sleftv));
5151	Free((ADDRESS)bn,sizeof(sleftv));
5152	Free((ADDRESS)cn,sizeof(sleftv));
5153	}
5154	// error handling ---------------------------------------------------
5155	if (!errorreported)
5156	{
5157	const char *s=NULL;
5158	if ((at==0) && (a->Name()!=sNoName))
5159	{
5160	s=a->Name();
5161	}
5162	else if ((bt==0) && (b->Name()!=sNoName))
5163	{
5164	s=b->Name();
5165	}
5166	else if ((ct==0) && (c->Name()!=sNoName))
5167	{
5168	s=c->Name();
5169	}
5170	if (s!=NULL)
5171	Werror("`%s` is not defined",s);
5172	else
5173	{
5174	i=0;
5175	while ((dArith3[i].cmd!=op)&&(dArith3[i].cmd!=0)) i++;
5176	char *s = iiTwoOps(op);
5177	Werror("%s(`%s`,`%s`,`%s`) is not supported"
5178	,s,Tok2Cmdname(at),Tok2Cmdname(bt),Tok2Cmdname(ct));
5179	if (BVERBOSE(V_SHOW_USE))
5180	{
5181	while (dArith3[i].cmd==op)
5182	{
5183	if(((at==dArith3[i].arg1)
5184	\|\|(bt==dArith3[i].arg2)
5185	\|\|(ct==dArith3[i].arg3))
5186	&& (dArith3[i].res!=0))
5187	{
5188	Werror("expected %s(`%s`,`%s`,`%s`)"
5189	,s,Tok2Cmdname(dArith3[i].arg1)
5190	,Tok2Cmdname(dArith3[i].arg2)
5191	,Tok2Cmdname(dArith3[i].arg3));
5192	}
5193	i++;
5194	}
5195	}
5196	}
5197	}
5198	res->rtyp = UNKNOWN;
5199	}
5200	a->CleanUp();
5201	b->CleanUp();
5202	c->CleanUp();
5203	//Print("op: %d,result typ:%d\n",op,res->rtyp);
5204	#endif
5205	return TRUE;
5206	}
5207	/==================== operations with many arg. ===============================/
5208
5209	BOOLEAN iiExprArithM(leftv res, leftv a, int op)
5210	{
5211	#ifndef GENTABLE
5212	memset(res,0,sizeof(sleftv));
5213
5214	if (!errorreported)
5215	{
5216	#ifdef SIQ
5217	if (siq>0)
5218	{
5219	//Print("siq:%d\n",siq);
5220	command d=(command)Alloc0(sizeof(ip_command));
5221	d->op=op;
5222	res->data=(char *)d;
5223	if (a!=NULL)
5224	{
5225	d->argc=a->listLength();
5226	// else : d->argc=0;
5227	memcpy(&d->arg1,a,sizeof(sleftv));
5228	switch(d->argc)
5229	{
5230	case 3:
5231	memcpy(&d->arg3,a->next->next,sizeof(sleftv));
5232	a->next->next->rtyp=0;
5233	a->next->next->data=NULL;
5234	a->next->next->name=NULL;
5235	a->next->next->attribute=NULL;
5236	case 2:
5237	memcpy(&d->arg2,a->next,sizeof(sleftv));
5238	a->next->rtyp=0;
5239	a->next->name=NULL;
5240	a->next->data=NULL;
5241	a->next->attribute=NULL;
5242	d->arg2.next=NULL;
5243	case 1:
5244	d->arg1.next=NULL;
5245	}
5246	if (d->argc>3) a->next=NULL;
5247	a->rtyp=0;
5248	a->data=NULL;
5249	a->name=NULL;
5250	a->CleanUp();
5251	}
5252	res->rtyp=COMMAND;
5253	return FALSE;
5254	}
5255	#endif
5256	BOOLEAN failed=FALSE;
5257	int args=0;
5258	if (a!=NULL) args=a->listLength();
5259
5260	iiOp=op;
5261	int i=0;
5262	while ((dArithM[i].cmd!=op)&&(dArithM[i].cmd!=0)) i++;
5263	int ii=i;
5264	while (dArithM[i].cmd==op)
5265	{
5266	if ((args==dArithM[i].number_of_args)
5267	\|\| (dArithM[i].number_of_args==-1)
5268	\|\| ((dArithM[i].number_of_args==-2)&&(args>0)))
5269	{
5270	res->rtyp=dArithM[i].res;
5271	if (dArithM[i].p(res,a))
5272	{
5273	break;// leave loop, goto error handling
5274	}
5275	if (a!=NULL) a->CleanUp();
5276	//Print("op: %d,result typ:%d\n",op,res->rtyp);
5277	return failed;
5278	}
5279	i++;
5280	}
5281	// error handling
5282	if (!errorreported)
5283	{
5284	if ((a->rtyp==0) && (a->Name()!=sNoName))
5285	{
5286	Werror("`%s` is not defined",a->Name());
5287	}
5288	else
5289	{
5290	char *s = iiTwoOps(op);
5291	Werror("%s(...) is not supported",s);
5292	}
5293	}
5294	res->rtyp = UNKNOWN;
5295	}
5296	if (a!=NULL) a->CleanUp();
5297	//Print("op: %d,result typ:%d\n",op,res->rtyp);
5298	#endif
5299	return TRUE;
5300	}
5301
5302	/=================== general utilities ============================/
5303	int IsCmd(char *n, int & tok)
5304	{
5305	int an=1;
5306	int i,v;
5307	#ifndef GENTABLE
5308	int en=LAST_IDENTIFIER;
5309
5310	loop
5311	{
5312	if(an>=en-1)
5313	{
5314	if (strcmp(n, cmds[an].name) == 0)
5315	{
5316	i=an;
5317	break;
5318	}
5319	else if (strcmp(n, cmds[en].name) == 0)
5320	{
5321	i=en;
5322	break;
5323	}
5324	else
5325	{
5326	return 0;
5327	}
5328	}
5329	i=(an+en)/2;
5330	v=strcmp(n,cmds[i].name);
5331	if(v<0)
5332	{
5333	en=i;
5334	}
5335	else if(v>0)
5336	{
5337	an=i;
5338	}
5339	else /v==0/
5340	{
5341	break;
5342	}
5343	}
5344	lastreserved=cmds[i].name;
5345	tok=cmds[i].tokval;
5346	if(cmds[i].alias==2)
5347	{
5348	Warn("outdated identifier `%s` used - please change your code",
5349	cmds[i].name);
5350	cmds[i].alias=1;
5351	}
5352	if (currRingHdl==NULL)
5353	{
5354	#ifdef SIQ
5355	if (siq<=0)
5356	{
5357	#endif
5358	if ((tok>=BEGIN_RING) && (tok<=END_RING))
5359	{
5360	Werror("no ring active");
5361	return 0;
5362	}
5363	#ifdef SIQ
5364	}
5365	#endif
5366	}
5367	if (!expected_parms)
5368	{
5369	switch (tok)
5370	{
5371	case IDEAL_CMD:
5372	case INT_CMD:
5373	case INTVEC_CMD:
5374	case MAP_CMD:
5375	case MATRIX_CMD:
5376	case MODUL_CMD:
5377	case POLY_CMD:
5378	case PROC_CMD:
5379	case RING_CMD:
5380	case STRING_CMD:
5381	cmdtok = tok;
5382	break;
5383	}
5384	}
5385	#endif
5386	return cmds[i].toktype;
5387	}
5388	static int iiTabIndex(const jjValCmdTab dArithTab, const int len, const int op)
5389	{
5390	#ifndef GENTABLE
5391	int a=0;
5392	int e=len;
5393	int p=len/2;
5394	while ( a!=e)
5395	{
5396	if (op==dArithTab[p].cmd) return dArithTab[p].start;
5397	else if (op<dArithTab[p].cmd)
5398	{ e=p; p=a+(e-a)/2;}
5399	else
5400	{ a=p; p=p+(e-p)/2; }
5401	}
5402	#endif
5403	return -1;
5404	}
5405

Note: See TracBrowser for help on using the repository browser.

Download in other formats: