Context Navigation

iparith.cc @ 0d7584

spielwiese

Last change on this file since 0d7584 was 0d7584, checked in by Hans Schönemann <hannes@…>, 25 years ago
*hannes: fixed highcorner git-svn-id: file:///usr/local/Singular/svn/trunk@2907 2c84dea3-7e68-4137-9b89-c4e89433aadc
Property mode set to `100644`
File size: 164.8 KB

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