Context Navigation

source: git/Singular/iparith.cc @ 2eeb7d

spielwiese

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

Line
1	/****************************************
2	* Computer Algebra System SINGULAR *
3	****************************************/
4	/* $Id: iparith.cc,v 1.161 1999-07-13 16:24:45 Singular Exp $ */
5
6	/*
7	* ABSTRACT: table driven kernel interface, used by interpreter
8	*/
9
10	#include <stdlib.h>
11	#include <string.h>
12	#include <ctype.h>
13	#include <stdio.h>
14	#include <time.h>
15	#include <unistd.h>
16
17	#include "mod2.h"
18	#include "tok.h"
19	#include "ipid.h"
20	#include "intvec.h"
21	#include "mmemory.h"
22	#include "febase.h"
23	#include "longalg.h"
24	#include "polys.h"
25	#include "ideals.h"
26	#include "matpol.h"
27	#include "kstd1.h"
28	#include "timer.h"
29	#include "ring.h"
30	#include "subexpr.h"
31	#include "lists.h"
32	#include "numbers.h"
33	#include "stairc.h"
34	#include "maps.h"
35	#include "syz.h"
36	#include "weight.h"
37	#include "ipconv.h"
38	#include "ipprint.h"
39	#include "sing_dld.h"
40	#include "attrib.h"
41	#include "silink.h"
42	#include "sparsmat.h"
43	#ifdef HAVE_FACTORY
44	#include "clapsing.h"
45	#include "kstdfac.h"
46	#endif
47	#ifdef HAVE_FGLM
48	#include "fglm.h"
49	#endif
50	#include "ipshell.h"
51
52	#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_3},
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_M},
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("identifier %s not found 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	,{nuMPResMat, MPRES_CMD, MODUL_CMD, IDEAL_CMD, INT_CMD PROFILER}
2281	,{NULL, 0, 0, 0, 0 PROFILER}
2282	};
2283	/=================== operations with 1 arg.: static proc =================/
2284	static BOOLEAN jjDUMMY(leftv res, leftv u)
2285	{
2286	res->data = (char *)u->CopyD();
2287	return FALSE;
2288	}
2289	static BOOLEAN jjNULL(leftv res, leftv u)
2290	{
2291	return FALSE;
2292	}
2293	//static BOOLEAN jjPLUSPLUS(leftv res, leftv u)
2294	//{
2295	// res->data = (char *)((int)u->Data()+1);
2296	// return FALSE;
2297	//}
2298	//static BOOLEAN jjMINUSMINUS(leftv res, leftv u)
2299	//{
2300	// res->data = (char *)((int)u->Data()-1);
2301	// return FALSE;
2302	//}
2303	static BOOLEAN jjPLUSPLUS(leftv res, leftv u)
2304	{
2305	if (IDTYP((idhdl)u->data)==INT_CMD)
2306	{
2307	if (iiOp==PLUSPLUS) IDINT((idhdl)u->data)++;
2308	else IDINT((idhdl)u->data)--;
2309	return FALSE;
2310	}
2311	return TRUE;
2312	}
2313	static BOOLEAN jjUMINUS_I(leftv res, leftv u)
2314	{
2315	res->data = (char *)(-(int)u->Data());
2316	return FALSE;
2317	}
2318	static BOOLEAN jjUMINUS_N(leftv res, leftv u)
2319	{
2320	number n=(number)u->CopyD();
2321	n=nNeg(n);
2322	res->data = (char *)n;
2323	return FALSE;
2324	}
2325	static BOOLEAN jjUMINUS_P(leftv res, leftv u)
2326	{
2327	res->data = (char *)pNeg((poly)u->CopyD(POLY_CMD));
2328	return FALSE;
2329	}
2330	static BOOLEAN jjUMINUS_MA(leftv res, leftv u)
2331	{
2332	poly m1=pISet(-1);
2333	res->data = (char *)mpMultP((matrix)u->CopyD(MATRIX_CMD),m1);
2334	return FALSE;
2335	}
2336	static BOOLEAN jjUMINUS_IV(leftv res, leftv u)
2337	{
2338	intvec iv=(intvec )u->CopyD(INTVEC_CMD);
2339	(iv)=(-1);
2340	res->data = (char *)iv;
2341	return FALSE;
2342	}
2343	static BOOLEAN jjPROC1(leftv res, leftv u)
2344	{
2345	if ((u->rtyp!=IDHDL) \|\| (u->e!=NULL))
2346	return TRUE;
2347	#ifdef HAVE_NAMESPACES
2348	leftv sl = iiMake_proc((idhdl) u->data,u,NULL);
2349	#else /* HAVE_NAMESPACES */
2350	leftv sl = iiMake_proc((idhdl) u->data,NULL);
2351	#endif /* HAVE_NAMESPACES */
2352	if (sl==NULL)
2353	{
2354	return TRUE;
2355	}
2356	else
2357	{
2358	memcpy(res,sl,sizeof(sleftv));
2359	}
2360	return FALSE;
2361	}
2362	static BOOLEAN jjBAREISS(leftv res, leftv v)
2363	{
2364	//matrix m=(matrix)v->Data();
2365	//lists l=mpBareiss(m,FALSE);
2366	lists l=smCallNewBareiss((ideal)v->Data(),0,0);
2367	res->data = (char *)l;
2368	return FALSE;
2369	}
2370	static BOOLEAN jjBAREISS_IM(leftv res, leftv v)
2371	{
2372	intvec m=(intvec )v->CopyD();
2373	ivTriangMat(m,1,1);
2374	res->data = (char *)m;
2375	return FALSE;
2376	}
2377	static BOOLEAN jjCALL1MANY(leftv res, leftv u)
2378	{
2379	return iiExprArithM(res,u,iiOp);
2380	}
2381	static BOOLEAN jjCHAR(leftv res, leftv v)
2382	{
2383	res->data = (char *)rChar((ring)v->Data());
2384	return FALSE;
2385	}
2386	static BOOLEAN jjCOLS(leftv res, leftv v)
2387	{
2388	res->data = (char *)MATCOLS((matrix)(v->Data()));
2389	return FALSE;
2390	}
2391	static BOOLEAN jjCOLS_IV(leftv res, leftv v)
2392	{
2393	res->data = (char )((intvec)(v->Data()))->cols();
2394	return FALSE;
2395	}
2396	static BOOLEAN jjCONTENT(leftv res, leftv v)
2397	{
2398	poly p=(poly)v->CopyD();
2399	if (p!=NULL) pCleardenom(p);
2400	res->data = (char *)p;
2401	return FALSE;
2402	}
2403	static BOOLEAN jjCOUNT_N(leftv res, leftv v)
2404	{
2405	res->data = (char *)nSize((number)v->Data());
2406	return FALSE;
2407	}
2408	static BOOLEAN jjCOUNT_L(leftv res, leftv v)
2409	{
2410	lists l=(lists)v->Data();
2411	res->data = (char *)(l->nr+1);
2412	return FALSE;
2413	}
2414	static BOOLEAN jjCOUNT_M(leftv res, leftv v)
2415	{
2416	matrix m=(matrix)v->Data();
2417	res->data = (char )(MATROWS(m)MATCOLS(m));
2418	return FALSE;
2419	}
2420	static BOOLEAN jjCOUNT_IV(leftv res, leftv v)
2421	{
2422	res->data = (char )((intvec)(v->Data()))->length();
2423	return FALSE;
2424	}
2425	static BOOLEAN jjDEG(leftv res, leftv v)
2426	{
2427	int dummy;
2428	poly p=(poly)v->Data();
2429	if (p!=NULL) res->data = (char *)pLDeg(p,&dummy);
2430	else res->data=(char *)-1;
2431	return FALSE;
2432	}
2433	static BOOLEAN jjDEGREE(leftv res, leftv v)
2434	{
2435	assumeStdFlag(v);
2436	scDegree((ideal)v->Data(),currQuotient);
2437	return FALSE;
2438	}
2439	static BOOLEAN jjDEFINED(leftv res, leftv v)
2440	{
2441	if ((v->rtyp==IDHDL)
2442	&& ((myynest==IDLEV((idhdl)v->data))\|\|(0==IDLEV((idhdl)v->data))))
2443	{
2444	res->data=(void *)(IDLEV((idhdl)v->data)+1);
2445	}
2446	else if (v->rtyp!=0) res->data=(void *)(-1);
2447	return FALSE;
2448	}
2449	#ifdef HAVE_FACTORY
2450	static BOOLEAN jjDET(leftv res, leftv v)
2451	{
2452	int i,j;
2453	matrix m=(matrix)v->Data();
2454	if (currRing->parameter==NULL)
2455	{
2456	for(i=m->rows();i>0;i--)
2457	{
2458	for(j=m->cols();j>0;j--)
2459	{
2460	if((MATELEM(m,i,j)!=NULL)
2461	&& (!pIsConstant(MATELEM(m,i,j))))
2462	{
2463	goto nonconst;
2464	}
2465	}
2466	}
2467	res->data = (char *)singclap_det(m);
2468	return FALSE;
2469	}
2470	nonconst:
2471	// res->data = (char *)mpDet(m);
2472	// poly p = mpDetBareiss(m);
2473	ideal I=idMatrix2Module(m);
2474	poly p=smCallDet(I);
2475	idDelete(&I);
2476	#ifdef PDEBUG
2477	poly old = mpDet(m);
2478	if (!pEqual(p,old))
2479	{
2480	WerrorS("error in mpDetBareiss");
2481	}
2482	#endif
2483	res ->data = (char *)p;
2484	return FALSE;
2485	}
2486	static BOOLEAN jjDET_I(leftv res, leftv v)
2487	{
2488	intvec * m=(intvec*)v->Data();
2489	int i,j;
2490	i=m->rows();j=m->cols();
2491	if(i==j)
2492	res->data = (char *)singclap_det_i(m);
2493	else
2494	{
2495	Werror("det of %d x %d intmat",i,j);
2496	return TRUE;
2497	}
2498	return FALSE;
2499	}
2500	static BOOLEAN jjDET_S(leftv res, leftv v)
2501	{
2502	ideal I=(ideal)v->Data();
2503	poly p=smCallDet(I);
2504	res->data = (char *)p;
2505	return FALSE;
2506	}
2507	#endif
2508	static BOOLEAN jjDIM(leftv res, leftv v)
2509	{
2510	assumeStdFlag(v);
2511	res->data = (char *)scDimInt((ideal)(v->Data()),currQuotient);
2512	return FALSE;
2513	}
2514	static BOOLEAN jjDUMP(leftv res, leftv v)
2515	{
2516	si_link l = (si_link)v->Data();
2517	if (slDump(l))
2518	{
2519	const char *s;
2520	if ((l!=NULL)&&(l->name!=NULL)) s=l->name;
2521	else s=sNoName;
2522	Werror("cannot dump to `%s`",s);
2523	return TRUE;
2524	}
2525	else
2526	return FALSE;
2527	}
2528	static BOOLEAN jjE(leftv res, leftv v)
2529	{
2530	res->data = (char *)pOne();
2531	pSetComp((poly)res->data,(int)v->Data());
2532	return FALSE;
2533	}
2534	#ifdef HAVE_FACTORY
2535	static BOOLEAN jjFACSTD(leftv res, leftv v)
2536	{
2537	res->data=(void *)kStdfac((ideal)v->Data(),NULL,testHomog,NULL);
2538	setFlag(res,FLAG_STD);
2539	return FALSE;
2540	}
2541	#endif
2542	static BOOLEAN jjGETDUMP(leftv res, leftv v)
2543	{
2544	si_link l = (si_link)v->Data();
2545	if (slGetDump(l))
2546	{
2547	const char *s;
2548	if ((l!=NULL)&&(l->name!=NULL)) s=l->name;
2549	else s=sNoName;
2550	Werror("cannot get dump from `%s`",s);
2551	return TRUE;
2552	}
2553	else
2554	return FALSE;
2555	}
2556	static BOOLEAN jjHIGHCORNER(leftv res, leftv v)
2557	{
2558	assumeStdFlag(v);
2559	ideal I=(ideal)v->Data();
2560	res->data=(void *)iiHighCorner(I,0);
2561	return FALSE;
2562	}
2563	static BOOLEAN jjHIGHCORNER_M(leftv res, leftv v)
2564	{
2565	assumeStdFlag(v);
2566	intvec w=(intvec)atGet(v,"isHomog");
2567	BOOLEAN delete_w=FALSE;
2568	ideal I=(ideal)v->Data();
2569	int i;
2570	poly p=NULL,po=NULL;
2571	int rk=idRankFreeModule(I);
2572	if (w==NULL)
2573	{
2574	w = new intvec(rk);
2575	delete_w=TRUE;
2576	}
2577	for(i=rk;i>0;i--)
2578	{
2579	p=iiHighCorner(I,i);
2580	if (p==NULL)
2581	{
2582	Werror("module must be zero-dimensional");
2583	if (delete_w) delete w;
2584	return TRUE;
2585	}
2586	if (po==NULL)
2587	{
2588	po=p;
2589	}
2590	else
2591	{
2592	// now po!=NULL, p!=NULL
2593	int d=(pFDeg(po)-(w)[pGetComp(po)-1] - pFDeg(p)+(w)[i-1]);
2594	if (d==0)
2595	d=pComp0(po,p);
2596	if (d > 0)
2597	{
2598	pDelete(&p);
2599	}
2600	else // (d < 0)
2601	{
2602	pDelete(&po); po=p;
2603	}
2604	}
2605	}
2606	if (delete_w) delete w;
2607	res->data=(void *)po;
2608	return FALSE;
2609	}
2610	static BOOLEAN jjHILBERT(leftv res, leftv v)
2611	{
2612	assumeStdFlag(v);
2613	intvec module_w=(intvec)atGet(v,"isHomog");
2614	//scHilbertPoly((ideal)v->Data(),currQuotient);
2615	hLookSeries((ideal)v->Data(),module_w,currQuotient);
2616	return FALSE;
2617	}
2618	static BOOLEAN jjHILBERT_IV(leftv res, leftv v)
2619	{
2620	res->data=(void )hSecondSeries((intvec )v->Data());
2621	return FALSE;
2622	}
2623	static BOOLEAN jjHOMOG1(leftv res, leftv v)
2624	{
2625	intvec *w;
2626	res->data=(void *)idHomModule((ideal)v->Data(),currQuotient,&w);
2627	if ((v->rtyp==IDHDL)&&(w!=NULL))
2628	atSet((idhdl)v->data,mstrdup("isHomog"),w,INTVEC_CMD);
2629	return FALSE;
2630	}
2631	static BOOLEAN jjIDEAL_Ma(leftv res, leftv v)
2632	{
2633	matrix mat=(matrix)v->CopyD();
2634	IDELEMS((ideal)mat)=MATCOLS(mat)*MATROWS(mat);
2635	MATROWS(mat)=1;
2636	mat->rank=1;
2637	res->data=(char *)mat;
2638	return FALSE;
2639	}
2640	static BOOLEAN jjIDEAL_Map(leftv res, leftv v)
2641	{
2642	map m=(map)v->CopyD();
2643	FreeL((ADDRESS)m->preimage);
2644	m->preimage=NULL;
2645	ideal I=(ideal)m;
2646	I->rank=1;
2647	res->data=(char *)I;
2648	return FALSE;
2649	}
2650	static BOOLEAN jjIDEAL_R(leftv res, leftv v)
2651	{
2652	if (currRing!=NULL)
2653	{
2654	ring q=(ring)v->Data();
2655	if (rEqual(currRing, q, 0))
2656	{
2657	if (q->qideal==NULL)
2658	res->data=(char *)idInit(1,1);
2659	else
2660	res->data=(char *)idCopy(q->qideal);
2661	return FALSE;
2662	}
2663	}
2664	WerrorS("can only get ideal from identical qring");
2665	return TRUE;
2666	}
2667	static BOOLEAN jjIm2Iv(leftv res, leftv v)
2668	{
2669	intvec iv = (intvec )v->CopyD();
2670	iv->makeVector();
2671	res->data = iv;
2672	return FALSE;
2673	}
2674	static BOOLEAN jjINDEPSET(leftv res, leftv v)
2675	{
2676	assumeStdFlag(v);
2677	res->data=(void *)scIndIntvec((ideal)(v->Data()),currQuotient);
2678	return FALSE;
2679	}
2680	static BOOLEAN jjINTERRED(leftv res, leftv v)
2681	{
2682	ideal result=kInterRed((ideal)(v->Data()),currQuotient);
2683	//if (result==NULL) return TRUE;
2684	idSkipZeroes(result);
2685	res->data = result;
2686	return FALSE;
2687	}
2688	static BOOLEAN jjIS_RINGVAR_P(leftv res, leftv v)
2689	{
2690	res->data = (char *)pVar((poly)v->Data());
2691	return FALSE;
2692	}
2693	static BOOLEAN jjIS_RINGVAR_S(leftv res, leftv v)
2694	{
2695	res->data = (char )(rIsRingVar((char )v->Data())+1);
2696	return FALSE;
2697	}
2698	static BOOLEAN jjIS_RINGVAR0(leftv res, leftv v)
2699	{
2700	res->data = (char *)0;
2701	return FALSE;
2702	}
2703	static BOOLEAN jjJACOB_P(leftv res, leftv v)
2704	{
2705	ideal i=idInit(pVariables,1);
2706	int k;
2707	for (k=pVariables;k>0;k--)
2708	{
2709	i->m[k-1]=pDiff(pCopy((poly)(v->Data())),k);
2710	}
2711	res->data = (char *)i;
2712	return FALSE;
2713	}
2714	static BOOLEAN jjKBASE(leftv res, leftv v)
2715	{
2716	assumeStdFlag(v);
2717	res->data = (char *)scKBase(-1,(ideal)(v->Data()),currQuotient);
2718	return FALSE;
2719	}
2720	static BOOLEAN jjKLAMMER_LIB(leftv res, leftv u)
2721	{
2722	char * s=(char *)u->Data();
2723	return iiLibCmd(s);
2724	}
2725	#ifdef MDEBUG
2726	static BOOLEAN jjpHead(leftv res, leftv v)
2727	{
2728	res->data=(char *)pHead((poly)v->Data());
2729	return FALSE;
2730	}
2731	#endif
2732	static BOOLEAN jjL2R(leftv res, leftv v)
2733	{
2734	res->data=(char *)syConvList((lists)v->Data());
2735	if (res->data != NULL)
2736	return FALSE;
2737	else
2738	return TRUE;
2739	}
2740	static BOOLEAN jjLEADCOEF(leftv res, leftv v)
2741	{
2742	poly p=(poly)v->Data();
2743	if (p==NULL)
2744	{
2745	res->data=(char *)nInit(0);
2746	}
2747	else
2748	{
2749	res->data=(char *)nCopy(pGetCoeff(p));
2750	}
2751	return FALSE;
2752	}
2753	static BOOLEAN jjLEADEXP(leftv res, leftv v)
2754	{
2755	poly p=(poly)v->Data();
2756	int s=pVariables;
2757	if (v->Typ()==VECTOR_CMD) s++;
2758	intvec *iv=new intvec(s);
2759	if (p!=NULL)
2760	{
2761	for(int i = pVariables;i;i--)
2762	{
2763	(*iv)[i-1]=pGetExp(p,i);
2764	}
2765	if (s!=pVariables)
2766	(*iv)[pVariables]=pGetComp(p);
2767	}
2768	res->data=(char *)iv;
2769	return FALSE;
2770	}
2771	static BOOLEAN jjLEADMONOM(leftv res, leftv v)
2772	{
2773	poly p=(poly)v->Data();
2774	if (p == NULL)
2775	{
2776	res->data = (char*) NULL;
2777	}
2778	else
2779	{
2780	poly lm = pCopy1(p);
2781	pSetCoeff(lm, nInit(1));
2782	res->data = (char*) lm;
2783	}
2784	return FALSE;
2785	}
2786	static BOOLEAN jjLIB(leftv res, leftv v)
2787	{
2788	return iiLibCmd((char *)v->CopyD());
2789	}
2790	static BOOLEAN jjMEMORY(leftv res, leftv v)
2791	{
2792	#ifdef MM_COUNT
2793	switch(((int)v->Data()))
2794	{
2795	case 0:
2796	res->data = (char *)mmMemUsed();
2797	break;
2798	case 1:
2799	res->data = (char *)mmMemAlloc();
2800	break;
2801	#ifdef HAVE_SBRK
2802	case 2:
2803	res->data = (char *)mmMemPhysical();
2804	break;
2805	#endif
2806	default:
2807	#ifndef MAKE_DISRIBUTION
2808	mmPrintStat();
2809	#endif
2810	res->data = (char *)0;
2811	}
2812	return FALSE;
2813	#else
2814	res->data = (char *)0;
2815	return FALSE;
2816	#endif
2817	}
2818	static BOOLEAN jjMONITOR1(leftv res, leftv v)
2819	{
2820	monitor((char *)(v->Data()),PROT_I);
2821	return FALSE;
2822	}
2823	static BOOLEAN jjMSTD(leftv res, leftv v)
2824	{
2825	res->data=(void *)min_std((ideal)v->Data(),currQuotient,testHomog,NULL);
2826	return FALSE;
2827	}
2828	static BOOLEAN jjMULT(leftv res, leftv v)
2829	{
2830	assumeStdFlag(v);
2831	res->data = (char *)scMultInt((ideal)(v->Data()),currQuotient);
2832	return FALSE;
2833	}
2834	static BOOLEAN jjNAMEOF(leftv res, leftv v)
2835	{
2836	res->data = (char *)v->name;
2837	if (res->data==NULL) res->data=mstrdup("");
2838	v->name=NULL;
2839	return FALSE;
2840	}
2841	static BOOLEAN jjNAMES(leftv res, leftv v)
2842	{
2843	res->data=ipNameList(((ring)v->Data())->idroot);
2844	return FALSE;
2845	}
2846	static BOOLEAN jjNVARS(leftv res, leftv v)
2847	{
2848	res->data = (char *)(((ring)(v->Data()))->N);
2849	return FALSE;
2850	}
2851	static BOOLEAN jjOpenClose(leftv res, leftv v)
2852	{
2853	si_link l=(si_link)v->Data();
2854	if (iiOp==OPEN_CMD) return slOpen(l, SI_LINK_OPEN);
2855	else return slClose(l);
2856	}
2857	static BOOLEAN jjORD(leftv res, leftv v)
2858	{
2859	poly p=(poly)v->Data();
2860	res->data=(char *)( p==NULL ? -1 : pFDeg(p) );
2861	return FALSE;
2862	}
2863	static BOOLEAN jjPAR1(leftv res, leftv v)
2864	{
2865	int i=(int)v->Data();
2866	int p=0;
2867	p=rPar(currRing);
2868	if ((0<i) && (i<=p))
2869	{
2870	res->data=(char *)nPar(i);
2871	}
2872	else
2873	{
2874	Werror("par number %d out of range 1..%d",i,p);
2875	return TRUE;
2876	}
2877	return FALSE;
2878	}
2879	static BOOLEAN jjPARDEG(leftv res, leftv v)
2880	{
2881	res->data = (char *)nParDeg((number)v->Data());
2882	return FALSE;
2883	}
2884	static BOOLEAN jjPARSTR1(leftv res, leftv v)
2885	{
2886	if (currRing==NULL)
2887	{
2888	WerrorS("no ring active");
2889	return TRUE;
2890	}
2891	int i=(int)v->Data();
2892	int p=0;
2893	if ((0<i) && (currRing->parameter!=NULL) && (i<=(p=rPar(currRing))))
2894	res->data=mstrdup(currRing->parameter[i-1]);
2895	else
2896	{
2897	Werror("par number %d out of range 1..%d",i,p);
2898	return TRUE;
2899	}
2900	return FALSE;
2901	}
2902	static BOOLEAN jjP2I(leftv res, leftv v)
2903	{
2904	poly p=(poly)v->Data();
2905	if (p==NULL) { /res->data=(char )0;*/ return FALSE; }
2906	if ((pNext(p)!=NULL)\|\| (!pIsConstant(p)))
2907	{
2908	WerrorS("poly must be constant");
2909	return TRUE;
2910	}
2911	res->data = (char *)nInt(pGetCoeff(p));
2912	return FALSE;
2913	}
2914	static BOOLEAN jjPRIME(leftv res, leftv v)
2915	{
2916	int i = IsPrime((int)(v->Data()));
2917	res->data = (char *)(i > 1 ? i : 2);
2918	return FALSE;
2919	}
2920	static BOOLEAN jjP2N(leftv res, leftv v)
2921	{
2922	number n;
2923	poly p;
2924	if (((p=(poly)v->Data())!=NULL)
2925	&& (pIsConstant(p)))
2926	{
2927	n=nCopy(pGetCoeff(p));
2928	}
2929	else
2930	{
2931	n=nInit(0);
2932	}
2933	res->data = (char *)n;
2934	return FALSE;
2935	}
2936	static BOOLEAN jjRESERVEDNAME(leftv res, leftv v)
2937	{
2938	char s= (char )v->Data();
2939	int i = 1;
2940	int l = strlen(s);
2941	while (cmds[i].tokval!=0)
2942	{
2943	if (strcmp(s, cmds[i].name) == 0)
2944	{
2945	res->data = (char *)1;
2946	return FALSE;
2947	}
2948	i++;
2949	}
2950	//res->data = (char *)0;
2951	return FALSE;
2952	}
2953	static BOOLEAN jjREAD(leftv res, leftv v)
2954	{
2955	return jjREAD2(res,v,NULL);
2956	}
2957	static BOOLEAN jjREGULARITY(leftv res, leftv v)
2958	{
2959	res->data = (char *)iiRegularity((lists)v->Data());
2960	return FALSE;
2961	}
2962	static BOOLEAN jjROWS(leftv res, leftv v)
2963	{
2964	ideal i = (ideal)v->Data();
2965	res->data = (char *)i->rank;
2966	return FALSE;
2967	}
2968	static BOOLEAN jjROWS_IV(leftv res, leftv v)
2969	{
2970	res->data = (char )((intvec)(v->Data()))->rows();
2971	return FALSE;
2972	}
2973	static BOOLEAN jjRPAR(leftv res, leftv v)
2974	{
2975	res->data = (char *)rPar(((ring)v->Data()));
2976	return FALSE;
2977	}
2978	static BOOLEAN jjSTD(leftv res, leftv v)
2979	{
2980	ideal result;
2981	intvec w=(intvec )atGet(v,"isHomog");
2982	tHomog hom=testHomog;
2983	if (w!=NULL)
2984	{
2985	w=ivCopy(w);
2986	hom=isHomog;
2987	}
2988	//if (hasFlag(v,FLAG_STD))
2989	// result=stdred((ideal)v->Data(),currQuotient,hom,&w);
2990	//else
2991	result=kStd((ideal)(v->Data()),currQuotient,hom,&w);
2992	idSkipZeroes(result);
2993	res->data = (char *)result;
2994	setFlag(res,FLAG_STD);
2995	if (w!=NULL) atSet(res,mstrdup("isHomog"),w,INTVEC_CMD);
2996	return FALSE;
2997	}
2998	static BOOLEAN jjSort_Id(leftv res, leftv v)
2999	{
3000	res->data = (char *)idSort((ideal)v->Data());
3001	return FALSE;
3002	}
3003	static BOOLEAN jjSYZYGY(leftv res, leftv v)
3004	{
3005	intvec *w=NULL;
3006	res->data = (char *)idSyzygies((ideal)v->Data(),currQuotient,testHomog,&w);
3007	if (w!=NULL) delete w;
3008	return FALSE;
3009	}
3010	static BOOLEAN jjTRACE_IV(leftv res, leftv v)
3011	{
3012	res->data = (char )ivTrace((intvec)(v->Data()));
3013	return FALSE;
3014	}
3015	static BOOLEAN jjTRANSP_IV(leftv res, leftv v)
3016	{
3017	res->data = (char )ivTranp((intvec)(v->Data()));
3018	return FALSE;
3019	}
3020	static BOOLEAN jjTYPEOF(leftv res, leftv v)
3021	{
3022	switch ((int)v->data)
3023	{
3024	case INT_CMD: res->data=mstrdup("int"); break;
3025	case POLY_CMD: res->data=mstrdup("poly"); break;
3026	case VECTOR_CMD: res->data=mstrdup("vector"); break;
3027	case STRING_CMD: res->data=mstrdup("string"); break;
3028	case INTVEC_CMD: res->data=mstrdup("intvec"); break;
3029	case IDEAL_CMD: res->data=mstrdup("ideal"); break;
3030	case MATRIX_CMD: res->data=mstrdup("matrix"); break;
3031	case MODUL_CMD: res->data=mstrdup("module"); break;
3032	case MAP_CMD: res->data=mstrdup("map"); break;
3033	case PROC_CMD: res->data=mstrdup("proc"); break;
3034	case RING_CMD: res->data=mstrdup("ring"); break;
3035	case QRING_CMD: res->data=mstrdup("qring"); break;
3036	case INTMAT_CMD: res->data=mstrdup("intmat"); break;
3037	case NUMBER_CMD: res->data=mstrdup("number"); break;
3038	case LIST_CMD: res->data=mstrdup("list"); break;
3039	case PACKAGE_CMD: res->data=mstrdup("package"); break;
3040	case LINK_CMD: res->data=mstrdup("link"); break;
3041	case RESOLUTION_CMD:res->data=mstrdup("resolution");break;
3042	case DEF_CMD:
3043	case NONE: res->data=mstrdup("none"); break;
3044	default: res->data=mstrdup("?unknown type?");
3045	}
3046	return FALSE;
3047	}
3048	static BOOLEAN jjVAR1(leftv res, leftv v)
3049	{
3050	int i=(int)v->Data();
3051	if ((0<i) && (i<=currRing->N))
3052	{
3053	poly p=pOne();
3054	pSetExp(p,i,1);
3055	pSetm(p);
3056	res->data=(char *)p;
3057	}
3058	else
3059	{
3060	Werror("var number %d out of range 1..%d",i,currRing->N);
3061	return TRUE;
3062	}
3063	return FALSE;
3064	}
3065	static BOOLEAN jjVARSTR1(leftv res, leftv v)
3066	{
3067	if (currRing==NULL)
3068	{
3069	WerrorS("no ring active");
3070	return TRUE;
3071	}
3072	int i=(int)v->Data();
3073	if ((0<i) && (i<=currRing->N))
3074	res->data=mstrdup(currRing->names[i-1]);
3075	else
3076	{
3077	Werror("var number %d out of range 1..%d",i,currRing->N);
3078	return TRUE;
3079	}
3080	return FALSE;
3081	}
3082	static BOOLEAN jjVDIM(leftv res, leftv v)
3083	{
3084	assumeStdFlag(v);
3085	res->data = (char *)scMult0Int((ideal)v->Data(),currQuotient);
3086	return FALSE;
3087	}
3088
3089	static BOOLEAN jjLOAD1(leftv res, leftv v)
3090	{
3091	return jjLOAD(res, v);
3092	}
3093
3094	static BOOLEAN jjLOAD(leftv res, leftv v, BOOLEAN autoexport)
3095	{
3096	char * s=mstrdup((char *)v->Data());
3097	char libnamebuf[256];
3098	lib_types LT = type_of_LIB(s, libnamebuf);
3099	BOOLEAN result = TRUE;
3100	#ifdef HAVE_DYNAMIC_LOADING
3101	extern BOOLEAN load_modules(char newlib, char fullpath, BOOLEAN tellerror);
3102	#endif /* HAVE_DYNAMIC_LOADING */
3103
3104	switch(LT)
3105	{
3106	default:
3107	case LT_NONE:
3108	Werror("%s: unknown type", s);
3109	break;
3110
3111	case LT_SINGULAR:
3112	#ifdef HAVE_NAMESPACES
3113	result = iiLibCmd(s, autoexport);
3114	#else
3115	result = iiLibCmd(s);
3116	#endif
3117	break;
3118
3119	case LT_ELF:
3120	#ifdef HAVE_DYNAMIC_LOADING
3121	result = load_modules(s, libnamebuf, autoexport);
3122	#else /* HAVE_DYNAMIC_LOADING */
3123	WerrorS("Dynamic modules are not supported by this version of Singular");
3124	#endif /* HAVE_DYNAMIC_LOADING */
3125	break;
3126
3127	case LT_HPUX:
3128	#ifdef HAVE_DYNAMIC_LOADING
3129	result = load_modules(s, libnamebuf, autoexport);
3130	#else /* HAVE_DYNAMIC_LOADING */
3131	WerrorS("Dynamic modules are not supported by this version of Singular");
3132	#endif /* HAVE_DYNAMIC_LOADING */
3133	break;
3134	}
3135	return result;
3136	}
3137
3138	/=================== operations with 1 arg.: table =================/
3139
3140	#ifdef INIT_BUG
3141	#define XS(A) -((short)A)
3142	#define jjstrlen (proc1)1
3143	#define jjpLength (proc1)2
3144	#define jjidElem (proc1)3
3145	#define jjmpDetBareiss (proc1)4
3146	#define jjidFreeModule (proc1)5
3147	#define jjidVec2Ideal (proc1)6
3148	#define jjrCharStr (proc1)7
3149	#ifndef MDEBUG
3150	#define jjpHead (proc1)8
3151	#endif
3152	#define jjidHead (proc1)9
3153	#define jjidMaxIdeal (proc1)10
3154	#define jjidMinBase (proc1)11
3155	#define jjsyMinBase (proc1)12
3156	#define jjpMaxComp (proc1)13
3157	#define jjmpTrace (proc1)14
3158	#define jjmpTransp (proc1)15
3159	#define jjrOrdStr (proc1)16
3160	#define jjrVarStr (proc1)18
3161	#define jjrParStr (proc1)19
3162	#define jjidMinEmbedding (proc1)20
3163	#define jjBETTI_R (proc1)21
3164	#define jjCOUNT_R (proc1)22
3165	#define jjDIM_R (proc1)23
3166	#define jjMINRES_R (proc1)24
3167	#define jjidTransp (proc1)25
3168
3169	extern struct sValCmd1 dArith1[];
3170	void jjInitTab1()
3171	{
3172	int i=0;
3173	for (;dArith1[i].cmd!=0;i++)
3174	{
3175	if (dArith1[i].res<0)
3176	{
3177	switch ((int)dArith1[i].p)
3178	{
3179	case (int)jjstrlen: dArith1[i].p=(proc1)strlen; break;
3180	case (int)jjpLength: dArith1[i].p=(proc1)pLength; break;
3181	case (int)jjidElem: dArith1[i].p=(proc1)idElem; break;
3182	case (int)jjidVec2Ideal: dArith1[i].p=(proc1)idVec2Ideal; break;
3183	#ifndef HAVE_FACTORY
3184	case (int)jjmpDetBareiss: dArith1[i].p=(proc1)mpDetBareiss; break;
3185	#endif
3186	case (int)jjidFreeModule: dArith1[i].p=(proc1)idFreeModule; break;
3187	case (int)jjrCharStr: dArith1[i].p=(proc1)rCharStr; break;
3188	#ifndef MDEBUG
3189	case (int)jjpHead: dArith1[i].p=(proc1)pHeadProc; break;
3190	#endif
3191	case (int)jjidHead: dArith1[i].p=(proc1)idHead; break;
3192	case (int)jjidMaxIdeal: dArith1[i].p=(proc1)idMaxIdeal; break;
3193	case (int)jjidMinBase: dArith1[i].p=(proc1)idMinBase; break;
3194	case (int)jjsyMinBase: dArith1[i].p=(proc1)syMinBase; break;
3195	case (int)jjpMaxComp: dArith1[i].p=(proc1)pMaxComp; break;
3196	case (int)jjmpTrace: dArith1[i].p=(proc1)mpTrace; break;
3197	case (int)jjmpTransp: dArith1[i].p=(proc1)mpTransp; break;
3198	case (int)jjrOrdStr: dArith1[i].p=(proc1)rOrdStr; break;
3199	case (int)jjrVarStr: dArith1[i].p=(proc1)rVarStr; break;
3200	case (int)jjrParStr: dArith1[i].p=(proc1)rParStr; break;
3201	case (int)jjidMinEmbedding: dArith1[i].p=(proc1)idMinEmbedding; break;
3202	case (int)jjBETTI_R: dArith1[i].p=(proc1)syBettiOfComputation; break;
3203	case (int)jjCOUNT_R: dArith1[i].p=(proc1)syLength; break;
3204	case (int)jjDIM_R: dArith1[i].p=(proc1)syDim; break;
3205	case (int)jjMINRES_R: dArith1[i].p=(proc1)syMinimize; break;
3206	case (int)jjidTransp: dArith1[i].p=(proc1)idTransp; break;
3207	#ifdef GENTABLE
3208	default: Werror("missing proc1-definition for %d",(int)dArith1[i].p);
3209	#endif
3210	}
3211	}
3212	}
3213	}
3214	#else
3215	#if defined(PROC_BUG)
3216	#define XS(A) A
3217	static BOOLEAN jjstrlen(leftv res, leftv v)
3218	{
3219	res->data = (char )strlen((char )v->Data());
3220	return FALSE;
3221	}
3222	static BOOLEAN jjpLength(leftv res, leftv v)
3223	{
3224	res->data = (char *)pLength((poly)v->Data());
3225	return FALSE;
3226	}
3227	static BOOLEAN jjidElem(leftv res, leftv v)
3228	{
3229	res->data = (char *)idElem((ideal)v->Data());
3230	return FALSE;
3231	}
3232	static BOOLEAN jjmpDetBareiss(leftv res, leftv v)
3233	{
3234	res->data = (char *)mpDetBareiss((matrix)v->Data());
3235	return FALSE;
3236	}
3237	static BOOLEAN jjidFreeModule(leftv res, leftv v)
3238	{
3239	res->data = (char *)idFreeModule((int)v->Data());
3240	return FALSE;
3241	}
3242	static BOOLEAN jjidVec2Ideal(leftv res, leftv v)
3243	{
3244	res->data = (char *)idVec2Ideal((poly)v->Data());
3245	return FALSE;
3246	}
3247	static BOOLEAN jjrCharStr(leftv res, leftv v)
3248	{
3249	res->data = rCharStr((ring)v->Data());
3250	return FALSE;
3251	}
3252	#ifndef MDEBUG
3253	static BOOLEAN jjpHead(leftv res, leftv v)
3254	{
3255	res->data = (char *)pHead((poly)v->Data());
3256	return FALSE;
3257	}
3258	#endif
3259	static BOOLEAN jjidHead(leftv res, leftv v)
3260	{
3261	res->data = (char *)idHead((ideal)v->Data());
3262	return FALSE;
3263	}
3264	static BOOLEAN jjidMaxIdeal(leftv res, leftv v)
3265	{
3266	res->data = (char *)idMaxIdeal((int)v->Data());
3267	return FALSE;
3268	}
3269	static BOOLEAN jjidMinBase(leftv res, leftv v)
3270	{
3271	res->data = (char *)idMinBase((ideal)v->Data());
3272	return FALSE;
3273	}
3274	static BOOLEAN jjsyMinBase(leftv res, leftv v)
3275	{
3276	res->data = (char *)syMinBase((ideal)v->Data());
3277	return FALSE;
3278	}
3279	static BOOLEAN jjpMaxComp(leftv res, leftv v)
3280	{
3281	res->data = (char *)pMaxComp((poly)v->Data());
3282	return FALSE;
3283	}
3284	static BOOLEAN jjmpTrace(leftv res, leftv v)
3285	{
3286	res->data = (char *)mpTrace((matrix)v->Data());
3287	return FALSE;
3288	}
3289	static BOOLEAN jjmpTransp(leftv res, leftv v)
3290	{
3291	res->data = (char *)mpTransp((matrix)v->Data());
3292	return FALSE;
3293	}
3294	static BOOLEAN jjrOrdStr(leftv res, leftv v)
3295	{
3296	res->data = rOrdStr((ring)v->Data());
3297	return FALSE;
3298	}
3299	static BOOLEAN jjrVarStr(leftv res, leftv v)
3300	{
3301	res->data = rVarStr((ring)v->Data());
3302	return FALSE;
3303	}
3304	static BOOLEAN jjrParStr(leftv res, leftv v)
3305	{
3306	res->data = rParStr((ring)v->Data());
3307	return FALSE;
3308	}
3309	static BOOLEAN jjidMinEmbedding(leftv res, leftv v)
3310	{
3311	res->data = (char *)idMinEmbedding((ideal)v->Data());
3312	return FALSE;
3313	}
3314	static BOOLEAN jjBETTI_R(leftv res, leftv v)
3315	{
3316	res->data=(char *)syBettiOfComputation((syStrategy)v->Data());
3317	return FALSE;
3318	}
3319	static BOOLEAN jjCOUNT_R(leftv res, leftv v)
3320	{
3321	res->data=(char *)syLength((syStrategy)v->Data());
3322	return FALSE;
3323	}
3324	static BOOLEAN jjDIM_R(leftv res, leftv v)
3325	{
3326	res->data = (char *)syDim((syStrategy)v->Data());
3327	return FALSE;
3328	}
3329	static BOOLEAN jjMINRES_R(leftv res, leftv v)
3330	{
3331	res->data=(char *)syMinimize((syStrategy)v->Data());
3332	return FALSE;
3333	}
3334	static BOOLEAN jjidTransp(leftv res, leftv v)
3335	{
3336	res->data = (char *)idTransp((ideal)v->Data());
3337	return FALSE;
3338	}
3339	#else
3340	#define XS(A) -((short)A)
3341	#define jjstrlen (proc1)strlen
3342	#define jjpLength (proc1)pLength
3343	#define jjidElem (proc1)idElem
3344	#define jjmpDetBareiss (proc1)mpDetBareiss
3345	#define jjidFreeModule (proc1)idFreeModule
3346	#define jjidVec2Ideal (proc1)idVec2Ideal
3347	#define jjrCharStr (proc1)rCharStr
3348	#ifndef MDEBUG
3349	#define jjpHead (proc1)pHead
3350	#endif
3351	#define jjidHead (proc1)idHead
3352	#define jjidMaxIdeal (proc1)idMaxIdeal
3353	#define jjidMinBase (proc1)idMinBase
3354	#define jjsyMinBase (proc1)syMinBase
3355	#define jjpMaxComp (proc1)pMaxComp
3356	#define jjmpTrace (proc1)mpTrace
3357	#define jjmpTransp (proc1)mpTransp
3358	#define jjrOrdStr (proc1)rOrdStr
3359	#define jjrVarStr (proc1)rVarStr
3360	#define jjrParStr (proc1)rParStr
3361	#define jjidMinEmbedding (proc1)idMinEmbedding
3362	#define jjBETTI_R (proc1)syBettiOfComputation
3363	#define jjCOUNT_R (proc1)syLength
3364	#define jjDIM_R (proc1)syDim
3365	#define jjMINRES_R (proc1)syMinimize
3366	#define jjidTransp (proc1)idTransp
3367	#endif
3368	#endif
3369	BOOLEAN jjnInt(leftv res, leftv u)
3370	{
3371	number n=(number)u->CopyD();
3372	res->data=(char *)nInt(n);
3373	nDelete(&n);
3374	return FALSE;
3375	}
3376	#define s short
3377	struct sValCmd1 dArith1[]=
3378	{
3379	// operations:
3380	// proc cmd res arg
3381	// {jjPLUSPLUS, PLUSPLUS, INT_CMD, INT_CMD }
3382	//,{jjMINUSMINUS, MINUSMINUS, INT_CMD, INT_CMD }
3383	{jjPLUSPLUS, PLUSPLUS, NONE, IDHDL }
3384	,{jjPLUSPLUS, MINUSMINUS, NONE, IDHDL }
3385	,{jjUMINUS_I, '-', INT_CMD, INT_CMD }
3386	,{jjUMINUS_N, '-', NUMBER_CMD, NUMBER_CMD }
3387	,{jjUMINUS_P, '-', POLY_CMD, POLY_CMD }
3388	,{jjUMINUS_P, '-', VECTOR_CMD, VECTOR_CMD }
3389	,{jjUMINUS_MA, '-', MATRIX_CMD, MATRIX_CMD }
3390	,{jjUMINUS_IV, '-', INTVEC_CMD, INTVEC_CMD }
3391	,{jjUMINUS_IV, '-', INTMAT_CMD, INTMAT_CMD }
3392	,{jjPROC1, '(', ANY_TYPE/set by p/,PROC_CMD }
3393	,{jjKLAMMER_LIB,'(', NONE, STRING_CMD }
3394	// and the procedures with 1 argument:
3395	,{atATTRIB1, ATTRIB_CMD, NONE, DEF_CMD }
3396	,{jjBAREISS_IM, BAREISS_CMD, INTMAT_CMD, INTMAT_CMD }
3397	,{jjBAREISS, BAREISS_CMD, LIST_CMD, MODUL_CMD }
3398	,{jjBETTI, BETTI_CMD, INTMAT_CMD, LIST_CMD }
3399	,{jjBETTI_R, BETTI_CMD, XS(INTMAT_CMD), RESOLUTION_CMD }
3400	,{jjCHAR, CHARACTERISTIC_CMD, INT_CMD, RING_CMD }
3401	,{jjCHAR, CHARACTERISTIC_CMD, INT_CMD, QRING_CMD }
3402	#ifdef HAVE_FACTORY
3403	,{jjCHARSERIES, CHAR_SERIES_CMD, MATRIX_CMD, IDEAL_CMD }
3404	#else
3405	,{jjWRONG, CHAR_SERIES_CMD, MATRIX_CMD, IDEAL_CMD }
3406	#endif
3407	,{jjrCharStr, CHARSTR_CMD, XS(STRING_CMD), RING_CMD }
3408	,{jjrCharStr, CHARSTR_CMD, XS(STRING_CMD), QRING_CMD }
3409	,{jjOpenClose, CLOSE_CMD, NONE, LINK_CMD }
3410	,{jjWRONG, COLS_CMD, 0, VECTOR_CMD }
3411	,{jjCOLS, COLS_CMD, INT_CMD, MATRIX_CMD }
3412	,{jjCOLS, COLS_CMD, INT_CMD, IDEAL_CMD }
3413	,{jjCOLS, COLS_CMD, INT_CMD, MODUL_CMD }
3414	,{jjCOLS_IV, COLS_CMD, INT_CMD, INTMAT_CMD }
3415	,{jjWRONG, COLS_CMD, 0, INTVEC_CMD }
3416	,{jjCONTENT, CONTENT_CMD, POLY_CMD, POLY_CMD }
3417	,{jjCONTENT, CONTENT_CMD, VECTOR_CMD, VECTOR_CMD }
3418	,{jjCOUNT_N, COUNT_CMD, INT_CMD, NUMBER_CMD }
3419	,{jjCOUNT_R, COUNT_CMD, XS(INT_CMD), RESOLUTION_CMD }
3420	,{jjstrlen, COUNT_CMD, XS(INT_CMD), STRING_CMD }
3421	,{jjpLength, COUNT_CMD, XS(INT_CMD), POLY_CMD }
3422	,{jjpLength, COUNT_CMD, XS(INT_CMD), VECTOR_CMD }
3423	,{jjidElem, COUNT_CMD, XS(INT_CMD), IDEAL_CMD }
3424	,{jjidElem, COUNT_CMD, XS(INT_CMD), MODUL_CMD }
3425	,{jjCOUNT_M, COUNT_CMD, INT_CMD, MATRIX_CMD }
3426	,{jjCOUNT_IV, COUNT_CMD, INT_CMD, INTVEC_CMD }
3427	,{jjCOUNT_IV, COUNT_CMD, INT_CMD, INTMAT_CMD }
3428	,{jjCOUNT_L, COUNT_CMD, INT_CMD, LIST_CMD }
3429	,{jjNULL, DEF_CMD, DEF_CMD, INT_CMD }
3430	,{jjWRONG, DEF_CMD, 0, ANY_TYPE }
3431	,{jjDEG, DEG_CMD, INT_CMD, POLY_CMD }
3432	,{jjDEG, DEG_CMD, INT_CMD, VECTOR_CMD }
3433	,{jjDEGREE, DEGREE_CMD, NONE, IDEAL_CMD }
3434	,{jjDEGREE, DEGREE_CMD, NONE, MODUL_CMD }
3435	,{jjDEFINED, DEFINED_CMD, INT_CMD, DEF_CMD }
3436	#ifdef HAVE_FACTORY
3437	,{jjDET_I, DET_CMD, INT_CMD, INTMAT_CMD }
3438	,{jjDET, DET_CMD, POLY_CMD, MATRIX_CMD }
3439	,{jjDET_S, DET_CMD, POLY_CMD, MODUL_CMD }
3440	#else
3441	,{jjWRONG, DET_CMD, INT_CMD, INTMAT_CMD }
3442	,{jjmpDetBareiss,DET_CMD, XS(POLY_CMD), MATRIX_CMD }
3443	#endif
3444	,{jjDIM, DIM_CMD, INT_CMD, IDEAL_CMD }
3445	,{jjDIM, DIM_CMD, INT_CMD, MODUL_CMD }
3446	,{jjDIM_R, DIM_CMD, XS(INT_CMD), RESOLUTION_CMD }
3447	,{jjDUMP, DUMP_CMD, NONE, LINK_CMD }
3448	,{jjE, E_CMD, VECTOR_CMD, INT_CMD }
3449	,{jjERROR, ERROR_CMD, NONE, STRING_CMD }
3450	#ifdef HAVE_FACTORY
3451	,{jjFAC_P, FAC_CMD, LIST_CMD, POLY_CMD }
3452	#else
3453	,{jjWRONG, FAC_CMD, LIST_CMD, POLY_CMD }
3454	#endif
3455	#ifdef HAVE_FGLM
3456	,{findUniProc, FINDUNI_CMD, IDEAL_CMD, IDEAL_CMD}
3457	#else
3458	,{jjWRONG, FINDUNI_CMD, IDEAL_CMD, IDEAL_CMD}
3459	#endif
3460	,{jjidFreeModule,FREEMODULE_CMD, XS(MODUL_CMD), INT_CMD }
3461	#ifdef HAVE_FACTORY
3462	,{jjFACSTD, FACSTD_CMD, LIST_CMD, IDEAL_CMD }
3463	#else
3464	,{jjWRONG, FACSTD_CMD, LIST_CMD, IDEAL_CMD }
3465	#endif
3466	,{jjGETDUMP, GETDUMP_CMD, NONE, LINK_CMD }
3467	,{jjHIGHCORNER, HIGHCORNER_CMD, POLY_CMD, IDEAL_CMD }
3468	,{jjHIGHCORNER_M, HIGHCORNER_CMD,VECTOR_CMD, MODUL_CMD }
3469	,{jjHILBERT, HILBERT_CMD, NONE, IDEAL_CMD }
3470	,{jjHILBERT, HILBERT_CMD, NONE, MODUL_CMD }
3471	,{jjHILBERT_IV, HILBERT_CMD, INTVEC_CMD, INTVEC_CMD }
3472	,{jjHOMOG1, HOMOG_CMD, INT_CMD, IDEAL_CMD }
3473	,{jjHOMOG1, HOMOG_CMD, INT_CMD, MODUL_CMD }
3474	,{jjidVec2Ideal,IDEAL_CMD, XS(IDEAL_CMD), VECTOR_CMD }
3475	,{jjIDEAL_Ma, IDEAL_CMD, IDEAL_CMD, MATRIX_CMD }
3476	,{jjIDEAL_R, IDEAL_CMD, IDEAL_CMD, QRING_CMD }
3477	,{jjIDEAL_R, IDEAL_CMD, IDEAL_CMD, RING_CMD }
3478	,{jjIDEAL_Map, IDEAL_CMD, IDEAL_CMD, MAP_CMD }
3479	,{jjDUMMY, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD }
3480	,{jjINDEPSET, INDEPSET_CMD, INTVEC_CMD, IDEAL_CMD }
3481	,{jjDUMMY, INT_CMD, INT_CMD, INT_CMD }
3482	,{jjnInt, INT_CMD, INT_CMD, NUMBER_CMD }
3483	,{jjP2I, INT_CMD, INT_CMD, POLY_CMD }
3484	,{jjINTERRED, INTERRED_CMD, IDEAL_CMD, IDEAL_CMD }
3485	,{jjINTERRED, INTERRED_CMD, MODUL_CMD, MODUL_CMD }
3486	,{jjDUMMY, INTMAT_CMD, INTMAT_CMD, INTMAT_CMD }
3487	,{jjIm2Iv, INTVEC_CMD, INTVEC_CMD, INTMAT_CMD }
3488	,{jjDUMMY, INTVEC_CMD, INTVEC_CMD, INTVEC_CMD }
3489	,{jjIS_RINGVAR_P, IS_RINGVAR, INT_CMD, POLY_CMD }
3490	,{jjIS_RINGVAR_S, IS_RINGVAR, INT_CMD, STRING_CMD }
3491	,{jjIS_RINGVAR0,IS_RINGVAR, INT_CMD, ANY_TYPE }
3492	,{jjJACOB_P, JACOB_CMD, IDEAL_CMD, POLY_CMD }
3493	,{mpJacobi, JACOB_CMD, MATRIX_CMD, IDEAL_CMD }
3494	,{jjKBASE, KBASE_CMD, IDEAL_CMD, IDEAL_CMD }
3495	,{jjKBASE, KBASE_CMD, MODUL_CMD, MODUL_CMD }
3496	,{atKILLATTR1, KILLATTR_CMD, NONE, IDHDL }
3497	#ifdef MDEBUG
3498	,{jjpHead, LEAD_CMD, POLY_CMD, POLY_CMD }
3499	#else
3500	,{jjpHead, LEAD_CMD, XS(POLY_CMD), POLY_CMD }
3501	#endif
3502	,{jjidHead, LEAD_CMD, XS(IDEAL_CMD), IDEAL_CMD }
3503	#ifdef MDEBUG
3504	,{jjpHead, LEAD_CMD, VECTOR_CMD, VECTOR_CMD }
3505	#else
3506	,{jjpHead, LEAD_CMD, XS(VECTOR_CMD), VECTOR_CMD }
3507	#endif
3508	,{jjidHead, LEAD_CMD, XS(MODUL_CMD), MODUL_CMD }
3509	,{jjLEADCOEF, LEADCOEF_CMD, NUMBER_CMD, POLY_CMD }
3510	,{jjLEADCOEF, LEADCOEF_CMD, NUMBER_CMD, VECTOR_CMD }
3511	,{jjLEADEXP, LEADEXP_CMD, INTVEC_CMD, POLY_CMD }
3512	,{jjLEADEXP, LEADEXP_CMD, INTVEC_CMD, VECTOR_CMD }
3513	,{jjLEADMONOM, LEADMONOM_CMD, POLY_CMD, POLY_CMD }
3514	,{jjLEADMONOM, LEADMONOM_CMD, VECTOR_CMD, VECTOR_CMD }
3515	,{jjLIB, LIB_CMD, NONE, STRING_CMD }
3516	,{jjDUMMY, LINK_CMD, LINK_CMD, LINK_CMD}
3517	,{jjCALL1MANY, LIST_CMD, LIST_CMD, DEF_CMD }
3518	,{jjWRONG, MAP_CMD, 0, ANY_TYPE}
3519	,{jjDUMMY, MATRIX_CMD, MATRIX_CMD, MATRIX_CMD }
3520	,{jjidMaxIdeal, MAXID_CMD, XS(IDEAL_CMD), INT_CMD }
3521	,{jjMEMORY, MEMORY_CMD, INT_CMD, INT_CMD }
3522	,{jjidMinBase, MINBASE_CMD, XS(IDEAL_CMD), IDEAL_CMD }
3523	,{jjidMinBase, MINBASE_CMD, XS(MODUL_CMD), MODUL_CMD }
3524	,{jjMINRES, MINRES_CMD, LIST_CMD, LIST_CMD }
3525	,{jjMINRES_R, MINRES_CMD, XS(RESOLUTION_CMD), RESOLUTION_CMD }
3526	,{jjDUMMY, MODUL_CMD, MODUL_CMD, MODUL_CMD }
3527	,{jjMONITOR1, MONITOR_CMD, NONE, STRING_CMD }
3528	,{jjMULT, MULTIPLICITY_CMD, INT_CMD, IDEAL_CMD }
3529	,{jjMULT, MULTIPLICITY_CMD, INT_CMD, MODUL_CMD }
3530	,{jjMSTD, MSTD_CMD, LIST_CMD, IDEAL_CMD }
3531	,{jjNAMEOF, NAMEOF_CMD, STRING_CMD, ANY_TYPE }
3532	,{jjNAMES, NAMES_CMD, LIST_CMD, PACKAGE_CMD }
3533	,{jjNAMES, NAMES_CMD, LIST_CMD, RING_CMD }
3534	,{jjNAMES, NAMES_CMD, LIST_CMD, QRING_CMD }
3535	,{jjDUMMY, NUMBER_CMD, NUMBER_CMD, NUMBER_CMD }
3536	,{jjP2N, NUMBER_CMD, NUMBER_CMD, POLY_CMD }
3537	,{jjRPAR, NPARS_CMD, INT_CMD, RING_CMD }
3538	,{jjRPAR, NPARS_CMD, INT_CMD, QRING_CMD }
3539	,{jjNVARS, NVARS_CMD, INT_CMD, RING_CMD }
3540	,{jjNVARS, NVARS_CMD, INT_CMD, QRING_CMD }
3541	,{jjOpenClose, OPEN_CMD, NONE, LINK_CMD }
3542	,{jjORD, ORD_CMD, INT_CMD, POLY_CMD }
3543	,{jjORD, ORD_CMD, INT_CMD, VECTOR_CMD }
3544	,{jjrOrdStr, ORDSTR_CMD, XS(STRING_CMD), RING_CMD }
3545	,{jjrOrdStr, ORDSTR_CMD, XS(STRING_CMD), QRING_CMD }
3546	,{jjPAR1, PAR_CMD, NUMBER_CMD, INT_CMD }
3547	,{jjPARDEG, PARDEG_CMD, INT_CMD, NUMBER_CMD }
3548	,{jjPARSTR1, PARSTR_CMD, STRING_CMD, INT_CMD }
3549	,{jjrParStr, PARSTR_CMD, XS(STRING_CMD), RING_CMD }
3550	,{jjrParStr, PARSTR_CMD, XS(STRING_CMD), QRING_CMD }
3551	,{jjDUMMY, POLY_CMD, POLY_CMD, POLY_CMD }
3552	,{jjPRIME, PRIME_CMD, INT_CMD, INT_CMD }
3553	,{jjPRINT, PRINT_CMD, NONE, LIST_CMD}
3554	,{jjPRINT, PRINT_CMD, NONE, DEF_CMD}
3555	,{jjidMinEmbedding, PRUNE_CMD, XS(MODUL_CMD), MODUL_CMD }
3556	,{kQHWeight, QHWEIGHT_CMD, INTVEC_CMD, IDEAL_CMD }
3557	,{kQHWeight, QHWEIGHT_CMD, INTVEC_CMD, MODUL_CMD }
3558	,{jjWRONG, QRING_CMD, 0, ANY_TYPE}
3559	,{jjREAD, READ_CMD, STRING_CMD, LINK_CMD }
3560	,{jjREGULARITY, REGULARITY_CMD, INT_CMD, LIST_CMD }
3561	,{jjRESERVEDNAME,RESERVEDNAME_CMD, INT_CMD, STRING_CMD }
3562	,{jjL2R, RESOLUTION_CMD, RESOLUTION_CMD, LIST_CMD }
3563	,{jjDUMMY, RESOLUTION_CMD, RESOLUTION_CMD, RESOLUTION_CMD }
3564	,{jjDUMMY, RING_CMD, RING_CMD, RING_CMD}
3565	,{jjWRONG, ROWS_CMD, 0, POLY_CMD }
3566	,{jjpMaxComp, ROWS_CMD, XS(INT_CMD), VECTOR_CMD }
3567	,{jjROWS, ROWS_CMD, INT_CMD, MODUL_CMD }
3568	,{jjROWS, ROWS_CMD, INT_CMD, MATRIX_CMD }
3569	,{jjROWS_IV, ROWS_CMD, INT_CMD, INTMAT_CMD }
3570	,{jjCOUNT_IV, ROWS_CMD, INT_CMD, INTVEC_CMD }
3571	,{jjSort_Id, SORTVEC_CMD, INTVEC_CMD, IDEAL_CMD }
3572	,{jjSort_Id, SORTVEC_CMD, INTVEC_CMD, MODUL_CMD }
3573	,{jjSTD, STD_CMD, IDEAL_CMD, IDEAL_CMD }
3574	,{jjSTD, STD_CMD, MODUL_CMD, MODUL_CMD }
3575	,{jjDUMMY, STRING_CMD, STRING_CMD, STRING_CMD }
3576	,{jjSYSTEM, SYSTEM_CMD, NONE, STRING_CMD }
3577	,{jjSYZYGY, SYZYGY_CMD, MODUL_CMD, IDEAL_CMD }
3578	,{jjSYZYGY, SYZYGY_CMD, MODUL_CMD, MODUL_CMD }
3579	,{jjWRONG, TRACE_CMD, 0, INTVEC_CMD }
3580	,{jjWRONG, TRACE_CMD, 0, IDEAL_CMD }
3581	,{jjTRACE_IV, TRACE_CMD, INT_CMD, INTMAT_CMD }
3582	,{jjmpTrace, TRACE_CMD, XS(POLY_CMD), MATRIX_CMD }
3583	,{jjTRANSP_IV, TRANSPOSE_CMD, INTMAT_CMD, INTVEC_CMD }
3584	,{jjTRANSP_IV, TRANSPOSE_CMD, INTMAT_CMD, INTMAT_CMD }
3585	,{jjmpTransp, TRANSPOSE_CMD, XS(MATRIX_CMD), MATRIX_CMD }
3586	,{jjidTransp, TRANSPOSE_CMD, XS(MODUL_CMD), MODUL_CMD }
3587	,{jjTYPEOF, TYPEOF_CMD, STRING_CMD, ANY_TYPE }
3588	,{jjDUMMY, VECTOR_CMD, VECTOR_CMD, VECTOR_CMD }
3589	,{jjVDIM, VDIM_CMD, INT_CMD, IDEAL_CMD }
3590	,{jjVDIM, VDIM_CMD, INT_CMD, MODUL_CMD }
3591	,{jjVAR1, VAR_CMD, POLY_CMD, INT_CMD }
3592	,{jjVARSTR1, VARSTR_CMD, STRING_CMD, INT_CMD }
3593	,{jjrVarStr, VARSTR_CMD, XS(STRING_CMD), RING_CMD }
3594	,{jjrVarStr, VARSTR_CMD, XS(STRING_CMD), QRING_CMD }
3595	,{kWeight, WEIGHT_CMD, INTVEC_CMD, IDEAL_CMD }
3596	,{kWeight, WEIGHT_CMD, INTVEC_CMD, MODUL_CMD }
3597	,{jjLOAD1, LOAD_CMD, NONE, STRING_CMD }
3598	,{NULL, 0, 0, 0}
3599	};
3600	#undef s
3601	/=================== operations with 3 args.: static proc =================/
3602	static BOOLEAN jjBRACK_S(leftv res, leftv u, leftv v,leftv w)
3603	{
3604	char s= (char )u->Data();
3605	int r = (int)v->Data();
3606	int c = (int)w->Data();
3607	int l = strlen(s);
3608
3609	if ( (r<1) \|\| (r>l) \|\| (c<0) )
3610	{
3611	Werror("wrong range[%d,%d] in string %s",r,c,u->Fullname());
3612	return TRUE;
3613	}
3614	res->data = (char *)AllocL(c+1);
3615	sprintf((char )res->data,"%-.*s",c,c,s+r-1);
3616	return FALSE;
3617	}
3618	static BOOLEAN jjBRACK_Im(leftv res, leftv u, leftv v,leftv w)
3619	{
3620	intvec iv = (intvec )u->Data();
3621	int r = (int)v->Data();
3622	int c = (int)w->Data();
3623	if ((r<1)\|\|(r>iv->rows())\|\|(c<1)\|\|(c>iv->cols()))
3624	{
3625	Werror("wrong range[%d,%d] in intmat %s(%d x %d)",
3626	r,c,u->Fullname(),iv->rows(),iv->cols());
3627	return TRUE;
3628	}
3629	res->data=u->data;
3630	u->data=NULL;
3631	res->rtyp=u->rtyp;
3632	u->rtyp=0;
3633	res->name=u->name;
3634	u->name=NULL;
3635	Subexpr e=jjMakeSub(v);
3636	e->next=jjMakeSub(w);
3637	if (u->e==NULL) res->e=e;
3638	else
3639	{
3640	Subexpr h=u->e;
3641	while (h->next!=NULL) h=h->next;
3642	h->next=e;
3643	res->e=u->e;
3644	u->e=NULL;
3645	}
3646	return FALSE;
3647	}
3648	static BOOLEAN jjBRACK_Ma(leftv res, leftv u, leftv v,leftv w)
3649	{
3650	matrix m= (matrix)u->Data();
3651	int r = (int)v->Data();
3652	int c = (int)w->Data();
3653	//Print("gen. elem %d, %d\n",r,c);
3654	if ((r<1)\|\|(r>MATROWS(m))\|\|(c<1)\|\|(c>MATCOLS(m)))
3655	{
3656	Werror("wrong range[%d,%d] in matrix %s(%d x %d)",r,c,u->Fullname(),
3657	MATROWS(m),MATCOLS(m));
3658	return TRUE;
3659	}
3660	res->data=u->data;
3661	u->data=NULL;
3662	res->rtyp=u->rtyp;
3663	u->rtyp=0;
3664	res->name=u->name;
3665	u->name=NULL;
3666	Subexpr e=jjMakeSub(v);
3667	e->next=jjMakeSub(w);
3668	if (u->e==NULL)
3669	res->e=e;
3670	else
3671	{
3672	Subexpr h=u->e;
3673	while (h->next!=NULL) h=h->next;
3674	h->next=e;
3675	res->e=u->e;
3676	u->e=NULL;
3677	}
3678	return FALSE;
3679	}
3680	static BOOLEAN jjBRACK_Ma_I_IV(leftv res, leftv u, leftv v,leftv w)
3681	{
3682	sleftv t;
3683	sleftv ut;
3684	leftv p=NULL;
3685	intvec iv=(intvec )w->Data();
3686	int l;
3687	BOOLEAN nok;
3688
3689	if ((u->rtyp!=IDHDL)\|\|(u->e!=NULL))
3690	{
3691	WerrorS("cannot build expression lists from unnamed objects");
3692	return TRUE;
3693	}
3694	memcpy(&ut,u,sizeof(ut));
3695	memset(&t,0,sizeof(t));
3696	t.rtyp=INT_CMD;
3697	for (l=0;l< iv->length(); l++)
3698	{
3699	t.data=(char )(iv)[l];
3700	if (p==NULL)
3701	{
3702	p=res;
3703	}
3704	else
3705	{
3706	p->next=(leftv)Alloc0(sizeof(sleftv));
3707	p=p->next;
3708	}
3709	memcpy(u,&ut,sizeof(ut));
3710	if (u->Typ() == MATRIX_CMD)
3711	nok=jjBRACK_Ma(p,u,v,&t);
3712	else /* INTMAT_CMD */
3713	nok=jjBRACK_Im(p,u,v,&t);
3714	if (nok)
3715	{
3716	while (res->next!=NULL)
3717	{
3718	p=res->next->next;
3719	Free((ADDRESS)res->next,sizeof(sleftv));
3720	// res->e aufraeumen !!!!
3721	res->next=p;
3722	}
3723	return TRUE;
3724	}
3725	}
3726	return FALSE;
3727	}
3728	static BOOLEAN jjBRACK_Ma_IV_I(leftv res, leftv u, leftv v,leftv w)
3729	{
3730	sleftv t;
3731	sleftv ut;
3732	leftv p=NULL;
3733	intvec iv=(intvec )v->Data();
3734	int l;
3735	BOOLEAN nok;
3736
3737	if ((u->rtyp!=IDHDL)\|\|(u->e!=NULL))
3738	{
3739	WerrorS("cannot build expression lists from unnamed objects");
3740	return TRUE;
3741	}
3742	memcpy(&ut,u,sizeof(ut));
3743	memset(&t,0,sizeof(t));
3744	t.rtyp=INT_CMD;
3745	for (l=0;l< iv->length(); l++)
3746	{
3747	t.data=(char )((iv)[l]);
3748	if (p==NULL)
3749	{
3750	p=res;
3751	}
3752	else
3753	{
3754	p->next=(leftv)Alloc0(sizeof(sleftv));
3755	p=p->next;
3756	}
3757	memcpy(u,&ut,sizeof(ut));
3758	if (u->Typ() == MATRIX_CMD)
3759	nok=jjBRACK_Ma(p,u,&t,w);
3760	else /* INTMAT_CMD */
3761	nok=jjBRACK_Im(p,u,&t,w);
3762	if (nok)
3763	{
3764	while (res->next!=NULL)
3765	{
3766	p=res->next->next;
3767	Free((ADDRESS)res->next,sizeof(sleftv));
3768	// res->e aufraeumen !!
3769	res->next=p;
3770	}
3771	return TRUE;
3772	}
3773	}
3774	return FALSE;
3775	}
3776	static BOOLEAN jjBRACK_Ma_IV_IV(leftv res, leftv u, leftv v,leftv w)
3777	{
3778	sleftv t1,t2,ut;
3779	leftv p=NULL;
3780	intvec vv=(intvec )v->Data();
3781	intvec wv=(intvec )w->Data();
3782	int vl;
3783	int wl;
3784	BOOLEAN nok;
3785
3786	if ((u->rtyp!=IDHDL)\|\|(u->e!=NULL))
3787	{
3788	WerrorS("cannot build expression lists from unnamed objects");
3789	return TRUE;
3790	}
3791	memcpy(&ut,u,sizeof(ut));
3792	memset(&t1,0,sizeof(sleftv));
3793	memset(&t2,0,sizeof(sleftv));
3794	t1.rtyp=INT_CMD;
3795	t2.rtyp=INT_CMD;
3796	for (vl=0;vl< vv->length(); vl++)
3797	{
3798	t1.data=(char )((vv)[vl]);
3799	for (wl=0;wl< wv->length(); wl++)
3800	{
3801	t2.data=(char )((wv)[wl]);
3802	if (p==NULL)
3803	{
3804	p=res;
3805	}
3806	else
3807	{
3808	p->next=(leftv)Alloc0(sizeof(sleftv));
3809	p=p->next;
3810	}
3811	memcpy(u,&ut,sizeof(ut));
3812	if (u->Typ() == MATRIX_CMD)
3813	nok=jjBRACK_Ma(p,u,&t1,&t2);
3814	else /* INTMAT_CMD */
3815	nok=jjBRACK_Im(p,u,&t1,&t2);
3816	if (nok)
3817	{
3818	res->CleanUp();
3819	return TRUE;
3820	}
3821	}
3822	}
3823	return FALSE;
3824	}
3825	static BOOLEAN jjPROC3(leftv res, leftv u, leftv v, leftv w)
3826	{
3827	v->next=(leftv)Alloc(sizeof(sleftv));
3828	memcpy(v->next,w,sizeof(sleftv));
3829	BOOLEAN r=iiExprArith2(res,u,'(',v);
3830	v->rtyp=0; v->data=NULL;
3831	w->rtyp=0; w->data=NULL;
3832	return r;
3833	}
3834	static BOOLEAN jjCALL3MANY(leftv res, leftv u, leftv v, leftv w)
3835	{
3836	u->next=(leftv)Alloc(sizeof(sleftv));
3837	memcpy(u->next,v,sizeof(sleftv));
3838	u->next->next=(leftv)Alloc(sizeof(sleftv));
3839	memcpy(u->next->next,w,sizeof(sleftv));
3840	BOOLEAN r=iiExprArithM(res,u,iiOp);
3841	v->rtyp=0; v->data=NULL; // iiExprArithM did the CleanUp
3842	w->rtyp=0; w->data=NULL;
3843	return r;
3844	}
3845	static BOOLEAN jjBAREISS3(leftv res, leftv u, leftv v, leftv w)
3846	{
3847
3848	lists l=smCallNewBareiss((ideal)u->Data(),(int)v->Data(),(int)w->Data());
3849	res->data = (char *)l;
3850	return FALSE;
3851	}
3852	static BOOLEAN jjCOEFFS3_Id(leftv res, leftv u, leftv v, leftv w)
3853	{
3854	if ((w->rtyp!=IDHDL)\|\|(w->e!=NULL))
3855	{
3856	WerrorS("3rd argument must be a name of a matrix");
3857	return TRUE;
3858	}
3859	ideal i=(ideal)u->Data();
3860	int rank=(int)i->rank;
3861	BOOLEAN r=jjCOEFFS_Id(res,u,v);
3862	if (r) return TRUE;
3863	mpMonomials((matrix)res->data, rank, pVar((poly)v->Data()),(matrix)w->Data());
3864	return FALSE;
3865	}
3866	static BOOLEAN jjCOEFFS3_KB(leftv res, leftv u, leftv v, leftv w)
3867	{
3868	res->data=(void*)idCoeffOfKBase((ideal)(u->Data()),
3869	(ideal)(v->Data()),(poly)(w->Data()));
3870	return FALSE;
3871	}
3872	static BOOLEAN jjCOEFFS3_P(leftv res, leftv u, leftv v, leftv w)
3873	{
3874	if ((w->rtyp!=IDHDL)\|\|(w->e!=NULL))
3875	{
3876	WerrorS("3rd argument must be a name of a matrix");
3877	return TRUE;
3878	}
3879	poly p=(poly)u->CopyD();
3880	ideal i=idInit(1,1);
3881	i->m[0]=p;
3882	sleftv t;
3883	memset(&t,0,sizeof(t));
3884	t.data=(char *)i;
3885	t.rtyp=IDEAL_CMD;
3886	int rank=1;
3887	if (u->Typ()==VECTOR_CMD)
3888	{
3889	i->rank=rank=pMaxComp(p);
3890	t.rtyp=MODUL_CMD;
3891	}
3892	BOOLEAN r=jjCOEFFS_Id(res,&t,v);
3893	t.CleanUp();
3894	if (r) return TRUE;
3895	mpMonomials((matrix)res->data, rank, pVar((poly)v->Data()),(matrix)w->Data());
3896	return FALSE;
3897	}
3898	static BOOLEAN jjELIMIN_HILB(leftv res, leftv u, leftv v, leftv w)
3899	{
3900	res->data=(char *)idElimination((ideal)u->Data(),(poly)v->Data(),
3901	(intvec *)w->Data());
3902	setFlag(res,FLAG_STD);
3903	return FALSE;
3904	}
3905	static BOOLEAN jjFIND3(leftv res, leftv u, leftv v, leftv w)
3906	{
3907	/*4
3908	* look for the substring what in the string where
3909	* starting at position n
3910	* return the position of the first char of what in where
3911	* or 0
3912	*/
3913	int n=(int)w->Data();
3914	char where=(char )u->Data();
3915	char what=(char )v->Data();
3916	char *found;
3917	if ((1>n)\|\|(n>(int)strlen(where)))
3918	{
3919	Werror("start position %d out of range",n);
3920	return TRUE;
3921	}
3922	found = strchr(where+n-1,*what);
3923	if (*(what+1)!='\0')
3924	{
3925	while((found !=NULL) && (strncmp(found+1,what+1,strlen(what+1))!=0))
3926	{
3927	found=strchr(found+1,*what);
3928	}
3929	}
3930	if (found != NULL)
3931	{
3932	res->data=(char *)((found-where)+1);
3933	}
3934	return FALSE;
3935	}
3936	static BOOLEAN jjINTMAT3(leftv res, leftv u, leftv v,leftv w)
3937	{
3938	intvec* im= new intvec((int)v->Data(),(int)w->Data(), 0);
3939	intvec* arg = (intvec*) u->Data();
3940	int i, n = min(im->cols()im->rows(), arg->cols()arg->rows());
3941
3942	for (i=0; i<n; i++)
3943	{
3944	(im)[i] = (arg)[i];
3945	}
3946
3947	res->data = (char *)im;
3948	return FALSE;
3949	}
3950	static BOOLEAN jjJET_P_IV(leftv res, leftv u, leftv v, leftv w)
3951	{
3952	short iw=iv2array((intvec )w->Data());
3953	res->data = (char *)pJetW((poly)u->Data(),(int)v->Data(),iw);
3954	Free((ADDRESS)iw,(pVariables+1)*sizeof(short));
3955	return FALSE;
3956	}
3957	static BOOLEAN jjJET_ID_IV(leftv res, leftv u, leftv v, leftv w)
3958	{
3959	res->data = (char *)idJetW((ideal)u->Data(),(int)v->Data(),
3960	(intvec *)w->Data());
3961	return FALSE;
3962	}
3963	static BOOLEAN jjPREIMAGE(leftv res, leftv u, leftv v, leftv w)
3964	{
3965	idhdl h;
3966	ring rr;
3967	map mapping;
3968
3969	if ((v->name==NULL) \|\| (w->name==NULL))
3970	{
3971	WerrorS("2nd/3rd arguments must have names");
3972	return TRUE;
3973	}
3974	rr=(ring)u->Data();
3975	const char *ring_name=u->Name();
3976	if ((h=rr->idroot->get(v->name,myynest))!=NULL)
3977	{
3978	if (h->typ==MAP_CMD)
3979	{
3980	mapping=IDMAP(h);
3981	}
3982	else if (h->typ==IDEAL_CMD)
3983	{
3984	mapping=IDMAP(h);
3985	}
3986	else
3987	{
3988	Werror("`%s` is no map nor ideal",IDID(h));
3989	return TRUE;
3990	}
3991	}
3992	else
3993	{
3994	Werror("`%s` is not defined in `%s`",v->name,ring_name);
3995	return TRUE;
3996	}
3997	if ((h=rr->idroot->get(w->name,myynest))!=NULL)
3998	{
3999	if (h->typ==IDEAL_CMD)
4000	{
4001	res->data=(char *)maGetPreimage(rr,mapping,IDIDEAL(h));
4002	}
4003	else
4004	{
4005	Werror("`%s` is no ideal",IDID(h));
4006	return TRUE;
4007	}
4008	}
4009	else
4010	{
4011	Werror("`%s` is not defined in `%s`",w->name,ring_name);
4012	return TRUE;
4013	}
4014	return FALSE;
4015	}
4016	static BOOLEAN jjRANDOM_Im(leftv res, leftv u, leftv v, leftv w)
4017	{
4018	int di, k;
4019	int i=(int)u->Data();
4020	int r=(int)v->Data();
4021	int c=(int)w->Data();
4022	intvec *iv = new intvec(r, c, 0);
4023	if (iv->rows()==0)
4024	{
4025	delete iv;
4026	return TRUE;
4027	}
4028	if (i!=0)
4029	{
4030	if (i<0) i = -i;
4031	di = 2 * i + 1;
4032	for (k=0; k<iv->length(); k++)
4033	{
4034	#ifdef buildin_rand
4035	(*iv)[k] = ((siRand() % di) - i);
4036	#else
4037	(*iv)[k] = ((rand() % di) - i);
4038	#endif
4039	}
4040	}
4041	res->data = (char *)iv;
4042	return FALSE;
4043	}
4044	static BOOLEAN jjSUBST_Test(leftv v,leftv w,
4045	int &ringvar, poly &monomexpr)
4046	{
4047	monomexpr=(poly)w->Data();
4048	if (pLength(monomexpr)>1)
4049	{
4050	Werror("`%s` substitutes a ringvar only by a term",
4051	Tok2Cmdname(SUBST_CMD));
4052	return TRUE;
4053	}
4054	if (!(ringvar=pVar((poly)v->Data())))
4055	{
4056	WerrorS("ringvar expected");
4057	return TRUE;
4058	}
4059	return FALSE;
4060	}
4061	static BOOLEAN jjSUBST_P(leftv res, leftv u, leftv v,leftv w)
4062	{
4063	int ringvar;
4064	poly monomexpr;
4065	BOOLEAN nok=jjSUBST_Test(v,w,ringvar,monomexpr);
4066	if (nok) return TRUE;
4067	res->data = pSubst((poly)u->CopyD(POLY_CMD),ringvar,monomexpr);
4068	return FALSE;
4069	}
4070	static BOOLEAN jjSUBST_Id(leftv res, leftv u, leftv v,leftv w)
4071	{
4072	int ringvar;
4073	poly monomexpr;
4074	BOOLEAN nok=jjSUBST_Test(v,w,ringvar,monomexpr);
4075	if (nok) return TRUE;
4076	res->data = idSubst((ideal)u->CopyD(IDEAL_CMD),ringvar,monomexpr);
4077	return FALSE;
4078	}
4079	static BOOLEAN jjMATRIX_Id(leftv res, leftv u, leftv v,leftv w)
4080	{
4081	matrix m=mpNew((int)v->Data(),(int)w->Data());
4082	ideal I=(ideal)u->CopyD(IDEAL_CMD);
4083	int i=min(IDELEMS(I),(int)v->Data()*(int)w->Data());
4084	//for(i=i-1;i>=0;i--)
4085	//{
4086	// m->m[i]=I->m[i];
4087	// I->m[i]=NULL;
4088	//}
4089	memcpy4(m->m,I->m,i*sizeof(poly));
4090	memset(I->m,0,i*sizeof(poly));
4091	idDelete(&I);
4092	res->data = (char *)m;
4093	return FALSE;
4094	}
4095	static BOOLEAN jjMATRIX_Mo(leftv res, leftv u, leftv v,leftv w)
4096	{
4097	res->data = (char *)idModule2formatedMatrix((ideal)u->CopyD(MODUL_CMD),
4098	(int)v->Data(),(int)w->Data());
4099	return FALSE;
4100	}
4101	static BOOLEAN jjMATRIX_Ma(leftv res, leftv u, leftv v,leftv w)
4102	{
4103	matrix m=mpNew((int)v->Data(),(int)w->Data());
4104	matrix I=(matrix)u->CopyD(MATRIX_CMD);
4105	int r=min(MATROWS(I),(int)v->Data());
4106	int c=min(MATCOLS(I),(int)w->Data());
4107	int i,j;
4108	for(i=r;i>0;i--)
4109	{
4110	for(j=c;j>0;j--)
4111	{
4112	MATELEM(m,i,j)=MATELEM(I,i,j);
4113	MATELEM(I,i,j)=NULL;
4114	}
4115	}
4116	idDelete((ideal *)&I);
4117	res->data = (char *)m;
4118	return FALSE;
4119	}
4120	static BOOLEAN jjLIFT3(leftv res, leftv u, leftv v, leftv w)
4121	{
4122	int sw=(int)w->Data();
4123	if (sw==0)
4124	{
4125	return jjLIFT(res,u,v);
4126	}
4127	else
4128	{
4129	ideal m;
4130	ideal ui=(ideal)u->Data();
4131	ideal vi=(ideal)v->Data();
4132	int ul= IDELEMS(ui);
4133	int vl= IDELEMS(vi);
4134	m = idLiftNonStB(ui,vi, sw);
4135	res->data = (char *)idModule2formatedMatrix(m,ul,vl);
4136	}
4137	return FALSE;
4138	}
4139	static BOOLEAN jjREDUCE3_P(leftv res, leftv u, leftv v, leftv w)
4140	{
4141	assumeStdFlag(v);
4142	res->data = (char *)kNF((ideal)v->Data(),currQuotient,(poly)u->Data(),
4143	0,(int)w->Data());
4144	return FALSE;
4145	}
4146	static BOOLEAN jjREDUCE3_ID(leftv res, leftv u, leftv v, leftv w)
4147	{
4148	assumeStdFlag(v);
4149	res->data = (char *)kNF((ideal)v->Data(),currQuotient,(ideal)u->Data(),
4150	0,(int)w->Data());
4151	return FALSE;
4152	}
4153	#ifdef OLD_RES
4154	static BOOLEAN jjRES3(leftv res, leftv u, leftv v, leftv w)
4155	{
4156	int maxl=(int)v->Data();
4157	int l=0;
4158	resolvente r;
4159	intvec **weights=NULL;
4160	int wmaxl=maxl;
4161	maxl--;
4162	if ((maxl==-1) && (iiOp!=MRES_CMD))
4163	maxl = pVariables-1;
4164	if ((iiOp == RES_CMD) \|\| (iiOp == MRES_CMD))
4165	{
4166	if (BTEST1(28))
4167	{
4168	r=syMinRes((ideal)u->Data(),maxl,&l,iiOp==MRES_CMD);
4169	}
4170	else
4171	{
4172	intvec * iv=(intvec*)atGet(u,"isHomog");
4173	if (iv!=NULL)
4174	{
4175	weights = (intvec*)Alloc0(sizeof(intvec));
4176	weights[0] = ivCopy(iv);
4177	l=1;
4178	}
4179	r=syResolvente((ideal)u->Data(),maxl,&l, &weights, iiOp==MRES_CMD);
4180	}
4181	}
4182	else
4183	r=sySchreyerResolvente((ideal)u->Data(),maxl+1,&l);
4184	if (r==NULL) return TRUE;
4185	int t3=u->Typ();
4186	iiMakeResolv(r,l,wmaxl,w->name,t3,weights);
4187	return FALSE;
4188	return TRUE;
4189	}
4190	#endif
4191	static BOOLEAN jjSTATUS3(leftv res, leftv u, leftv v, leftv w)
4192	{
4193	int yes;
4194	jjSTATUS2(res, u, v);
4195	yes = (strcmp((char ) res->data, (char ) w->Data()) == 0);
4196	FreeL((ADDRESS) res->data);
4197	res->data = (void *) yes;
4198	return FALSE;
4199	}
4200	static BOOLEAN jjSTD_HILB_W(leftv res, leftv u, leftv v, leftv w)
4201	{
4202	ideal result;
4203	intvec ww=(intvec )atGet(u,"isHomog");
4204	tHomog hom=testHomog;
4205	if (ww!=NULL)
4206	{
4207	ww=ivCopy(ww);
4208	hom=isHomog;
4209	}
4210	result=kStd((ideal)(u->Data()),
4211	currQuotient,
4212	hom,
4213	&ww, // module weights
4214	(intvec *)v->Data(), // hilbert series
4215	0,0, // syzComp, newIdeal
4216	(intvec *)w->Data()); // weights of vars
4217	idSkipZeroes(result);
4218	res->data = (char *)result;
4219	setFlag(res,FLAG_STD);
4220	if (ww!=NULL) atSet(res,mstrdup("isHomog"),ww,INTVEC_CMD);
4221	return FALSE;
4222	}
4223
4224	/=================== operations with 3 args.: table =================/
4225	struct sValCmd3 dArith3[]=
4226	{
4227	// operations:
4228	// proc cmd res arg1 arg2 arg3
4229	{jjBRACK_S, '[', STRING_CMD, STRING_CMD, INT_CMD, INT_CMD }
4230	,{jjBRACK_Im, '[', INT_CMD, INTMAT_CMD, INT_CMD, INT_CMD }
4231	,{jjBRACK_Ma_I_IV, '[', INT_CMD, INTMAT_CMD, INT_CMD, INTVEC_CMD }
4232	,{jjBRACK_Ma_IV_I, '[', INT_CMD, INTMAT_CMD, INTVEC_CMD, INT_CMD }
4233	,{jjBRACK_Ma_IV_IV, '[', INT_CMD, INTMAT_CMD, INTVEC_CMD, INTVEC_CMD }
4234	,{jjBRACK_Ma, '[', POLY_CMD, MATRIX_CMD, INT_CMD, INT_CMD }
4235	,{jjBRACK_Ma_I_IV, '[', POLY_CMD, MATRIX_CMD, INT_CMD, INTVEC_CMD }
4236	,{jjBRACK_Ma_IV_I, '[', POLY_CMD, MATRIX_CMD, INTVEC_CMD, INT_CMD }
4237	,{jjBRACK_Ma_IV_IV, '[', POLY_CMD, MATRIX_CMD, INTVEC_CMD, INTVEC_CMD }
4238	,{jjPROC3, '(', ANY_TYPE, PROC_CMD, DEF_CMD, DEF_CMD }
4239	,{atATTRIB3, ATTRIB_CMD, NONE, IDHDL, STRING_CMD, DEF_CMD }
4240	,{jjBAREISS3, BAREISS_CMD,LIST_CMD, MODUL_CMD, INT_CMD, INT_CMD }
4241	,{jjCOEFFS3_P, COEFFS_CMD, MATRIX_CMD, POLY_CMD, POLY_CMD, MATRIX_CMD }
4242	,{jjCOEFFS3_P, COEFFS_CMD, MATRIX_CMD, VECTOR_CMD, POLY_CMD, MATRIX_CMD }
4243	,{jjCOEFFS3_Id, COEFFS_CMD, MATRIX_CMD, IDEAL_CMD, POLY_CMD, MATRIX_CMD }
4244	,{jjCOEFFS3_Id, COEFFS_CMD, MATRIX_CMD, MODUL_CMD, POLY_CMD, MATRIX_CMD }
4245	,{jjCOEFFS3_KB, COEFFS_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD }
4246	,{jjCOEFFS3_KB, COEFFS_CMD, MATRIX_CMD, MODUL_CMD, MODUL_CMD, POLY_CMD }
4247	,{jjELIMIN_HILB, ELIMINATION_CMD,IDEAL_CMD, IDEAL_CMD, POLY_CMD, INTVEC_CMD }
4248	,{jjFIND3, FIND_CMD, INT_CMD, STRING_CMD, STRING_CMD, INT_CMD }
4249	,{jjCALL3MANY, IDEAL_CMD, IDEAL_CMD, DEF_CMD, DEF_CMD, DEF_CMD }
4250	//,{jjCALL3MANY, INTERSECT_CMD, NONE, DEF_CMD, DEF_CMD, DEF_CMD }
4251	,{lInsert3, INSERT_CMD, LIST_CMD, LIST_CMD, DEF_CMD, INT_CMD }
4252	,{jjINTMAT3, INTMAT_CMD, INTMAT_CMD, INTMAT_CMD, INT_CMD, INT_CMD }
4253	,{jjCALL3MANY, INTVEC_CMD, INTVEC_CMD, DEF_CMD, DEF_CMD, DEF_CMD }
4254	,{jjJET_P_IV, JET_CMD, POLY_CMD, POLY_CMD, INT_CMD, INTVEC_CMD }
4255	,{jjJET_ID_IV, JET_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD, INTVEC_CMD }
4256	,{jjJET_P_IV, JET_CMD, VECTOR_CMD, VECTOR_CMD, INT_CMD, INTVEC_CMD }
4257	,{jjJET_ID_IV, JET_CMD, MODUL_CMD, MODUL_CMD, INT_CMD, INTVEC_CMD }
4258	,{mpKoszul, KOSZUL_CMD, MATRIX_CMD, INT_CMD, INT_CMD, IDEAL_CMD }
4259	,{jjCALL3MANY, LIST_CMD, LIST_CMD, DEF_CMD, DEF_CMD, DEF_CMD }
4260	,{jjMATRIX_Id, MATRIX_CMD, MATRIX_CMD, IDEAL_CMD, INT_CMD, INT_CMD }
4261	,{jjMATRIX_Mo, MATRIX_CMD, MATRIX_CMD, MODUL_CMD, INT_CMD, INT_CMD }
4262	,{jjMATRIX_Ma, MATRIX_CMD, MATRIX_CMD, MATRIX_CMD, INT_CMD, INT_CMD }
4263	,{jjCALL3MANY, MODUL_CMD, MODUL_CMD, DEF_CMD, DEF_CMD, DEF_CMD }
4264	#ifdef OLD_RES
4265	,{jjRES3, MRES_CMD, NONE, IDEAL_CMD, INT_CMD, ANY_TYPE }
4266	,{jjRES3, MRES_CMD, NONE, MODUL_CMD, INT_CMD, ANY_TYPE }
4267	#endif
4268	,{jjLIFT3, LIFT_CMD, MATRIX_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD }
4269	,{jjPREIMAGE, PREIMAGE_CMD, IDEAL_CMD, RING_CMD, ANY_TYPE, ANY_TYPE }
4270	,{jjPREIMAGE, PREIMAGE_CMD, IDEAL_CMD, QRING_CMD, ANY_TYPE, ANY_TYPE }
4271	,{jjRANDOM_Im, RANDOM_CMD, INTMAT_CMD, INT_CMD, INT_CMD, INT_CMD }
4272	,{jjREDUCE3_P, REDUCE_CMD, POLY_CMD, POLY_CMD, IDEAL_CMD, INT_CMD }
4273	,{jjREDUCE3_P, REDUCE_CMD, VECTOR_CMD, VECTOR_CMD, IDEAL_CMD, INT_CMD }
4274	,{jjREDUCE3_P, REDUCE_CMD, VECTOR_CMD, VECTOR_CMD, MODUL_CMD, INT_CMD }
4275	,{jjREDUCE3_ID, REDUCE_CMD, IDEAL_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD }
4276	,{jjREDUCE3_ID, REDUCE_CMD, MODUL_CMD, MODUL_CMD, MODUL_CMD, INT_CMD }
4277	,{jjREDUCE3_ID, REDUCE_CMD, MODUL_CMD, MODUL_CMD, IDEAL_CMD, INT_CMD }
4278	#ifdef OLD_RES
4279	,{jjRES3, RES_CMD, NONE, IDEAL_CMD, INT_CMD, ANY_TYPE }
4280	,{jjRES3, RES_CMD, NONE, MODUL_CMD, INT_CMD, ANY_TYPE }
4281	#endif
4282	#ifdef HAVE_FACTORY
4283	,{jjRESULTANT, RESULTANT_CMD, POLY_CMD,POLY_CMD, POLY_CMD, POLY_CMD }
4284	#else
4285	,{jjWRONG3, RESULTANT_CMD, POLY_CMD,POLY_CMD, POLY_CMD, POLY_CMD }
4286	#endif
4287	#ifdef OLD_RES
4288	,{jjRES3, SRES_CMD, NONE, IDEAL_CMD, INT_CMD, ANY_TYPE }
4289	,{jjRES3, SRES_CMD, NONE, MODUL_CMD, INT_CMD, ANY_TYPE }
4290	#endif
4291	,{jjSTATUS3, STATUS_CMD, INT_CMD, LINK_CMD, STRING_CMD, STRING_CMD}
4292	,{jjSTD_HILB_W, STD_CMD, IDEAL_CMD, IDEAL_CMD, INTVEC_CMD, INTVEC_CMD}
4293	,{jjSTD_HILB_W, STD_CMD, MODUL_CMD, MODUL_CMD, INTVEC_CMD, INTVEC_CMD}
4294	,{jjSUBST_P, SUBST_CMD, POLY_CMD, POLY_CMD, POLY_CMD, POLY_CMD }
4295	,{jjSUBST_P, SUBST_CMD, VECTOR_CMD, VECTOR_CMD, POLY_CMD, POLY_CMD }
4296	,{jjSUBST_Id, SUBST_CMD, IDEAL_CMD, IDEAL_CMD, POLY_CMD, POLY_CMD }
4297	,{jjSUBST_Id, SUBST_CMD, MODUL_CMD, MODUL_CMD, POLY_CMD, POLY_CMD }
4298	,{jjSUBST_Id, SUBST_CMD, MATRIX_CMD, MATRIX_CMD, POLY_CMD, POLY_CMD }
4299	,{jjCALL3MANY, SYSTEM_CMD, NONE, STRING_CMD, DEF_CMD, DEF_CMD }
4300	,{nuLagSolve, LAGSOLVE_CMD,LIST_CMD, POLY_CMD, INT_CMD, INT_CMD }
4301	,{nuVanderSys, VANDER_CMD, POLY_CMD, IDEAL_CMD, IDEAL_CMD, INT_CMD }
4302	,{NULL, 0, 0, 0, 0, 0 }
4303	};
4304	/=================== operations with many arg.: static proc =================/
4305	static BOOLEAN jjCALL1ARG(leftv res, leftv v)
4306	{
4307	return iiExprArith1(res,v,iiOp);
4308	}
4309	static BOOLEAN jjCALL2ARG(leftv res, leftv u)
4310	{
4311	leftv v=u->next;
4312	u->next=NULL;
4313	BOOLEAN b=iiExprArith2(res,u,iiOp,v, (iiOp > 255));
4314	u->next=v;
4315	return b;
4316	}
4317	static BOOLEAN jjCALL3ARG(leftv res, leftv u)
4318	{
4319	leftv v = u->next;
4320	leftv w = v->next;
4321	u->next = NULL;
4322	v->next = NULL;
4323	BOOLEAN b = iiExprArith3(res, iiOp, u, v, w);
4324	u->next = v;
4325	v->next = w;
4326	return b;
4327	}
4328
4329	static BOOLEAN jjCOEF_M(leftv res, leftv v)
4330	{
4331	if((v->Typ() != VECTOR_CMD)
4332	\|\| (v->next->Typ() != POLY_CMD)
4333	\|\| (v->next->next->Typ() != MATRIX_CMD)
4334	\|\| (v->next->next->next->Typ() != MATRIX_CMD))
4335	return TRUE;
4336	if (v->next->next->rtyp!=IDHDL) return TRUE;
4337	idhdl c=(idhdl)v->next->next->data;
4338	if (v->next->next->next->rtyp!=IDHDL) return TRUE;
4339	idhdl m=(idhdl)v->next->next->next->data;
4340	idDelete((ideal *)&(c->data.uideal));
4341	idDelete((ideal *)&(m->data.uideal));
4342	mpCoef2((poly)v->Data(),(poly)v->next->Data(),
4343	(matrix )&(c->data.umatrix),(matrix )&(m->data.umatrix));
4344	return FALSE;
4345	}
4346	static BOOLEAN jjIDEAL_PL(leftv res, leftv v)
4347	{
4348	int s=1;
4349	leftv h=v;
4350	if (h!=NULL) s=exprlist_length(h);
4351	ideal id=idInit(s,1);
4352	int rank=1;
4353	int i=0;
4354	poly p;
4355	while (h!=NULL)
4356	{
4357	switch(h->Typ())
4358	{
4359	case POLY_CMD:
4360	{
4361	p=(poly)h->CopyD();
4362	break;
4363	}
4364	case INT_CMD:
4365	{
4366	number n=nInit((int)h->Data());
4367	if (!nIsZero(n))
4368	{
4369	p=pOne();
4370	pSetCoeff(p,n);
4371	}
4372	else
4373	{
4374	p=NULL;
4375	nDelete(&n);
4376	}
4377	break;
4378	}
4379	case NUMBER_CMD:
4380	{
4381	number n=(number)h->CopyD();
4382	if (!nIsZero(n))
4383	{
4384	p=pOne();
4385	pSetCoeff(p,n);
4386	}
4387	else
4388	{
4389	p=NULL;
4390	nDelete(&n);
4391	}
4392	break;
4393	}
4394	case VECTOR_CMD:
4395	{
4396	p=(poly)h->CopyD();
4397	if (iiOp!=MODUL_CMD)
4398	{
4399	idDelete(&id);
4400	pDelete(&p);
4401	return TRUE;
4402	}
4403	rank=max(rank,pMaxComp(p));
4404	break;
4405	}
4406	default:
4407	{
4408	idDelete(&id);
4409	return TRUE;
4410	}
4411	}
4412	if ((iiOp==MODUL_CMD)&&(p!=NULL)&&(pGetComp(p)==0))
4413	{
4414	pSetCompP(p,1);
4415	}
4416	id->m[i]=p;
4417	i++;
4418	h=h->next;
4419	}
4420	id->rank=rank;
4421	res->data=(char *)id;
4422	return FALSE;
4423	}
4424	static BOOLEAN jjINTERSECT_PL(leftv res, leftv v)
4425	{
4426	leftv h=v;
4427	int l=v->listLength();
4428	resolvente r=(resolvente)Alloc0(l*sizeof(ideal));
4429	BOOLEAN copied=(BOOLEAN )Alloc0(l*sizeof(BOOLEAN));
4430	int t=0;
4431	// try to convert to IDEAL_CMD
4432	while (h!=NULL)
4433	{
4434	if (iiTestConvert(h->Typ(),IDEAL_CMD)!=0)
4435	{
4436	t=IDEAL_CMD;
4437	}
4438	else break;
4439	h=h->next;
4440	}
4441	// if failure, try MODUL_CMD
4442	if (t==0)
4443	{
4444	h=v;
4445	while (h!=NULL)
4446	{
4447	if (iiTestConvert(h->Typ(),MODUL_CMD)!=0)
4448	{
4449	t=MODUL_CMD;
4450	}
4451	else break;
4452	h=h->next;
4453	}
4454	}
4455	// check for success in converting
4456	if (t==0)
4457	{
4458	WerrorS("cannot convert to ideal or module");
4459	return TRUE;
4460	}
4461	// call idMultSect
4462	h=v;
4463	int i=0;
4464	sleftv tmp;
4465	while (h!=NULL)
4466	{
4467	if (h->Typ()==t)
4468	{
4469	r[i]=(ideal)h->Data(); /no copy/
4470	h=h->next;
4471	}
4472	else if(iiConvert(h->Typ(),t,iiTestConvert(h->Typ(),t),h,&tmp))
4473	{
4474	Free((ADDRESS)copied,l*sizeof(BOOLEAN));
4475	Free((ADDRESS)r,l*sizeof(ideal));
4476	Werror("cannot convert arg. %d to %s",i+1,Tok2Cmdname(t));
4477	return TRUE;
4478	}
4479	else
4480	{
4481	r[i]=(ideal)tmp.Data(); /now it's a copy/
4482	copied[i]=TRUE;
4483	h=tmp.next;
4484	}
4485	i++;
4486	}
4487	res->rtyp=t;
4488	res->data=(char *)idMultSect(r,i);
4489	while(i>0)
4490	{
4491	i--;
4492	if (copied[i]) idDelete(&(r[i]));
4493	}
4494	Free((ADDRESS)copied,l*sizeof(BOOLEAN));
4495	Free((ADDRESS)r,l*sizeof(ideal));
4496	return FALSE;
4497	}
4498	static BOOLEAN jjINTVEC_PL(leftv res, leftv v)
4499	{
4500	int i=0;
4501	leftv h=v;
4502	if (h!=NULL) i=exprlist_length(h);
4503	intvec *iv=new intvec(i);
4504	i=0;
4505	while (h!=NULL)
4506	{
4507	if(h->Typ()==INT_CMD)
4508	{
4509	(*iv)[i]=(int)h->Data();
4510	}
4511	else
4512	{
4513	delete iv;
4514	return TRUE;
4515	}
4516	i++;
4517	h=h->next;
4518	}
4519	res->data=(char *)iv;
4520	return FALSE;
4521	}
4522	static BOOLEAN jjKLAMMER_PL(leftv res, leftv u)
4523	{
4524	if ((yyInRingConstruction)
4525	&& ((strcmp(u->Name(),"real")==0) \|\| (strcmp(u->Name(),"complex")==0)))
4526	{
4527	memcpy(res,u,sizeof(sleftv));
4528	memset(u,0,sizeof(sleftv));
4529	return FALSE;
4530	}
4531	leftv v=u->next;
4532	BOOLEAN b;
4533	if(v==NULL)
4534	b=iiExprArith1(res,u,iiOp);
4535	else
4536	{
4537	u->next=NULL;
4538	b=iiExprArith2(res,u,iiOp,v);
4539	u->next=v;
4540	}
4541	return b;
4542	}
4543	static BOOLEAN jjLIST_PL(leftv res, leftv v)
4544	{
4545	int sl=0;
4546	if (v!=NULL) sl = v->listLength();
4547	lists L;
4548	if((sl==1)&&(v->Typ()==RESOLUTION_CMD))
4549	{
4550	L=syConvRes((syStrategy)v->Data());
4551	}
4552	else
4553	{
4554	L=(lists)Alloc(sizeof(slists));
4555	leftv h=NULL;
4556	int i;
4557	int rt;
4558
4559	L->Init(sl);
4560	for (i=0;i<sl;i++)
4561	{
4562	if (h!=NULL) { /* e.g. not in the first step:
4563	* h is the pointer to the old sleftv,
4564	* v is the pointer to the next sleftv
4565	* (in this moment) */
4566	h->next=v;
4567	}
4568	h=v;
4569	v=v->next;
4570	h->next=NULL;
4571	rt=h->Typ();
4572	if (rt==0)
4573	{
4574	L->Clean();
4575	Werror("`%s` is undefined",h->Fullname());
4576	return TRUE;
4577	}
4578	if ((rt==RING_CMD)\|\|(rt==QRING_CMD))
4579	{
4580	L->m[i].rtyp=rt;
4581	L->m[i].data=h->Data();
4582	((ring)L->m[i].data)->ref++;
4583	}
4584	else
4585	L->m[i].Copy(h);
4586	}
4587	}
4588	res->data=(char *)L;
4589	return FALSE;
4590	}
4591	static BOOLEAN jjNAMES0(leftv res, leftv v)
4592	{
4593	res->data=(void *)ipNameList(IDROOT);
4594	return FALSE;
4595	}
4596	static BOOLEAN jjOPTION_PL(leftv res, leftv v)
4597	{
4598	if(v==NULL)
4599	{
4600	res->data=(char *)showOption();
4601	return FALSE;
4602	}
4603	res->rtyp=NONE;
4604	return setOption(res,v);
4605	}
4606	static BOOLEAN jjRESERVED0(leftv res, leftv v)
4607	{
4608	int i=1;
4609	loop
4610	{
4611	Print("%-20s",cmds[i].name);
4612	i++;
4613	if(cmds[i].name==NULL)
4614	break;
4615	if ((i%3)==1) PrintLn();
4616	}
4617	PrintLn();
4618	return FALSE;
4619	}
4620	static BOOLEAN jjSTRING_PL(leftv res, leftv v)
4621	{
4622	if (v == NULL)
4623	{
4624	res->data = mstrdup("");
4625	return FALSE;
4626	}
4627	int n = v->listLength();
4628	if (n == 1)
4629	{
4630	res->data = v->String();
4631	return FALSE;
4632	}
4633
4634	char slist = (char) Alloc(nsizeof(char));
4635	int i, j;
4636
4637	for (i=0, j=0; i<n; i++, v = v ->next)
4638	{
4639	slist[i] = v->String();
4640	assume(slist[i] != NULL);
4641	j+=strlen(slist[i]);
4642	}
4643	char* s = (char) AllocL((j+1)sizeof(char));
4644	*s='\0';
4645	for (i=0;i<n;i++)
4646	{
4647	strcat(s, slist[i]);
4648	FreeL(slist[i]);
4649	}
4650	Free(slist, nsizeof(char));
4651	res->data = s;
4652	return FALSE;
4653	}
4654	static BOOLEAN jjTEST(leftv res, leftv v)
4655	{
4656	do
4657	{
4658	if (v->Typ()!=INT_CMD)
4659	return TRUE;
4660	test_cmd((int)v->Data());
4661	v=v->next;
4662	}
4663	while (v!=NULL);
4664	return FALSE;
4665	}
4666
4667	#ifndef __MWERKS__
4668	static BOOLEAN jjSTATUS_M(leftv res, leftv v)
4669	{
4670	if ((v->Typ() != LINK_CMD) \|\|
4671	(v->next->Typ() != STRING_CMD) \|\|
4672	(v->next->next->Typ() != STRING_CMD) \|\|
4673	(v->next->next->next->Typ() != INT_CMD))
4674	return TRUE;
4675	jjSTATUS3(res, v, v->next, v->next->next);
4676	#if defined(HAVE_USLEEP)
4677	if (((int) res->data) == 0)
4678	{
4679	int i_s = (int) v->next->next->next->Data();
4680	if (i_s > 0)
4681	{
4682	usleep((int) v->next->next->next->Data());
4683	jjSTATUS3(res, v, v->next, v->next->next);
4684	}
4685	}
4686	#elif defined(HAVE_SLEEP)
4687	if (((int) res->data) == 0)
4688	{
4689	int i_s = (int) v->next->next->next->Data();
4690	if (i_s > 0)
4691	{
4692	sleep((is - 1)/1000000 + 1);
4693	jjSTATUS3(res, v, v->next, v->next->next);
4694	}
4695	}
4696	#endif
4697	return FALSE;
4698	}
4699	#endif
4700
4701	#ifdef HAVE_NAMESPACES
4702	static BOOLEAN jjIMPORTFROM(leftv res, leftv v);
4703
4704	static BOOLEAN jjEXPORTTO(leftv res, leftv v)
4705	{
4706	BOOLEAN nok=TRUE;
4707	leftv u=v;
4708	if(u->rtyp==NSHDL)
4709	{
4710	namehdl ns = (namehdl)(u->data);
4711	idhdl h = namespaceroot->root->get(ns->name, 0, TRUE);
4712	//Print("Export to '%s', lev %d\n", ns->name, ns->myynest);
4713	while(v->next!=NULL)
4714	{
4715	nok = iiInternalExport(v->next, ns->myynest, h);
4716	if(nok) { return nok; }
4717
4718	v = v->next;
4719	}
4720	return FALSE;
4721	}
4722	if(u->Typ()==PACKAGE_CMD)
4723	{
4724	//PrintS("export to package\n");
4725	while(v->next!=NULL)
4726	{
4727	nok = iiInternalExport(v->next, 0, u->data);
4728	if(nok) return nok;
4729	v = v->next;
4730	}
4731	return FALSE;
4732	}
4733	return TRUE;
4734	}
4735	#endif /* HAVE_NAMESPACES */
4736	#ifdef HAVE_NAMESPACES
4737	static BOOLEAN jjIMPORTFROM(leftv res, leftv v)
4738	{
4739	BOOLEAN nok=FALSE;
4740	PrintS("jjIMPORT_FROM()\n");
4741	if(v->rtyp==NSHDL)
4742	{
4743	PrintS("Import from toplevel\n");
4744	//While-schleife!!!
4745	return FALSE;
4746	}
4747	if(v->Typ()==PACKAGE_CMD)
4748	{
4749	Print("Import from package %s\n", v->name);
4750	while(v->next!=NULL)
4751	{
4752	//nok = iiInternalImport(v->next, 0, v->data);
4753	if(nok) return nok;
4754	v = v->next;
4755	}
4756	return FALSE;
4757	}
4758	return TRUE;
4759	}
4760	#endif
4761	#ifdef HAVE_NAMESPACES
4762	static BOOLEAN jjUNLOAD(leftv res, leftv v)
4763	{
4764	if(v->Typ()==PACKAGE_CMD)
4765	{
4766	char *typ;
4767	idhdl h = (idhdl)v->data;
4768	package d=(package)v->Data();
4769	switch (d->language)
4770	{
4771	case LANG_C:
4772	typ="object";
4773	break;
4774	case LANG_SINGULAR:
4775	case LANG_NONE:
4776	default:
4777	killhdl(h);
4778	}
4779	return FALSE;
4780	}
4781	return TRUE;
4782	}
4783	#endif
4784	/=================== operations with many arg.: table =================/
4785	/* number_of_args: -1: any, -2: any >0, .. */
4786	struct sValCmdM dArithM[]=
4787	{
4788	// operations:
4789	// proc cmd res number_of_args
4790	{jjKLAMMER_PL, '(', ANY_TYPE, -2 }
4791	,{jjCALL2ARG, COEF_CMD, MATRIX_CMD, 2 }
4792	,{jjCOEF_M, COEF_CMD, NONE, 4 }
4793	,{jjDBPRINT, DBPRINT_CMD, NONE, -2 }
4794	,{jjCALL1ARG, IDEAL_CMD, IDEAL_CMD, 1 }
4795	,{jjIDEAL_PL, IDEAL_CMD, IDEAL_CMD, -1 }
4796	,{jjCALL2ARG, INTERSECT_CMD, IDEAL_CMD, 2 }
4797	,{jjINTERSECT_PL,INTERSECT_CMD, IDEAL_CMD, -2 }
4798	,{jjCALL1ARG, INTVEC_CMD, INTVEC_CMD, 1 }
4799	,{jjINTVEC_PL, INTVEC_CMD, INTVEC_CMD, -1 }
4800	,{jjLIST_PL, LIST_CMD, LIST_CMD, -1 }
4801	,{jjCALL1ARG, MODUL_CMD, MODUL_CMD, 1 }
4802	,{jjIDEAL_PL, MODUL_CMD, MODUL_CMD, -1 }
4803	,{jjCALL1ARG, NAMES_CMD, LIST_CMD, 1 }
4804	,{jjNAMES0, NAMES_CMD, LIST_CMD, 0 }
4805	,{jjOPTION_PL, OPTION_CMD, STRING_CMD/or set by p/,-1 }
4806	,{jjCALL1ARG, RESERVEDNAME_CMD, INT_CMD, 1 }
4807	,{jjRESERVED0, RESERVEDNAME_CMD, NONE, 0 }
4808	,{jjSTRING_PL, STRING_CMD, STRING_CMD, -1 }
4809	,{jjSYSTEM, SYSTEM_CMD, NONE/or set by p/,-2 }
4810	,{jjTEST, TEST_CMD, NONE, -2 }
4811	,{iiWRITE, WRITE_CMD, NONE, -2 }
4812	,{jjCALL2ARG, STATUS_CMD, STRING_CMD, 2 }
4813	,{jjCALL3ARG, STATUS_CMD, INT_CMD, 3 }
4814	#ifndef __MWERKS__
4815	,{jjSTATUS_M, STATUS_CMD, INT_CMD, 4 }
4816	#endif
4817	#ifdef HAVE_NAMESPACES
4818	,{jjIMPORTFROM,IMPORTFROM_CMD, ANY_TYPE, -2 }
4819	,{jjEXPORTTO, EXPORTTO_CMD, NONE, -2 }
4820	,{jjUNLOAD, UNLOAD_CMD, NONE, -2 }
4821	#endif /* HAVE_NAMESPACES */
4822	,{nuUResSolve, URSOLVE_CMD, LIST_CMD, 4 }
4823	,{NULL, 0, 0, 0 }
4824	};
4825	#ifdef MDEBUG
4826	static Subexpr jjDBMakeSub(leftv e,char *f, int l)
4827	#else
4828	static Subexpr jjMakeSub(leftv e)
4829	#endif
4830	{
4831	// assume: e->Typ()==INT_CMD
4832	#ifdef MDEBUG
4833	Subexpr r=(Subexpr)mmDBAllocBlock0(sizeof(*r),f,l);
4834	#else
4835	Subexpr r=(Subexpr)Alloc0(sizeof(*r));
4836	#endif
4837	r->start =(int)e->Data();
4838	return r;
4839	}
4840
4841	/================ generating tables ============================/
4842	#ifdef GENTABLE
4843	extern struct sValAssign dAssign[];
4844	struct sValCmdTab dArithTab1[]={ {0,0}};
4845	#define JJTAB1LEN 0
4846	struct sValCmdTab dArithTab2[]={ {0,0}};
4847	#define JJTAB2LEN 0
4848	void ttGen1()
4849	{
4850	FILE *outfile = myfopen("iparith.inc","w");
4851	int i,j,l1=0,l2=0;
4852	currRing=(ring)Alloc(sizeof(*currRing));
4853	fprintf(outfile,
4854	"/****************************************\n"
4855	"* Computer Algebra System SINGULAR *\n"
4856	"****************************************/\n\n");
4857	/-------------------------------------------------------------------/
4858	fprintf(outfile,"// syntax table for Singular\n//\n");
4859	fprintf(outfile,"// - search for an exact match of the argument types\n");
4860	fprintf(outfile,"// - otherwise search for the first possibility\n");
4861	fprintf(outfile,"// with converted types of the arguments\n");
4862	fprintf(outfile,"// - otherwise report an error\n//\n");
4863
4864	int op;
4865	i=0;
4866	while ((op=dArith1[i].cmd)!=0)
4867	{
4868	if (dArith1[i].p==jjWRONG)
4869	fprintf(outfile,"// DUMMY ");
4870	char *s = iiTwoOps(op);
4871	fprintf(outfile,"// operation: %s (%s) -> %s\n",
4872	s,
4873	Tok2Cmdname(dArith1[i].arg),
4874	Tok2Cmdname(ABS(dArith1[i].res)));
4875	i++;
4876	}
4877	fprintf(outfile,"/---------------------------------------------/\n");
4878	i=0;
4879	while ((op=dArith2[i].cmd)!=0)
4880	{
4881	if (dArith2[i].p==jjWRONG2)
4882	fprintf(outfile,"// DUMMY ");
4883	char *s = iiTwoOps(op);
4884	fprintf(outfile,"// operation: %s (%s, %s) -> %s\n",
4885	s,
4886	Tok2Cmdname(dArith2[i].arg1),
4887	Tok2Cmdname(dArith2[i].arg2),
4888	Tok2Cmdname(dArith2[i].res));
4889	i++;
4890	}
4891	fprintf(outfile,"/---------------------------------------------/\n");
4892	i=0;
4893	while ((op=dArith3[i].cmd)!=0)
4894	{
4895	char *s = iiTwoOps(op);
4896	if (dArith3[i].p==jjWRONG3)
4897	fprintf(outfile,"// DUMMY ");
4898	fprintf(outfile,"// operation: %s (%s, %s, %s) -> %s\n",
4899	s,
4900	Tok2Cmdname(dArith3[i].arg1),
4901	Tok2Cmdname(dArith3[i].arg2),
4902	Tok2Cmdname(dArith3[i].arg3),
4903	Tok2Cmdname(dArith3[i].res));
4904	i++;
4905	}
4906	fprintf(outfile,"/---------------------------------------------/\n");
4907	i=0;
4908	while ((op=dArithM[i].cmd)!=0)
4909	{
4910	char *s = iiTwoOps(op);
4911	fprintf(outfile,"// operation: %s (...) -> %s",
4912	s,
4913	Tok2Cmdname(dArithM[i].res));
4914	switch(dArithM[i].number_of_args)
4915	{
4916	case -2:
4917	fprintf(outfile," ( number of arguments >0 )\n");
4918	break;
4919	case -1:
4920	fprintf(outfile," ( any number of arguments )\n");
4921	break;
4922	default:
4923	fprintf(outfile," ( %d arguments )\n",dArithM[i].number_of_args);
4924	break;
4925	}
4926	i++;
4927	}
4928	fprintf(outfile,"/---------------------------------------------/\n");
4929	i=0;
4930	while ((op=dAssign[i].res)!=0)
4931	{
4932	fprintf(outfile,"// assign: %s = %s\n",
4933	Tok2Cmdname(op/dAssign[i].res/),
4934	Tok2Cmdname(dAssign[i].arg));
4935	i++;
4936	}
4937	/-------------------------------------------------------------------/
4938	fprintf(outfile,"/---------------------------------------------/\n");
4939	for (j=257;j<=MAX_TOK+1;j++)
4940	{
4941	for(i=257;i<=MAX_TOK+1;i++)
4942	{
4943	if ((i!=j) && (j!=IDHDL) && (j!=DEF_CMD) && (j!=ANY_TYPE)
4944	&& iiTestConvert(i,j))
4945	{
4946	fprintf(outfile,"// convert %s -> %s\n",
4947	Tok2Cmdname(i), Tok2Cmdname(j));
4948	if (j==ANY_TYPE) break;
4949	}
4950	}
4951	}
4952	fprintf(outfile,"/---------------------------------------------/\n");
4953	char ops[]="=><+*/[.^,%(;";
4954	for(i=0;ops[i]!='\0';i++)
4955	fprintf(outfile,"// token %d : %c\n", (int)ops[i], ops[i]);
4956	for (i=257;i<=MAX_TOK;i++)
4957	{
4958	char *s=iiTwoOps(i);
4959	if (s[0]!='$')
4960	{
4961	fprintf(outfile,"// token %d : %s\n", i, s);
4962	}
4963	}
4964	/-------------------------------------------------------------------/
4965	fprintf(outfile,"/--max. token: %d, gr: %d --/\n",MAX_TOK,UMINUS);
4966	/-------------------------------------------------------------------/
4967	fprintf(outfile,"/---------------------------------------------/\n");
4968	fprintf(outfile,
4969	"struct sValCmdTab dArithTab1[]=\n"
4970	"{\n");
4971	for (j=1;j<=MAX_TOK+1;j++)
4972	{
4973	for(i=0;dArith1[i].cmd!=0;i++)
4974	{
4975	if (dArith1[i].cmd==j)
4976	{
4977	fprintf(outfile," { %d,%d },\n",j,i);
4978	l1++;
4979	break;
4980	}
4981	}
4982	}
4983	fprintf(outfile," { 10000,0 }\n};\n");
4984	fprintf(outfile,"#define JJTAB1LEN %d\n",l1);
4985	/-------------------------------------------------------------------/
4986	fprintf(outfile,
4987	"struct sValCmdTab dArithTab2[]=\n"
4988	"{\n");
4989	for (j=1;j<=MAX_TOK+1;j++)
4990	{
4991	for(i=0;dArith2[i].cmd!=0;i++)
4992	{
4993	if (dArith2[i].cmd==j)
4994	{
4995	fprintf(outfile," { %d,%d },\n",j,i);
4996	l2++;
4997	break;
4998	}
4999	}
5000	}
5001	fprintf(outfile," { 10000,0 }\n};\n");
5002	fprintf(outfile,"#define JJTAB2LEN %d\n",l2);
5003	fclose(outfile);
5004	}
5005	/-------------------------------------------------------------------/
5006	void ttGen2()
5007	{
5008	FILE *outfile = myfopen("iparith.inc","a");
5009	fprintf(outfile,
5010	"/****************************************\n"
5011	"* Computer Algebra System SINGULAR *\n"
5012	"****************************************/\n\n");
5013	/-------------------------------------------------------------------/
5014	fprintf(outfile,"// identifier table for Singular\n//\n");
5015
5016	fprintf(outfile,
5017	"cmdnames cmds[] =\n"
5018	"{ // name-string alias tokval toktype\n"
5019	"{ \"$INVALID$\", 0, -1, 0},\n");
5020	int i=1;
5021	int m=-1;
5022	int id_nr=0;
5023	BOOLEAN f=FALSE;
5024	loop
5025	{
5026	while (cmds[i].tokval!=0)
5027	{
5028	if ((cmds[i].tokval!=-1)&&(cmds[i].name!=NULL))
5029	{
5030	if(m==-1)
5031	{
5032	m=i;
5033	f=TRUE;
5034	}
5035	else if(strcmp(cmds[m].name,cmds[i].name)>0)
5036	{
5037	m=i;
5038	f=TRUE;
5039	}
5040	}
5041	i++;
5042	}
5043	if(f)
5044	{
5045	id_nr++;
5046	if(cmds[m].tokval==VRTIMER) fprintf(outfile,"#ifdef HAVE_RTIMER\n");
5047	fprintf(outfile," {\"%s\", %*d, %3d, ",cmds[m].name,
5048	20-strlen(cmds[m].name),
5049	cmds[m].alias,
5050	cmds[m].tokval);
5051	switch(cmds[m].toktype)
5052	{
5053	case CMD_1: fprintf(outfile,"CMD_1 },\n"); break;
5054	case CMD_2: fprintf(outfile,"CMD_2 },\n"); break;
5055	case CMD_3: fprintf(outfile,"CMD_3 },\n"); break;
5056	case CMD_12: fprintf(outfile,"CMD_12 },\n"); break;
5057	case CMD_123 : fprintf(outfile,"CMD_123 },\n"); break;
5058	case CMD_23: fprintf(outfile,"CMD_23 },\n"); break;
5059	case CMD_M: fprintf(outfile,"CMD_M },\n"); break;
5060	case SYSVAR: fprintf(outfile,"SYSVAR },\n"); break;
5061	case ROOT_DECL: fprintf(outfile,"ROOT_DECL },\n"); break;
5062	case ROOT_DECL_LIST: fprintf(outfile,"ROOT_DECL_LIST },\n"); break;
5063	case RING_DECL: fprintf(outfile,"RING_DECL },\n"); break;
5064	case NONE: fprintf(outfile,"NONE },\n"); break;
5065	default: if((cmds[m].toktype>' ')
5066	&&(cmds[m].toktype<127))
5067	{
5068	fprintf(outfile,"'%c' },\n",cmds[m].toktype);
5069	}
5070	else
5071	{
5072	fprintf(outfile,"%d },\n",cmds[m].toktype);
5073	}
5074	break;
5075	}
5076	if(cmds[m].tokval==VRTIMER) fprintf(outfile,"#endif\n");
5077	cmds[m].name=NULL;
5078	m=-1;
5079	i=1;
5080	f=FALSE;
5081	}
5082	else break;
5083	}
5084	fprintf(outfile,
5085	"/* list of scanner identifiers/only for feread/reservedName */\n");
5086	f=FALSE;
5087	i=1;m=-1;
5088	loop
5089	{
5090	while (cmds[i].tokval!=0)
5091	{
5092	if (cmds[i].name!=NULL)
5093	{
5094	if(m==-1)
5095	{
5096	m=i;
5097	f=TRUE;
5098	}
5099	else if(strcmp(cmds[m].name,cmds[i].name)>0)
5100	{
5101	m=i;
5102	f=TRUE;
5103	}
5104	}
5105	i++;
5106	}
5107	if(f)
5108	{
5109	fprintf(outfile," {\"%s\", %*d, -1, 0 },\n",cmds[m].name,
5110	20-strlen(cmds[m].name),
5111	0/cmds[m].alias/
5112	/-1 cmds[m].tokval/
5113	/0 cmds[m].toktype/);
5114	cmds[m].name=NULL;
5115	m=-1;
5116	i=1;
5117	f=FALSE;
5118	}
5119	else break;
5120	}
5121	fprintf(outfile,
5122	"/* end of list marker */\n"
5123	" { NULL, 0, 0, 0}\n"
5124	"};\n"
5125	"#ifdef HAVE_RTIMER\n"
5126	"#define LAST_IDENTIFIER %d\n"
5127	"#else\n"
5128	"#define LAST_IDENTIFIER %d\n"
5129	"#endif\n",id_nr,id_nr-1);
5130	fclose(outfile);
5131	}
5132	/-------------------------------------------------------------------/
5133	#if 0
5134	void ttGen3()
5135	{
5136	FILE *outfile = myfopen("mpsr_tok.inc","w");
5137	fprintf(outfile,
5138	"/****************************************\n"
5139	"* Computer Algebra System SINGULAR *\n"
5140	"****************************************/\n\n");
5141	/-------------------------------------------------------------------/
5142	fprintf(outfile,"// token table for Singular\n//\n");
5143
5144	fprintf(outfile,
5145	"short vtok[] =\n"
5146	"{\n");
5147	// operations with 1 arg: ===========================================
5148	int i=0;
5149	while (dArith1[i].cmd!=0)
5150	{
5151	if ((dArith1[i].p!=jjWRONG)
5152	&&((i==0)\|\|(dArith1[i].cmd!=dArith1[i-1].cmd)))
5153	{
5154	fprintf(outfile," %d,\n",dArith1[i].cmd);
5155	}
5156	i++;
5157	}
5158	// operations with 2 args: ===========================================
5159	i=0;
5160	while (dArith2[i].cmd!=0)
5161	{
5162	if ((dArith2[i].p!=jjWRONG2)
5163	&&((i==0)\|\|(dArith2[i].cmd!=dArith2[i-1].cmd)))
5164	{
5165	fprintf(outfile," %d,\n",dArith2[i].cmd);
5166	}
5167	i++;
5168	}
5169	// operations with 3 args: ===========================================
5170	i=0;
5171	while (dArith3[i].cmd!=0)
5172	{
5173	if (
5174	((i==0)\|\|(dArith3[i].cmd!=dArith3[i-1].cmd)))
5175	{
5176	fprintf(outfile," %d,\n",dArith3[i].cmd);
5177	}
5178	i++;
5179	}
5180	// operations with many args: ===========================================
5181	i=0;
5182	while (dArithM[i].cmd!=0)
5183	{
5184	if (
5185	((i==0)\|\|(dArithM[i].cmd!=dArithM[i-1].cmd)))
5186	{
5187	fprintf(outfile," %d,\n",dArithM[i].cmd);
5188	}
5189	i++;
5190	}
5191	// ====================================================================
5192	fprintf(outfile,
5193	"/* end of list marker */\n"
5194	" %d };\n",MAX_TOK);
5195	fclose(outfile);
5196	}
5197	#endif
5198	/-------------------------------------------------------------------/
5199	#else
5200	#include "iparith.inc"
5201	#endif
5202
5203	/=================== operations with 2 args. ============================/
5204
5205	BOOLEAN iiExprArith2(leftv res, leftv a, int op, leftv b, BOOLEAN proccall)
5206	{
5207	#ifndef GENTABLE
5208	memset(res,0,sizeof(sleftv));
5209
5210	if (!errorreported)
5211	{
5212	#ifdef SIQ
5213	if (siq>0)
5214	{
5215	//Print("siq:%d\n",siq);
5216	command d=(command)Alloc0(sizeof(ip_command));
5217	memcpy(&d->arg1,a,sizeof(sleftv));
5218	memcpy(&d->arg2,b,sizeof(sleftv));
5219	d->argc=2;
5220	d->op=op;
5221	res->data=(char *)d;
5222	res->rtyp=COMMAND;
5223	return FALSE;
5224	}
5225	#endif
5226	int at=a->Typ();
5227	int bt=b->Typ();
5228	int i=iiTabIndex(dArithTab2,JJTAB2LEN,op);
5229	int index=i;
5230
5231	iiOp=op;
5232	while (dArith2[i].cmd==op)
5233	{
5234	if ((at==dArith2[i].arg1)
5235	&& (bt==dArith2[i].arg2))
5236	{
5237	res->rtyp=dArith2[i].res;
5238	if (dArith2[i].p(res,a,b))
5239	{
5240	break;// leave loop, goto error handling
5241	}
5242	a->CleanUp();
5243	b->CleanUp();
5244	//Print("op: %d,result typ:%d\n",op,res->rtyp);
5245	return FALSE;
5246	}
5247	i++;
5248	}
5249	// implicite type conversion ----------------------------------------------
5250	if (dArith2[i].cmd!=op)
5251	{
5252	int ai,bi;
5253	leftv an = (leftv)Alloc0(sizeof(sleftv));
5254	leftv bn = (leftv)Alloc0(sizeof(sleftv));
5255	BOOLEAN failed=FALSE;
5256	i=index; /iiTabIndex(dArithTab2,JJTAB2LEN,op);/
5257	//Print("op: %c, type: %s %s\n",op,Tok2Cmdname(at),Tok2Cmdname(bt));
5258	while (dArith2[i].cmd==op)
5259	{
5260	//Print("test %s %s\n",Tok2Cmdname(dArith2[i].arg1),Tok2Cmdname(dArith2[i].arg2));
5261	if ((ai=iiTestConvert(at,dArith2[i].arg1))!=0)
5262	{
5263	if ((bi=iiTestConvert(bt,dArith2[i].arg2))!=0)
5264	{
5265	res->rtyp=dArith2[i].res;
5266	failed= ((iiConvert(at,dArith2[i].arg1,ai,a,an))
5267	\|\| (iiConvert(bt,dArith2[i].arg2,bi,b,bn))
5268	\|\| (dArith2[i].p(res,an,bn)));
5269	// everything done, clean up temp. variables
5270	if (failed)
5271	{
5272	// leave loop, goto error handling
5273	break;
5274	}
5275	else
5276	{
5277	// everything ok, clean up and return
5278	an->CleanUp();
5279	bn->CleanUp();
5280	Free((ADDRESS)an,sizeof(sleftv));
5281	Free((ADDRESS)bn,sizeof(sleftv));
5282	a->CleanUp();
5283	b->CleanUp();
5284	return FALSE;
5285	}
5286	}
5287	}
5288	i++;
5289	}
5290	an->CleanUp();
5291	bn->CleanUp();
5292	Free((ADDRESS)an,sizeof(sleftv));
5293	Free((ADDRESS)bn,sizeof(sleftv));
5294	}
5295	// error handling ---------------------------------------------------
5296	const char *s=NULL;
5297	if (!errorreported)
5298	{
5299	if ((at==0) && (a->Fullname()!=sNoName))
5300	{
5301	s=a->Fullname();
5302	}
5303	else if ((bt==0) && (b->Fullname()!=sNoName))
5304	{
5305	s=b->Fullname();
5306	}
5307	if (s!=NULL)
5308	Werror("`%s` is not defined",s);
5309	else
5310	{
5311	i=index; /iiTabIndex(dArithTab2,JJTAB2LEN,op);/
5312	s = iiTwoOps(op);
5313	if (proccall)
5314	{
5315	Werror("%s(`%s`,`%s`) is not supported"
5316	,s,Tok2Cmdname(at),Tok2Cmdname(bt));
5317	}
5318	else
5319	{
5320	Werror("`%s` %s `%s` is not supported"
5321	,Tok2Cmdname(at),s,Tok2Cmdname(bt));
5322	}
5323	if (BVERBOSE(V_SHOW_USE))
5324	{
5325	while (dArith2[i].cmd==op)
5326	{
5327	if(((at==dArith2[i].arg1)\|\|(bt==dArith2[i].arg2))
5328	&& (dArith2[i].res!=0)
5329	&& (dArith2[i].p!=jjWRONG2))
5330	{
5331	if (proccall)
5332	Werror("expected %s(`%s`,`%s`)"
5333	,s,Tok2Cmdname(dArith2[i].arg1),Tok2Cmdname(dArith2[i].arg2));
5334	else
5335	Werror("expected `%s` %s `%s`"
5336	,Tok2Cmdname(dArith2[i].arg1),s,Tok2Cmdname(dArith2[i].arg2));
5337	}
5338	i++;
5339	}
5340	}
5341	}
5342	}
5343	res->rtyp = UNKNOWN;
5344	}
5345	a->CleanUp();
5346	b->CleanUp();
5347	#endif
5348	return TRUE;
5349	}
5350
5351	/==================== operations with 1 arg. ===============================/
5352
5353	BOOLEAN iiExprArith1(leftv res, leftv a, int op)
5354	{
5355	#ifndef GENTABLE
5356	memset(res,0,sizeof(sleftv));
5357
5358	if (!errorreported)
5359	{
5360	#ifdef SIQ
5361	if (siq>0)
5362	{
5363	//Print("siq:%d\n",siq);
5364	command d=(command)Alloc0(sizeof(ip_command));
5365	memcpy(&d->arg1,a,sizeof(sleftv));
5366	d->op=op;
5367	d->argc=1;
5368	res->data=(char *)d;
5369	res->rtyp=COMMAND;
5370	return FALSE;
5371	}
5372	#endif
5373	int at=a->Typ();
5374	BOOLEAN failed=FALSE;
5375
5376	iiOp=op;
5377	int i=iiTabIndex(dArithTab1,JJTAB1LEN,op);
5378	int ti = i;
5379	while (dArith1[i].cmd==op)
5380	{
5381	if (at==dArith1[i].arg)
5382	{
5383	res->rtyp=dArith1[i].res;
5384	if (dArith1[i].res<0)
5385	{
5386	res->rtyp=-res->rtyp;
5387	#ifdef PROC_BUG
5388	dArith1[i].p(res,a);
5389	#else
5390	res->data=(char )((Proc1)dArith1[i].p)((char )a->Data());
5391	#endif
5392	}
5393	else if (dArith1[i].p(res,a))
5394	{
5395	break;// leave loop, goto error handling
5396	}
5397	if (a->Next()!=NULL)
5398	{
5399	res->next=(leftv)Alloc(sizeof(sleftv));
5400	failed=iiExprArith1(res->next,a->next,op);
5401	}
5402	a->CleanUp();
5403	return failed;
5404	}
5405	i++;
5406	}
5407	// implicite type conversion --------------------------------------------
5408	if (dArith1[i].cmd!=op)
5409	{
5410	int ai;
5411	leftv an = (leftv)Alloc0(sizeof(sleftv));
5412	i=ti;
5413	//Print("fuer %c , typ: %s\n",op,Tok2Cmdname(at));
5414	while (dArith1[i].cmd==op)
5415	{
5416	//Print("test %s\n",Tok2Cmdname(dArith1[i].arg));
5417	if ((ai=iiTestConvert(at,dArith1[i].arg))!=0)
5418	{
5419	res->rtyp=dArith1[i].res;
5420	if (dArith1[i].res<0)
5421	{
5422	res->rtyp=-res->rtyp;
5423	failed= iiConvert(at,dArith1[i].arg,ai,a,an);
5424	if (!failed)
5425	{
5426	#ifdef PROC_BUG
5427	dArith1[i].p(res,a);
5428	#else
5429	res->data=(char )((Proc1)dArith1[i].p)((char )an->Data());
5430	#endif
5431	}
5432	}
5433	else
5434	{
5435	failed= ((iiConvert(at,dArith1[i].arg,ai,a,an))
5436	\|\| (dArith1[i].p(res,an)));
5437	}
5438	// everything done, clean up temp. variables
5439	if (failed)
5440	{
5441	// leave loop, goto error handling
5442	break;
5443	}
5444	else
5445	{
5446	if (an->Next() != NULL)
5447	{
5448	res->next = (leftv)Alloc(sizeof(sleftv));
5449	failed=iiExprArith1(res->next,an->next,op);
5450	}
5451	// everything ok, clean up and return
5452	an->CleanUp();
5453	Free((ADDRESS)an,sizeof(sleftv));
5454	a->CleanUp();
5455	return failed;
5456	}
5457	}
5458	i++;
5459	}
5460	an->CleanUp();
5461	Free((ADDRESS)an,sizeof(sleftv));
5462	}
5463	// error handling
5464	if (!errorreported)
5465	{
5466	if ((at==0) && (a->Fullname()!=sNoName))
5467	{
5468	Werror("`%s` is not defined",a->Fullname());
5469	}
5470	else
5471	{
5472	i=ti;
5473	char *s = iiTwoOps(op);
5474	Werror("%s(`%s`) is not supported"
5475	,s,Tok2Cmdname(at));
5476	if (BVERBOSE(V_SHOW_USE))
5477	{
5478	while (dArith1[i].cmd==op)
5479	{
5480	if ((dArith1[i].res!=0)
5481	&& (dArith1[i].p!=jjWRONG))
5482	Werror("expected %s(`%s`)"
5483	,s,Tok2Cmdname(dArith1[i].arg));
5484	i++;
5485	}
5486	}
5487	}
5488	}
5489	res->rtyp = UNKNOWN;
5490	}
5491	a->CleanUp();
5492	#endif
5493	return TRUE;
5494	}
5495
5496	/=================== operations with 3 args. ============================/
5497
5498	BOOLEAN iiExprArith3(leftv res, int op, leftv a, leftv b, leftv c)
5499	{
5500	#ifndef GENTABLE
5501	memset(res,0,sizeof(sleftv));
5502
5503	if (!errorreported)
5504	{
5505	#ifdef SIQ
5506	if (siq>0)
5507	{
5508	//Print("siq:%d\n",siq);
5509	command d=(command)Alloc0(sizeof(ip_command));
5510	memcpy(&d->arg1,a,sizeof(sleftv));
5511	memcpy(&d->arg2,b,sizeof(sleftv));
5512	memcpy(&d->arg3,c,sizeof(sleftv));
5513	d->op=op;
5514	d->argc=3;
5515	res->data=(char *)d;
5516	res->rtyp=COMMAND;
5517	return FALSE;
5518	}
5519	#endif
5520	int at=a->Typ();
5521	int bt=b->Typ();
5522	int ct=c->Typ();
5523
5524	iiOp=op;
5525	int i=0;
5526	while ((dArith3[i].cmd!=op)&&(dArith3[i].cmd!=0)) i++;
5527	while (dArith3[i].cmd==op)
5528	{
5529	if ((at==dArith3[i].arg1)
5530	&& (bt==dArith3[i].arg2)
5531	&& (ct==dArith3[i].arg3))
5532	{
5533	res->rtyp=dArith3[i].res;
5534	if (dArith3[i].p(res,a,b,c))
5535	{
5536	break;// leave loop, goto error handling
5537	}
5538	a->CleanUp();
5539	b->CleanUp();
5540	c->CleanUp();
5541	return FALSE;
5542	}
5543	i++;
5544	}
5545	// implicite type conversion ----------------------------------------------
5546	if (dArith3[i].cmd!=op)
5547	{
5548	int ai,bi,ci;
5549	leftv an = (leftv)Alloc0(sizeof(sleftv));
5550	leftv bn = (leftv)Alloc0(sizeof(sleftv));
5551	leftv cn = (leftv)Alloc0(sizeof(sleftv));
5552	BOOLEAN failed=FALSE;
5553	i=0;
5554	while ((dArith3[i].cmd!=op)&&(dArith3[i].cmd!=0)) i++;
5555	while (dArith3[i].cmd==op)
5556	{
5557	if ((ai=iiTestConvert(at,dArith3[i].arg1))!=0)
5558	{
5559	if ((bi=iiTestConvert(bt,dArith3[i].arg2))!=0)
5560	{
5561	if ((ci=iiTestConvert(ct,dArith3[i].arg3))!=0)
5562	{
5563	res->rtyp=dArith3[i].res;
5564	failed= ((iiConvert(at,dArith3[i].arg1,ai,a,an))
5565	\|\| (iiConvert(bt,dArith3[i].arg2,bi,b,bn))
5566	\|\| (iiConvert(ct,dArith3[i].arg3,ci,c,cn))
5567	\|\| (dArith3[i].p(res,an,bn,cn)));
5568	// everything done, clean up temp. variables
5569	if (failed)
5570	{
5571	// leave loop, goto error handling
5572	break;
5573	}
5574	else
5575	{
5576	// everything ok, clean up and return
5577	an->CleanUp();
5578	bn->CleanUp();
5579	cn->CleanUp();
5580	Free((ADDRESS)an,sizeof(sleftv));
5581	Free((ADDRESS)bn,sizeof(sleftv));
5582	Free((ADDRESS)cn,sizeof(sleftv));
5583	a->CleanUp();
5584	b->CleanUp();
5585	c->CleanUp();
5586	//Print("op: %d,result typ:%d\n",op,res->rtyp);
5587	return FALSE;
5588	}
5589	}
5590	}
5591	}
5592	i++;
5593	}
5594	an->CleanUp();
5595	bn->CleanUp();
5596	cn->CleanUp();
5597	Free((ADDRESS)an,sizeof(sleftv));
5598	Free((ADDRESS)bn,sizeof(sleftv));
5599	Free((ADDRESS)cn,sizeof(sleftv));
5600	}
5601	// error handling ---------------------------------------------------
5602	if (!errorreported)
5603	{
5604	const char *s=NULL;
5605	if ((at==0) && (a->Fullname()!=sNoName))
5606	{
5607	s=a->Fullname();
5608	}
5609	else if ((bt==0) && (b->Fullname()!=sNoName))
5610	{
5611	s=b->Fullname();
5612	}
5613	else if ((ct==0) && (c->Fullname()!=sNoName))
5614	{
5615	s=c->Fullname();
5616	}
5617	if (s!=NULL)
5618	Werror("`%s` is not defined",s);
5619	else
5620	{
5621	i=0;
5622	while ((dArith3[i].cmd!=op)&&(dArith3[i].cmd!=0)) i++;
5623	char *s = iiTwoOps(op);
5624	Werror("%s(`%s`,`%s`,`%s`) is not supported"
5625	,s,Tok2Cmdname(at),Tok2Cmdname(bt),Tok2Cmdname(ct));
5626	if (BVERBOSE(V_SHOW_USE))
5627	{
5628	while (dArith3[i].cmd==op)
5629	{
5630	if(((at==dArith3[i].arg1)
5631	\|\|(bt==dArith3[i].arg2)
5632	\|\|(ct==dArith3[i].arg3))
5633	&& (dArith3[i].res!=0))
5634	{
5635	Werror("expected %s(`%s`,`%s`,`%s`)"
5636	,s,Tok2Cmdname(dArith3[i].arg1)
5637	,Tok2Cmdname(dArith3[i].arg2)
5638	,Tok2Cmdname(dArith3[i].arg3));
5639	}
5640	i++;
5641	}
5642	}
5643	}
5644	}
5645	res->rtyp = UNKNOWN;
5646	}
5647	a->CleanUp();
5648	b->CleanUp();
5649	c->CleanUp();
5650	//Print("op: %d,result typ:%d\n",op,res->rtyp);
5651	#endif
5652	return TRUE;
5653	}
5654	/==================== operations with many arg. ===============================/
5655
5656	BOOLEAN jjANY2LIST(leftv res, leftv v, int cnt)
5657	{
5658	// cnt = 0: all
5659	// cnt = 1: only first one
5660	leftv next;
5661	BOOLEAN failed = TRUE;
5662	if(v==NULL) return failed;
5663	res->rtyp = LIST_CMD;
5664	if(cnt) v->next = NULL;
5665	next = v->next; // saving next-pointer
5666	failed = jjLIST_PL(res, v);
5667	v->next = next; // writeback next-pointer
5668	return failed;
5669	}
5670
5671	BOOLEAN iiExprArithM(leftv res, leftv a, int op)
5672	{
5673	#ifndef GENTABLE
5674	memset(res,0,sizeof(sleftv));
5675
5676	if (!errorreported)
5677	{
5678	#ifdef SIQ
5679	if (siq>0)
5680	{
5681	//Print("siq:%d\n",siq);
5682	command d=(command)Alloc0(sizeof(ip_command));
5683	d->op=op;
5684	res->data=(char *)d;
5685	if (a!=NULL)
5686	{
5687	d->argc=a->listLength();
5688	// else : d->argc=0;
5689	memcpy(&d->arg1,a,sizeof(sleftv));
5690	switch(d->argc)
5691	{
5692	case 3:
5693	memcpy(&d->arg3,a->next->next,sizeof(sleftv));
5694	a->next->next->rtyp=0;
5695	a->next->next->data=NULL;
5696	a->next->next->name=NULL;
5697	a->next->next->attribute=NULL;
5698	case 2:
5699	memcpy(&d->arg2,a->next,sizeof(sleftv));
5700	a->next->rtyp=0;
5701	a->next->name=NULL;
5702	a->next->data=NULL;
5703	a->next->attribute=NULL;
5704	d->arg2.next=NULL;
5705	case 1:
5706	d->arg1.next=NULL;
5707	}
5708	if (d->argc>3) a->next=NULL;
5709	a->rtyp=0;
5710	a->data=NULL;
5711	a->name=NULL;
5712	a->CleanUp();
5713	}
5714	res->rtyp=COMMAND;
5715	return FALSE;
5716	}
5717	#endif
5718	BOOLEAN failed=FALSE;
5719	int args=0;
5720	if (a!=NULL) args=a->listLength();
5721
5722	iiOp=op;
5723	int i=0;
5724	while ((dArithM[i].cmd!=op)&&(dArithM[i].cmd!=0)) i++;
5725	int ii=i;
5726	while (dArithM[i].cmd==op)
5727	{
5728	if ((args==dArithM[i].number_of_args)
5729	\|\| (dArithM[i].number_of_args==-1)
5730	\|\| ((dArithM[i].number_of_args==-2)&&(args>0)))
5731	{
5732	res->rtyp=dArithM[i].res;
5733	if (dArithM[i].p(res,a))
5734	{
5735	break;// leave loop, goto error handling
5736	}
5737	if (a!=NULL) a->CleanUp();
5738	//Print("op: %d,result typ:%d\n",op,res->rtyp);
5739	return failed;
5740	}
5741	i++;
5742	}
5743	// error handling
5744	if (!errorreported)
5745	{
5746	if ((args>0) && (a->rtyp==0) && (a->Name()!=sNoName))
5747	{
5748	Werror("`%s` is not defined",a->Fullname());
5749	}
5750	else
5751	{
5752	char *s = iiTwoOps(op);
5753	Werror("%s(...) is not supported",s);
5754	}
5755	}
5756	res->rtyp = UNKNOWN;
5757	}
5758	if (a!=NULL) a->CleanUp();
5759	//Print("op: %d,result typ:%d\n",op,res->rtyp);
5760	#endif
5761	return TRUE;
5762	}
5763
5764	/=================== general utilities ============================/
5765	int IsCmd(char *n, int & tok)
5766	{
5767	int an=1;
5768	int i,v;
5769	#ifndef GENTABLE
5770	int en=LAST_IDENTIFIER;
5771
5772	loop
5773	{
5774	if(an>=en-1)
5775	{
5776	if (strcmp(n, cmds[an].name) == 0)
5777	{
5778	i=an;
5779	break;
5780	}
5781	else if ((an!=en) && (strcmp(n, cmds[en].name) == 0))
5782	{
5783	i=en;
5784	break;
5785	}
5786	else
5787	{
5788	return 0;
5789	}
5790	}
5791	i=(an+en)/2;
5792	if (n < (cmds[i].name))
5793	{
5794	en=i-1;
5795	}
5796	else if (n > (cmds[i].name))
5797	{
5798	an=i+1;
5799	}
5800	else
5801	{
5802	v=strcmp(n,cmds[i].name);
5803	if(v<0)
5804	{
5805	en=i-1;
5806	}
5807	else if(v>0)
5808	{
5809	an=i+1;
5810	}
5811	else /v==0/
5812	{
5813	break;
5814	}
5815	}
5816	}
5817	lastreserved=cmds[i].name;
5818	tok=cmds[i].tokval;
5819	if(cmds[i].alias==2)
5820	{
5821	Warn("outdated identifier `%s` used - please change your code",
5822	cmds[i].name);
5823	cmds[i].alias=1;
5824	}
5825	if (currRingHdl==NULL)
5826	{
5827	#ifdef SIQ
5828	if (siq<=0)
5829	{
5830	#endif
5831	if ((tok>=BEGIN_RING) && (tok<=END_RING))
5832	{
5833	WerrorS("no ring active");
5834	return 0;
5835	}
5836	#ifdef SIQ
5837	}
5838	#endif
5839	}
5840	if (!expected_parms)
5841	{
5842	switch (tok)
5843	{
5844	case IDEAL_CMD:
5845	case INT_CMD:
5846	case INTVEC_CMD:
5847	case MAP_CMD:
5848	case MATRIX_CMD:
5849	case MODUL_CMD:
5850	case POLY_CMD:
5851	case PROC_CMD:
5852	case RING_CMD:
5853	case STRING_CMD:
5854	cmdtok = tok;
5855	break;
5856	}
5857	}
5858	#endif
5859	return cmds[i].toktype;
5860	}
5861	static int iiTabIndex(const jjValCmdTab dArithTab, const int len, const int op)
5862	{
5863	#ifndef GENTABLE
5864	int a=0;
5865	int e=len;
5866	int p=len/2;
5867	do
5868	{
5869	if (op==dArithTab[p].cmd) return dArithTab[p].start;
5870	if (op<dArithTab[p].cmd) e=p-1;
5871	else a = p+1;
5872	p=a+(e-a)/2;
5873	}
5874	while ( a <= e);
5875
5876	#endif
5877	assume(0);
5878	return 0;
5879	}
5880

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

Download in other formats: