Context Navigation

iparith.cc @ 54ef19

spielwiese

Last change on this file since 54ef19 was 54ef19, checked in by Wilfred Pohl <pohl@…>, 24 years ago
bareiss with 3 arguments git-svn-id: file:///usr/local/Singular/svn/trunk@3195 2c84dea3-7e68-4137-9b89-c4e89433aadc
Property mode set to `100644`
File size: 165.6 KB

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